GATE CS 2025 (Forenoon) — Question 42

Digital LogicBoolean Algebra, Minimization, K-MapsMCQ2 marks · −2/3 if wrongMedium

Consider the following four variable Boolean function in sum-of-product form
\[ F(b_3, b_2, b_1, b_0) = \Sigma(0, 2, 4, 8, 10, 11, 12) \]
where the value of the function is computed by considering \( b_3b_2b_1b_0 \) as a 4-bit binary number, where \( b_3 \) denotes the most significant bit and \( b_0 \) denotes the least significant bit. Note that there are no don't care terms. Which ONE of the following options is the CORRECT minimized Boolean expression for \( F \)?
  1. A
    \( \overline{b_1}\overline{b_0} + \overline{b_2}\overline{b_0} + b_1\overline{b_2}b_3 \)
  2. B
    \( \overline{b_1}\overline{b_0} + \overline{b_2}\overline{b_0} \)
  3. C
    \( \overline{b_2}\overline{b_0} + b_1b_2b_3 \)
  4. D
    \( \overline{b_0}\overline{b_2} + \overline{b_3} \)
Practise the full 2025-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
Practise more on Boolean Algebra, Minimization, K-MapsTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group