Question 72Asked in Bihar STET 2025 Paper II Computer Science, 3 Nov 2025, Shift 1 (9:00 AM)

What is the POS form of the Boolean expression F(A, B, C) = Π(1, 2, 4, 6)?बूलियन अभिव्यक्ति f (a, b, c) = π (1, 2, 4, 6) का POS रूप क्या है?

बूलियन अभिव्यक्ति f (a, b, c) = π (1, 2, 4, 6) का POS रूप क्या है?
  1. A(A + B + C ') (A + B' + C)(A '+ B + C)(a + b + c ') (a + b' + c) (a ' + b + c)
  2. B(A' + B + C) (A '+ B + C)(a + b + c) (a + b' + c) (a ' + b + c )
  3. C(A' + B + C ') (A + B + C') (A '+ B + C)(a + b + c ') (a + b + c') (a ' + b + c)
  4. D(A + B' + C) (A + B '+ C) (A' + B + C)(a + b' + c) (a + b ' + c) (a' + b + c)
Show answerHide answer

Correct answer: (A) (A + B + C ') (A + B' + C)(A '+ B + C)(a + b + c ') (a + b' + c) (a ' + b + c)

Explanation

Each maxterm is a sum where a 0 bit is uncomplemented and a 1 bit is complemented: 1 = (A+B+C'), 2 = (A+B'+C), 4 = (A'+B+C), 6 = (A'+B'+C). Option A matches the first three; the full POS also includes (A'+B'+C).हर maxterm एक योग है जिसमें 0 बिट बिना पूरक और 1 बिट पूरक के साथ आता है: 1 = (A+B+C'), 2 = (A+B'+C), 4 = (A'+B+C), 6 = (A'+B'+C)। विकल्प A पहले तीन से मेल खाता है; पूरे POS में (A'+B'+C) भी शामिल है।

From Bihar STET 2025 Paper II Computer Science PYQ, 3 Nov 2025, Shift 1 (9:00 AM)

This is question 72 of Bihar STET 2025 Paper II Computer Science PYQ, 3 Nov 2025, Shift 1 (9:00 AM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.