CS 2733/2731
Computer Organization II -- Fall 2002
Review for Exam 1 (11 October 2002)
- Overview (Chapter 1)
- Nothing directly asked about this, just for orientation.
- Skip Chapter 2.
- ints (4.1, 4.2)
- Conversions between binary, decimal, hexadecimal
- Integers: 2s complement for negative numbers
- -13: write 13 in binary, complement, add 1
- doubles (4.8)
- Conversions between scientific notation and internal
bit representation of a double, using
the IEEE standard.
- MIPS Assembly Language (Chapter 3, 4.4)
- Format, constants in hex or decimal, comments following #
- Registers, 32: $0-$31, with symbolic names
- Basic instructions
- Arithmetic (add, sub, and, or)
- Arithmetic immediate (addi, ori)
- Load/Store (lw, sw) --
uses offset in bytes to form an address
- Load address (pseudo: la, uses lui
and ori)
- Branches
- bne, beq (offset in words from PC)
- slt
- all other branches are pseudo instructions
- Jumps
- j, jal (absolute addr in words)
- jr (jump to address in a register)
- Pseudo-instructions, and simulating them with real instructions:
li, move, la,
blt, mul, b)
- Coding loops
- Arrays, and their access (in memory, must use lw
or sw.
- Functions and function calls (use jal to call
and jr $ra to return.
- Parameters to functions ($a0 - $a3),
returned values ($v0), or on the stack.
- Use of the stack: local variables, local (automatic) arrays,
values saved
- Recursion [example in class, but since the recursion lab is
not complete, there won't be questions about recursion]
- Logical instructions (shifts, and, or, etc.)
- The assembly process
- MIPS Machine Language (Chapter 3)
- Basic types
- R-type (register), usually 3 registers (arithmetic, logical,
slt, jr)
- I-type (immediate), lw, sw,
beq, bne, addi,
lui)
- J-type (jump), j, jal
- Hand conversion of machine language into assembly (dis-assembly)
[Not emphasized, since this is in Lab 8]
- Hand conversion of assembly into machine language (assembly)
[Not emphasized, since this is in Lab 8]
- Construction of NAND, NOR, NOT, AND, OR gates from CMOS transistors
- Combinational Logic (B.1, B.2, B.3)
- Truth tables, boolean algebra, logic equations
- AND, OR and NOT gates
- Combinational logic
- Decoders
- Multiplexors
- Creating a logic circuit to represent an arbitrary
truth table. (Skip PLAs and Don't Cares)
Revision date: 2002-10-09.
(Please use ISO 8601,
the International Standard Date and Time Notation.)