CS43A - Algorithms & Analysis

Credits: 4

Pre-requisites: CS42A - Data Structures

Description: Design of efficient data structures and algorithms. Analysis of algorithms and asymptotic time complexity. Graph, string, and geometric algorithms.

Learning Objectives:

Content:

Assessment:

Students are required to pass both components.

Texts:

Lecturer:

Daniel Coore, Ph:D. (MIT), Lecturer, Department of Mathematics and Computer Science, University of the West Indies, Mona.