Simplify the following using K-Map

F(A, B, C, D) = ∑(0, 2, 5, 7, 8, 10, 13, 15) 

This question was previously asked in
UGC NET Computer Science (Paper 2) 11 March 2023 Official Paper
View all UGC NET Papers >
  1. BD + B'D'
  2. AC + A'C'
  3. BC + B'C'
  4. AD + A'D'

Answer (Detailed Solution Below)

Option 1 : BD + B'D'
Free
UGC NET Paper 1: Held on 21st August 2024 Shift 1
50 Qs. 100 Marks 60 Mins

Detailed Solution

Download Solution PDF

The correct answer is BD + B'D'

Key Points

  • An pairs is a group of two adjacent 1's. An pairs reduces one variable from a Boolean equation.
  •  An quads is a group of four adjacent 1's. An quads reduces two variable from a Boolean equation.
  •  An octet is a group of eight adjacent 1's. An octet reduces three variable from a Boolean equation.

After simplification ​BD + B'D'

Latest UGC NET Updates

Last updated on Jun 25, 2025

-> The UGC Net Admit Card has been released on its official website today.

-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.

-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.

-> The exam is conducted bi-annually - in June and December cycles.

-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions. 

-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.

More Minimization of Boolean Expression Questions

Hot Links: teen patti apk download teen patti joy teen patti sweet teen patti master online