Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Digital Logic Number Representations and Computer Arithmetic Minimization of Boolean Expression
Out the following steps in the proper sequence for simplifying a Boolean function using a Karnaugh map (K-map).
(A) Identify and group the largest possible cluster of I's
(B) Draw the K-map for the given Boolean function
(C) Write the simplified Boolean expression from the grouped clusters
(D) Transfer the truth table values to the K-map
Choose the correct answer from the options given below:
1
(B), (D), (A), (C)
2
(D), (B), (A), (C)
3
(B), (A), (D), (C)
4
(A), (B), (C), (D)