/undefined/notes/CS136
notes
CS136 Elementary Algorithm Design and Data Abstraction

Spring 2017

This course builds on the techniques and patterns learned in CS 135 while making the transition to use 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.

Prereqs: At least 90% in CS115 or at least 70% in CS116 or at least 60% in CS135 or CS145.