CS 136: Elementary Algorithm Design and Data Abstraction, Fall 2021


This is the homepage for CS 136 (Fall 2021).

This course builds on the techniques and patterns learned in CS 135 while making the transition to use of an imperative language. It introduces the design and analysis of algorithms, the management of information, and the programming mechanisms and methodologies required in implementations.

Topics discussed include iterative and recursive sorting algorithms; lists, stacks, queues, trees, and their application; abstract data types and their implementations.

You can find the handbook description of the course here.

Major Announcements

All announcements will be made through Piazza.

Week-One Guide

Here is a checklist of things you should do in the first week of CS 136:

Weekly Guide

With the exceptions of midterm week and Holiday-weeks, each week in CS 136 will follow a similar structure. Make sure that you do not miss any due dates:

  • Tuesdays: For students who selected the blended course option, this week's Tutorial will be held from 11:30-12:50 in MC 2066.
  • Tuesdays: This week's Self-Check Quiz is due.
  • Fridays: This week's Assignment is due.
  • Fridays: New Course Notes, a new Assignment and a new Self-Check Quiz are released. Make sure to start working through the course notes soon since the corresponding quiz is due on the following Tuesday.

Throughout the week there will be:

Last modified on Tuesday, 07 September 2021, at 13:48.