CMPSC 130A - Data Structures and Algorithms I

Data structures and applications with proofs of correctness and analysis. Hash Tables, Priority Queues (heaps); Balanced Search Trees. Graph Traversal techniques and their applications.

Prerequisites: Pre-requisites: CMPSC 40 or MATH 8 with a grade of C or better; CMPSC 24 or CMPSC 9 with a grade of C or better; PSTAT 120A or ECE 139 (may be taken concurrently with CMPSC 130A); open to computer science, computer engineering, and electrical engineering majors only.

CMPSC 130A

0 / 150 Enrolled

Data Structures and Algorithms I

Ambuj Singh 2.4

T R

11:00 AM - 12:15 PM

41.1% A