Computer Science 126

Spring 1998
  • 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. Introduction2/3
    2. Introduction to C2/5
    3. UNIX2/10
    4. TOY machine2/12
    5. TOY programming2/17
    6. TOY simulator2/19
    7. Data structures and types2/24
    8. WAR example2/26
    9. Recursion3/3
    11. Boolean logic3/5
    12. Sequential circuits3/10
    13. Computer architecture3/12
    14. Pattern Matching3/24
    15. Finite state automata3/26
    16. Formal languages3/31
    17. Turing machines4/2
    10. Trees4/7
    18. Systems programming4/9
    19. Systems programming4/14
    20. Applications4/16
    21. Java4/21
    22. Java applets and libraries4/23
    23. Algorithm design/analysis4/28
    24. NP-completeness4/30
    25. Review (no new slides)5/5
    26. History5/7

    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 © 1998, Robert Sedgewick