GATE ECE · Digital Circuits
Generate GATE-level questions on Boolean Algebra. Focus on: 1. Minimization: Using Boolean identities, De Morgan's theorems, and K-maps. 2. Logic forms: Sum of Products (SOP) and Product of Sums (POS). 3. Canonical and standard forms.
20 questions · 20 PYQs · 0 AI practice · GATE ECE 2027
🎯 These are sample questions
Just sign in to unlock everything. Free for all students.
A 3-input majority logic gate has inputs and . The output of the gate is logic '1' if two or more of the inputs are logic '1'. The output is logic '0' if two or more of the inputs are logic '0'. Which one of the following options is a Boolean expression of the output ?
A 4-bit priority encoder has inputs and in descending order of priority. The two-bit output is generated as 00,01, 10, and 11 corresponding to inputs , and , respectively. The Boolean expression of the output bit is _____
For the Boolean function the essential prime implicants are
Select the Boolean function(s) equivalent to , where , and are Boolean variables, and + denotes logical OR operation.
A function F(A,B,C) defined by three Boolean variables A, B and C when expressed as sum of products is given by where, are complements of the respective variable. The product of sums (POS) form of the function F is
Which one of the following gives the simplified sum of products expression for the Boolean function , where , are minterms corresponding to the inputs A, B and C with A as the MSB and C as the LSB?
Following is the K-map of a Boolean function of five variables P, Q, R, S and X. The minimum sum-of-product (SOP) expression for the function is

The Boolean expression converted into the canonical product of sum (POS) form is
A function of Boolean variables X, Y and Z is expressed in terms of the min-terms as Which one of the product of sums given below is equal to the function F(X,Y,Z)?
For an n-variable Boolean function, the maximum number of prime implicants is
Consider the Boolean function, . Which one of the following is the complete set of essential prime implicants ?
The Boolean expression simplifies to
In the sum of products function f (X, Y, Z) = (2, 3, 4, 5), the prime implicants are
If X=1 in logic equation , then
The Boolean expression can be minimized to
The Boolean function Y = AB + CD is to be realized using only 2-input NAND gates. The minimum number of gates required is
The Boolean expression for the truth table shown is

The Boolean expression AC+ B is equivalent to
The number of distinct Boolean expressions of 4 variables is
If the function W,X,Y and Z are as follows , , , Then,
Want unlimited AI-generated Boolean Algebra questions?
Sign up free and practice with adaptive difficulty — Easy, Medium, Hard. New questions every session.
Start practising for free →