Logo2
This website is not affiliated with Stanford.
FindCourse Search StarHot Courses Book_openMy Used Books TableMy Planner CartShopping List
Webauth Login
Log in with WebAuth to see who is in the course and view and write course reviews.
CS161 - Design and Analysis of Algorithms
Worst and average case analysis. Recurrences and asymptotics. Efficient algorithms for sorting, searching, and selection. Data structures: binary search trees, heaps, hash tables. Algorithm design techniques: divide-and-conquer, dynamic programming, greedy algorithms, amortized analysis, randomization. Algorithms for fundamental graph problems: minimum-cost spanning tree, connected components, topological sort, and shortest paths. Possible additional topics: network flow, string searching. Prerequisite: 103 or 103B; 109 or STATS 116. May be taken for 3 units by grad students. GERs: DB-EngrAppSci
Details
Page_worldCourse Website
Book_open1 Used Textbook
Book_addSell Your CS161 Book
Courserank_iconCourseRank Details
Offerings
Show/Hide Previous Offerings
2008-2009 Autumn
Sec Type Instructor Room Units Days Times
01 Lecture Serge Plotkin Gates B1 3-4 Tue Thu 11am-12:15pm SCPD Cart_addShop
2008-2009 Winter
Sec Type Instructor Room Units Days Times
01 Lecture Timothy Roughgarden 370-370 3-4 Tue Thu 11am-12:15pm Cart_addShop
2008-2009 Summer
Sec Type Instructor Room Units Days Times
01 Lecture Staff TBA 3-4 Mon Wed 9-10:50am Cart_addShop
Readings
2007-2008 Autumn
Sec Kind Books
01 Required Material(s) Cormen: Intro to Algorithms (w/CD) (2nd ed) $141.75
01 Recommended Material(s) Aho: Data Structures & Algorithms
01 Recommended Material(s) Kleinberg: Algorithm Design $106.50
2007-2008 Winter
Sec Kind Books
01 Required Material(s) Kleinberg: Algorithm Design $106.50
2008-2009 Autumn
Sec Kind Books
01 Required Material(s) Cormen: Intro to Algorithms (w/CD) (2nd ed) $148.00
01 Recommended Material(s) Aho: Data Structures & Algorithms
01 Recommended Material(s) Kleinberg: Algorithm Design $110.75
Wiki
Log in with WebAuth to view the Wiki.