The analysis and design of computer algorithms and their underlying data structures. Analysis of the timing and efficiency of algorithms. Study of lists, stacks, queues, trees, backtracking, searching, sorting and recursion. Introduction to graphs, hash tables, heaps, priority queues and direct access files. Further study of abstract data types and object-oriented programming.
This is an asynchronous online section. There are NO in-person meetings and NO virtual meetings. For more information, please visit the .
This section is a late-start section that runs for 16 weeks. It is NOT self-paced. It requires the use of Canvas and an internet-enabled device.
This section is part of CityOnline. For more information about CityOnline, please visit the CityOnline website.
The analysis and design of computer algorithms and their underlying data structures. Analysis of the timing and efficiency of algorithms. Study of lists, stacks, queues, trees, backtracking, searching, sorting and recursion. Introduction to graphs, hash tables, heaps, priority queues and direct access files. Further study of abstract data types and object-oriented programming.
PREREQ: CS 111B.