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.

Course ID
111C
Department
Units
4
Requisites

PREREQ: CS 111B.

Transfer code
UC/CSU
Credit type
Credit/Degree Applicable
Lecture hours
Lec-70
Has field trips
0