CS 136: Elementary Algorithm Design and Data Abstraction

• Home
• Course Outline
• Software

Home

This is the homepage for CS 136.

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.

The course is delivered through UW Online. See the Software page for details of how to access our course.