Spring 2021
COMPSCI 270 001 - LEC 001
Combinatorial Algorithms and Data Structures
Prasad Raghavendra
Jan 19, 2021 - May 07, 2021
Mo, We
05:00 pm - 06:29 pm
Internet/Online
Class #:30274
Units: 3
Instruction Mode:
Pending Review
Offered through
Electrical Engineering and Computer Sciences
Current Enrollment
Total Open Seats:
16
Enrolled: 64
Waitlisted: 0
Capacity: 80
Waitlist Max: 20
No Reserved Seats
Hours & Workload
3 hours of instructor presentation of course materials per week, 5 hours of outside work hours per week, and 1 hours of the exchange of opinions or questions on course material per week.
Course Catalog Description
Design and analysis of efficient algorithms for combinatorial problems. Network flow theory, matching theory, matroid theory; augmenting-path algorithms; branch-and-bound algorithms; data structure techniques for efficient implementation of combinatorial algorithms; analysis of data structures; applications of data structure techniques to sorting, searching, and geometric problems.
Rules & Requirements
Requisites
- Students not in the Master of Engineering Program
Repeat Rules
Course is not repeatable for credit.
Reserved Seats
Current Enrollment
No Reserved Seats
Textbooks & Materials
See class syllabus or https://calstudentstore.berkeley.edu/textbooks for the most current information.
Guide to Open, Free, & Affordable Course Materials