This program is mainly taught in Chinese.

 

Graduation Requirements

To graduate with a master’s degree, in addition to the complete a thesis, a minimum of 30 credits must be earned in approved courses.

 
The above three prerequisite courses are undergraduate courses. For any of these three courses, if the student got a score, which is under 70, the student has to retake that course before graduation. If the student passed all of these three courses and got scores that are above 70, the student still need to retake one of the three courses before graduation.

Notice:The credits obtained from taking prerequisite courses will not be included in the minimum of 30 credits.

 

Required Courses

Research Methodology (I) & (II)  (First year of master’s program: 1/1 credits)

Basic skills of writing research papers/thesis and selecting research topics will be delivered in class. Students will have a short presentation to show their direction of thesis writing. The instructor will invite domestic/international scholars to present their work upon demand.

Thesis (I) & (II)  (Second year of master’s program: 0/0 credits)

By selecting a good topic for graduate students research and transforming an idea to reality, we try to organize the paper and the thesis.

 

Required Elective Courses (English Lecture)

Formal Language and Automata Theory  (Fall semester in the first year of master’s program: 3 credits)

This course is to introduce students to the abstract models of digital computers, programming languages, and related matters. Students learn the foundations and basic principles of computer science.

Computer Algorithms  (Spring semester in the first year of master’s program: 3 credits)

The objective of this course is to study paradigms and approaches used to analyze and design algorithms and to appreciate the impact of algorithm design in practice. It also ensures that students are Familiar with fundamental algorithms and algorithmic techniques and understand how to analyze the running time of a given algorithm, how asymptotic notation is used to provide a rough classification of algorithms, and how a number of algorithms for fundamental problems in computer science and engineering work and compare with one another.

 

Other Elective Courses And More Details

Elective Courses

There are many elective courses, including multiple professional courses of IT area, such as Pattern Recognition, Cryptology, Broadband Wireless Networks, Ubiquitous Computing Security, Machine Learning, Image Processing, Object-Oriented Software Engineering, Component-based Software Development Technology, Complex Networks, Data Mining, Distributed System, and so on.

More Course Details

TKU Course Catalogs



地圖資訊 MAP

建議最佳瀏覽 Microsoft IE 10 以上/Google Chrome/Mozilla Firefox 或相容W3C網頁標準之瀏覽器 | Design by it-easygo.