Digital Logic Previous Year Questions
GATE Digital Logic previous year questions follow identifiable patterns, and recognizing these patterns during preparation is the fastest way to improve yo...
PYQ Patterns: Boolean Algebra and Minimization Questions
GATE Digital Logic previous year questions follow identifiable patterns, and recognizing these patterns during preparation is the fastest way to improve your score. This section analyzes the most common question types on Boolean algebra and minimization that have appeared in GATE CS from 2012 onward.
The most recurrent question type presents a Boolean expression and asks for its minimal equivalent form. For example, GATE 2014 asked for the minimal SOP of F(A,B,C,D) with specific minterms and don't-cares, testing both K-map construction and don't-care optimization. The key skill is grouping don't-cares only when they allow a larger group — never assume don't-cares increase complexity. Always start with 4-cell groups before settling for 2-cell groups.
Another common pattern gives two expressions and asks whether they are equivalent. The efficient approach is not expansion but substitution of a few input combinations — if outputs differ for any input, they are not equivalent. If they match for all 2-to-the-n combinations, they are equivalent. However, for GATE MCQs with four options, you can often eliminate wrong answers by testing one or two input combinations.
Complement of a function questions ask: given F as a SOM, find the SOM of F-complement. The answer is simply the minterms not in F, since the sum of all minterms equals 1. For example, if F = SOM(0, 2, 5, 7) for three variables, then F-complement = SOM(1, 3, 4, 6). This requires no computation beyond identifying missing indices.
Universal gate implementation questions present a function and ask how to implement it using only NAND or only NOR gates. The strategy: find the minimal SOP, then convert every AND, OR, and NOT into NAND equivalents using De Morgan's theorem. For NAND implementation, NOT A = NAND(A,A), A AND B = NAND(NAND(A,B), NAND(A,B)), A OR B = NAND(NAND(A,A), NAND(B,B)). Practicing these substitutions until they are automatic saves exam time.
A specific past question type asks for the number of prime implicants or essential prime implicants of a given K-map. Prime implicants are all maximal groups; essential prime implicants are those that are the only group covering at least one minterm. Counting these requires careful K-map analysis. Practice by drawing the K-map for minterms 0, 1, 3, 7, 8, 9, 11, 15 in a 4-variable map and identifying all prime and essential prime implicants before checking the answer.
PYQ Patterns: Combinational Circuit and Number System Questions
Combinational circuit and number system questions in GATE Digital Logic tend to be straightforward if you know the standard designs cold. This section covers the most common patterns and the solving strategies that minimize errors under exam pressure.
MUX-based function implementation is a classic GATE question type. A typical question states: "Using a 4-to-1 MUX with select lines S1 and S0, implement the function F(A,B,C) = sum of minterms 1, 3, 5, 6." The approach: assign A to S1 and B to S0, creating four cases. When AB=00, F depends only on C; evaluate F at minterms where AB=00, which are minterms 0 and 1. Minterm 0 (ABC=000) gives F=0 and minterm 1 (ABC=001) gives F=1, so the data input for select 00 is C. Repeat for AB=01, AB=10, AB=11 to find C, C, C-complement respectively. Wire these to data inputs I0 through I3.
Adder circuit delay questions appear almost every year. A typical question asks: what is the delay of a 16-bit ripple carry adder if each full adder has a propagation delay of T nanoseconds? The answer is 16T. For carry lookahead, the carry computation is O(1) depth for a single level of lookahead, and GATE sometimes asks to compare the two architectures.
Number system conversion questions with signed arithmetic test two's complement operations. A recurring format: "A and B are 8-bit two's complement numbers. A = 0110 1010 and B = 1001 1100. Compute A+B and determine if overflow occurs." Add the binary values: 0110 1010 plus 1001 1100 = 0000 0110 with a carry out of 1. No overflow because carry into sign bit equals carry out of sign bit. The result 0000 0110 represents decimal 6.
BCD arithmetic questions test whether you know to add 6 to any digit sum exceeding 9. For example, BCD addition of 7 (0111) and 8 (1000) gives binary 1111 = decimal 15, which exceeds 9. Add 0110 to get 1 0101, representing BCD 15 (one ten, five units). This correction step is the core of BCD adder design.
Code converter questions ask you to design a circuit converting Gray code to binary or BCD to seven-segment display. The Gray-to-binary conversion rule: the MSB of binary equals the MSB of Gray, and each subsequent binary bit equals the XOR of the previous binary bit with the current Gray bit. Knowing this rule directly gives the answer to these questions without full truth-table derivation.
PYQ Patterns: Sequential Circuit and State Machine Questions
Sequential circuit questions in GATE are among the most analytically demanding, and they reward students who practice structured solution approaches. This section covers the dominant PYQ patterns and step-by-step strategies for each.
Flip-flop conversion questions are a perennial GATE favorite. The question provides a flip-flop type to implement (say JK) using another type (say D) and asks for the conversion circuit. The approach is systematic: write the characteristic equation of the target flip-flop (for JK: Q-next = J Q-complement + K-complement Q), express this in terms of the implementing flip-flop's input (for D: D = Q-next), then derive the combinational logic for J and K in terms of D. A past GATE question provided a JK to SR conversion and asked for the Boolean expressions for S and R. This type of question is pure mechanical application of excitation tables.
Counter state sequence questions give a counter circuit (flip-flop connections and feedback) and ask: what sequence of states does it cycle through? The technique is to apply the flip-flop characteristic equations iteratively starting from the initial state. If a 3-bit counter starts at 000 and the next-state logic produces 001, 011, 111, 110, 100, 001 (cycling), identify the cycle length and any transient states. GATE may ask for the modulus (cycle length) or whether certain states are self-correcting.
State machine minimization questions present a state table with redundant states and ask for the minimal equivalent machine. Apply equivalence partitioning: initially partition states by output, then refine partitions by checking whether states in the same partition have transitions to states in the same partition for every input. Repeat until no further refinement is possible. Equivalent states can be merged, reducing flip-flop count.
Sequence detector questions ask you to design a Mealy or Moore machine to detect a given binary sequence, such as "101" or "1011." Draw the state diagram by tracking how much of the pattern has been matched so far. For "101" detection with overlapping, after matching "10" and seeing "1," you have matched "101" and simultaneously have the potential start of another "1" — transition to a state representing one character matched rather than zero.
Timing and setup/hold time questions test whether a flip-flop captures data correctly given signal delays. Setup time is the minimum time data must be stable before the clock edge; hold time is the minimum time data must remain stable after the clock edge. If propagation delay between two flip-flops is less than the hold time, a hold-time violation occurs. These questions require arithmetic on timing values and appear in recent GATE papers with increasing frequency.