Introduction to Algorithms and Complexity
Fall 2020
Week 9 Announcements
HW6 has been assigned and is due Monday 12/07 at 9 am Pacific Time. The end is in sight! The final is coming up, Wednesday December 16, 2020 from 8am-11am PST.
Course Information
- Lecture: Mondays and Wednesdays, 10:00am-Noon PST. Link Here
- Discussion: Fridays, 10:00am-Noon PST. Link Here
- Office Hourse: Saturdays,4-6pm PST Link Here
Description
Designed for junior/senior Computer Science majors. This course offers a comprehensive introduction to the design and analysis of algorithms.
Sections
- Overview of design techniques
- Divide-and-conquer
- Greedy methods
- Dynamic programming
- Selection of prototypical algorithms
- Choice of data structures and representations
- Complexity measures: time, space, upper, lower bounds, asymptotic complexity
- NP-completeness