Browse papers
A

Section A: Long Answer Questions

Attempt all / any as specified.

4 questions
1long12 marks

(a) Perform the following arithmetic operations as indicated, showing all intermediate steps: (i) Subtract (1010110)2(1010110)_2 from (1101001)2(1101001)_2 using 2's complement method, and (ii) convert (2AF.C)16(2AF.C)_{16} into its decimal and octal equivalents. [6]

(b) Define weighted and non-weighted codes. Explain the Gray code and the Excess-3 code with suitable examples, and state one practical application of each. [6]

number-systemscodesboolean-algebra
2long12 marks

(a) Simplify the Boolean function F(A,B,C,D)=m(0,1,2,5,8,9,10)+d(3,11,15)F(A,B,C,D)=\sum m(0,1,2,5,8,9,10)+\sum d(3,11,15) using a four-variable Karnaugh map. Obtain the minimal sum-of-products expression and implement it using only NAND gates. [8]

(b) State and prove DeMorgan's theorems for two variables, and prove that a positive logic X-OR gate is equivalent to a negative logic X-NOR gate. [4]

k-mapsboolean-algebranand-implementation
3long16 marks

(a) Design a synchronous sequential circuit that detects the input sequence "1011" (overlapping allowed) and produces an output of 1 whenever the sequence is detected. Draw the state diagram, construct the state table, perform state assignment, and implement the circuit using JK flip-flops. Show the excitation table and the simplified flip-flop input equations. [10]

(b) Differentiate between a Moore machine and a Mealy machine. Explain the role of state reduction in sequential circuit design with an example. [6]

sequential-circuit-designflip-flopscounters
4long10 marks

(a) Design a full adder using two half adders and explain its operation with a truth table. Show how four full adders can be cascaded to build a 4-bit binary parallel adder. [6]

(b) Implement the Boolean function F(A,B,C)=m(1,3,5,6)F(A,B,C)=\sum m(1,3,5,6) using an 8×18\times1 multiplexer, and explain how the same function can be realized with a 4×14\times1 multiplexer. [4]

combinational-circuitsaddersmultiplexers
B

Section B: Short Answer Questions

Attempt all / any as specified.

9 questions
5short6 marks

Design a combinational logic circuit for a BCD-to-seven-segment display decoder for a common-cathode display. Write the truth table for any two of the output segments and derive their simplified Boolean expressions using K-maps.

decodersbcdseven-segment-display
6short6 marks

What is the difference between a decoder and an encoder? Design an octal-to-binary priority encoder, write its truth table, and explain the need for priority in such encoders.

encoderspriority-encoderdecoders
7short6 marks

Explain the working of an SR latch using NOR gates and discuss its invalid state. Describe how a master-slave JK flip-flop eliminates the race-around condition, with the help of a timing diagram.

flip-flopslatchestiming
8short6 marks

Explain the operation of a 4-bit Serial-In Parallel-Out (SIPO) shift register using D flip-flops. Draw its logic diagram and show the timing waveforms when the serial data 1101 is shifted in.

registersshift-registerstiming
9short6 marks

Design a MOD-10 asynchronous (ripple) counter using JK flip-flops. Draw the logic diagram and the output timing waveforms, and explain how the counter resets at the count of ten.

countersasynchronous-counterfrequency-division
10short6 marks

Differentiate between RAM and ROM. Explain how a combinational circuit can be implemented using a ROM, taking the example of a circuit that converts a 3-bit binary number to its square.

memorypldsrom
11short6 marks

Distinguish between PLA and PAL with the help of their basic block diagrams. Implement the functions F1(A,B,C)=m(0,1,3,4)F_1(A,B,C)=\sum m(0,1,3,4) and F2(A,B,C)=m(1,2,3,4,5)F_2(A,B,C)=\sum m(1,2,3,4,5) using a PLA, and show the PLA programming table.

pldsplapal
12short4 marks

Define analog and digital signals. State the logic gate that acts as a universal gate and justify your answer by realizing the NOT, AND and OR operations using only that gate.

logic-gatesdigital-signalsboolean-algebra
13short4 marks

Design a 2-bit magnitude comparator that produces three outputs indicating A>BA>B, A=BA=B and A<BA<B. Write the truth table and the simplified output expressions.

combinational-circuitscomparatorssubtractors