Kingdom of Saudi Arabia

Ministry of Education - Higher Education

Computer Sciences Department
Tutorial Sheet (2)
Course: CS 105 T Digital Logic Design
Level: 2nd; Semester: 2nd; Year: 1443 - 2022
____________________________________
www
Answer the following questions WII!
1. Simplify the following Boolean functions to a minimum number of literals.
(a) f- = YCX -123

(b) f=y 1%01,61

(c) f- = 0

2. draw a logic diagram of the circuits that implement the original and simplified expression:
' '

Y'
'

Y' ✗ y
'
+
'
+ ✗
fide '
Y' City ) ✗ =

Simp / i
=
= ✗

3. Find the complement of the following expressions using duality and Demor

/
'
a) b) f=( (A' + B) - C) D -1 E
(a) f- duals City ') (✗ 1-
'
Y) '

dual =( CA ' B) + C / 1- D E
-
'

'
f -
-

(b) f- = (✗ ' + y ) (✗ + Y' ) -

fi = ( A. B' 1- c) + D -
E
'

4. List the truth table of the following function:

* 2=25-11*1
sense #
⇐

5. Draw logic diagrams to implement the following Boolean expressions:

(a) Jo ! # *
2=2%1 #
(b) *

6. Express the following functions as a sum of minterms and as a product of maxterms:

(a) F(A,B,C) = (AB+C)(B+AC)

(b) III. A

7. Express the complement of the following functions in the :

(a) F(w,x,y,z 0,1,3,8,9,13,15) [ 14 )
'

f = (2 , 4.5 , 6.7.10 ,
11,12 ,

=E( 3
'

f- ,
5 ,
7)

1
By Riham AlSmari
 119 ) ①
'

y ( Xz y)
'

F )
'

=
y (✗ z + ✗2 + +

' '
'
f- = ✗ YZ -1 Xyz + Xyz + y .
y
'

f- = ✗ yz + ✗ y (2+2)
'

f- = ✗ y z + ✗ y
f-
'
= y (✗ +✗y)

f- = YCCX 1-X
'
) ( ✗ +2 ) )

F =
y (✗ 1- 2) ✓

1lb) f = Xyz + ✗
'
y + ✗ y 2
'

f- y
'

y C2 ) + ✗
'
= ✗ -12

f = Xy + ✗
'
Y
f- = Y ( ✗ + xD
f- =
Y ✓

CBC -1 A' D) CAB't CD )

' '

1 / C) f- =

'

f- BC AB -113C'CD + A' DAB + A'DCD

' ' ' '
= = o

y)
'
' '
2) f- = (✗ + g) ( ✗ +

Simplified
'

y )
' ' ' '
Y' ( ✗
' ' ' '
= ✗ + = ✗ y + ✗ y = ✗ y
Not ☐
✗
••
y
f
%• or
'

8•

'

]
✗ •s
'

y og
o
f- Simp
 '
4) f
'
②
'
'
= ✗ YZ + ✗ Y 2
'
+ XYZ

ÉÉYÉyf
O O o l l l 0 O O O

o O l l I 0 O o o o

I
l
0°
o ° °

I 1 I 0 0 o

°
0 I

1 0 I 0 I 0 0

I 0 I

l1

A' 13
'
51A) f- = 1- CAB'S

]
A •o

B •• f

••
B
'

]o•
'

5 / b) f- = ( A -1C ) ( At
'
B -
D 1
OR
A
Not c
'
c ••

°
B
f
'

D
D •
.GR
A Not
 Glad f- ( A. B. C) = CAB + C) (Bt Ac ] ③

AB -1 ABC -113C + AC
= ABC + ABC + A' BC
'
+ ABE
=
> f- = { ( 7 , 6 , 3 , 5)

f- = # ( o
, 1,2 , 4) SCA -113-1 C) ( At Btc) ( A -113 't C) CA 't Btc )

6lb ) FC A. B. C. D) = B 'D +
A 'D -1
BD

'
ABED + A' B. CD -1A B'C'DAA 'B'C' ☐ + A' BCD -1A BED + A' BC'D -1A B'C' ☐ + ABCD A'BED
'
'
+

+ ABC ☐ + A' Bc'D

'

f- [ ( 11
=
, 3,9 , 1,7 5 , ,
15 ,
13 , 5)

IT ( 0 ,
2,4 ,
6 , 8 , 10 , 12,14 ) =

D) CA -113 -1413) ( A -113 't C' + D) ( A'1- Btc 1- D) ( A' + Btc 't D)
'
( At Btc + D) CA -113 -1C
'
+
'

CA -113 D) CA 't B' a C' 1- D)

'
-1C +
 8. For the following logic diagram:
I
- Write the Boolean expressions described by the diagram. f- =D ( CCA -113 ) -113 )

Then, write it in a standard form SOP. F Standard from =AcDtBcDtBD

2
-
- Then, draw the logic diagram in two-level implementation.

:
9. For the Boolean expression F=A

3
2
-
-
-
B C
Draw a logic diagram using a 3-input gate.
Then, write it in a standard form SOP.
Then, draw the SOP form in a logic diagram.
1197
]
A
B y y=A⑦B④C
C

219 ) A B C Y
O O O O
O
0
O
I 0
l l
I
standard from f- =

0 ✗ ,
ABCTAB C' + A' BC 't A' B' C
'

1
,
o
O
o
l
9
l l 0 O
l
l
'
?
A .

B
3197
C
☐
A
I' %•☐
•
Ba

.
f
B'
d
10
A
'
☐
Be .
☐
3183

A
'
☐ J
B
☐
e
] f-

B
☐
☐
2
By Riham AlSmari