CPS 104, Fall 2008, Lectures

Note: These lectures are provided as a courtesy. They are subject to change any time.

Monday Wednesday
 8/25
Introduction; Data representations
Reading: Ch. 1, Ch. 3.1-.3, 3.8
slides: Lecture 1 		8/27
Data Representation 
slides: Lecture 2
9/1
Data Representations;
Reading Ch. 3
slides:   		9/3
Memory; Data structures; Bitwise Ops; ISA
Ch. 3,  Appendix A
slides:
9/8
Data structures; Bitwise Ops; ISA
Ch. 3,  Appendix A
slides: 		9/10
ISA; MIPS 2000 ISA; Assembly programming; 
Ch. 3,  Appendix A
slides:
9/15
MIPS 2000 ISA;
Ch. 2, Appendix A
slides:		 9/17
Assembly programming; The SPIM simulator
Appendix A, Ch. 2
slides:
9/22
Mips Assembler;
Appendix A, Ch. 2
slides: 

9/24
Functions and Methods
Appendix A, Ch. 2
slides:

9/29
Functions and Methods:
Appendix B Ch. 4
slides:  		10/1
Boolean Algebra, Basic Logic design ; Logic Gates ;
Appendix B, Ch. 4
Slides:
10/6

Midterm Exam

 10/8
Basic Logic design ; Logic Gates ;The ALU,
Ch, 4
Slides:
10/13

Fall Break 		10/15
Memory Elements, Busses, Registers  
Ch. 4
slides:
10/20
Building A Single Cycle Datapath
Ch 5.
slides:		 10/22
A Single cycle data path
Ch.5.4
Slides: 
10/27
Control for a single cycle processor;
Ch. 5
Slides:
 		 10/29
Memory Systems
Ch. 7
Slides:
11/3
Cache Memory 
Ch. 7
Slides:

11/5
Cache Memory 
Ch. 7.4
Slides:

11/10
Cache Performance;
Ch. 7.4, Ch. 8
Slides:

11/12
Virtual Memory
Ch. 8
Slides:
11/17
Virtual Memory; Input/Output,
Ch. 8
Slides: 		11/22
Input/Output, Buses 
Ch. 8
Slides: 
11/24
I/O Busses,
Ch. 8
slides:  		11/27

Thanksgiving Break
12/1
Iterrupts & Exceptions
Ch. 6, Ch. 9
slides:  		12/3

Q&A on Computer Architecture