Register No:

Sri Sivasubramaniya Nadar College of Engineering, Kalavakkam – 603 110

(An Autonomous Institution, Affiliated to Anna University, Chennai)
B.E. / B.Tech. End Semester Theory Examinations, Nov / Dec 2021
Third Semester
Information Technology
UIT1301 DIGITAL ELECTRONICS
(Regulations 2018)
Time: Three Hours Answer ALL Questions Maximum:100 Marks
K1: Remembering K2: Understanding K3: Applying K4 :Analyzing K5: Evaluating

PART – A (10 × 2 = 20 Marks)

01. K1 Find the 9’s and the 10’s complement of the 25,478,036 decimal numbers. CO1
02. K2 Draw the XOR logic using only NAND gates. CO1
03. K1 List the truth table for the function: F = bc + a`c` CO2
Write the Boolean expression for the output of the system shown in figure.

04. K3 CO2

05. K1 Draw the truth table for half adder. CO2

06. K2 Mention any two applications of multiplexers. CO3
07. K1 What do you mean by triggering of flip-flop? CO4
08. K1 How does ROM retain information? CO3
09. K2 Distinguish between stable and unstable state. CO1
10. K2 Construct a combinational hazard free circuit. CO1

PART – B (5 × 6 = 30 Marks)
Simplify the logic circuit shown in figure.

11. K3 CO1

1
 UIT1301

12. K2 State and prove De Morgan’s theorems. CO2

13. K2 Draw the schematic of a full adder circuit and give its truth table. CO2
14. K3 Implement JK flip flop using D flip flop. CO1
15. K3 Design hazard free circuits for Y = X1X2 + X2’Y CO2

PART – C (5 × 10 = 50 Marks)

16. K3 Design a code converter that converts 8421 to BCD code. CO1
OR
Simplify the function F(w,x,y,z) = ∑ m(2,3,12,13,14,15) using boolean
17. K3 CO1
algebra. Implement the simplified function using gates.

Minimize the following expression using Karnaugh map.

18. K3 CO2
Y = A’BC’D’ + A’BC’D + ABC’D’ + A’B’CD’
OR
Minimize the following expression using Quine Mccluskey method.
19. K3 CO2
Y = A’BC’D’ + A’BC’D + ABC’D’ + ABC’D + AB’C’D + A’B’CD’

20. K3 Design a serial adder using a full adder and a flip-flop. CO2
OR
Formulate the following Boolean function using 4x1 multiplexers.
21. K3 CO2
F(A,B,C,D) = ∑ (1,2,3,6,7,8,11,12,14).

Design a synchronous counter using J flip-flops to count following

22. K4 CO1
sequence: “1-3-15-5-8-2-0-12-6-9”.
OR
Recognize the implementation of the following Boolean functions using
23. K4 CO1
4x3x4 PAL. W(A,B,C,D) = ∑ (0,2,6,7,8,9,12,13)

Explain with neat diagram the different hazards and the way to eliminate
24. K3 CO1
them.
OR
25. K3 Discuss on the concept of working and applications of digital clock. CO1

UIT1301 2
 UIT1301

Course Outcomes:
CO1: Analyze a problem, Design combinational and sequential circuits.
CO2: Simplify Boolean functions using KMap.
CO3: Design using Programmable Logic Devices.
CO4: Write HDL code for combinational and Sequential Circuits.

UIT1301 3