My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Boolean Algebra and Logic Minimization - Digital Logic - Computer Science & Information Technology Previous Year Questions

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

23Papers
14Years
37Questions
1Topics

Boolean Algebra and Logic Minimization question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Boolean Algebra and Logic Minimization. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Easy 22 59.5%
Medium 15 40.5%

Question type distribution

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

MCQ 25 67.6%
MSQ 8 21.6%
Numerical Answer Type (NAT) 4 10.8%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
37 Qs

Most asked topics

Top topics across the included previous year papers.

Digital Logic
37 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Boolean Algebra and Logic Minimization
37 Qs

Paper coverage

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

Computer Science and Information Technology (CS) 2026
2 Qs
Computer Science and Information Technology (CS) 2026
2 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
1 Qs
Computer Science & Information Technology (CS) 2010
1 Qs
Computer Science & Information Technology (CS) 2009
2 Qs
Computer Science & Information Technology (CS) 2008
4 Qs
Computer Science & Information Technology (CS) 2007
4 Qs

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) 202620262View paper
Computer Science and Information Technology (CS) 202620262View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20252View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20252View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20241View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20241View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20211View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20211View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20191View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20182View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20172View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20161View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20141View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20142View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20141View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20131View paper
Computer Science & Information Technology (CS) 201020101View paper
Computer Science & Information Technology (CS) 200920092View paper
Computer Science & Information Technology (CS) 200820084View paper
Computer Science & Information Technology (CS) 200720074View paper

All Boolean Algebra and Logic Minimization previous year questions

Practice every matching question in batches of 20, with every available option.

1
2007 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2007
What is the maximum number of different Boolean functions involving \( n \) Boolean variables?
Open complete paper
2
2007 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2007
Consider the following Boolean function of four variables:
\( f(w,x,y,z) = \sum (1,3,4,6,9,11,12,14) \)
The function is
Open complete paper
3
2007 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2007
Let f(w, x, y, z) = ∑(0,4,5,7,8,9,13,15). Which of the following expressions are NOT equivalent to f?
Open complete paper
4
2007 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2007
Define the connective * for the Boolean variables X and Y as: X * Y = XY + X'Y'. Let Z = X * Y. Consider the following expressions P, Q and R. P : X = Y * Z, Q : Y = X * Z, R : X * Y * Z = 1. Which of the following is TRUE?
Open complete paper
5
2008 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2008
In the Karnaugh map shown below, X denotes a don't care term. What is the minimal form of the function represented by the Karnaugh map?

Question diagram

Open complete paper
6
2008 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2008
Given \(f_1\), \(f_2\) and f in canonical sum of products form (in decimal) for the circuit
\[ \begin{aligned} f_1 &= \Sigma m (4, 5, 6, 7, 8) \\ f_2 &= \Sigma m (1, 6, 15) \\ f &= \Sigma m (1, 6, 8, 15) \end{aligned} \]
then \(f_2\) is

Question diagram

Open complete paper
7
2008 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2008
If $P, Q, R$ are Boolean variables, then $(P + \bar{Q})(P \cdot \bar{Q} + P \cdot R)(\bar{P} \cdot \bar{R} + \bar{Q})$ simplifies to
Open complete paper
8
2008 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2008
P and Q are two propositions. Which of the following logical expressions are equivalent?
I. $P \vee \neg Q$
II. $\neg(\neg P \wedge Q)$
III. $(P \wedge Q) \vee (P \wedge \neg Q) \vee (\neg P \wedge \neg Q)$
IV. $(P \wedge Q) \vee (P \wedge \neg Q) \vee (\neg P \wedge Q)$
Open complete paper
9
2009 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2009
What is the minimum number of gates required to implement the Boolean function (AB + C) if we have to use only 2-input NOR gates ?
Open complete paper
10
2009 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2009
The binary operation □ is defined as follows :
PQP □ Q
TTT
TFT
FTF
FFT
Which one of the following is equivalent to P ∨ Q ?
Open complete paper
11
2010 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2010
The minterm expansion of \(f(P, Q, R) = PQ + Q\bar{R} + P\bar{R}\) is
Open complete paper
12
2013 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2013 [Session 1]
Which one of the following expressions does NOT represent exclusive NOR of \(x\) and \(y\)?
Open complete paper
13
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
14
2013 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2013 [Session 3]
Which one of the following expressions does NOT represent exclusive NOR of x and y?
Open complete paper
15
2014 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2014 [Session 1]
Which one of the following propositional logic formulas is TRUE when exactly two of p, q, and r are TRUE?
Open complete paper
16
2014 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2014 [Session 2]
Which one of the following Boolean expressions is NOT a tautology?
Open complete paper
17
2014 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2014 [Session 2]
The dual of a Boolean function \(F(x_1, x_2, \ldots, x_n, +, \cdot, ')\), written as \(F^D\), is the same expression as that of \(F\) with \(+\) and \(\cdot\) swapped. \(F\) is said to be self-dual if \(F = F^D\). The number of self-dual functions with \(n\) Boolean variables is
Open complete paper
18
2014 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2014 [Session 3]
Let ⊕ denote the Exclusive OR (XOR) operation. Let '1' and '0' denote the binary constants. Consider the following Boolean expression for F over two variables P and Q:
F(P, Q) = ((1⊕P)⊕(P⊕Q)) ⊕ ((P⊕Q)⊕(Q⊕0))
The equivalent expression for F is
Open complete paper
19
2016 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2016 [Session 1]
Consider the Boolean operator # with the following properties: \(x \# 0 = x\), \(x \# 1 = \bar{x}\), \(x \# x = 0\) and \(x \# \bar{x} = 1\). Then \(x \# y\) is equivalent to
Open complete paper
20
2017 · Computer Science & Information Technology · Digital Logic · Boolean Algebra and Logic Minimization
Computer Science & Information Technology (CS) 2017 [Session 2]
If \(w,x,y,z\) are Boolean variables, then which one of the following is INCORRECT?
Open complete paper

Showing 20 of 36 questions