CS 153 Computer Science III
Fundamental data structures: linked lists, stacks, queues. Introduction to binary search trees. Advanced sorting: quick and merge sorts. Study of a second programming language. Alternative implementations of linked lists. Basics of algorithmic analysis.
Credits
3
Prerequisite
Grade C- or better in
CS 152.