Scribd
Upload
2 views

Assignment question

The document contains a series of practice questions for a Digital Electronics course (EE402). It includes various tasks such as demonstrating the dual of exclusive-OR, converting canonical forms, simplifying Boolean functions, designing combinational circuits, and implementing logic gates. The questions cover a range of topics including parity generators, majority circuits, and multiplexers.

Uploaded by

mohammadarifkhan2100
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Assignment question

The document contains a series of practice questions for a Digital Electronics course (EE402). It includes various tasks such as demonstrating the dual of exclusive-OR, converting canonical forms, simplifying Boolean functions, designing combinational circuits, and implementing logic gates. The questions cover a range of topics including parity generators, majority circuits, and multiplexers.

Uploaded by

mohammadarifkhan2100
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Practice question Digital Electronics:EE402

Q1.

Q2.

Q3. Show that the dual of the exclusive‐OR is equal to its complement.

Q4. Convert each of the following to the other canonical form:

Q5. Show that a positive logic NAND gate is a negative logic NOR gate and vice versa.

Q7. Write the Boolean equations and draw the logic diagram of the circuit whose outputs are
defined by the following truth table:
Q8. Simplify the following Boolean functions:

(d) A’B + A’CD + B’CD + BC’D’

(e)

Q9. Simplify the following Boolean function F , together with the don’t-care conditions d , and then
express the simplified function in sum-of-minterms form:

Q10. Derive the circuits for a three-bit parity generator and four-bit parity checker using an odd
parity bit.

Q11. Implement the following four Boolean expressions with three half adders:

Q12. Obtain the simplified Boolean expressions for output F and G in terms of the input variables in
the circuit given below

Q13. Problems 183 Design a combinational circuit with three inputs, x , y , and z , and three outputs,
A, B , and C . When the binary input is 0, 1, 2, or 3, the binary output is one greater than the input.
When the binary input is 4, 5, 6, or 7, the binary output is two less than the input.

Q14. A majority circuit is a combinational circuit whose output is equal to 1 if the input variables
have more 1’s than 0’s. The output is 0 otherwise. ( a ) * Design a 3-input majority circuit by finding
the circuit’s truth table, Boolean equation, and a logic diagram.
Q15. Design a combinational circuit that compares two 4-bit numbers to check if they are equal. The
circuit output is equal to 1 if the two numbers are equal and 0 otherwise.

16. Construct a 5-to-32-line decoder with four 3-to-8-line decoders with enable and a 2-to 4-line
decoder.

Q17.

Q18. Implement a full adder with two 4 x 1 multiplexers.

Q19. Implement the following Boolean function with a multiplexer

Q20. An 8 x 1 multiplexer has inputs A , B , and C connected to the selection inputs S2 , S1 , and S0 ,
respectively. The data inputs I0 through I7 are as follows:

I1 = I2 = I7 = 0; I3= I5 = 1; I0 = I4 = D ; and I6 = D ’.

Q21.

You might also like