User Tools
courses:alg2012:main
Differences
This shows you the differences between two versions of the page.
|
courses:alg2012:main [2012/04/13 22:38] tsay |
courses:alg2012:main [2013/04/09 13:58] (current) tsay |
||
|---|---|---|---|
| Line 3: | Line 3: | ||
| =====Announcements===== | =====Announcements===== | ||
| - | * 04/13: old exams: {{courses:alg:old_exams.zip|1996-2011}}. | + | * 07/04: grade report available (updated 07/09); please send inquiries, if any, to the instructor by 2PM July 07. |
| + | * 06/11: slides for Reduction and a note on NP-Completeness available. | ||
| + | * 06/11: slides from TA sessions: {{courses:alg2012:hw6slides.pptx|HW#6}}, {{courses:alg2012:hw7slides.pptx|HW#7}}, {{courses:alg2012:hw8slides.pptx|HW#8}}, {{courses:alg2012:hw9slides.pptx|HW#9}}. | ||
| + | * 06/04: slides for NP-Completeness available. | ||
| + | * 05/28: {{courses:alg2012:hw10.pdf|HW#10}} due on June 11. | ||
| + | * 05/28: slides for Dynamic Programming available. | ||
| + | * 05/14: {{courses:alg2012:hw9.pdf|HW#9}} due on May 28. | ||
| + | * 05/14: slides for Advanced Graph Algorithms available. | ||
| + | * 05/14: {{courses:alg2012:hw8.pdf|HW#8}} due on May 21. | ||
| + | * 05/02: {{courses:alg2012:alg2012mid_s.pdf|Suggested Solutions to Midterm Problems}} available (revised on 05/06). | ||
| + | * 04/30: {{courses:alg2012:hw7.pdf|HW#7}} due on May 7. | ||
| + | * 04/23: slides for String Processing and Basic Graph Algorithms available. | ||
| + | * 04/13: old exams: 1996-2011. | ||
| * 04/13: slides from TA sessions: {{courses:alg2012:hw1slides.pptx|HW#1}}, {{courses:alg2012:hw2slides.pptx|HW#2}}, {{courses:alg2012:hw3slides.pptx|HW#3}}, {{courses:alg2012:hw4slides.pptx|HW#4}}. | * 04/13: slides from TA sessions: {{courses:alg2012:hw1slides.pptx|HW#1}}, {{courses:alg2012:hw2slides.pptx|HW#2}}, {{courses:alg2012:hw3slides.pptx|HW#3}}, {{courses:alg2012:hw4slides.pptx|HW#4}}. | ||
| * 03/26: reminder: TA session on Apr. 9, 1:20-2:10PM. | * 03/26: reminder: TA session on Apr. 9, 1:20-2:10PM. | ||
| Line 60: | Line 72: | ||
| =====References===== | =====References===== | ||
| + | * [[http://en.wikipedia.org/wiki/Mathematical_induction|Mathematical Induction]] (a Wikipedia page) | ||
| * [[http://dl.acm.org/citation.cfm?id=2093549&CFID=70582427&CFTOKEN=84470362|What is an Algorithm?]] (M.Y. Vardi, Communications of the ACM, Volume 55 Issue 3, March 2012) | * [[http://dl.acm.org/citation.cfm?id=2093549&CFID=70582427&CFTOKEN=84470362|What is an Algorithm?]] (M.Y. Vardi, Communications of the ACM, Volume 55 Issue 3, March 2012) | ||
| * MIT OpenCourseWare: [[http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-spring-2008/|Introduction to Algorithms]] | * MIT OpenCourseWare: [[http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-spring-2008/|Introduction to Algorithms]] | ||
courses/alg2012/main.1334327895.txt.gz · Last modified: 2012/04/13 22:38 by tsay
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
