Given f1 , f3 and f in canonical sum of products form (in decimal)..." - Step-by-step solution, answer key, and detailed explanation on MCA Prep."> Given f1 , f3 and f in canonical sum of products form (in decimal)..." - Step-by-step solution, answer key, and detailed explanation on MCA Prep." /> Given f1 , f3 and f in canonical sum of products form (in decimal)..." - Step-by-step solution, answer key, and detailed explanation on MCA Prep." />

Question 93

Computer Awareness Boolean algebra Easy

<p>Given f<sub>1</sub> , f<sub>3</sub> and f in canonical sum of products form (in decimal) for the circuit</p> <p><img alt="" src="https://firebasestorage.googleapis.com/v0/b/mcaprep-d6081.appspot.com/o/66408a3e8f5fa0df2bcec971.png?alt=media&token=7dc81c34-08fe-499e-950d-a8d006838c1e" style="width: 184px; height: 73px;" /></p> <p>f<sub>1</sub> &Sigma;m (4, 5, 6, 7, 8), f<sub>3</sub> &Sigma;m (1, 6, 15) and f &Sigma;m (1, 6, 8, 15) then f<sub>2</sub> is</p>

(A) &sum;(4,6)
(B) &sum;(4,8)
(C) &sum;(6,8)
(D) &sum;(4,6,8)
โœ“ Correct Answer: Option C Verified Solution

๐Ÿ“˜ Step-by-Step Solution & Detailed Explanation:

In this circuit (GATE CS 2008), \(f = f_1 \cdot f_2 + f_3\).

\(f_3\) already gives the minterms 1, 6 and 15 of \(f = \Sigma(1, 6, 8, 15)\). The term \(f_1 \cdot f_2\) must give minterm 8, and must not add any minterm outside \(f\).

  • \(f_1 = \Sigma(4,5,6,7,8)\), so \(f_2\) must contain 8.
  • \(f_2\) must not contain 4, 5 or 7, otherwise \(f_1 f_2\) would add them to \(f\).
  • \(f_2\) may contain 6, since 6 is already in \(f\).

Among the options, only \(\Sigma(6, 8)\) satisfies all these.

Answer: (C) ฮฃ(6, 8)

Practice Similar Boolean algebra Questions

Reinforce your conceptual grasp with related questions from NIMCET 2015:

Q21 The number of bit strings of length 10 that contain either five...
Solve โ†’
Q94 Which of the following is equivalent to the expression
Solve โ†’
Q95 (p → q v r, q → s, r → s  is logically...
Solve โ†’
Q98 The minimum number of NAND gates required to realize AB + AB'C + AB'C' is
Solve โ†’
Q100 The number of Boolean functions possible with n binary variables is equal...
Solve โ†’
Full-Length Test Series

Prepare for NIMCET Under Real Exam Conditions

Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.

Start Free Mock Test Series โ†’