演算法

This class is NOT programming courses. But you need the basic ability of C, Java, or Python programming. The idea is to provide you with concepts: tools you need to write efficient programs. The programming language you use and the way you implement these ideas is up to you. You will learn efficient structures for storing information and handy algorithms for manipulating that information There are four main, interrelated topics in this class: 1. Recursion 2. Data structures 3. Algorithms 4. Analysis of algorithms In addition, we will continue to explore good programming practices: 1. Good programming style 2. Good habits, such as creating test cases

You should have learned the following courses first. 1. Discrete Mathematics 2. Programming Language (C or Java)

Students will have the slides. Slides do not cover all the details, reading book is required. This course is conducted in Chinese, and the slides are mainly in Chinese. In addition, homework and exams will be in English.

Homeworks: 20% Midterm examination, 40% Final examination, 40%

Introduction to Algorithms, Third Edition, T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, MIT Press, 2009.

時間

Office hour, to be announced, or appointment.

聯絡方式

cklin@nycu.edu.tw