Computer Science · Digital Logic
Simplify the following Boolean function using K-Map: F(A, B, C, D) = ∑(0, 2, 5, 7, 8, 10, 13, 15)
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1BD + B'D'✓
- 2AC + A'C'
- 3BC + B'C'
- 4AD + A'D'
Correct answer
BD + 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 Logic MCQs →Want more practice questions on Digital Logic?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Digital Logic