MARWADI EDUCATION FOUNDATION’S GROUP OF INSTITUTIONS

FACULTY OF ENGINEERING, GAURIDAD CAMPUS.

DEPARTMENT OF ELECTRONICS & COMMUNICATION

Question Bank
Syllabus Unit # 1,2,3
(Important question previously asked in GTU)

Digital Electronics (2131004) (EC/CE/IT) Date : 9/8/2016

No Question
Chapter 1 (Binary System & Logic circuits) Marks
[Percentage of Weightage in Examination: 5]
Do as directed
(i) Convert (75)10 = (___________)2 1
(ii) Convert (101011)2 = (_________)10 1
1. (iii) Convert (10101101)2 = (___________)16 = (__________)8 1
(iv) Convert (96)10 to its equivalent gray code and EX-3 code. 1
(v) Perform addition in BCD format (79)BCD + (16)BCD 1
(vi)What is self-complementing code? Represent (472)10 in 2421 self-complementing code. 1
(i) State De Morgan’s theorems and prove with the help of truth table. 3
2. 3
(ii) Convert F (A, B, C) = BC +A into standard minterm form.
(i) Discuss NAND gate as universal gate (implement NOT, AND, OR & NOR gate 3
3. using NAND gate).
(ii) Perform subtraction of (78)10 – (58)10 using 2’s complement method. 3
4. (i) Convert decimal number (0.252)10 to binary with an error less than 1 %. 3
(a) Do as directed :
I. Given that (16)10 = (100)x, find the value of x. 1
II. Add (6E)16 and (C5)16 1
III. (4433)5 = ( )10 = ( )2 1
5.
(b) Do as directed :
I. Subtract (45)8 from (66)8 1
II. Covert the Gray code 1101 to binary 1
III. Find the XS-3 code of 37 1
Define following terms
a. universal gates and its advantage 1
6.
b. associative property of Boolean algebra 1
c. bit, nibble & bytes 1
3
7. What are the different types of the codes used in digital systems? Explain them.
Find the logic required at R input.
1

8.
 MARWADI EDUCATION FOUNDATION’S GROUP OF INSTITUTIONS
FACULTY OF ENGINEERING, GAURIDAD CAMPUS.
DEPARTMENT OF ELECTRONICS & COMMUNICATION

(i) Convert (96)10 to its equivalent gray code and EX-3 code. 3
9. 3
(ii) Perform addition in BCD format (79)BCD + (16)BCD
Discuss NAND gate as universal gate. 6
10.
(implement NOT, AND, OR & NOR gate using NAND gate).
Perform subtraction of (78)10 – (58)10 using 6
11. a. 2’s complement method
b. 1’s complement method
Chapter 2 (Boolean Algebra & Mapping Methods)
[Percentage of Weightage in Examination: 15]
State following properties of Boolean Algebra
a. DE Morgan’s theorem 1
12. b. Associative law 1
c. Commutative law 1
d. distributive law 1
4
13. State and explain De Morgan’s theorems with truth tables.
14. Write short note on half adder and full adder. 7
Reduce the given function using K-map and implement the same using gates. 7
15.
F(A,B,C,D ) = Σm (0,1,3,7,11,15) + Σd ( 2,4)
16. Convert F (A, B, C) = BC +A into standard minterm form. 3
17. Discuss application of NOR gate as universal gate 7
Draw the truth table of full adder and implement using minimum number of logic 4
18.
gates.
19. Design a Full Subtractor and implement it using NOR gates only. 7
20. F(A,B,C) = Σm(0,2,3,4,5,6) using K-map and implement using NAND gates only. 7
Simplify the Boolean equation given in the form of Sum of Minterms and Don’t Care 3
21.
conditions. F = Σ m(1, 2, 4, 6, 7, 11, 15) + Σ d(0, 3)
Using D as the MEV, reduce 3
22.
Y = A'B'C'D' + A'B'CD' + AB'C'D' + AB'C'D + AB'CD + AB'CD'
23. Design a circuit for 2-bit magnitude comparator 7
24. Design 3-bit even parity generator circuit. 7
25. Design 4 bit binary to gray code converter using decoder 7
Chapter 3 (Logic Function Realization with MSI circuits)
[Percentage of Weightage in Examination: 15]
Show that AB = AB + A’B’ = (A xor B)’ = (AB’+A’B)’. Also construct the 7
26.
corresponding logic diagrams.
27. Give the applications of Decoder. 3
Implement following Boolean function using 8x1 MUX. 7
28.
F  ABC  ABCD  ABC D  ABCE  ABC
Implement given function using 8x1 MUX 7
29.
F ( A, B, C, D)   m(0,1,2,3,5,8,9,11,14)
30. Design 4x16 decoder using two 3x8 decoder. 7