🔌
GATE CS - Digital Logic
Practice Boolean algebra, logic gates, combinational and sequential circuits
50 questions•5 pages•~75 min
Use this quiz track to strengthen recall, speed, and exam-style decision making. Attempt one page first, review explanations, and then re-attempt incorrect questions without notes.
A good scoring strategy is to mark uncertain questions, finish known ones quickly, and return with elimination logic. This improves accuracy while keeping momentum under time constraints.
Progress: 0 / 500%
Page 2 of 5 • Questions 11-20 of 50
Q11medium
What is the simplified form of A + A'B using Boolean algebra?
Q12easy
How many minterms are there in a 3-variable function?
Q13easy
What is the output of a NAND gate when both inputs are 0?
Q14medium
What is the simplified form of (A + B)(A' + B)?
Q15easy
How many inputs does a full adder have?
Q16easy
What is the output of XOR gate when inputs are (1, 0)?
Q17hard
What is the simplified form of AB + A'C + BC?
Q18medium
How many flip-flops are needed for a mod-16 counter?
Q19easy
What is the 1's complement of binary number 1011?
Q20easy
What is the output of a 2:1 multiplexer when S=0, I0=1, I1=0?
...