Computer Organization Assignment 2: Solution for Question 2b and Related Concepts - Prof. , Assignments of Computer Architecture and Organization

The solution for question 2b of a computer organization assignment, which involves simplifying a boolean expression using demorgan's theorem. The document also includes the simplified circuit design for an xor gate using nand gates.

Typology: Assignments

Pre 2010

Uploaded on 09/17/2009

koofers-user-xz6
koofers-user-xz6 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
22C:060 Computer Organization
Assignment 2
Sample solution
Answer 2(b)
x y z
F
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
0
0
0
1
0
1
0
1
Answer 4. (For simplicity, I am writing x as x’)
(x.y + x’.z + y.z’)
= (x’+y’).(x+z’).(y’+z)
Answer 10(c) F(x, y, z) = (x + y) (x’ + y’)
= (x’.y’) . (x.y) (DeMorgan’s theorem)
= 0
Answer 28 If you simplify, then you will find that
F = (x + x’.y) (x’.z) = (x + y) (x’.z)
x y z
F
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
0
1
1
0
1
1
1
1
pf2

Partial preview of the text

Download Computer Organization Assignment 2: Solution for Question 2b and Related Concepts - Prof. and more Assignments Computer Architecture and Organization in PDF only on Docsity!

22C:060 Computer Organization

Assignment 2

Sample solution

Answer 2(b)

x y z F 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1

Answer 4. (For simplicity, I am writing x as x’)

(x.y + x’.z + y.z’) = (x’+y’).(x+z’).(y’+z)

Answer 10(c) F(x, y, z) = (x + y) (x’ + y’)

= (x’.y’). (x.y) (DeMorgan’s theorem) = 0

Answer 28 If you simplify, then you will find that

F = (x + x’.y) ⊕ (x’.z) = (x + y) ⊕ (x’.z)

x y z F 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1

Answer 32 The simplest circuit is as follows:

X SUM = X ⊕ Y

Y

Carry = X.Y

There are other circuits that take 5 gates to implement XOR, and can be derived from the

definition of XOR x ⊕ y = x.y’ + x’.y. First implement it using AND OR NOT gates,

and then substitute each gate with its NAND equivalent (we have already done this

exercise when we studied why NAND gates are universal gates. See Section 3.3.2 pp

103-104).