Yih-Kuen Tsay's Wiki @ IM.NTU

This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.
======Algorithms, Spring 2013======
The goal of this course is to acquaint the students with basic computer
algorithms and their design principles and to cultivate the students' ability
in designing and analyzing algorithms independently.
=====Announcements=====
  * 07/03: grade report available; please send inquiries, if any, to the instructor by 2PM July 05.
  * 06/14: slides from TA sessions: {{courses:alg2013:hw6slides.pptx|HW#6}}, {{courses:alg2013:hw7slides.pptx|HW#7}},  {{courses:alg2013:hw8slides.pptx|HW#8}},  {{courses:alg2013:hw9slides.pptx|HW#9}}.
  * 06/03: notes/slides for NP-Completeness available.
  * 05/29: reminder: there will be a TA session on 06/04.
  * 05/28: {{courses:alg2013:hw10.pdf|HW#10}} due on 06/11.
  * 05/27: notes/slides for Dynamic Programming and for Reduction available.
  * 05/21: {{courses:alg2013:hw9.pdf|HW#9}} due on 05/28.
  * 05/14: reminder: there will be a TA session on 05/21.
  * 05/07: {{courses:alg2013:alg2013mid_s.pdf|Suggested Solutions to Midterm Problems}} available.
  * 05/06: {{courses:alg2013:hw8.pdf|HW#8}} due on 05/14.
  * 05/05: notes/slides for Advanced Graph Algorithms available.
  * 04/29: notes/slides for Basic Graph Algorithms available.
  * 04/22: {{courses:alg2013:hw7.pdf|HW#7}} due on 04/30.
  * 04/22: notes/slides for String Processing available.
  * 04/09: slides from TA sessions: {{courses:alg2013:hw1slides.pptx|HW#1}}, {{courses:alg2013:hw2slides.pptx|HW#2}},  {{courses:alg2013:hw3slides.pptx|HW#3}},  {{courses:alg2013:hw4slides.pptx|HW#4}}.
  * 04/09: {{courses:alg:old_exams.zip|old exams}}.
  * 04/01: problem statement of 5.8 in {{courses:alg2013:hw4.pdf|HW#4}} corrected.
  * 03/27: reminder: there will be a TA session on 04/09.
  * 03/26: {{courses:alg2013:hw6.pdf|HW#6}} due on 04/16.
  * 03/26: {{courses:alg2013:hw5.pdf|HW#5}} due on 04/09.
  * 03/25: notes/slides for Searching and Sorting available.
  * 03/19: {{courses:alg2013:hw4.pdf|HW#4}} due on 04/02.
  * 03/19: notes/slides for Data Structures (A Supplement) available.
  * 03/12: {{courses:alg2013:hw3.pdf|HW#3}} due on 03/19.
  * 03/11: notes/slides for Design by Induction available.
  * 03/11: an appendix on Solving a Recurrence Relation with Generating Functions available.
  * 03/04: notes/slides for Analysis of Algorithms available.
  * 02/26: {{courses:alg2013:hw2.pdf|HW#2}} due on 03/12.
  * 02/19: {{courses:alg2013:hw1.pdf|HW#1}} due on 03/05.
  * 02/19: eight copies of [Manber 1989] available for loan; please contact TA Lai or Chang.
  * 02/18: notes/slides for Introduction and Mathematical Induction and an appendix on Proving a Loop Invariant available.
=====Instructor=====
[[http://im.ntu.edu.tw/~tsay/|Yih-Kuen Tsay (蔡益坤)]], NTU IM Dept.,
3366-1189, ''Xtsay@im.ntu.edu.twX'' (between the enclosing pair of X's).

=====Lectures=====
Tuesday 2:20~5:20PM, Room 205, Management II. \\ TA
sessions will be scheduled prior to some of the class meetings between 1:20
and 2:10PM.

=====Office Hours=====
Tuesday 1:30~2:00PM, Wednesday 1:30~2:00PM, or by appointment, Room 1108,
Management II.

=====TA=====
Jui-Shun Lai (賴瑞舜), 3366-1205, ''Xnarration.lai@gmail.comX'' (between the
enclosing pair of X's). \\ Wei-Hsien Chang (張暐獻), 3366-1205,
''Xb96705043@ntu.edu.twX'' (between the enclosing pair of X's).

=====Textbooks=====
  * [M] //[[http://www.amazon.com/Introduction-Algorithms-Creative-Udi-Manber/dp/0201120372/ref=sr_1_1?s=books&ie=UTF8&qid=1329702126&sr=1-1|Introduction to Algorithms - A Creative Approach]]//, U. Manber, Addison-Wesley, 1989. (滄海圖書代理) (Five copies of this book have been put on reserve at NTU Library in the 教師指定參考書區 under the name "BM-4演算法")
  * [C] //[[http://www.amazon.com/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844/ref=pd_bxgy_b_img_c|Introduction to Algorithms, Third Edition]]//, T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, MIT Press, 2009. (開發圖書代理)

=====Syllabus/Schedule (with links to notes/slides)=====
This course provides an introduction to the design and analysis of computer
algorithms. A particular emphasis is given to **principles of mathematical
induction** and their use in designing algorithms. The course will cover most
of Manber's book plus supplementary material, including a few chapters of the
book by Cormen //et al.// (Note: a TA session will precede a class meeting
whose date is marked with an *. There are four TA sessions on 3/19, 4/9,
5/21, and 6/4, making up the skipped class meeting on 4/2.)
  *Introduction [M: Ch. 1; C: Ch. 1,2] (.5 week: 2/19a) [{{courses:alg2013:ch1_notes.pdf|notes}}, {{courses:alg2013:ch1_slides.pdf|slides}}]
  *Mathematical Induction [M: Ch. 2; C: Ch. 4] (1.5 weeks: 2/19b, 2/26) [{{courses:alg2013:ch2_notes.pdf|notes}}, {{courses:alg2013:ch2_slides.pdf|slides}}, {{courses:alg2013:ch2_appendix.pdf|Proving a Loop Invariant}}]
  *Analysis of Algorithms [M: Ch. 3; C: Ch. 2,3,4] (1 week: 3/5) [{{courses:alg2013:ch3_notes.pdf|notes}}, {{courses:alg2013:ch3_slides.pdf|slides}}, {{courses:alg2013:ch3_appendix.pdf|Solving a Recurrence Relation with Generating Functions}}]
  *Design by Induction [M: Ch. 5] (1 week: 3/12) [{{courses:alg2013:ch5_notes.pdf|notes}}, {{courses:alg2013:ch5_slides.pdf|slides}}]
  *Data Structures: A Supplement [M: Ch. 4; C: Ch. 6,13,21] (.5 week: 3/19a*) [{{courses:alg2013:ch4_notes.pdf|notes}}, {{courses:alg2013:ch4_slides.pdf|slides}}]
  *Searching and Sorting [M: Ch. 6;  C: Ch. 6,7,8,9] (2.5 weeks: 3/19b, 3/26, 4/9*) [{{courses:alg2013:ch6_notes_a.pdf|notes}}, {{courses:alg2013:ch6_slides_a.pdf|slides}}]
  * **Midterm** (**2013/04/16**)
  *String Processing [M: Ch. 6;  C: Ch. 32] (1 week: 4/23) [{{courses:alg2013:ch6_notes_b.pdf|notes}}, {{courses:alg2013:ch6_slides_b.pdf|slides}}]
  *Graph Algorithms: Basic [M: Ch. 7;  C: Ch. 22,23,24,25,26] (3 weeks: 4/30, 5/7, 5/14) [{{courses:alg2013:ch7_notes_a.pdf|notes}}, {{courses:alg2013:ch7_slides_a.pdf|slides}}]
  *Graph Algorithms: Advanced [M: Ch. 7;  C: Ch. 22,23,24,25,26] (1 week: 5/21*) [{{courses:alg2013:ch7_notes_b.pdf|notes}}, {{courses:alg2013:ch7_slides_b.pdf|slides}}]
  *Dynamic Programming [C: Ch.15] (.5 week: 5/28a) [{{courses:alg2013:dynamic_prog_notes.pdf|notes}}, {{courses:alg2013:dynamic_prog_slides.pdf|slides}}]
  *Reduction [M: Ch. 10; C: Ch. 29] (.5 week: 5/28b) [{{courses:alg2013:ch10_notes.pdf|notes}}, {{courses:alg2013:ch10_slides.pdf|slides}}]
  *NP-Completeness [M: Ch. 11; C: Ch. 34] (2 weeks: 6/4*, 6/11) [{{courses:alg2013:ch11_notes.pdf|notes}}, {{courses:alg2013:ch11_slides.pdf|slides}}, {{courses:alg2013:ch11_appendix.pdf|An NP-Completeness Proof}}]
  * **Final** (**2013/06/18**)

=====References=====
  * [[http://en.wikipedia.org/wiki/Mathematical_induction|Mathematical Induction]] (a Wikipedia page)
  * MIT OpenCourseWare: [[http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-spring-2008/|Introduction to Algorithms]]
  * Stanford Coursera: [[https://www.coursera.org/algo/auth/welcome|Design and Analysis of Algorithms]]
  * [[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://www.cs.ubc.ca/~harrison/Java/sorting-demo.html|Animated Sorting Algorithms]]
  * [[http://www.cs.sunysb.edu/~skiena/combinatorica/animations/|Graph Animations with Combinatorica]]

=====Grading=====
Homework 20%, Participation 10%, Midterm 30%, Final 40%.
Yih-Kuen Tsay's Wiki @ IM.NTU

User Tools

Site Tools

Page Tools
