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 2017======
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=====
  * 05/02: notes/slides for Basic Graph Algorithms available.
  * 05/02: {{courses:alg2017:hw7.pdf|HW#7}} due on 05/09.
  * 04/20: slides from TA sessions: {{courses:alg2017:hw1slides.pptx|HW#1}}, {{courses:alg2017:hw2slides.pptx|HW#2}}, {{courses:alg2017:hw3slides.pptx|HW#3}}, {{courses:alg2017:hw4slides.pptx|HW#4}}.
  * 04/18: old exams: {{courses:alg:old_exams.zip|1996-2016}}.
  * 04/11: {{courses:alg2017:hw6.pdf|HW#6}} due on 04/25.
  * 04/11: notes/slides for String Processing available.
  * 03/31: {{courses:alg2017:hw5.pdf|HW#5}} due on 04/11; ACM ICPC 2016 World Finals {{courses:alg2017:2016WorldFinalsProblemC.pdf|Problem C}} and {{courses:alg2017:2016WorldFinalsProblemL.pdf|Problem L}}.
  * 03/28: notes/slides for Searching and Sorting available.
  * 03/21: {{courses:alg2017:hw4.pdf|HW#4}} due on 03/28.
  * 03/21: notes/slides for A Supplement to Data Structures available.
  * 03/12: {{courses:alg2017:hw3.pdf|HW#3}} due on 03/21.
  * 03/12: notes/slides for Design by Induction available.
  * 03/08: {{courses:alg2017:hw2.pdf|HW#2}} due on 03/14.
  * 03/06: notes/slides for Analysis of Algorithms and an appendix on Solving a Recurrence Relation with Generating Functions available.
  * 03/06: notes on Proving a Loop Invariant available. 
  * 02/23: {{courses:alg2017:hw1.pdf|HW#1}} due on 03/07.
  * 02/21: notes/slides for Introduction and for Mathematical Induction available.
  * 02/20: this website announced.
=====Instructor=====
[[http://im.ntu.edu.tw/~tsay/|Yih-Kuen Tsay (蔡益坤)]], NTU IM Dept.,
3366-1189, ''Xtsay@ntu.edu.twX'' (between the enclosing pair of X's).

=====Lectures=====
Tuesday 2:20~5:20PM, Room 303, Management Building 2. \\ TA
sessions will be scheduled prior to some of the class meetings between 1:20
and 2:10PM; see the course schedule below.

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

=====TAs=====
Carlos Chang (張永叡), ''Xjake080449@gmail.comX'' (between the enclosing pair of X's). \\
Rick Lee (李昱賢), ''Xrick830620@gmail.comX'' (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. (Four copies of this book have been put on reserve at NTU Library in the B1-教師指定參考書區 under 演算法(BM-4). Additionally, eight copies are available for loan; please contact one of the TAs.)
  * [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. (開發圖書代理; one copy of this book has been put on reserve at NTU Library in the B1-教師指定參考書區 under (FF-9).)

=====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/21, 4/11,
5/9, and 6/6.)
  *Introduction [M: Ch. 1; C: Ch. 1,2] (.5 week: 2/21a) [{{courses:alg2017:ch1_notes.pdf|notes}}, {{courses:alg2017:ch1_slides.pdf|slides}}]
  *Mathematical Induction [M: Ch. 2; C: Ch. 4] (1 week: 2/21b, 3/7a) [{{courses:alg2017:ch2_notes.pdf|notes}}, {{courses:alg2017:ch2_slides.pdf|slides}}, Proving a Loop Invariant ({{courses:alg2017:ch2_appendix.pdf|the gcd example}}, {{courses:alg2017:ch2_appendix_old.pdf|the original example}})]
  *Analysis of Algorithms [M: Ch. 3; C: Ch. 2,3,4] (.5 week: 3/7b) [{{courses:alg2017:ch3_notes.pdf|notes}}, {{courses:alg2017:ch3_slides.pdf|slides}}, {{courses:alg2017:ch3_appendix.pdf|Solving a Recurrence Relation with Generating Functions}}]
  *Design by Induction [M: Ch. 5] (1.5 weeks: 3/14, 3/21a*) [{{courses:alg2017:ch5_notes.pdf|notes}}, {{courses:alg2017:ch5_slides.pdf|slides}}]
  *Data Structures: A Supplement [M: Ch. 4; C: Ch. 6,13,21] (.5 week: 3/21b) [{{courses:alg2017:ch4_notes.pdf|notes}}, {{courses:alg2017:ch4_slides.pdf|slides}}, {{courses:alg2017:ch4_slides_avl.pptx|Building an AVL Tree (Illustration)}}]
  *Searching and Sorting [M: Ch. 6;  C: Ch. 6,7,8,9] (2 weeks: 3/28, 4/11*) [{{courses:alg2017:ch6_notes_a.pdf|notes}}, {{courses:alg2017:ch6_slides_a.pdf|slides}}, {{courses:alg2017:ch6_slides_heapsort.pptx|Heapsort (Illustration)}}, {{courses:alg2017:ch6_slides_heapbottomup.pptx|Bottom-Up Heap Building (Illustration)}}]
  *String Processing [M: Ch. 6;  C: Ch. 32] (1 week: 4/18) [{{courses:alg2017:ch6_notes_b.pdf|notes}}, {{courses:alg2017:ch6_slides_b.pdf|slides}}, {{courses:alg2017:ch6_slides_huffman.pptx|Construction of a Huffman Tree (Illustration)}}]
  * **Midterm** (**2017/04/25**)
  *Graph Algorithms: Basic [M: Ch. 7;  C: Ch. 22,23,24,25,26] (2 weeks: 5/2, 5/9*) [{{courses:alg2017:ch7_notes_a.pdf|notes}}, {{courses:alg2017:ch7_slides_a.pdf|slides}}, {{courses:alg2017:ch7_slides_dijkstras.pptx|Dijkstra's Algorithm (Illustration)}}, {{courses:alg2017:ch7_slides_mst.pptx|Prim's Algorithm (Illustration)}}]
  *Graph Algorithms: Advanced [M: Ch. 7;  C: Ch. 22,23,24,25,26] (1 week: 5/16) [{{courses:alg2017:ch7_notes_b.pdf|notes}}, {{courses:alg2017:ch7_slides_b.pdf|slides}}]
  *Dynamic Programming [C: Ch.15] (.5 week: 5/23a) [{{courses:alg2017:dynamic_prog_notes.pdf|notes}}, {{courses:alg2017:dynamic_prog_slides.pdf|slides}}]
  *Reduction [M: Ch. 10; C: Ch. 29] (.5 week: 5/23b) [{{courses:alg2017:ch10_notes.pdf|notes}}, {{courses:alg2017:ch10_slides.pdf|slides}}]
  *NP-Completeness [M: Ch. 11; C: Ch. 34] (2 weeks: 6/6*, 6/13) [{{courses:alg2017:ch11_notes.pdf|notes}}, {{courses:alg2017:ch11_slides.pdf|slides}}, {{courses:alg2017:ch11_appendix.pdf|An NP-Completeness Proof}}]
  * **Final** (**2017/06/20**)
=====References=====
  * [[http://en.wikipedia.org/wiki/Mathematical_induction|Mathematical Induction]] (a Wikipedia page)
  * [[http://en.wikipedia.org/wiki/Structural_induction|Structural 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]]
  * The website of [[http://icpc.baylor.edu/welcome.icpc|ACM-ICPC]] (International Collegiate Programming Contest)

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

User Tools

Site Tools

Page Tools
