COS 126 SCHEDULE SPRING 1999

Programs:
  Read assignments and do preliminary code before precept discussion.
  Due through electronic submisson by 11:59PM Wednesdays.

Precepts require preparation.
  Do the reading and attempt to solve the exercises *before* precept.

Exams:
  You may bring one 8.5" by 11" sheet of paper with handwritten notes on 
  it to exams, if you wish. Otherwise, exams are "closed book".  No calculators
  or other computational devices!
				   

        LECTURES  (TTh)              PRECEPTS (MF)          PROGRAMS (due W) 

------------------------------------------------------------------------------

WEEK 1
 2/1
 2/2     1. Introduction
 2/3                                                      P0. Hello, world
 2/4     2. C  
 2/5                                Hello, world/C

WEEK 2
 2/8                                functions/P1
 2/9     3. Unix
 2/10                                                     P1. Newton's method
 2/11    7. Data Types
 2/12                               Unix/structs

WEEK 3
 2/15                               arrays/P2
 2/16    8. Data Structures
 2/17                                                     P2. Mandelbrot
 2/18    9. Recursion 
 2/19                               linked lists

WEEK 4
 2/22                               ADT/P3
 2/23   10. Trees
 2/24                                                     P3. Rational ADT
 2/25   23. Algorithms/Complexity
 2/26                               algorithms

WEEK 5
 3/1                                P4
 3/2    11. Boolean Logic 
 3/3                                                      P4. Linked-list TSP 
 3/4    12. Sequential Circuits 
 3/5                                numbers, boolean logic

WEEK 6
 3/8                                architecture
 3/9    13. Machine Architecture
 3/10                                                    
 3/11   FIRST MIDTERM EXAM
 3/12                               [no precept F]

                              B     R     E     A     K












        LECTURES  (TTh)              PRECEPTS (MF)          PROGRAMS (due W) 

------------------------------------------------------------------------------

WEEK 7
 3/22                               PS/recursion/P5
 3/23   4. Machine Organization
 3/24                                                     P5. Recursive graphics
 3/25   5. Machine Language
 3/26                               TOY

WEEK 8
 3/29                               P5a
 3/30   14. Pattern Matching
 3/31                                                     P5a. Toy Simulator
 4/1    15. Finite State Automata
 4/2                                RE/FSA

WEEK 9
 4/5                                strings/P6
 4/6    16. Formal Languages
 4/7                                                      P6. Genetic code
 4/8    17. Computability
 4/9                                formal languages

WEEK 10
 4/12                               exam review
 4/13   24. NP-completeness
 4/14                                                     SECOND MIDTERM EXAM
 4/15   18. Systems Programming
 4/16                               exam postmortem

WEEK 11
 4/19                               BSTs/P7
 4/20   21. Java 
 4/21                                                     P7. Text index 
 4/22   22. Java Graphics 
 4/23                               java

WEEK 12                               
 4/26                               P8
 4/27   19. Operating Systems
 4/28                                                     P8. N-body
 4/29   25. Graphics
 4/30                               course review                          

READING PERIOD
 5/3                                none
 5/4    26. Perspective
 5/5                                                      [no program]
 5/6    none
 5/7                                none                        

 5/21  FINAL AT 1:30 in MCCOSH 10