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.
Nabeel Nasir
4.9