HomeInformationLecturesProblem SetsLinks |
Course News:
Textbook:
Computer Organization & Design, 3rd Edition, by Patterson & Hennessy.
We will begin using this text on our 4th class meeting (9/5/06). 
Course Staff:
Problem sets will be distributed on Wednesdays and are due back on the following Wednesday (before lecture). You will have at least one week to complete each set. Late problem sets will not be accepted, but the lowest two problem-set scores will be dropped. No homeworks will be due on the week of a quiz. I will attempt to put lecture notes, problem sets, and other course materials online before class. Bring your laptop if you want to follow along. Lecture Slides:
Lecture 1: Introduction & Information Theory
Lecture 2: Computer Technology and Abstraction Lecture 3: Representing Information Lecture 4: A Simple Instruction Set Lecture 5: Addressing Modes Lecture 6: Writing in Assembly Sum Example Sum Array Example Fibonacci Example Lecture 7: Stacks and Procedures Lecture 8: Assemblers and Compilers The first quiz will cover Lectures 1-8. Lecture 9: Transistors and Logic Lecture 10: Arithmetic Circuits Lecture 11: Multiplication Lecture 12: Floating Point Lecture 13: Memory Lecture 14: Sequential Logic Lecture 15: Programmable Machines Lecture 16: Building a Computer The second quiz will cover Lectures 9-16. Lecture 17: CPU Performance Lecture 18: Basic Pipelining Lecture 19: Pipelining a CPU Lecture 20: Pipelining Hazards Lecture 21: Memory Hierarchy Lecture 22: Caches Lecture 23: Virtual Memory Lecture 24: Operating System Concepts Lecture 25: Multiprocessors and Parallel Computers & Final Words Problem Sets:
Course Related Links:
|
