跳到主要內容區
nthulogo
English     NTHU    
TITLE

2019 春-博士班資格考公告

國立清華大學資訊系統與應用研究所

2019年春季博士班資格考報名及考試日期公告

Institute of Information Systems and Applications, NTHU

The Spring of 2019 Qualifying Exam Announcement

 

一、      報名日期 (Registration Dates)

報名開始日期 (Registration date):2019年2月 18日 (Mon.)

報名截止日期 (Deadline date):2019 年 2 月 22日 (Fri.)

Registration Dates: March 18 - 22, 2019

 

二、考試日期(Exam Dates)

考試日期:2019年3月14日(Thursday) 及3月15日 (Friday)

Exam Dates: March 14- 15, 2019

 

三、博士班資格考 Reading List(本清單僅供參考,命題範圍得超越之)

This list is for informational purposes only, the range beyond the scope.

作業系統 (Operating Systems):

A. Silberschatz, J. Peterson and P. Galvin

Operating System Concepts, 7th Edition

Chapters 1-13

 

或亞洲版 (Wiley Asia Student Edition)

A. Silberschatz, J. Peterson and P. Galvin

Operating System Principles, 7th Edition

Chapters 1-13

 

 

計算機結構 (Computer Architecture):

 Computer Organization & Design: The Hardware/Software Interface

David A. Patterson and John L. Hennessy

 

計算方法(Algorithm):

1.         [1] R.C.T. Lee, R.C. Chang, S.S. Tseng and Y.T. Tsai

Introduction to the Design and Analysis of Algorithms:

A Strategic Approach, McGraw Hill

Chapter 3: The greedy method

Chapter 4: The divide-and-conquer strategy

Chapter 8: The Theory of NP-completeness

 

2.         T. H. Cormen, C. E. Leiserson, R.L. Rivest and C. Stein

Introduction to Algorithms, MIT Press, 2nd Edition

Chapter 3: Growth of functions

Chapter 4: Recurrences

Chapters 6-9: Sorting and order statistics

Chapter 15: Dynamic programming

Chapters 22-26: Graph algorithms

Section 28.2: Strassen’s algorithm for matrix multiplication

Section 32.4: The Knuth-Morris-Pratt algorithm

Chapter 35: Approximation algorithms

NOTE: If your text book is the 1st Edition, the corresponding chapters are: Chapters 2, 3, 4, 7-10, 16, 23-27, 31.2, 34.4, 37.

資料結構 (Data Structure):
   Fundamentals of Data Structures in C, Ellis Horowit

 

機率論 (Probability theory):

S. Ghahramani, Fundamentals of Probability with Stochastic Processes,
           3rd edition, Prentice Hall, 2005 (Chapters 1~11)

瀏覽數:
登入成功