Design and Analysis of Computer Algorithms

Fall 2019 Welcome

General Information

Time: Mon 14:10-15:00 and Fri 14:10-16:00
Place: Room 207, 2th Teaching Building


Instructor:
Chuan-Ming Liu (劉傳銘)
Office: Technology and Research Building 1530
Office Hours: Tue 10:10-12:00 and Thu 10:10-12:00, or by appointment
Email: alg.taipeitech@gmail.com or cmliu@csie.ntut.edu.tw
Phone: 02-2771-2171 ext. 4251

TA:
Kuan-Teng Liao (廖冠登) and Van-Dai Jackie Ta (謝文大)
Office: Technology and Research Building 1262
Office Hours: (or by appointment)
Kuan-Teng Liao: Tue 1400~ 16:00 and Wed: 1400~ 16:00
Van - Dai Ta: Thu 14:00~17:00
Email: alg.taipeitech@gmail.com
Phone: 02-2771-2171 ext. 4262

Topics
The course gives a broad introduction about the design and analysis of computer algorithms. General topics to be covered include:
  • Introduction
  • Asymptotic Analysis
  • Advanced Data Structures
  • Average and Worst Case Analysis
  • Lower Bounds
  • Dynamic Programming
  • Greedy Methods
  • Graph Algorithms
  • Search and Traversal Techniques
  • NP-Completeness
Material
  • Textbook:
    Introduction to Algorithms, 3nd edition. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. MIT Press Edition, 2009. ISBN: 978-0-262-53305-8.
  • References:
    1. Computer Algorithms /C++, 2nd Edition. E. Horowitz, S. Sahni, and S. Rajasekaran, W.H. Freeman and Company, 1998.
    2. Computer Algorithms, 3rd edition. S. Baase and A. V. Gelder. Addison-Wesley, 2000.
    3. Algorithms in C++, 3rd. R. Sedgewick. Addison-Wesley, 1998.
    4. Algorithms, R. Johnsonbaugh and M. Schaefer, Pearson Prentice Hall, 2004.
    5. Algorithm Design, Jon Kleinberg and Éva Tardos, Pearson/Addison-Wesley, 2006.
    6. Algorithms, Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, McGraw-Hill, 2008. ISBN:978-007-125975-0.
    7. The Design and Analysis of Algorithms, 2nd Edition, Anany Levitin, Addison Wesley, 2007. ISBN:0-321-36413-9.
  • Lecture notes: Available online

Welcome To The Class

The course gives a broad introduction about the design and analysis of computer algorithms. General topics to be covered include: growth of functions, recurrences, sorting and order statistics, fundamental and advanced data structures, dynamic programming, greedy algorithms, graph searching and graph algorithms, and NP-completeness.

Home

Announcement

Home

SCHEDULE

The table below gives the material covered in class, deadlines and important dates, and reading assignments. It is updated weekly. Please keep in mind that it is a "working" document and, as such, it is subject to change without notice.

Lecture Notes

Course Work

Grade Statistics

Contact

Contact Us

Instructor:
Chuan-Ming Liu (劉傳銘)
Email: cmliu@csie.ntut.edu.tw
Phone: 02-2771-2171 ext. 4251

TA:
Kuan-Teng Liao (廖冠登)
Email: altoliaw2@gmail.com
Phone: 02-2771-2171 ext. 4262