CRN
35086
Term
Spring 2026
Course
110C
Section
861
Catalog Description
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.
Section Notes
THIS SECTION HAS AN ON-CAMPUS FINAL EXAM! Students will have two options for final exam day/time: Friday 5/15 10:30am - 12:30pm and Monday 5/18 10:30am - 12:30pm (room TBD). This is otherwise an asynchronous online section with no in-person or virtual meetings. For more information, please visit the instructor's website.

This section runs for the whole semester. 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 110B.


Requisites

PREREQ: CS 110B

Learning Outcomes