Description:
A second course in computer science for computer science majors in which students learn how the algorithms and structures studied in CSC 220 are implemented on a sequential machine. Classic data structures (lists, queues, stacks, trees, and tables) and algorithms (searching and sorting) are considered, but the emphasis is on analysis. First, analysis of implementation techniques is addressed by studying the trade-offs between static and dynamic structures. Second, analysis of complexity of algorithms is studied informally and then using formal proof techniques. The implementation of the object-oriented paradigm is also shown via Java.

Option for major/minor:
None