Semester
Subject
Year
B.Sc Computer Science and Information Technology
Institute of Science and Technology, TU
Digital Logic (CSC116)
Year Asked: 2078, syllabus wise question
Binary Systems
1.
Carry out the following tasks: a. Perform 1's complement subtraction of 10101-100101 b. Represent decimal number 0.125 into its binary form [2.5+2.5]
Combinational Logic
1.
Implement F using: a.Multiplexer
$F = \sum(0,2,3,4,7)$ b. Decoder c. PLA [4+3+3]
$F = \sum(0,2,3,4,7)$
2.
Derive the Boolean expression for sum and carry of half adder. Draw its combinational circuit. Implement it using only NAND gates. [5]
3.
Design a combinational circuit with three inputs and one output. The output is 1 when the binary value of the inputs is an odd number. [5]
Combinational Logic with MSI and LSI
1.
Differentiate between PLA and PAL. Explain 4-bit magnitude comparator. [5]
Registers and Counters
1.
Differentiate between synchronous and asynchronous counter. Design mod-7 synchronous counter using T-flip flop. Show necessary truth tables and k-maps. [10]
2.
Provide one example where shift right operation can be used. Explain parallel-in parallel-out register. [5]
3.
What are the practical implications of up counter? Explain Binary ripple counter. [5]
Simplification of Boolean Functions
1.
Express the Boolean function F = x+yz as a product of max-terms. [5]
2.
Minimize the following Boolean function using K-map.
$F(A,B,C,D) = \sum(0,1,3,5,7,8,9,11,13,15)$ [5]
$F(A,B,C,D) = \sum(0,1,3,5,7,8,9,11,13,15)$
Synchronous and Asynchronous Sequential Logic
1.
Design the sequential circuit with respect to the following state diagram using J-K Flip flops.
[10]
2.
Write short notes on (Any Two):
$Negative Logic$
$CMOS$
$EBCDIC$ [5]
$Negative Logic$
$CMOS$
$EBCDIC$