Simplified expression/s for following Boolean function F(A, B, C, D) = ∑ (0, 1, 2, 3, 6, 12, 13, 14, 15) is/are

(A) A'B' + AB + A'C'D'

(B) A'B' + AB + A'CD'

(C) A'B' + AB + BC'D'

(D) A'B' + AB + BCD'

Choose the correct answer from the options given below:

This question was previously asked in
UGC NET Computer Science (Paper 2) 2020 Official Paper
View all UGC NET Papers >
  1. (A) only
  2. (B) only 
  3. (A) and (B) only
  4. (B) and (D) only

Answer (Detailed Solution Below)

Option 4 : (B) and (D) only
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 option 4

K-maps

F(A, B, C, D) = ∑ (0, 1, 2, 3, 6, 12, 13, 14, 15)

Two K-Maps can be constructed from the given boolean function

The expression for K-Map 1 is AB + A'B' + A'CD'

The expression for K-Map 2 is AB +A'B' + BCD'

Latest UGC NET Updates

Last updated on Jun 12, 2025

-> 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.

Hot Links: teen patti lucky teen patti real money app teen patti tiger