Scribd
Upload
94 views3 pages

Homework 1: Problem 1.1

This homework assignment contains solutions to 8 problems related to computer architecture and programming languages. Problem 1.1 involves binary conversions. Problem 1.2 requires drawing logic gates by hand. Problem 1.3 involves deriving a logic circuit truth table and expression. The remaining problems involve simplifying logic expressions using reduction rules.

Uploaded by

Alex Hambasan
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
94 views3 pages

Homework 1: Problem 1.1

This homework assignment contains solutions to 8 problems related to computer architecture and programming languages. Problem 1.1 involves binary conversions. Problem 1.2 requires drawing logic gates by hand. Problem 1.3 involves deriving a logic circuit truth table and expression. The remaining problems involve simplifying logic expressions using reduction rules.

Uploaded by

Alex Hambasan
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/ 3

Computer Architecture and Programming Languages Course: CO20-320241

Jacobs University Bremen September 18, 2018


Alexandru Hambasan

Homework 1

Problem 1.1
Solution:

a) 7778 → 10008
b) 88816 → 88916

c) 320078 → 320108
d) 3210816 → 3210916
e) 8BF F16 → 8C0016

f) 121916 → 121A

Problem 1.2
Solution:
For simplicity, in this problem the gates are drawn by hand.
Problem 1.3
Solution:
From the logic circuit we see that X = M N Q · M N Q · M N Q
Truth table:
M N Q X
F F F F
F F T F
F T F F
F T T T
T F F F
T F T T
T T F F
T T T T
We can, using the table, rewrite X as:
X = M N Q + M N Q + M N Q ⇒ X = Q(M N + M N + M N
X = Q[M N + M (N + N )] ⇒ X = Q[M N + M ]

Problem 1.4
Solution:

a)

X Y X̄ X̄ Y X + X̄Y X+Y
F F T F F F
F T T T T T
T F F F T T
T T F F T T
b)
X Y X̄ XY X̄ + XY X̄ + Y
F F T F T T
F T T F T T
T F F F F F
T T F T T T

Problem 1.5
Solution:

a) A + 1 = 1
b) A · A = A

c) B ·B̄ = 0
d) C + C = C
e) X · 0 = 0
f) D · 1 = D

g) D + 0 = D
h) C + C̄ = 1
i) G + G · F = G · (1+F) = G

j) Y + W̄ ·Y = Y(1+W̄ ) = Y
Problem 1.6
Solution:

1) XY = X + Y
X Y X̄ Ȳ XY XY X̄ + Ȳ
F F T T F T T
F T T F F T T
T F F T F T T
T T F F T F F

2) X + Y = X · Y
X Y X̄ Ȳ X +Y X +Y X ·Y
F F T T F T T
F T T F T F F
T F F T T F F
T T F F T F F

Problem 1.7
Solution:
SOP: f = ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD

R0 + R1 : f = ABD(C + C) + ABD(C + C) + ABCD + ABD(C + C)


R2 f = ABD + ABD + ABCD + ABD
R0 + R1 : f = ABD + BD(A + A) + ABCD
R2 : f = ABD + BD + ABCD

R1 + R3 : f = ABCD + AD + BD
Within this context, I have used the following notations:
R0 : Distributive rule

R1 : Commutative rule
R2 : Complement Rule
R3 : Annulment Rule

Problem 1.8
Solution:
The steps I took are the steps presented on the course slides. I have attached the table, where I
constructed blocks of ones and each minterms associated with each of them.

You might also like