Scribd
Upload
3 views

Sheet4 Digital Computer Fundamentals

Sheet4 Digital Computer Fundamentals

Uploaded by

nour.3bas752005
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Sheet4 Digital Computer Fundamentals

Sheet4 Digital Computer Fundamentals

Uploaded by

nour.3bas752005
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Alexandria University CS131: Digital Computer

Faculty of Engineering Fundamentals


Computer and Systems Fall 2024/2025
Engineering Dept.
First Year

Sheet 4

1. Let f = Σ(5,6,13) and f1 = Σ(0,1,2,3,5,6,8,9,10,11,13).


Find f2 such that f = f1. f2. Is f2 unique? If not, indicate all possibilities.

2. Simplify the Boolean function T(w, x, y, z) = Σ(0,1,2,4,5,6,8,9,12,13,14) using a


Karnaugh map.

3. Simplify the following Boolean expressions using Karnaugh maps.


a. F (A, B, C) = A ’ C + A ’ B + AB ’ C + BC
b. F (A, B, C, D)= A ’ B ’ C ’ D ’ + AC ’ D ’ + B ’ CD ’ + A ’ BCD + BC ’ D
c. F(A, B, C, D, E) = Σ m(0, 1, 2, 6, 7, 9, 10, 15, 16, 18, 20, 21, 27, 30)
+ Σ d(3, 4, 11, 12, 19)

4. Find a function of three variables, such that it has the highest cost when
represented using a two-level network of AND/OR (a sum of product
representation), even after minimization.

a. Using Karnaugh maps, illustrate that the cost of representing this function
as a sum of product expression cannot be reduced.
b. Can you find a much less costly expression for the function using other
types of gates?

5. For the following function: f1(a,b,c,d) = (a’ + b’) (c’ + d’) + a b c’ d’


a. Find the minimal S.O.P expression.
b. Find the minimal P.O.S expression.

6. Given the function T(w,x,y,z) = Σ (1, 2, 3, 5, 13) + Σ d (6, 7, 8, 9, 11, 15)


a. Find the minimal S.O.P expression.
b. Find the minimal P.O.S expression.
c. Compare the expressions obtained in a and b.

Policies:
● If 2 or more copies are discovered, both parties will receive serious submission
penalties.
● No late submission is allowed.
Alexandria University CS131: Digital Computer
Faculty of Engineering Fundamentals
Computer and Systems Fall 2024/2025
Engineering Dept.
First Year

7. Simplify the following Boolean functions as Product of Sums:


a. F (w,x,y,z) = Σ (0,2,5,6,7,8,10)
b. F (A,B,C,D) = π( 1,3,5,7,13,15)

8. For a function of four variables A, B, C, and D, assume that the inputs will never
occur. ABCD = 0101, ABCD = 1001, ABCD = 1011
Simplify the following expression:

F (A, B, C, D) = A ’ BC ’ D + A ’ B ’ D + A ’ CD + ABD + ABC

Policies:
● If 2 or more copies are discovered, both parties will receive serious submission
penalties.
● No late submission is allowed.

You might also like