|
|
|
Lecture and Precept Topics |
Reading and Exercises |
|
| Sep. |
12 |
|
Introduction |
DD 1 |
|
13 |
|
UNIX, The Web, Hello World! Meets in CS 101 |
HH 1-4 |
|
|
|
Note: The 9/13 and 9/16 precepts are identical, so
you can attend one or both. |
|
|
16 |
|
UNIX, The Web, Hello World! Meets in CS 101 |
HH 5, 8, 15, 23Exercise Set 1 |
|
17 |
|
An Introduction to C |
DD 2, 3.1-10 |
|
19 |
|
More About C |
DD 3.11-12, 9.1-6, 9.10-11, 10.9 |
|
20 |
|
Expressions and Statements |
HH 10, 11DD
Self-Review pp. 46-48, Exercise Set 2 |
|
|
23 |
|
The Ins and Outs of Loops |
HH 24-26DD
Self-Review pp. 87-89 |
|
24 |
|
Functions and Modules |
DD 5.1-12, 14.5-6 |
|
26 |
|
Arrays |
DD 6.1-7, 6.9 |
|
27 |
|
Scoping out Lifetimes |
DD Self-Review pp. 189-191 |
|
|
30 |
|
Please pass the Arrays |
DD Self-Review pp. 244-245 |
| Oct. |
1 |
|
Strings |
DD 8.1-3, 8.5-7, 14.4 |
|
3 |
|
The TOY Machine |
DD Appendix E, pp. 305-310 |
|
4 |
|
Strings galore |
DD Self-Review pp. 354-355Exercise Set 3 |
|
|
7 |
|
Bits, Bytes, and Words |
DD Self-Review pp. 903-904 |
|
8 |
|
TOY Instructions |
DD 10.9 |
|
10 |
|
Branches and Loops |
|
|
|
|
7:00-8:30 PM: First
Midterm Exam, McCosh 50Solutions |
|
11 |
|
Midterm recap; TOY |
|
|
|
14 |
|
Implementing Functions |
|
|
15 |
|
Recursion |
DD 5.13-15, 6.8 |
|
17 |
|
Quicksort |
DD 6.6 |
|
18 |
|
Recursion and Sorting |
Exercise Set 4 |
|
|
21 |
|
Postscript |
COS 111
Postscript
"cheatsheet" |
|
22 |
|
Pointers |
DD 7.1-4, 7.6-10 |
|
24 |
|
Structures |
DD 10.1-7 |
|
25 |
|
Pointers |
DD Self-Review pp. 299-301Exercise Set 5 |
|
|
28 |
|
No precept Fall
recess |
|
|
29 |
|
No lectureFall
recess |
|
|
31 |
|
No lectureFall
recess |
|
| Nov. |
1 |
|
No preceptFall
recess |
|
|
|
4 |
|
Structures |
DD Self-Review pp. 423-425 |
|
5 |
|
Dynamic Memory Allocation |
DD 7.6, 12.3, 14.11, emalloc.c,
strsave.c |
|
7 |
|
Dynamic Data Structures |
DD 12.1-6 |
|
8 |
|
malloc and Friends |
DD Self-Review pp. 498-499Exercise Set 6 |
|
|
11 |
|
Linked Lists |
|
|
12 |
|
Writing Efficient Programs |
DD 12.7 |
|
14 |
|
Analysis of Algorithms |
|
|
15 |
|
Binary Search Trees |
|
|
|
18 |
|
More Trees |
|
|
19 |
|
Elementary Systems Programming |
DD 1.11, 13 |
|
21 |
|
Compilers |
|
|
|
|
7:00-8:30 PM: Second
Midterm Exam, McCosh 50Solutions |
|
22 |
|
Grammars and Languages |
Exercise Set 7 |
|
|
25 |
|
Midterm recap; Compilers and Interpreters |
Exercise Set 8 |
|
26 |
|
Operating Systems |
DD 11.1-5 |
|
28 |
|
No lectureThanksgiving
recess |
|
|
29 |
|
No preceptThanksgiving
recess |
|
|
| Dec. |
2 |
|
Virtual memory |
Exercise Set 9 |
|
3 |
|
Regular Expressions |
|
|
5 |
|
Hard Problems |
|
|
6 |
|
File systems; Reading Files |
efopen.c |
|
|
9 |
|
Regular languages and egrep |
Exercise Set 10 |
|
10 |
|
Viruses and Secret Messages |
|
|
12 |
|
Catch-up; course evaluation |
|
|
13 |
|
Wrap-up and Review |
|
|
| Jan. |
20 |
|
Monday, 8:30-11:30 AM:
Final Exam, McCosh 50Solutions |