GATE CSE · Computer Science and Information Technology
Digital Logic
Boolean algebra; combinational and sequential circuits; minimisation; number representations and computer arithmetic.
Test yourself on Digital Logic
5 real GATE CSE questions with instant answers — no signup, ~3 minutes.
Study notes are still being prepared.
Don't wait — Shishya can teach you this topic right now, on demand.
Ask Shishya to teach this →Need more? Ask Shishya
Shishya is your personal tutor for this topic. Pick a starter or open a free chat.
- Go deeper on this topicGo deeper on Digital Logic for GATE CSE — examples and edge cases I should know.
- Show me exam shortcutsGive me 3 fastest shortcuts to solve Digital Logic questions in the exam.
- What mistakes should I avoid?What are the most common mistakes students make on Digital Logic? How do I avoid them?
- Quiz me adaptivelyQuiz me on Digital Logic — start with one easy question, then go harder based on how I answer.
Practice this topic
Take a full mock →Q1 · Digital Logic · EASY
What is the minimum number of 2-to-1 multiplexers required to implement a 4-to-1 multiplexer?
Q2 · Digital Logic · EASY
The minimal sum-of-products expression for the Boolean function F(A, B, C) = Σm(1, 3, 5, 7) is:
Q3 · Digital Logic · MEDIUM
A combinational circuit is designed using four 2-to-1 multiplexers. What is the maximum number of input variables (excluding control/select inputs of the multiplexers) that such a circuit can have?
Q4 · Digital Logic · MEDIUM
A 4-variable Boolean function F(A, B, C, D) is given by the sum of minterms Σ(0, 2, 5, 7, 8, 10, 13, 15). What is the minimal sum-of-products expression using a Karnaugh map simplification?
Q5 · Digital Logic · EASY
In a positive edge-triggered D flip-flop, if the D input is held at logic 1 and a clock pulse arrives, what will be the value of Q after the clock edge?