0% found this document useful (0 votes)
4 views

Midterm_solution

MCQ digital Logic

Uploaded by

hemawbsuhk
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views

Midterm_solution

MCQ digital Logic

Uploaded by

hemawbsuhk
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Arish University

Faculty of Computers and Information

Midterm Exam
1st Term 2023/2024
Course Title: Digital Logic Design Course ID: CS 221
Level: 2 Instructor: Dr. Asmaa Gad Date of Exam: 27/11/2023
Total Marks: 30 Student Name: Time Allowed: 1 hour

Answer the Following Questions:


Question 1:
a. Convert the following octal number (270.4)8 to decimal.

270.4 = 2 x 82 + 7 x 81 + 0 x 80 + 4 x 8-1 = 128 + 56 + 0.5 = (184.5)10

b. Convert the decimal number (45.0625)10 to binary and hexadecimal

Question 2:
Find the (r-1)’s and r’s complements of the following numbers in the indicated bases. [10 Marks]
i. (4190)10
9’s complement of 4190 = 5809
10’s complement of 4190 = 5810

ii. (11011000)2

1’ complement of 11011000 = 00100111


2’ complement of 11011000 = 00101000
Arish University
Faculty of Computers and Information

Question 3:
a) Simplify the following Boolean expressions to a minimum number of literals:

𝑎𝑎′ 𝑏𝑏𝑏𝑏 + 𝑎𝑎𝑎𝑎𝑐𝑐 ′ + 𝑎𝑎𝑎𝑎𝑎𝑎 + 𝑎𝑎′𝑏𝑏𝑏𝑏′

b) Express the following Boolean function:


𝐹𝐹(𝐴𝐴, 𝐵𝐵, 𝐶𝐶) = (𝐴𝐴′ + 𝐵𝐵)(𝐵𝐵 ′ + 𝐶𝐶)
1. As a product of Maxterms

2. As a sum of minterms
Arish University
Faculty of Computers and Information

Question 3:

Construct truth table and draw the logic diagram for the following Boolean
function:
𝐹𝐹(𝑎𝑎, 𝑏𝑏, 𝑐𝑐) = (𝑎𝑎𝑎𝑎 + 𝑎𝑎′𝑐𝑐)′ + 𝑏𝑏𝑏𝑏

a b c a’ ab a’c ab+a’c (ab+a’c)’ bc (ab+a′c)′+bc


0 0 0 1 0 0 0 1 0 1
0 0 1 1 0 1 1 0 0 0
0 1 0 1 0 0 0 1 0 1
0 1 1 1 0 1 1 0 1 1
1 0 0 0 0 0 0 1 0 1
1 0 1 0 0 0 0 1 0 1
1 1 0 0 1 0 1 0 0 0
1 1 1 0 1 0 1 0 1 1
Arish University
Faculty of Computers and Information

Question 4:

Use a K-map to simplify the Boolean expression and implement it using NAND
gates only:

𝐹𝐹(𝑥𝑥, 𝑦𝑦, 𝑧𝑧) = 𝑥𝑥 ′ 𝑦𝑦 + 𝑦𝑦𝑧𝑧 ′ + 𝑦𝑦′𝑧𝑧′

You might also like