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: CMPSC 40 or MATH 8 with a grade of C or better; CMPSC 24 or CMPSC 25 with a grade of C or better; PSTAT 120A or ECE 139 (may be taken concurrently with CMPSC 130A); open to Computer Science Department majors, and Electrical and Computer Engineering Department majors only.

CMPSC 130A

25 / 150 Enrolled

Data Structures and Algorithms I

Ambuj Singh 2.4

T R

14:00 PM - 15:15 PM

53.1% A