Offered Every Semester
Course Units: 1
A second course in computer science in which students learn how the algorithms and structures studied in CSC 220 are implemented. Classic data structures (lists, queues, stacks, trees, and hash tables) and algorithms (searching and sorting) are considered. The analysis of implementation techniques is addressed by studying the trade-offs between static and dynamic structures. A second object-oriented programming language is introduced. A C++ test is required for students approved to transfer an equivalent course in which C++ was not covered.
Prerequisite notes: CSC 220 with a grade of C or higher
Required for major/minor: Computer Science Major, Computer Science Minor
Option for major/minor: None