Question 1
The truth table
represents the Boolean function
X
X+Y
X xor Y
Y
Question 2
Which one of the following is NOT logically equivalent to ¬∃x(∀y(α)∧∀z(β))?
∀x(∃z(¬β)->∀y(α))
∀x(∀z(β)->∃y(¬α))
∀x(∀y(α)->∃z(¬β))
∀x(∃y(¬α)->∃z(¬β))
Question 3
Which one of the following expressions does NOT represent exclusive NOR of x and y?
xy+x'y'
x⊕y'
x'⊕y
x'⊕y'
Question 4
In the following truth table, V = 1 if and only if the input is valid.
What function does the truth table represent?
Priority encoder
Decoder
Multiplexer
Demultiplexer
Question 5
The smallest integer that can be represented by an 8-bit number in 2’s complement form is
-256
-128
-127
0
Question 6
Consider the data given in Q50 question. If all the flip-flops were reset to 0 at power on, what is the total number of distinct outputs (states) represented by PQR generated by the counter?
3
4
5
6
Question 7
Consider the following circuit involving three D-type flip-flops used in a certain type of counter configuration.

If at some instance prior to the occurrence of the clock edge, P, Q and R have a value 0, 1 and 0 respectively, what shall be the value of PQR after the clock edge?
000
001
010
011
Question 8
The minimum number of D flip-flops needed to design a mod-258 counter is.
9
8
512
258
Question 9
What is the minimized sum-of-products (SOP) switching expression corresponding to the Boolean function
f(A, B, C, D) = Σ(1, 4, 5, 9, 11, 12)?
(GATE 2005 | MCQ | 2-mark)
BC'D + A'CD + AB'D
BC'D' + A'C'D + AB'D
ABC' + ACD + B'C'D
ACD' + A'BC' + AC'D'
Question 10
Which one of the following circuits is NOT equivalent to a 2-input XNOR (exclusive NOR) gate?

A
B
C
D
There are 149 questions to complete.