Computer Science 126

Fall 1997
  • Announcements
  • General Information
  • Programming Assignments
  • Reading and Exercises
  • Lectures
  • Help!

    • Lectures

    The following list of the lectures has links to the .ps files that were used to make slides (no pictures). Paper copies of the lecture notes (with all the pictures) are available at Pequod Copy, 6 Nassau Street. Follow this link to all the lecture notes in ASCII for the quickest route to the information in the lectures (no pictures).
    1. Introduction9/11
    2. Introduction to C9/16
    3. UNIX9/18
    4. TOY machine9/23
    5. TOY programming9/25
    6. TOY simulator9/30
    7. Data structures and types10/2
    8. WAR example10/7
    9. Recursion10/9
    10. Trees10/14
    11. Boolean logic10/16
    12. Sequential circuits10/21
    13. Computer architecture10/23
    14. Pattern Matching11/4
    15. Finite state automata11/6
    16. Formal languages11/11
    17. Turing machines11/13
    18. Systems programming11/18
    19. Systems programming11/20
    20. Applications11/25
    21. Java12/2
    22. Java applets and libraries12/4
    23. Algorithm design/analysis12/9
    24. NP-completeness12/11
    25. Review (no new slides)1/6
    26. History1/8

    Any significant changes or corrections to the slides will be noted in the course announcements. You are responsible for the information in the (most up to date) electronic versions. Feel free to look ahead at any future lectures that appear online, but those are subject to being completely changed.

    Copyright © 1997, Robert Sedgewick