CS 136: Elementary Algorithm Design and Data Abstraction

• Announcements / Home
• Assignments
  • Postmortems
  • Solutions Request
• Calendar
• Exams
• Handouts
  • Errata
• Marks
• Piazza
  • Piazza Help
• Personnel
  • Office Hours
• Resources & Links
• Software
• Textbooks
• Tutorials

---

• CS Advising FAQ

Handouts

Below you will find lecture slides, some example code (generally from the lecture), and other handouts prepared as necessary. Handouts will be posted during the term as they are ready. Assignments can be found on the Assignments page.

Please do not regard the slides as the complete material presented in lectures. You are expected to attend lectures, where additional material may be presented. The lecture slides below are in PDF format. You may need to get reader software to view and print them. Lecture code is provided as a courtesy only, and roughly corresponds to what is presented in class.

Lecture Materials

• Module 01 – Side-effects, mutation, encapsulation: 1-up, 2-up, 4-up (Updated on May 14); Lecture code
• Module 02 – Separation of Concerns, abstraction: 1-up, 2-up, 4up (Updated on May 14); Lecture code
• Module 03 – Introduction to C 1-up, 2-up, 4-up; Lecture code