UMBC CMSC 313, Computer Organization & Assembly Language, Fall 2002, Section 0101

Homework Assignments

Homework assigned so far:

Homework 1 (due Tues 9/10)

From Murdocca & Heuring Chapter 2, pages 56-57. Show all of your work.
  1. (25 pts) 2.2 (a)-(e)
  2. (25 pts) 2.3 (a)-(e)
  3. (5 pts) 2.5
  4. (5 pts) 2.7
  5. (5 pts) 2.8

Homework 2 (due Tues 9/17)

From Murdocca & Heuring Chapter 2, pages 57-59 and Chapter 3, 95-98. Show all of your work.
  1. (5 pts) 2.13
  2. (15 pts) 2.18 (a), (b) and (e)
  3. (15 pts) 3.1
  4. (5 pts) 3.2
  5. (10 pts) 3.3

Homework 3 (due Thur 11/07)

From Murdocca & Heuring Appendix A, pages 493-494.
  1. (5 points) A.2
  2. (5 points) A.8
  3. (5 points) A.9
  4. (40 points) For each CMOS circuit below,
    1. Provide a truth table for the circuit's function.
    2. For diagram (a), write down the Sum-of-Products (SOP) Boolean Formula for the truth table. For diagram (b), write down the Product-of-Sums (POS) Boolean formula.
    3. Simplify the SOP or POS formula using the postulates and theorems of Boolean Algebra (M&H p. 451). Show all work.
    4. Draw the logic diagram of the simplified formula using AND, OR, NOT, NAND and NOR gates.

       
    (a)     (b)

    Figures taken from Digital Design, Wakerly, Prentice-Hall.

Homework 4 (due Thur 11/14)

From Murdocca & Heuring Appendix A, pages 494-495.
  1. (5 pts) A.12
  2. (5 pts) A.13
  3. (5 pts) A.14
  4. (5 pts) A.15
  5. (5 pts) A.16

Homework 5 (due Tues 12/03)

Available only in PDF.

Last Modified: 22 Jul 2024 11:27:52 EDT by Richard Chang
to Fall 2002 CMSC 313 Section Homepage