CS201 Section 1 FINAL EXAM

When/where: 
  Monday, Mar. 13, 7:30-9:20pm, usual classroom.

What you can bring:
  One 8.5"x11" sheet with anything you want written or typeset on 
    one side (only) of it.
  Scientific calculator (recommended)

What you should not bring:
  Textbook
  Notes (except the one sheet)
  Magnifying glass

What to review:

  The exam will be comprehensive over the entire term, but the emphasis will be
  on material presented since the midterm.

  All lectures, especially those since the midterm

  Textbook Ch 1 (entire)
              2.1, 2.2 (except 2.2.4), 2.3.1-6, 2.4
              3.1-3,3.5
              4 (entire)
              5 (entire)
              6.1.1-5
	      7.1,7.3-4
              8.1
           App B

  Homeworks 1-9 and their solutions

  Labs 1-4 and their solutions

  SPARC instruction set 
  IJVM instruction set and Mic-1 microarchitecture and microcode
     (no need to memorize details, but be familiar with them)


Topics (in addition to those on the midterm):
  (This list is not necessarily exhaustive. Anything in the above list of
   "what to review" is fair game for the exam.  But if you understand what
   each of these topics means and can explain and/or apply it, you should
   be in good shape.)
    
  I/O programming methods  
  Interrupts
  Direct memory access (DMA)
  Traps
  Logic gates: AND,OR,NOT,NAND,NOR,XOR and their symbols
  Truth tables
  Boolean algebra and laws
  Sum of products representation  
  Combinational vs. sequential circuits
  Simple combinational circuits: multiplexers, decoders
  Arithmetic-logic unit (ALU)
  Adders: ripple-carry and carry-lookahead
  Integer multiply circuits
  Floating point representation and operations
  Clocks 
  Microarchitectures
  Data path
  Control logic
  Microinstructions
  Microinstruction control
  Finite state machines
  Stack machines
  Instruction fetch unit (IFU)
  Pipelining
  Stalls
  Latches and flip-flops
  Registers
  Memory chips
  Memory addressing
  RAM, DRAM, SRAM, ROM
  Caches; hits; misses
  Direct-mapped cache
  Set-associative cache
  Least-recently used (LRU)
  Branch prediction
  Memory hierarchy 
  Secondary memory
  Disks: tracks, sectors, cylinders 
  Disk performance: seek, rotational latency, peak transfer rate
  Virtual memory
  Paging
  Virtual vs. physical address space
  Memory managment unit (MMU)
  Working set
  Multiprocessor
  Multicomputer
  Parallel speedup  
  Scalability