CS147 Midterm Study Guide

Date: September 25, 2001

2001Fall :CS 147 First midterm study guide

2001Fall :CS 147 First midterm study guide

"I see and I forget, I hear and I remember, I do and I understand." -----------Confucius

 

Chapter 1 Combinational Logic

Chapter 3 ISA

Sample Problems.

  1. Consider the problem of adding two 2-bit binary numbers, producing a 3-bit sum.

Part A: Give the complete truth table for this function, without optimization.

Part B: Indicate the number of input not gates, row nand gates and output nand gates required to implement this function, without optimization.

    Give the complete truth table for an adder for two 2-bit binary numbers, producing a 3-bit sum.
  1. A1 A0 B1 B0 | S2 S1 S0
  2. --------------+---------
  3. 0 0 0 0 | 0 0 0
  4. 0 0 0 1 | 0 0 1
  5. 0 0 1 0 | 0 1 0
  6. 0 0 1 1 | 0 1 1
  7. 0 1 0 0 | 0 0 1
  8. 0 1 0 1 | 0 1 0
  9. 0 1 1 0 | 0 1 1
  10. 0 1 1 1 | 1 0 0
  11. 1 0 0 0 | 0 1 0
  12. 1 0 0 1 | 0 1 1
  13. 1 0 1 0 | 1 0 0
  14. 1 0 1 1 | 1 0 1
  15. 1 1 0 0 | 0 1 1
  16. 1 1 0 1 | 1 0 0
  17. 1 1 1 0 | 1 0 1
  18. 1 1 1 1 | 1 1 0

Part B: Indicate the number of gates required to implement this function, without optimization.

input not gates: 4

row nand gates: 16

output nand gates 3

  1. For the Boolean function: F = XY + X'YZ of three inputs, list its minterms. Express F in the sum of minterms in algebraic form. List minterms of F'.
  2. State if the following identities are TRUE or FALSE
    b. (B' + C)(B' + D) = B' + CD
    d. X'Z +X'Y + XZ = X'YZ' + X'YZ + X'Z
    e. (P + Q' + R)(P + Q' + R') = Q' + PR' + RP'
  3. Consider the following truth table:
         a  b  c    f
        --------------
         0  0  0    1
         0  0  1    0
         0  1  0    1
         0  1  1    0
         1  0  0    1
         1  0  1    1
         1  1  0    1
         1  1  1    0

Use this table to generate its corresponding function in the

  1. Analyse the following circuit (generate both the algebraic representation and the truth table):