Scribd
Upload
26 views4 pages

Digital Design Quiz1 Thursday Set1 - 2

The document is a quiz for a digital design course covering Boolean functions and their realization using K-map and sum-of-products forms. It contains 5 multiple choice questions related to a Boolean function F(A,B,C,D) = ∑(0, 2, 6, 7, 8, 10, 12, 13, 15) realized using K-map. Students are asked to determine the number of prime implicants, minimum SOP forms, whether a term is a prime implicant or equivalent prime implicant, and the minimum number of AND/NAND gates needed for two-level AND-OR and NAND-NAND implementations.

Uploaded by

Govind Malpani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views4 pages

Digital Design Quiz1 Thursday Set1 - 2

The document is a quiz for a digital design course covering Boolean functions and their realization using K-map and sum-of-products forms. It contains 5 multiple choice questions related to a Boolean function F(A,B,C,D) = ∑(0, 2, 6, 7, 8, 10, 12, 13, 15) realized using K-map. Students are asked to determine the number of prime implicants, minimum SOP forms, whether a term is a prime implicant or equivalent prime implicant, and the minimum number of AND/NAND gates needed for two-level AND-OR and NAND-NAND implementations.

Uploaded by

Govind Malpani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, PILANI, HYDERABAD CAMPUS

First Semester 2022-2023 CS/ECE/EEE/INSTR F215 DIGITAL DESIGN


Quiz1 (Closed Book)
Time: 4.40 to 4.50 pm (10 MINUTES) Date: 13.09.2022 Marks: 10

NOTE:
(1) Answer all 5 Questions (each carrying 2M) and write down the answer in the space
provided. Overwriting and Unclear indication of answer will be awarded Zero marks
(2) Answer sheets without Name, ID no. and Tutorial sec will be awarded zero marks.
(3) Use the reverse side of the question paper for rough work
ID. NO.: Name: Tutorial sec:

Q. Consider the Boolean Function F (A, B, C, D) = ∑ (0, 1, 5, 7, 10, 14, 15) realised using k-
Map method of realization. Answer the following Questions.

Q1. Number of Prime Implicants (PI):

Ans.: __________

Q2. Number of minimum possible SOP forms for F is

Ans.: ___________

Q3. ACD’ is (a) Only PI, (b) Both PI & EPI, (c) None of these

Ans. _____________

Q4. If the minimal Sum of the Products forms is implemented using AND-OR two-level
implementation (Assuming inputs available both in true and complement form) minimum
number of AND gates used in the circuit is:

Ans.: _________

Q5. If the minimal Sum of the Products forms is implemented using NAND-NAND two level
implementation (Assuming inputs available both in true and compliment form) minimum
number of NAND gates used in the circuit is:

Ans.: _________

1
Use this page for Rough Work
BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, PILANI, HYDERABAD CAMPUS
First Semester 2022-2023 CS/ECE/EEE/INSTR F215 DIGITAL DESIGN
Quiz1 (Closed Book)
Time: 4.40 to 4.50 pm (10 MINUTES) Date: 15.09.2022 Marks: 10

NOTE:
(1) Answer all 5 Questions (each carrying 2M) and write down the answer in the space
provided. Overwriting and Unclear indication of answer will be awarded Zero marks
(2) Answer sheets without Name, ID no. and Tutorial sec will be awarded zero marks.
(3) Use the reverse side of the question paper for rough work
ID. NO.: Name: Tutorial sec:

Q. Consider the Boolean Function F (A, B, C, D) = ∑ (0, 2, 6, 7, 8, 10, 12, 13, 15) realised
using k-Map method of realization. Answer the following Questions.

Q1. Number of Prime Implicants (PI):

Ans.: __________

Q2. Number of minimum possible SOP forms for F is

Ans.: ___________

Q3. B’CD’ is (a) Only PI, (b) Both PI & EPI, (c) None of these

Ans. _____________

Q4. If the minimal Sum of the Products forms is implemented using AND-OR two-level
implementation (Assuming inputs available both in true and complement form) minimum
number of AND gates used in the circuit is:

Ans.: _________

Q5. If the minimal Sum of the Products forms is implemented using NAND-NAND two level
implementation (Assuming inputs available both in true and compliment form) minimum
number of NAND gates used in the circuit is:

Ans.: _________

2
Use this page for Rough Work

You might also like