Scribd
Upload
49 views1 page

University of Sargodha: Midterm Digital Logic Design (CS-Department)

The document provides instructions for a midterm exam on Digital Logic Design. It outlines three key rules: 1) university rules will be followed for any cheating, 2) students cannot share answers, and 3) there is a 50% penalty for submissions over 5 minutes late and submissions over 15 minutes late will not be accepted. The exam consists of two questions. Question 1 (worth 80 marks) involves simplifying a Boolean function using a K-map and Boolean algebra. It requires creating a truth table, drawing pre- and post-minimization circuits, and explaining the purpose of K-maps and Boolean algebra as well as the benefits of don't care conditions. Question 2 (worth 20 marks) involves writing the output values

Uploaded by

M Naveed Shakir
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
49 views1 page

University of Sargodha: Midterm Digital Logic Design (CS-Department)

The document provides instructions for a midterm exam on Digital Logic Design. It outlines three key rules: 1) university rules will be followed for any cheating, 2) students cannot share answers, and 3) there is a 50% penalty for submissions over 5 minutes late and submissions over 15 minutes late will not be accepted. The exam consists of two questions. Question 1 (worth 80 marks) involves simplifying a Boolean function using a K-map and Boolean algebra. It requires creating a truth table, drawing pre- and post-minimization circuits, and explaining the purpose of K-maps and Boolean algebra as well as the benefits of don't care conditions. Question 2 (worth 20 marks) involves writing the output values

Uploaded by

M Naveed Shakir
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/ 1

University of Sargodha

Midterm (Summer Semester)


Digital Logic Design (CS-Department)
Time Allowed: 24 Hours (Saturday, November 14, 2020)

Instructor: Salman Rashid

The following instruction should be strictly followed.


1. In the case of cheating by any means, university rules will be followed.
2. Students are not allowed to share anything.
3. There is a 50% penalty on late submission, up to 5 minutes. More than 15 minutes late
submission will NOT be accepted, what so ever is the reason.

Q No.1: [80]
Simplify the following Boolean function using K-map and Boolean Algebra.
F(A, B, C, D) = ∑(1, 4, 5, 7, 10, 13, 15)
A. Create a truth table. [10]
B. Draw a circuit before minimization. [10]
C. Draw a circuit after minimization. [15 + 15 + 10 = 40]
D. What is the purpose of K-map and Boolean algebra theorems and pustulates? If any similarities between
them. Explain your opinion with logical reasoning. [10]
E. What is the benefit of the Don’t care condition? Can we use the Don’t care condition with Boolean
algebra? If yes/no. Justify your answer with some supporting examples and explanations. [10]

Q No.2: [20]
Write down the gate level output against every input.
Marks Distribution [2] [2] [2] [2] [2] [5] [5]
A B C D AND OR NOT NAND NOR EXCLUSIVE‐OR EXCLUSIVE‐NOR
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1

You might also like