Differences

This shows you the differences between two versions of the page.

Link to this comparison view

public:teaching-eecs215-f11-lecture-schedule [2011/12/05 23:56]
athina
public:teaching-eecs215-f11-lecture-schedule [2014/04/02 18:22]
Line 1: Line 1:
-====== EECS 215: Design and Analysis of Algorithms, Fall 2011 ====== 
  
-{{page>​public:​teaching-eecs215-f11-nav&​nofooter&​noeditbtn}} 
- 
-<box rightBio>​ 
-<​html><​h1>​Lecture Schedule and Materials</​h1></​html>​ 
- 
-This tentative schedule will be updated throughout the quarter. ​ 
- 
-^ Week ^ Lecture ^  Date   ^ Topic  ^ Book Chapters ^ Slides ​ ^ Homeworks | 
-|  0  |  1  |  Thu 9/22   | course syllabus \\ Stable Matching | - \\ KT 1.1 | [[https://​eee.uci.edu/​11f/​18410/​slides/​01-syllabus.pdf|syllabus]] \\ [[https://​eee.uci.edu/​11f/​18410/​slides/​01-stable-matching.pdf|stable matching]], [[https://​eee.uci.edu/​11f/​18410/​slides/​01demo-propose-and-reject.ppt|demo]] | | 
-|  1  |  2  |  Tue 9/27  | representative problems \\ Algorithm Analysis | KT.1.2 \\ KT 2.1-2.4| [[https://​eee.uci.edu/​11f/​18410/​slides/​01-five-problems.pdf|5 problems]] \\ [[https://​eee.uci.edu/​11f/​18410/​slides/​02analysis.pdf|(ch.2) analysis]]| | 
-| ::: |  3  |  Thu 9/29  | Graphs: definitions,​\\ exploration (BFS)| KT 3.1-3.2 | [[https://​eee.uci.edu/​11f/​18410/​slides/​03graphs.pdf|Slides from Ch.3]]| | 
-|  2  |  4  |  Tue 10/4  | traversal, BFS, DFS | KT 3.2-3.4 |  | [[https://​eee.uci.edu/​11f/​18410/​hws/​hw1.pdf|HW1]] \\ (due 10/20) | 
-| ::: |  5  |  Thu 10/6  | directed graphs,\\ greedy algorithms | KT 3.5-3.6 \\ KT 4.1 | [[https://​eee.uci.edu/​11f/​18410/​slides/​|Slides from Ch.4]] |  | 
-|  3  |  -  |  Mon 10/10  | Python tutorial (optional) | | python {{:​public:​scripts.zip|scripts}},​ [[https://​eee.uci.edu/​11f/​18410/​hws/​maciej-slides.pdf|slides]] \\ [[https://​eee.uci.edu/​11f/​18410/​hws/​EECS215HomeworkSubmissionGuideline.pdf|electronic submission]]\\ [[http://​tinyurl.com/​eecs215guide|HW1 instructions]] ​  | | 
-| ::: |  6  |  Tue 10/11  | scheduling, \\ shortest paths| KT 4.1 \\ KT 4.4| | | 
-| ::: |  7  |  Thu 10/13  | shortest paths \\ MST| KT 4.4 \\ KT 4.5| | | 
-|  4  |  8  |  Tue 10/18  | MST, clustering \\ recursions | KT 4.5-4.7 \\ KT 5.1-5.2 | | | 
-| ::: |  9  |  Thu 10/20  | Divide and conquer| KT 5.1-5.3, 5.5| [[https://​eee.uci.edu/​11f/​18410/​slides/​05divide-and-conquer-all.pdf|Slides from Ch.5]] | [[https://​eee.uci.edu/​11f/​18410/​hws/​hw2.pdf|HW2]] \\ [[https://​eee.uci.edu/​11f/​18410/​hws/​hw1sol.pdf|HW1sol]] \\ [[https://​eee.uci.edu/​11f/​18410/​hws/​StableMatching.py|GS python]] | 
-|  5  |  10  |  Tue 10/25  | Dynamic Programing (DP) | 6.1,​6.2,​6.4| [[https://​eee.uci.edu/​11f/​18410/​slides/​dp-all.pdf|slides on DP]] | | 
-| ::: |  11  |  Thu 10/27  | **MIDTERM** | | | [[https://​eee.uci.edu/​11f/​18410/​hws/​midterm-f11-a.pdf|a]] ​ and [[https://​eee.uci.edu/​11f/​18410/​hws/​midterm-f11-b.pdf|b]] \\ [[https://​eee.uci.edu/​11f/​18410/​hws/​midterm-f11-a-solution.pdf|solution]] | 
-|  6  |  12  |  Tue 11/1  | DP continued | 6.6, 6.8| | | 
-| ::: |  13  |  Thu 11/3  | Shortest Paths revisited \\ Network Flow | 6.8-6.10\\ 7.1-7.2| [[https://​eee.uci.edu/​11f/​18410/​slides/​| all slides on shortest paths]]| [[https://​eee.uci.edu/​11f/​18410/​hws/​hw2sol.pdf|HW2sol]] | 
-|  7  |  14  |  Tue 11/8  | Finding Max Flow | 7.2-7.3 | [[https://​eee.uci.edu/​11f/​18410/​slides/​07maxflow-all.pdf|slides on network flow]]| ​ | 
-| ::: |  15  |  Thu 11/10  |Applications \\ of Max Flow | 7.5-7.7| | [[https://​eee.uci.edu/​11f/​18410/​hws/​hw3.pdf|HW3]]\\ due 11/22 | 
-|  8  |  16  |  Tue 11/15  | Reductions | 8.1-8.2 | [[https://​eee.uci.edu/​11f/​18410/​slides/​08np-part1.pdf|slides,​ Ch.8, Part 1]]| | 
-| ::: |  17  |  Thu 11/17  | NP, NP-complete| 8.3-8.4 | [[https://​eee.uci.edu/​11f/​18410/​slides/​08np-part2.pdf|slides,​ Ch.8, Part 2]]| | 
-|  9  |  18  |  Tue 11/22  | Well-known NP-complete problems| 8.5-8.8| [[https://​eee.uci.edu/​11f/​18410/​slides/​08np-part3.pdf|slides,​ Ch.8, part3]]| [[https://​eee.uci.edu/​11f/​18410/​hws/​hw3sol-enchanced.pdf|HW3sol]] \\ [[https://​eee.uci.edu/​11f/​18410/​hws/​hw4.pdf|HW4]] ​ | 
-| ::: |  -  |  Thu 11/24  | **THANKSGIVING** | | | | 
-|  10 |  19  |  Tue 11/29  | Beyond NP \\ NP-hardness in practice| 8.9, 9.1 \\ 10.1-10.2| [[https://​eee.uci.edu/​11f/​18410/​slides/​08beyond-np.pdf|slides "​beyond np"​]]\\ [[https://​eee.uci.edu/​11f/​18410/​slides/​10extending.pdf|special input]]| | 
-| ::: |  20  |  Thu 12/1  | Review | | [[https://​eee.uci.edu/​11f/​18410/​slides/​review.pdf|review slides]] |[[https://​eee.uci.edu/​11f/​18410/​hws/​final.pdf|sample final]], [[https://​eee.uci.edu/​11f/​18410/​hws/​hw4sol.pdf|HW4sol]]| 
-|  11 |  -  |  Tue 12/6 \\ 10:​30-12:​30 ​ | **FINAL EXAM** \\in the regular classroom! | | | | 
-</​box>​ 
- 
-(*) The instructor //may// be out of town those days. If that turns out to be the case, an alternative arrangement will be made (somebody else will give the lecture, or we will schedule a makeup session). By default (unless otherwise notified), the lectures will be given as scheduled.