Neco 2021 Data Processing Question 15

Practice objective / multiple choice question 15 from the 2021 Neco Data Processing examination.

Neco 2021 Data Processing Objective / Multiple Choice Medium Difficulty
Question 15 NECO • 2021 • DATA_PROCESSING • objective

The Boolean function \(F(A,B,C,D)\) is defined by the minterms \(\Sigma m(1,3,4,6,9,11,12,14)\). (a) Simplify \(F\) using a Karnaugh map and give the minimal sum‑of‑products expression. (b) If each NOT gate is a separate gate, each 2‑input AND gate counts as one gate and each 3‑input OR gate counts as one gate, determine the total number of gates required to implement the minimal expression.

Answer Options

Correct Answer A. Minimal SOP: F = \overline{B}D + B\overline{D}; total gates required = 5
B. Minimal SOP: F = \overline{B}\overline{D} + BD; total gates required = 5
C. Minimal SOP: F = \overline{B}D + B\overline{D}; total gates required = 6
D. Minimal SOP: F = \overline{A}C + AD; total gates required = 5
Correct Answer
A
Correct Option:
Minimal SOP: F = \overline{B}D + B\overline{D}; total gates required = 5

About This Question

This is Neco 2021 Data Processing Question 15. It is one of the objective questions from the 2021 Neco Data Processing examination.

Difficulty level: Medium .

View More Neco 2021 Data Processing Questions More Neco Practice Questions Back to Questions

Master the Exam!

You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.

Unlock Full Access Available for Android & Windows
Chat with Support