Scribd
Upload
11 views

MT1 Sample

Uploaded by

Oula Abd Al-moty
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
11 views

MT1 Sample

Uploaded by

Oula Abd Al-moty
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

Page 1 of 4 – ITEC259 Digital Logic Design, Sample Midterm Exam – I

ITEC259 - Digital Logic Design 00 November 0000,


Midterm Examination Wednesday – 00.00
Std. No.: Name Surname: Gr:

Lecturer: Prof. Dr. Ahmet Rizaner 0000-0000 Fall Duration: 80 Minutes

Question 1 Question 2 Question 3 Question 4 Question 5 Question 6 Question 7 Total


12 pts. 12 pts. 16 pts. 16 pts. 12 pts. 12 pts. 20 pts. 100 pts.

 This is a closed book exam  No books, notes and dictionaries are allowed  Calculators are not allowed  All mobile
phones should be switched off during the exam  Attempt ALL questions  A summary of Boolean algebra postulates
and theorems are given on the last page  All work to be done in the spaces provided on the exam paper  If you think
a question is not clear, then write the assumptions you made for your solution  Good Luck 

Question 1. (12 pts.)

Perform the following conversions:

a. 110110.0112 decimal (6 pts.) b. 3BD616 to octal (6 pts.)

Question 2. (12 pts.)

Solve the following questions:

a. What are three different ways of representing a b. Represent decimal number 6027 in BCD and
signed number? Assume 8-bit numbers and excess-3? (6 pts.)
represent (-15) in each of them. (6 pts.)
Page 2 of 4 – ITEC259 Digital Logic Design, Sample Midterm Exam – I

Question 3. (16 pts.)

Reduce the following Boolean expression using only Boolean algebra. Show all your work (Do NOT use truth
tables or K-maps for this question. See last page for a summary of Boolean algebra postulates and theorems.)

a. F = b'c + ac' + bc (8 pts.) b. F = A'B (D' + C' D) + B (A + A' C D) (8 pts.)

Question 4. (16 pts.)

Use Karnaugh map (K-map) to simplify the following 4-variable function with Don’t-Care conditions:

F(A,B,C,D)= (3, 5, 6, 14, 15),

d(A,B,C,D)= (0, 4, 7, 10)


Page 3 of 4 – ITEC259 Digital Logic Design, Sample Midterm Exam – I

Question 5. (12 pts.)

Obtain the truth table of the function F by filling the following table.
F(x, y, z) = F = x’y + xz' + yz

x y z x' z' x’y xz' yz F


0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

Question 6. (12 pts.)


Draw a logic diagram using only two-input NAND gates to implement the following expression:

F=(AB + A’B’)(CD’ + C’D)


Page 4 of 4 – ITEC259 Digital Logic Design, Sample Midterm Exam – I

Question 7. (20 pts.)

Consider the Boolean expression as F (A, B, C, D) = B’D + A’D + BD.


a) Express the Boolean expression F as a sum of minterms.

b) Express the Boolean expression F as a product of maxterms.

Summary of Boolean algebra postulates and theorems

1. X + 0 = X 2. X•1=X
3. X + 1 = 1 4. X•0=0
5. X + X = X 6. X•X=X
7. X + X’ = 1 8. X • X’ = 0
9. X + X’ • Y= X + Y 10. (X’)’ = X
11. X + Y = Y + X 12. X•Y=Y•X
13. (X + Y) + Z = X + (Y + Z) 14. (X • Y) • Z = X • (Y • Z)
15. X • (Y + Z) = X • Y + X • Z 16. X + Y • Z = (X + Y) • (X + Z)
17. (X + Y)’ = X’ • Y’ 18. (X • Y)’ = X’ + Y’

You might also like