CS270

Combinatorial Algorithms and Data Structures

Fall 2024


Assessment Homeworks Notes and Handouts Ed Stem

Homework

Lecture slides.

Notes. References.

Course Outline

This course will focus on algorithms and the mathematics behind them. It will touch upon combinatorial algorithms, optimization, statistical algorithms, and a variety of other things. Beauty is key. Trying to get to what is really happening is key, and beauty. Perhaps they are the same thing.


Course Staff


Satish Rao (satishr@cs.berkeley.edu)

Scheduling

The class meets on Tuesdays and Thursdays 11:00-12:30 in 306 Soda.

Assessment

Still working it out. Apologies. Lots of student interest and no TA, so I am working out assessment. It will likely involve some homework, maybe some service work (scribe notes), and an exam. There are no resources for grading projects, so there will likely be no project. The material may be difficult. That being said, an A should be achievable with reasonable effort. There is a background homework that is partially to allow you to brush up on some skills. Please bear with me.