Computer Science · Digital Electronics
The simplified Boolean function f(A, B, C, D) = ∑(0, 2, 4, 5, 6, 7, 8, 10, 13, 15) in Product-of-Sums (POS) form is:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(B + D')(A' + B' + D)✓
- 2(B + D)(B' + D')(A' + B')
- 3(B + D)(A + B' + D)
- 4(B' + D)(A' + B' + D)
Correct answer
(B + D')(A' + B' + D)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Digital Electronics MCQs →Want more practice questions on Digital Electronics?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Digital Electronics