Sheet 1 computer architecture, Cheat Sheet of Computer Science

Sheet 1 of course computer architecture

Typology: Cheat Sheet

2022/2023

Uploaded on 03/13/2025

ahmed-mabrouk-3
ahmed-mabrouk-3 🇪🇬

1 document

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Sheet (1)
[Revision]
(1) Express the following numbers in decimal:
(a) (10110)2 (b) (l6)16 (c) (26)8 (d) (FAFA)16
(2) Find the complement of the following expressions:
(a) x.y' + x'y
(b) (AB' + C)D' + E
(c) (x + y' + z)(x' + z')(x + y)
(3) Draw the logic diagrams for the following Boolean expressions:
(a) Y = A'B' + B(A + C)
(b) Y = (A + B)(C ' + D)
(4) Given the following Boolean function:
F = x.y + x'. y' + y'.z
implement it with AND, OR and inverter gates.
(5) Derive the truth table of the following Boolean Functions:
(a) F(x,y,z) = x.y + x.y' + y '.z
(b) F(A,B,C,D) = A.B + C.D+ A.B'.C'
(c) F(A,B,C,D) = A + C.D'+ B.C.D'
(6) Given the following truth table, Express the output Z as Sum of Minterms and
Product of Maxterms.
Inputs
Output
A
B
C
Z
0
0
0
1
0
0
1
0
0
1
0
0
0
1
1
0
1
0
0
1
1
0
1
1
1
1
0
0
1
1
1
1
pf3

Partial preview of the text

Download Sheet 1 computer architecture and more Cheat Sheet Computer Science in PDF only on Docsity!

Sheet (1)

[Revision]

( 1 ) Express the following numbers in decimal: (a) ( 10110 ) 2 (b) (l6) 16 (c) (26) 8 (d) (FAFA) 16 (2) Find the complement of the following expressions:

(a) x.y ' + x ' y

(b) (AB ' + C)D ' + E

(c) (x + y ' + z)(x ' + z ' )(x + y)

(3) Draw the logic diagrams for the following Boolean expressions:

(a) Y = A ' B ' + B(A + C)

(b) Y = (A + B)(C ' + D)

(4) Given the following Boolean function:

F = x.y + x '. y ' + y ' .z

implement it with AND, OR and inverter gates.

(5) Derive the truth table of the following Boolean Functions:

(a) F(x,y,z) = x.y + x.y ' + y ' .z

(b) F(A,B,C,D) = A.B + C.D+ A.B ' .C '

(c) F(A,B,C,D) = A + C.D ' + B.C.D '

(6) Given the following truth table, Express the output Z as Sum of Minterms and Product of Maxterms. Inputs Output A B C Z 0 0 0 1 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 0 1 1 1 1

(7) Convert the following Sum of Products into Sum of Minterms.

(a) F(W,X,Y,Z) = WX + X ' YZ + WY ' Z '

(b) F(X,Y,Z) = X + X ' YZ + Y ' Z '

(8) Given the following Karnaugh maps, simplify these functions into Sum of Products and Product of Sums forms. (9) Simplify the following Boolean Functions using Karnaugh map.

(a) F(X,Y,Z) = ∑ (0,2,6.7)

(b) F(X,Y,Z) = ∑ (3,5,6,7)

(c) F(X,Y,Z) = XYZ + XY'Z + XYZ'

(d) F(A,B,C,D) = A'B'C'D+ ABCD+ AB'C'D+ A'BCD'+ AB'C'D'

(e) F(A,B,C,D) = A'B'C'D+ ABCD+ AB'C'D+ A'BCD+ AB'CD'

+AB'C'D'+ A'BCD'+ ABC'D+ ABC'D'+ A'B'CD'

(10) Implement the following Boolean Functions using 3x8 decoder.

F 1 (X, Y, Z) = X + Y ' Z

F 2 (X, Y, Z) = X ' + Y Z '

(11) Implement the following Boolean functions using multiplexers: (a) F (A, B, C, D) = Ʃ ( 0 , 2, 5 , 7 , 11, 14) (b) F (A, B, C, D) = Π (3, 8 , 12 )