Hello Computer Organization Students:

Test 1 will be Thursday, February 9, in class. It will be closed book and notes, except for one 8.5" x 11" sheet of paper (front and back) with notes.

Chapter 1.

Basic structure and functional units of a computer

Functional units: Input, CPU, Memory, Output, System bus

CPU components: control unit, ALU, regs., internal CPU interconnection

Appendix B: The Basics of LogicDesign (B.1 through B.6)

Truth tables for the gates

Boolean algebra notations: sum-of-products

Combinational circuit design (no memory): 1) determine truth table for function, 2) using Karnaugh/K-maps to get minimized sum-of-products function, 3) draw implementation of minimized function (using gates)

Common combinational circuits: 1-bit Adders (half and full), ripple adder, faster (2-bit) carry-lookahead adders, decoder, and multiplexer (MUX).

Number of gate delays for a circuit.

Complexity number of a circuit (# of gates + # inputs to gates)

Appendix B: (B.7 through B.9) Register File and Memory

Sequential Circuits (Memory): SR latch - know how it remembers (two stable

states, etc.), know how it changes states;

Gated/Clocked D latches. Master-slave D Flip Flop; their characteristic tables

Timing diagrams for latches and Flip Flops

Register file - design and usage

Square-memory implementation of large memories - understand (1) how the two level decoding of an address reduces the overhead for decoding, (2) how the tri-state buffers eliminate the need for MUXs, (3) how a single-port RAM memory and two-level decoding reduces the wires to the memory chip, (4) how burst/block transfers from memory is more efficient than multiple individual data transfers

Chapter 3.

Unsigned binary numbers

Conversion between base 10, base 2, and base 16

Addition and subtraction of unsigned numbers