CS & IT
Engineering
Boolean Algebra &Minimization
Practice session
Lecture Number- By- Rahul Sir
Topics to be covered
Boolean Algebra &Minimization Practice session
1
If A B, then the value of Boolean expression,
( A + B) + ( A + B) + ( AB)( AB)
equals to,
A 0
B 1
C A+B
D AB
Assume 6-variable of inputs are connected to an Ex-OR gates, the number of
min-terms in the Boolean expression of the output of Ex-OR gate ‘Y’ will be 1
A 16
B 32
C 8
D 6
Consider the given K-map:
The solution of the K-map is:
A B+C
B ഥ
A+B
C ഥ+C
A+B
D ഥ+C
B
ഥ + C.
Consider the function f, f = AB
Which of the following is the correct K-map of the f.
A B
C D
Consider the K-map given below:
Which of the following is/are minimized form of above K-map?
A AD + BD + BC
B BC + AB + CD
C AB + CD + BD + BD
D BD + AD + BD
Consider the three 3-variable function f1, f2, f3 which are expressed in sum of
min-terms as
f1 = m (0, 1, 4, 5, 7)
f2 = m (2, 3, 4, 5, 7)
f3 = m (0, 1, 2, 3, 6)
The output function f can be expressed as:
A 1
B m (0, 1, 2, 3, 4, 5, 6, 7)
C 0
D m (0, 1, 2, 3, 6)
A function with don’t care condition as follows
f (a, b, c, d) = m (0, 2, 3, 5, 7, 8, 9, 10, 11) + d (4, 15)
The minimized expression for this function is
A ab + bd + cd + abc
B ab + bd + cd + abd
C ab + bd + bc+ abd
D Above all
A function with don’t care is as given as, g (X, Y, Z) = m (5, 6) + d (1, 2, 4).
For this function, consider following expression
1. XYZത + XഥYZ
2. Xഥ
Y + XZത
3. XZത + ഥ
XZ + ഥ
YZ
4. YZത + ഥ
YZ
The solution for g are
A 1, 2 and 3
B 1, 2 and 4
C 1 and 4
D 1 and 3
A switching function of four variable, f(w, x, y, z) is equal to the product of
two other functions f1 and f2 of the same variable, i.e. f = f1f2. The function f
and f1 are as follows:
f = m (4, 7, 15)
f1 = m (0, 1, 2, 3, 4, 7, 8, 9, 10, 11, 15)
The number of full specified function, that will satisfy the given condition is
A 32
B 16
C 4
D 1
Consider the K-map given below:
The EPI term will be:
A BD, AB
B AB, CD
C BD, BD
D BD, BC
Consider the K-map
The RPI term will be:
A CD
B AC
C BC
D BD
Consider the K-map
The EPI term will be:
A AB, BC
B AB, AB
C AB, AC
D AB, BC
A logic circuit implements the Boolean function f = xത y + xതyz. It is found that
the input combination x = y = 1 can never occur. Taking this into accounts a
simplified expression for f is given by
A xത + yത z
B x+z
C x+y
D y + xതz
In a function f, the difference between PI and EPI is 2. Then the number of
minimal expressions are
(Given RPI = 0)
A 4
B 2
C 1
D cannot determined
Let the function given as
f(A, B, C, D) = m (0, 1, 4, 6, 7, 8, 10, 14, 15)
The number of prime implicants and essential prime implicants in f are
A 7, 2
B 6, 1
C 6, 2
D 7, 1
A switching circuit has four inputs as shown below.
A and B represents the first and second bits of a Binary number N1. C and D
represents the first and second bits of a Binary number N2. The output is to
be 1 only if the product N1 × N2 is less than or equal to 2. The minimized
form of F is
A AB + BC + CD + DA
B AB + AC + CD + AD + BC
C AB + AC + CD + AD + BC
D ABC + AC + BD + AD + BCD
Consider the minimization of the following expression using the K-map
Y(A, B, C, D) = m (1, 5, 6, 7, 11, 12, 13, 15)
How many essential prime implicants will present in minimized expression?
THANK YOU!
Here’s to a cracking journey ahead!