🔌
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 1 of 5 • Questions 1-10 of 50
Q1easy
What is the output of an AND gate when both inputs are 1?
Q2medium
What is the simplified form of (A + B)(A + C) using Boolean algebra?
Q3easy
Which gate is called a universal gate?
Q4easy
What is the output of XOR gate when both inputs are 1?
Q5medium
How many select lines are needed for a 4:1 multiplexer?
Q6easy
What is De Morgan's theorem for (A + B)'?
Q7medium
What is the sum output of a half adder when A=1 and B=1?
Q8medium
How many flip-flops are needed to build a mod-8 counter?
Q9medium
What is the 2's complement representation of -5 in 4 bits?
Q10easy
Which flip-flop has no invalid state?
...