In the following truth table, V = 1 if and only if the input is valid. What function does the truth table represent?
Question 1 Explanation:
Since there are more than one outputs and number of outputs is less than inputs, it is a Priority encoder V=1 when input is valid and for priority encoder it checks first high bit encountered. Except all are having at least one bit high and ‘x’ represents the “don’t care” as we have found a high bit already. So answer is (A).
Which one of the following expressions does NOT represent exclusive NOR of x and y?
Question 2 Explanation:
By Definition of XNOR, So Option-A is correct. Also by Definition of XOR, Option-B is So Option-B is also correct. Option-C is Option-C is also correct. Option-D x'⊕y' = x''y' + x'y'' = xy' + x'y = x⊕y ≠ x⊙y Therefore option (D) is false. This explanation is provided by Chirag Manwani.
X xor Y
Question 3 Explanation:
The value of f(X, Y) is same as X for all input pairs. We see from truth table – Column x= f(x,y) So , f(x,y)=x Ans is (A) part.
b'd' + b'c'
b'd' + a'b'c'd'
b'd' + b'c' + c'd'
Question 4 Explanation:
There are two prime implicants in the following K-Map- Prime Implicant higlighted in Green = Prime Implicant higlighted in Orange = So the Boolean expression is- Therefore option (B) is correct. This explanation is provided by Chirag Manwani.
Question 5 Explanation:
All options except D produce XOR as described below :
The simplified SOP (Sum Of Product) form of the boolean expression (P + Q' + R') . (P + Q' + R) . (P + Q + R') is
(P'.Q + R')
(P + Q'.R')
(P'.Q + R)
(P.Q + R)
Question 6 Explanation:
See following : (P+Q'+R').(P+Q'+R).(P+Q+R') = From the K-map, POS form is : P + Q'.R'
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?
Question 7 Explanation:
P' = R Q' = (P + R)' R' = QR' Given that (P, Q, R) = (0, 1, 0), next state P', Q', R' = 0, 1, 1 ----------------------------------------------------------------------------------------------- D flip flop truth table
Initially (p,q,r) =(0,1,0)
D for p=R
D for q=NOT(p xor r)
D for r= (not)r.q
So Q(t+1) for(p,q,r)
p=>r=0 so p=0
q=> NOT(p xor r) => 1 so q=1
r=>(not)r.q => 1 so r=1
(p, q, r) = (0, 1, 1)
Alternative approach -
Truth table of a D Flip-Flop-
By looking at the circuit diagram, it is clear that the boolean expressions of P, Q, and R are-
Here the subscript t refers to the current clock cycle, and the subscript (t+1) refers to the next clock cycle.
This explanation is provided by Chirag Manwani.
Consider the data given in previous 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?
Question 8 Explanation:
There are four distinct states, 000 → 010 → 011 → 100 (→ 000) so the answer is B
The minterm expansion of f(P, Q, R) = PQ + QR' + PR' is
m2 + m4 + m6 + m7
m0 + m1 + m3 + m5
m0 + m1 + m6 + m7
m2 + m3 + m4 + m5
Question 10 Explanation:
For 4 to 1 mux truth table SEL INPUT O/P
There are 251 questions to complete.
My Personal Notes arrow_drop_up