CS310H Spring 2009 Schedule, Handouts, and Reading

 
Week
Date
Lec #
Topic 
Reading BEFORE this date 
Out
In
(Due)
1
1/21
L1
Course intro and overview
HW #1  

1/22
D1
Meet your TA, unix, binary/hex numbers      

1/23
L2 Computer system abstractions, digital vs. analog P&P 1, 2.1, 2.2; Maccabe 1.1, 1.2    
2
1/26
L3
 Transistors and how they work P&P 3.1
 

1/28
L4
Switch logic P&P 3.2; Maccabe 2.1 HW #2  

1/29
D2
Switches and simple circuits
   

1/30
L5
Boolean algebra and logic design     HW #1
3
2/2
L6
 Combinational logic circuits P&P 3.3; Maccabe 2.3
 

2/4
L7
More combinational logic circuits, basic storage P&P 3.4 HW #3  

2/5
D3
Practice in logic design
   

2/6
L8
D-latches, flip-flops, register files Maccabe 2.2, 2.4   HW #2
4
2/9
L9
Memory organization, sequential circuits/clocks P&P 3.5; Maccabe 3.1    

2/11
L10
State machines P&P 3.6 HW #4  

2/12
D4
State machine practice      

2/13
L11
Introduction to the LC-3 datapath, binary representations P&P 2.3-2.7; Maccabe: Chapter 7   HW #3
5
2/16
L12
Binary representations: integers, characters      

2/18
L13
Floating-point numbers Maccabe: Chapter 8    

2/19
D5
Binary representations      

2/20
L14
Floating-point operators, von Neumann machine models P&P Chapter 4   HW #4
6
2/23
L15
Exam review, von Neumann computation model      

2/25
E1
Midterm Exam #1   HW #5  

2/26
D6
Exam review      

2/27
L16
LC-3 ISA Overview P&P Chapter 5.1, 5.2    
7
3/2
L17
LC-3 Memory overview (load/store instructions) P&P 5.3, Maccabe 3.2    

3/4
L18
Addressing modes, branch instructions P&P 5.4-5.6 HW #6  

3/5
D7
Practice with LC-3 instruction set, conditional branches, loops      

3/6
L19
Instruction execution and RTL P&P Chapter 6   HW #5
8
3/9
L20
TRAP instruction, more RTL      

3/11
L21
Introduction to I/O P&P Chapter 8 HW #7  

3/12
D8
More details on I/O      

3/13
L22
The assembly process (two-pass) P&P Chapter 7   HW #6

3/16

Spring Break
   

3/18

Spring Break
   

3/19
  Spring Break
   

3/20

Spring Break
   
9
3/23
L23
2-pass assembly P&P Chapter 7    

3/25
L24
Linking and Loading P&P Chapter 9, Maccabe Chapter 10    

3/26
D9
Practice with assembly, linking, loading
   

3/27
L25
 Machine control register, TRAP, HALT
  HW #7
10
3/30
L26
Review      

4/1
E2
Midterm Exam #2   HW #8  

4/2
D10
Exam rehash      

4/3
L27
Introduction to C programming, data types P&P Chapter 10, 11, 12    
11
4/6
L28
Procedure calling protocols      

4/8
L29
The stack and activation records P&P Chapter 13, 14, Maccabe Chapter 6 HW #9  

4/9
D11
Procedure calling      

4/10
L30
Recursion and procedure calling optimizations     HW #8
12
4/13
L31
Pointers, memory allocation P&P Chapters 15-17, 19; skim chapter 18    

4/15
L32
The heap   HW #10  

4/16
D12
Dynamic memory management      

4/17
L33
Heap management and bookkeeping     HW #9
13
4/20
L34
LC-3 Control Logic - I P&P Appendix C    

4/22
L35
LC-3 Control Logic - II   HW #11  

4/23
D13
LC-3 Control logic practice      

4/24
L36
LC-3 Control Logic - III     HW #10
14
4/27
L37
LC-3 Interrupts P&P Chapter 10    

4/29
E3
Midterm Exam #3      

4/30
D14
Exam review      

5/1
L38
Timer interrupts, memory hierarchies Maccabe 11.3, 12.2, 12.3    
15
5/4
L39
New ISAs and paper discussion "Scaling to the EDGE of Silicon," by Burger, Keckler, et al.    

5/6
L40
x86 ISA and paper discussion P&P Appendix B, "This History of the Microcomputer - Invention and Evolution," by Mazor    

5/7
D15
Final exam review      

5/8
L41
Course wrap-up and cookies     HW #11
17
5/14
FE
Final Exam - Thursday May 14, 2-5pm, Location WAG 420      

Last modified: 04/29/09
Steve Keckler, skeckler@cs.utexas.edu