Digital Logic 2072

Tribhuwan University
Institute of Science and Technology
2072
Bachelor Level / Second Semester / Science
Computer Science and Information Technology ( CSC-151 )
( Digital Logic )
Full Marks: 60
Pass Marks: 24
Time: 3 hours
Candidates are required to give their answers in their own words as far as practicable.
The figures in the margin indicate full marks.

Long Questions:

Attempt any two questions: (2 × 10=20)

1. Design and implement with logic diagram of synchronous 3 bit up down counter using J-K flip flop.

10 marks view

2. Design a magnitude comparator using logic gates and truth table.

10 marks view

3. Design a master-slave S-R flip flop with logic diagram and truth table.

10 marks view

Short Questions:

Attempt any eight questions: (8 × 5=40)

4. What do you mean by the Gray code? What are its application?

5 marks view

5. Covert the following:

a) A08E. FA16 = (? )10

b) AE9. BOE16 = (? )2

5 marks view

6. State and prove commutative laws, associative laws and distributive law using logic gate and truth table.

5 marks view

7. Show that both NAND gate and NOR gate are universal gates.

5 marks view

An universal gate is a gate which can implement any Boolean function without need to use any other gate type. The NAND and NOR gates are universal gates.

NAND gate

NAND gate is the combination of NOT gate and AND gate. If the two input values for an NAND gate are both 1, the output is 0; otherwise, the output is 1.


Fig: Various representations of a NAND gate


NAND gate as a Universal Gate

To prove that any Boolean function can be implemented using only NAND gates, we will show that the AND, OR, and NOT operations can be performed using only these gates.

Thus, the NAND gate is a universal gate since it can implement the AND, OR and NOT functions.


NOR gate

NOR gate is the combination of NOT gate and OR gate. If the two input values for NOR gate are both 0, the output value is 1; otherwise, the output is 0.


Fig: Various representations of a NOR gate


NOR gate as a Universal Gate

To prove that any Boolean function can be implemented using only NOR gates, we will show that the AND, OR, and NOT operations can be performed using only these

Thus, the NOR gate is a universal gate since it can implement the AND, OR and NOT functions.

8. Prove that:


5 marks view

9. Reduce the following expression using K-map.


5 marks view

10. How does a J-K flip flop differs from an S-R flip flop in its basic operations? Explain.

5 marks view

11. Differentiate between a counter a shift register.

5 marks view

12. Design a 4 input multiplexer using logic diagram and truth table.

5 marks view

13. Explain the serial-In, parallel out shift register.

5 marks view