My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Digital Logic - Computer Science & Information Technology Previous Year Questions

Practice Digital Logic - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

23Papers
14Years
86Questions
1Topics

Digital Logic question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Digital Logic. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Easy 43 50%
Medium 42 48.8%
Hard 1 1.2%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 48 55.8%
Numerical Answer Type (NAT) 22 25.6%
MSQ 16 18.6%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
86 Qs

Most asked topics

Top topics across the included previous year papers.

Digital Logic
86 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Number Representation and Arithmetic
31 Qs
Combinational and Sequential Logic
29 Qs
Boolean Algebra and Logic Minimization
26 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Computer Science and Information Technology (CS) 2026
5 Qs
Computer Science and Information Technology (CS) 2026
5 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
6 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
6 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
6 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
2 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
3 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
3 Qs
Computer Science & Information Technology (CS) 2013 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2009
1 Qs

Browse by subtopics

Open a focused page built from the same verified paper data.

Number Representation and Arithmetic

Explore previous-paper coverage, trends and focused practice for Number Representation and Arithmetic.

31 questions19 papers12 years

Combinational and Sequential Logic

Explore previous-paper coverage, trends and focused practice for Combinational and Sequential Logic.

29 questions21 papers14 years

Boolean Algebra and Logic Minimization

Explore previous-paper coverage, trends and focused practice for Boolean Algebra and Logic Minimization.

26 questions19 papers10 years

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Computer Science and Information Technology (CS) 202620265View paper
Computer Science and Information Technology (CS) 202620265View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20254View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20255View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20244View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20244View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20236View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20223View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20214View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20215View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20202View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20196View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20184View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20176View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20164View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20143View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20143View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20142View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20133View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20133View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20133View paper
Computer Science & Information Technology (CS) 200920091View paper

Sample previous year questions

A varied preview from the papers represented in this selection, with every available option.

1
2009 · Computer Science & Information Technology · Digital Logic · Combinational and Sequential Logic
Computer Science & Information Technology (CS) 2009
Given the following state table of an FSM with two states A and B, one input and one output :
Present State APresent State BInputNext State ANext State BOutput
000001
010100
100010
110100
001010
011001
101001
111000
If the initial state is A = 0, B = 0, what is the minimum length of an input string which will take the machine to the state A = 0, B = 1 with Output = 1 ?
Open complete paper
2
2013 · Computer Science & Information Technology · Digital Logic · Number Representation and Arithmetic
Computer Science & Information Technology (CS) 2013 [Session 1]

The smallest integer that can be represented by an 8-bit number in 2’s complement form is

Open complete paper
3
2013 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2013 [Session 2]
Which one of the following expressions does NOT represent exclusive NOR of $x$ and $y$?
Open complete paper
4
2013 · Computer Science & Information Technology · Digital Logic · Combinational and Sequential Logic
Computer Science & Information Technology (CS) 2013 [Session 3]
In the following truth table, V = 1 if and only if the input is valid.
InputsOutputs
D0D1D2D3 X0X1V
0000 XX0
1000 001
X100 011
XX10 101
XXX1 111
What function does the truth table represent?
Open complete paper
5
2013 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2013 [Session 4]
Which one of the following expressions does NOT represent exclusive NOR of x and y?
Open complete paper
6
2014 · Computer Science & Information Technology · Digital Logic · Number Representation and Arithmetic
Computer Science & Information Technology (CS) 2014 [Session 1]
There are 5 bags labeled 1 to 5. All the coins in a given bag have the same weight. Some bags have coins of weight 10 gm, others have coins of weight 11 gm. I pick 1, 2, 4, 8, 16 coins respectively from bags 1 to 5. Their total weight comes out to 323 gm. Then the product of the labels of the bags having 11 gm coins is ___.
Open complete paper