Tribhuvan University
Bachelor of Information Technology
Semester 1 · TU Board 2083
Course Title: Digital Logics (BIT103)
Full Marks: 60Pass Marks: 24Time: 3 hours
Candidates are required to give their answers in their own words as far as practicable.
Group A
Attempt any Two questions.(2 × 10 = 20)
- 1.10
What is a parallel binary adder? Design a full adder with truth table, logical expression for output and circuit diagram.
- 2.10
Design a 2-bit synchronous up counter using JK Flip-Flop with state diagram, state transition table, logical expression for input and circuit diagram.
- 3.10
Minimize the following function using K-Map and implement using universal gates: F(A,B,C,D) = Σ(0,2,4,6,8,10,12,14) with don't care condition d(1,3,11)
Group B
Attempt any Eight questions(8 × 5 = 40)
- 4.5
Given A = 63 and B = 57, perform the following: (a) A – B using 2's complement (b) A – B using 9's complement
- 5.5
What is Latch? Explain SR Flip-Flop with its characteristic table and equation.
- 6.5
Implement Boolean function F(A, B, C) = Σ(0,2,3,7) using Decoder and PLA.
Answer comingAlso asked in 2078
- 7.5
Why NAND and NOR gates are called Universal gates? Show that all basic gates can be realized using NAND and NOR gates.
- 8.5
Simplify the Boolean expression F = AB + A(B + C) + B(B + C) using Boolean algebra. Implement the simplified expression using basic gates.
- 9.5
What do you mean by shift register? Explain SISO shift register with block and timing diagram.
- 10.5
Design a 2 to 4 decoder using basic gates. Show how two 2-to-4 decoders can be connected to form a 3-to-8 decoder.
- 11.5
What is Encoder? Design a octal to binary encoder.
- 12.5
Write short notes on: (a) Magnitude Comparator (b) Half Adder
— The End —