Department of Electrical Engineering

BABU BANARASI DAS

NORTHERN INDIA INSTITUTE OF TECHNOLOGY
Affiliated to Dr. A.P.J. Abdul Kalam Technical University (AKTU Code : 056)
AKTU Code : 056 Approved by All India Council for Technical Education (AICTE)
Sector II, Dr Akhilesh Das Nagar, Faizabad Road, Lucknow (UP) – India, 226028
Website : www.bbdniit.ac.in
DIGITAL ELECTRONICS (KEE-401)
Previous Year Questions (Unit-1)
2018-19
1. Determine the value of base x if (193)x = (623)8.
2. What are the advantage of Gray Code over the straight binary number sequence?
3. Define Cyclic Codes.
4. Minimize the following Boolean function using K-map
F(A, B, C, D) = ∑ m(3, 4, 5, 7, 9, 13, 14, 15)
5. Minimize the following using Quine McCluskey method
F(A, B, C, D) = ∑ (0, 1, 9, 15, 24, 29, 30) + ∑d (8, 11, 31)
2017-18
6. Write four advantages of Digital Systems over Analog Systems.
7. What is (33)6 + (45)6
8. Implement the Expression Y = ABC’ + BD + E using Nand gate only.
9. Convert the following: (i) (562.13)7 = (?)10 (ii) (467.342)8 = (?)10
10. Simplify the following Boolean function using K-map
Y = Σ m(0,1,3,5,6,7,9,11,16,18,19,20,21,22,24,26)
11. Generate the hamming code for the word 11011. Assume that a single error occurs while storing the
generated hamming code. Explain how this single error is detected.
12. Explain method to convert a binary number to octal number with example.
13. What do you mean by minterms?
14. State De-Morgan’s theorem of Boolean algebra.
15. What is Truth Table?
16. Convert the number (99)10 = ( )8 & (11010011)2 = ( )16.
17. Construct a logic circuit for the Boolean expression
(x + y + z). (x + y'). (x' + y')
18. Prove NAND and NOR gates as Universal gates.
19. Simplify the following Boolean function using K-map
F (w, x, y, z) = Σ m (0, 1, 2, 5, 8, 9, 10)

BBDNIIT 2019-20(Even Semester) Page1

 20. Represent decimal number 27 in
(i) BCD code (ii) Octal code (iii) Gray code
2016-17
21. Perform 2’s complement subtraction of 010110-100101.
22. What is the feature of Gray code?
23. Simplify the following Boolean function using K-map and implement using gates
F (w, x, y, z) = Σ m (0, 1, 4, 8, 9, 10) + Σ d (2, 11)
24. Detect and correct error in the following received even parity Hamming code word 00111101010.
25. Minimize the following using Quine McCluskey method and implement the simplified function
using NOR gates only
f (A, B, C, D) = Σ m(0, 1, 2, 4, 5, 8, 9, 11, 15)
26. Obtain the simplified Boolean expression for output F & G in terms of input variables in the circuit
of fig 1.

Fig. 1

27. Convert (153.513)10 to an octal number.

28. What are the advantage of Gray Code over the straight binary number sequence?
29. Simplify the following Boolean function using K-map
F (w, x, y, z) = Σ m (1, 3, 7, 11, 15) + Σ d (0, 2, 5)
30. Implement the following Boolean function using NAND gates
F (x, y, z) = Σ m (1, 2, 3, 4, 5, 7)
31. Minimize the following switching function using Quine McCluskey method
F (X1, X2, X3, X4, X5) = ∑ (0, 1, 2, 8, 9, 15, 17, 21, 24, 25, 27, 31)
2015-16
32. Explain Self-Complementing codes with an example.
33. Perform subtraction using 2’s complement: 80-65
34. What are don’t care conditions? Explain with example.

BBDNIIT 2019-20(Even Semester) Page2

 35. Convert the following SOP Boolean expression into POS form: ABC + A'B'C
36. Find the minimal SOP for the following 5 variable function using Quine Mc-Cluskey method:
F = ∑ (0, 1, 2, 9, 11, 12, 13, 27, 28, 29)
37. Subtract 11010 from 10110 using 2’s complement.
38. Convert (9)10 into Gray code.
39. Simplify the Boolean expression: (A+B)(A+C')(B'+C')
40. Obtain Hamming code word for the given data: 11001001010
41. Minimize the following Boolean function using Quine McCluskey method:
F (A, B, C, D) = ∑ m (4, 5, 6, 8, 9, 10, 13) + ∑ d(0, 7, 15)
42. Perform subtraction using 2’s complement: 46-23
43. Realize an EX-OR gate using NAND gates only.
44. Convert (32.75)10 into octal, binary, hexadecimal and gray.
45. Prepare Hamming code for the message “01001001010” assuming even parity. Also explain error detection
and correction capabilities at the receiver by assuming a single error in any of the received bits.
46. Minimize the following Boolean function using Quine McCluskey method:
F (A, B, C, D) = ∑ m (0, 3, 5, 6, 7, 10, 12, 13) + ∑ d(2, 9, 15)
2014-15
47. Represent the decimal number 6208 in (i) BCD and (ii) as a binary number.
48. Compute M-N and N-M using 1’s complement and 2’s complement methods where M= 110100 and
N= 10101.
49. Implement Boolean function of EX-NOR using (i) NAND gates only and (ii) using NOR gates only.
50. Simplify using K-map the following Boolean function:
F (w, x, y, z) = ∑ m (1, 5, 7, 10, 15) + ∑ d(3, 2, 6)
51. Explain weighted and unweighted code with example.
52. Covert the following numbers as indicated
(i) (BC64)16 = ( )10 = ( )2
(ii) (111011)2 = ( )5
53. The Hamming code “101101101” is received with even parity. Correct the errors if any.
54. Minimize the following using K-Map method and implement the simplified function using NAND
gates only
F (A, B, C, D) = Σ m(0, 1, 2, 9, 11, 15) + Σ d (8, 10, 14)
55. Minimize the following Boolean function using Tabular method:
F (A, B, C, D) = ∑ m (0, 2, 3, 6, 7, 8, 10, 12, 13)
56. Covert the following number into desired base: (A6BF5)16 = (?)2 = (?)Gray
57. Perform subtraction using 2’s complement: (17-135)
58. Use Quine Mc-Cluskey method to solve the following function:
F (A, B, C, D) = ∑ m (5, 7, 8, 9, 10, 11, 14, 15)

BBDNIIT 2019-20(Even Semester) Page3

 59. Simplify the Boolean function ‘Y’ and implement it using 2 level NAND gate circuit:
Y = BD + BCD' + AB'CD'
60. The Hamming code “101101101” is received with odd parity. Correct the errors if any.
2013-14
61. Detect and correct errors (if any) in the following received even parity Hamming code word
00111101010. Also find out the correct message.
62. Represent decimal number “–13” in all methods of negative binary number representation using
eight bits.
63. Simplify the following expression as much as possible and implement your result using universal
gates only.
F(w, x, y, z) = y'z' + w'x'z' + w'xyz' + wyz'
64. Use the Quine-McCluskey method to generate the set of prime implicants for the following function:
F (A, B, C, D) = Σ m(0, 1, 4, 5, 6, 7, 9, 11, 15) + Σ d (10, 14)
Also obtain all minimal expressions for the function. Draw a logic diagram using only NAND gates
to implement your best solution obtained.
65. What is the value of radix in case of decimal, binary, octal and hexadecimal number system?
66. Explain the rules of 1’s complement addition and subtraction with suitable examples.
2012-13
64. What is the largest number that can be expressed with (i) 14 bits and (ii) 10 bits.
65. Convert (247.36)8 to (?)16.
66. Simplify the following Boolean expression
F = AB + A'B + A'B'
67. Given:
F = ABC'D + AC + BC'D' + B'C + A'C'D' + A'B'C'D
(i) Show using a K-Map that F can be simplified to
F1 = A.B + A'B' + AC + BC'D'
(ii) Show that there are four possible expressions of F.
(iii) Implement F1 using NAND gates only.
68. Simplify the Boolean function:
F = A'B'C' + BC'D' + A'BCD + AB'C' using four variable K-Map. Explain briefly Prime Implicants.
2011-12
69. Perform the following subtraction using 2’s complement method
(i) 01000-01001
(ii) 0011.1001-0001.1110
70. Add the following numbers:
(i) (ABC)16 + (CDE)16
(ii) (77)8 + (107)8
BBDNIIT 2019-20(Even Semester) Page4
 71. Detect and correct errors (if any) in the following received even parity Hamming code word
00111101010. Also find out the correct message.
72. Minimize the following using K-Map method and implement the simplified function using NAND
gates only
F (A, B, C, D) = Σ m(0, 1, 2, 9, 11, 15) + Σ d (8, 10, 14)
73. Minimize the following Boolean function using Tabular method:
F (A, B, C, D) = ∑ m (0, 2, 3, 6, 7, 8, 9, 10, 13)

BBDNIIT 2019-20(Even Semester) Page5