Scribd
Upload
155 views2 pages

Mid-Term Exam: Logic Design & Circuits

This document is a midterm exam for a logic design and digital circuits course. It contains 3 questions. Question 1 has multiple choice questions testing knowledge of binary, hexadecimal, Boolean algebra concepts. Question 2 involves finding the complement of a Boolean expression and demonstrating the validity of an expression using a truth table. Question 3 asks to simplify a Boolean expression using a Karnaugh map. The model answer provides step-by-step solutions and explanations for each question.

Uploaded by

AhmedGamal
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
155 views2 pages

Mid-Term Exam: Logic Design & Circuits

This document is a midterm exam for a logic design and digital circuits course. It contains 3 questions. Question 1 has multiple choice questions testing knowledge of binary, hexadecimal, Boolean algebra concepts. Question 2 involves finding the complement of a Boolean expression and demonstrating the validity of an expression using a truth table. Question 3 asks to simplify a Boolean expression using a Karnaugh map. The model answer provides step-by-step solutions and explanations for each question.

Uploaded by

AhmedGamal
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/ 2

Future University in Egypt, FUE Exam: Mid-Term # 1

Faculty of Engineering and Technology Course: Logic Design and Digital Circuits
Electrical Engineering Dept. Course Code: ELE 215
Examiner: Dr. Waleed Al-Hanafy Date: 25/3/2019
Semester: Spring 2019 Time Allowed: 1 Hour

Student Name: ....................... Academic Number: .......................

Model Answer:
15

1. (a) Choose the proper answer A, B, C, or D of the following: [2.5 marks]


i. 5110 is equal to
A. 1100112 B. 3316 C. 00110001BCD D. answer A. and B.
ii. The largest binary that can be represented with 8 bits is
A. 128 B. 255 C. 256 D. 127
iii. The output of an AND gate is 1 if
A. at least one of its inputs is 1
B. all its inputs are 0s
C. none of its inputs is 0
D. at least one of its inputs is 0
iv. The hexadecimal number 7616 is
A. greater than 778 B. equal to 1111102 C. less than 3E16 D. answer A. and B.
v. The expression x0 + y is equivalent to
A. xy 0 B. x + y 0 C. x0 y D. x + y 0
√
(b) Put true or false × next to each of the following sentences and correct the
false sentences: [2.5 marks]
i. x + 1 = x h×i, x + 1 = 1
0
√
ii. x · x = 0 h i
iii. Boolean algebra expressions is always equivalent to their respective linear algebra
ones h×i, isn’t
iv. The operator precedence for evaluating Boolean expressions is: 1) parentheses, 2)
NOT, 3) OR, and 4) AND h×i, 1) parentheses, 2) NOT, 3) AND, and 4) OR
√
v. x + x · y = x h i

2. (a) Find the complement of the F = x (y 0 z + yz 0 ) by talking its dual and complementing
each literal. [2 marks]
0 0 0 0 0 0
Solution: dual = x + (y + z)(y + z ) → F = x + (y + z )(y + z).
(b) Demonstrate using a truth table the validity of x + yz = (x + y) (x + z). [3 marks]
Solution: Clearly, it is seen from the following truth table that the LHS of the above
equation is equivalent to its RHS.
x y z yz LHS: x + yz (x + y) (x + z) RHS: (x + y) (x + z)
0 0 0 0 0 0 0 0
0 0 1 0 0 0 1 0
0 1 0 0 0 1 0 0
0 1 1 1 1 1 1 1
1 0 0 0 1 1 1 1
1 0 1 0 1 1 1 1
1 1 0 0 1 1 1 1
1 1 1 1 1 1 1 1

3. By using Karnaugh map, simplify the following Boolean expression: [5 marks]

w0 z + xz + x0 y + wx0 z
Solution:
w0 z = m1 + m3 + m5 + m7 ,
xz = m5 + m7 + m13 + m15 ,
x0 y = m2 + m3 + m10 + m11 ,
wx0 z = m9 + m11 .
P
∴ F (w, x, y, z) = (m1 , m2 , m3 , m5 , m7 , m9 , m10 , m11 , m13 , m15 )
Therefore F (w, x, y, z) can be represented in the K-map as shown below

clearly, it is shown that the given Boolean expression is equivalent to z + x0 y.


with my best wishes...

You might also like