wiki:welcome
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| wiki:welcome [2018/09/06 05:42] – [Welcome to your new DokuWiki] mht208 | wiki:welcome [2026/07/22 19:16] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | The goal of this course is to acquaint the students with basic computer | + | ====== Welcome |
| - | algorithms and their design principles and to cultivate the students' | + | |
| - | ability in designing and analyzing algorithms independently. | + | |
| - | ===== Announcements ===== | + | Congratulations, |
| - | ===== Instructors ===== | + | Enjoy your work with DokuWiki, |
| + | -- the developers | ||
| - | Yu-Fang Chen (陳郁方) \\ | ||
| - | Institute of Information Science, Academia Sinica \\ | ||
| - | 02-27883799 ext 1514 \\ | ||
| - | Xyfc@iis.sinica.edu.twX (between the enclosing pair of X's) \\ | ||
| - | \\ | ||
| - | Ming-Hsien Tsai (蔡明憲) \\ | ||
| - | Institute of Information Science, Academia Sinica \\ | ||
| - | 02-27883799 ext 2411 \\ | ||
| - | Xmhtsai208@gmail.comX (between the enclosing pair of X's) | ||
| - | |||
| - | ===== Lectures ===== | ||
| - | |||
| - | Monday 2: | ||
| - | |||
| - | ===== Office Hours ===== | ||
| - | |||
| - | By appointment | ||
| - | |||
| - | ===== TAs ===== | ||
| - | |||
| - | 陳昀靖, Xr06725004@ntu.edu.twX (between the enclosing pair of X's) \\ | ||
| - | 賴冠廷, Xr06725007@ntu.edu.twX (between the enclosing pair of X's) | ||
| - | |||
| - | ===== Textbooks ===== | ||
| - | |||
| - | * [M] Introduction to Algorithms - A Creative Approach, U. Manber, Addison-Wesley, | ||
| - | * [C] Introduction to Algorithms, Third Edition, T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, MIT Press, 2009 | ||
| - | |||
| - | ===== Syllabus/ | ||
| - | |||
| - | * Introduction [M: Ch. 1; C: Ch. 1,2] | ||
| - | * Mathematical Induction [M: Ch. 2; C: Ch. 4] | ||
| - | * Analysis of Algorithms [M: Ch. 3; C: Ch. 2,3,4] | ||
| - | * Design by Induction [M: Ch. 5] | ||
| - | * Data Structures: A Supplement [M: Ch. 4; C: Ch. 6,13,21] | ||
| - | * Searching and Sorting [M: Ch. 6; C: Ch. 6,7,8,9] | ||
| - | * String Processing [M: Ch. 6; C: Ch. 32] | ||
| - | * Midterm | ||
| - | * Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22, | ||
| - | * Graph Algorithms: Advanced [M: Ch. 7; C: Ch. 22, | ||
| - | * Dynamic Programming [C: Ch.15] | ||
| - | * Reduction [M: Ch. 10; C: Ch. 29] | ||
| - | * NP-Completeness [M: Ch. 11; C: Ch. 34] | ||
| - | * Final | ||
| - | |||
| - | ===== Grading ===== | ||
| - | |||
| - | Homework 20%, Participation 10%, Midterm 35%, Final 35% | ||
| ===== Create your first pages ===== | ===== Create your first pages ===== | ||
| Line 75: | Line 26: | ||
| DokuWiki is an Open Source project that thrives through user contributions. A good way to stay informed on what's going on and to get useful tips in using DokuWiki is subscribing to the [[doku> | DokuWiki is an Open Source project that thrives through user contributions. A good way to stay informed on what's going on and to get useful tips in using DokuWiki is subscribing to the [[doku> | ||
| - | The [[http:// | + | The [[https:// |
| Of course we'd be more than happy to have you [[doku> | Of course we'd be more than happy to have you [[doku> | ||
wiki/welcome.txt · Last modified: by 127.0.0.1
