Spring 2019
COMPSCI 270 001 - LEC 001
Combinatorial Algorithms and Data Structures
Current Enrollment
Total Open Seats:
0
Enrolled:
Waitlisted:
Capacity:
Waitlist Max:
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.
Other classes by Satish B Rao
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
Repeat Rules
Course is not repeatable for credit.
Reserved Seats
Current Enrollment
No Reserved Seats