Carry out the following tasks:a. Perform 2's complement subtraction of 010110 - 100101b. Represent decimal number 10 in its BCD form [5]
Boolean algebra and Logic Gates
1.
Derive the Boolean expression for sum and carry of half adder. Draw its combinational circuit. Implement it using only NOR gates. [5]
2.
Write short notes on (Any two): a. Positive Logic b. I2L c. ASCII [5]
Combinational Logic
1.
Design a combinational circuit with three inputs and one output. The output is 1 when the binary value of the inputs is an even number. [5]
Combinational Logic with MSI and LSI
1.
Differentiate between ROM and PLA. Explain different types of ROM. [5]
Registers and Counters
1.
Provide one example where shift left operator can be used. Explain serial-in-serial-out register. [5]
2.
What are the practical implications of down counter? Explain BCD ripple counter. [5]
Simplification of Boolean Functions
1.
Implement $F = \Sigma(1,4,5,7)$ using a. Multiplexer b. Decoder c. PLA [10]
2.
Express $F' = (x + y + z)'$ as a sum of min-terms. [5]
3.
Minimize the following Boolean function using K-map $F(A, B, C, D) = \Sigma m(0,1,2,5,7,8,9,10,13,15)$. [5]
Synchronous and Asynchronous Sequential Logic
1.
Design the sequential circuit with respect to the following state diagram using T flip flops. [10]
2.
Differentiate between combinational circuit and sequential circuit. Design mod-10 synchronous counter using J-K flip-flop. Show necessary truth tables and K-maps. [10]