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.

Units: 3

Also Offered As: COMPSCI 270

Related Areas:

• Theory (THY)

Prerequisites: COMPSCI 170

Formats:
Spring: 3.0 hours of lecture and 1.0 hours of discussion per week
Fall: 3.0 hours of lecture and 1.0 hours of discussion per week

Grading Basis: Default Letter Grade; P/NP Option

Final Exam Status: No

---

Class Schedule (Fall 2026):
CS 270 – MoWe 15:30-16:59, The Gateway Building B1022 – Prasad Raghavendra

Links:

• EECS Course Archives (CalNet authentication required)
• CS enrollment policies
• EE enrollment policies
• HKN course maps