Computer Science - CMPSC

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
130 / 149 Enrolled
Data Structures and Algorithms I
Daniel Lokshtanov 3.7
T R
11:00 AM - 12:15 PM
54.5% A
Image for ACM Leetcode Workshop Series
UCSB Association for Computing Machinery logo
UCSB Association for Computing Machinery
We are the largest computer science club at UCSB
Promoted

ACM Leetcode Workshop Series

Level up your Leetcode skill for SWE internship interview questions

Phelps Hall, Room 3526