Scribd
Upload
24 views2 pages

DE Imp Mid 1

The document contains a series of short and long questions related to digital electronics and computer science concepts. Topics include binary and hexadecimal conversions, Boolean algebra, combinational circuits, and the design of adders and subtractors. It also covers De-Morgan's Laws, parity generation, and the differences between combinational and sequential circuits.

Uploaded by

insaneboi2006
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
24 views2 pages

DE Imp Mid 1

The document contains a series of short and long questions related to digital electronics and computer science concepts. Topics include binary and hexadecimal conversions, Boolean algebra, combinational circuits, and the design of adders and subtractors. It also covers De-Morgan's Laws, parity generation, and the differences between combinational and sequential circuits.

Uploaded by

insaneboi2006
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/ 2

Short questions

1. Convert the (1101101110.11001)2 to hexadecimal equivalent

2. Convert the (125.68)8 to binary.

3. Find 1’s and 2’s complement of the following decimal number 782

4. Define: (a) bit (b) nibble (c) byte (d) word

5 How many minterms or maxterms will be there for n-inputs?

6 State De-Morgan’s Laws?

7 Explain parity generation and its significance? And What is the parity of (i) 10111001 (ii)
11001010.

8 How to obtain the dual of a Boolean equation?

9 Explain about Analysis and design procedures of combinational Circuits.

10 Define is half subtractor and draw its truth table.

11. Find the 2’s complement of the decimal number 1101011.

12. Perform the 10111011 binary to grey code.

13. Perform the (1101101110.11001)2 to hexadecimal equivalent.

14. When is a SOP/POS form is called standard or canonical?

15 What do you mean by don’t care condition?

16 Express the F=A+B1C as sum of minterms.

17 What is Duality property.

18 What are the universal gates?

19 What is a Combinational circuit?

20 Define is a half adder and draw its truth table.


Long questions
1. Perform the (46)10-(22)10 in BCD using 9’s complement.

2. Perform the following Binary to Gray and Gray to Binary Conversion

a)(10100110101)2 - ( )G

b) (01101101)G - ( )2

3. Implement the following Boolean express

using only NAND gates

Y = ABC’ + ABC + A’BC

Y= ∑ (0,1,5).

4. Reduce using mapping the following expression and implementing the real minimum expression
. F(A,B,C,D)=∑m(0,2,4,6,7,8,10,12,13,15) and draw the Logic gates for the obtained equation.

5. Differences between Combinational and Sequential Circuit?

6. Explain Full Adder and design its truth table and logic diagram.

7. Convert the 12.125 decimal to binary.

8. If F(A,B,C,D,E) = B’E, how many terms will be there in the standard or canonical SOP
representation of F?

9. Implement the following Boolean express using only NOR gates

Y = (A’+B+C)(A + B)D

Y = (A+C)(B+C).

10. Use K-Map to simplify F = ∑ (0,1,2,6,7,8,9,10,14,15) in SOP & POS form?

11. Explain Full Adder and design the circuit using half adders.

12. Explain Full Subtractor and design its truth table and logic diagram.

You might also like