Operating Systems Computer Architecture

Page 1 of 8

03 OSCA Logic Gate Exercise Solutions

SECTION A
Multiple Choice Questions

1. Which of the following is the Boolean algebra function of an AND gate?

a) Divider.
b) Multiplier.
c) Subtracter.
d) Adder.

2. If a NOR gate has n inputs, how many possible input state combinations are there?

a) n.
b) 2n.
c) 2n
d) n2.

3. Which of the following is not part of an EX-OR gate’s truth table?

a) X=1, Y=1, Output=1.

b) X=0, Y=0, Output=0.
c) X=0, Y=1, Output=1
d) X=1, Y=0, Output=1

4. The output of a gate is low when at least one of its inputs is high. This is true for
_____ gate.

a) AND
b) NAND 
c) OR
d) NOR

Level 1 Asia Pacific University of Technology & Innovation Tutorial Solutions

Operating Systems Computer Architecture
Page 2 of 8

SECTION B
Exercises

1. Complete the truth table based on the diagram provided below:

A B C D E F Out
0 0
0 1
1 0
1 1

Answer

A B C D E F Out
0 0 1 0 1 0 0
0 1 1 1 0 0 1
1 0 0 0 1 1 1
1 1 0 0 0 0 0

2. What are the binary values of C, D, E, F, and G for all possible combinations
of A and B? Draw a truth table to show the results.

Level 1 Asia Pacific University of Technology & Innovation Tutorial Solutions

Operating Systems Computer Architecture
Page 3 of 8

A B C D E F G
0 0
0 1
1 0
1 1

Answer
A B C D E F G
0 0 1 0 1 1 0
0 1 1 1 0 1 1
1 0 0 1 1 1 0
1 1 0 0 1 1 1

SECTION B
Exercises

3. Draw a logic circuit for the following:

a) (A + B)C
b) A + BC + D’
c) AB + (AC)’
d) (A + B)’(C + D)C’

Answer

a)

b)

Level 1 Asia Pacific University of Technology & Innovation Tutorial Solutions

Operating Systems Computer Architecture
Page 4 of 8

c)

d)

4. Write the truth table and draw the logic diagram for each of the following:

a)
b)
c)
d)
e)

Answer
a)

a b

0 0 1

0 1 0

1 0 0

1 1 0

Level 1 Asia Pacific University of Technology & Innovation Tutorial Solutions

Operating Systems Computer Architecture
Page 5 of 8

b)
a b c

0 0 0 0 0

0 0 1 0 0

0 1 0 1 0

0 1 1 1 1

1 0 0 1 0

1 0 1 1 1

1 1 0 0 0

1 1 1 0 0

c)

a b c

0 0 0 1 1 0 0 0

0 0 1 1 1 0 1 1

0 1 0 1 0 1 0 1

0 1 1 1 0 1 1 1

1 0 0 0 1 1 0 1

1 0 1 0 1 1 0 1

1 1 0 0 0 1 0 1

1 1 1 0 0 1 0 0

Level 1 Asia Pacific University of Technology & Innovation Tutorial Solutions

Operating Systems Computer Architecture
Page 6 of 8

d)

a b

0 0 1 1 1 1 1

0 1 1 0 1 0 0

1 0 0 1 1 0 0

1 1 0 0 0 0 0

e)

a b c

0 0 0 0 0 0

0 0 1 0 1 1

0 1 0 1 0 1

0 1 1 1 1 1

1 0 0 1 1 1

1 0 1 1 0 1

1 1 0 0 1 1

1 1 1 0 0 0

Level 1 Asia Pacific University of Technology & Innovation Tutorial Solutions

Operating Systems Computer Architecture
Page 7 of 8

5. Write the truth table and draw the logic circuit for the following expression.
F(x,y,z) = (xy XOR (y+z’)’) + x’z
Answer

x y z xy z’ y+z’ (y+z’)’ (xy xor x’ x’z (xy xor

(y+z’)’ (y+z’)’) + x’z
)

0 0 0 0 1 1 0 0 1 0 0

0 0 1 0 0 0 1 1 1 1 1

0 1 0 0 1 1 0 0 1 0 0

0 1 1 0 0 1 0 0 1 1 1

1 0 0 0 1 1 0 0 0 0 0

1 0 1 0 0 0 1 1 0 0 1

1 1 0 1 1 1 0 1 0 0 1

1 1 1 1 0 1 0 1 0 0 1

Level 1 Asia Pacific University of Technology & Innovation Tutorial Solutions

Operating Systems Computer Architecture
Page 8 of 8

6. Find the truth table and the expression for the following circuit.

d
c
Answer
Truth Table
x y z a b c d OF
0 0 0 0 0 1 1 1
0 0 1 0 1 1 1 1
0 1 0 1 1 1 1 0
0 1 1 1 0 1 1 0
1 0 0 1 0 0 0 1
1 0 1 1 1 0 1 0
1 1 0 1 0 0 1 0
1 1 1 1 0 0 0 1

Expression
(x+y) XOR ((y XOR z) + x’)

Level 1 Asia Pacific University of Technology & Innovation Tutorial Solutions