Midterm 1 Review

Tom Kelliher, CS 240

Mar. 8, 1999

Administrivia

Announcements

Midterm Wednesday. Class Friday.

From now on, assigned readings will be classified as covered material or background material. At the beginning of the next class I will ask for questions on the background material. Other than answering those questions, we will not discuss the background material in class.

You are responsible for reading the background material before class.

Assignment

For next Friday.

Background material: Section 5.1 minus An Overview of the Implementation.

Covered material: An Overview of the Implementation, Section 5.2.

From Last Time

Homework

Outline

1. Midterm Review.

Coming Up

Bicycle light.

Midterm Review

Four problems.

Open book. Study as if closed book.

1. Instruction set design. Design principles:
   1. Simplicity favors regularity.

   2. Smaller is faster.

   3. Good design demands good compromises.

   4. Make the common case fast.

   Classes of instructions.

   Instruction formats.

   Various types of branches and why we have them.

   Registers and their use.

   Load/store and memory addressing. Word addressing vs. byte addressing. Effective address.

2. Number representation.

   Unsigned, sign-magnitude, one's complement, two's complement. Ranges, symmetry, etc.

   Why one's complement is called one's complement. This generalizes to the 's and b's complement in radix b number systems. Computation of the complements. Example: decimal system.

   Powers of two, hexadecimal number system, converting between hex and binary.

3. Arithmetic

   Addition. Use of same adder for signed and unsigned operations.

   Sign extension.

   Overflow.

   Logical operations. Bitwise operations and masks. Shifts and rotates. The two right shifts.

   Carry lookahead. Addition reduces to carry generation. Equations for p, g, carry-out, P, G, PP, and GG.

4. Combinational logic design.

   NOT, OR, AND, and XOR.

   Realizing SOP equations and counting delays.

   Truth tables and minterms.