- Tutorials
- Courses
- Tracks
Logic functions and Minimization
Question 1
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 2
Which one of the following circuits is NOT equivalent to a 2-input XNOR (exclusive NOR) gate?
A
B
C
D
Question 3
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 4
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 5
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?
2
3
4
5
Question 6
What is the minimal form of the Karnaugh map shown below? Assume that X denotes a don’t care term.
.png)
b'd'
b'd' + b'c'
b'd' + a'b'c'd'
b'd' + b'c' + c'd'
Question 7
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?
A) b'd'+a'd'
B) a'b'+b'd'+a'b'd'
C) b'd'+a'b'd'
D) a'b'+b'd'+a'd'
A
B
C
D
Question 8
Given f1, f3 and f in canonical sum of products form (in decimal) for the circuit
[Tex]\sum m(4,6)[/Tex]
[Tex]\sum m(4,8)[/Tex]
[Tex]\sum m(6,8)[/Tex]
[Tex]\sum m(4,6,8)[/Tex]
Question 9
If P, Q, R are Boolean variables, then (P + Q')(PQ' + PR)(P'R' + Q') simplifies
PQ'
PR'
PQ' + R
PR'' + Q
Question 10
Consider the following Boolean function of four variables: f(w,x,y,z) = ∑(1,3,4,6,9,11,12,14) The function is:
independent of one variables.
independent of two variables.
independent of three variables.
dependent on all the variables.
There are 104 questions to complete.