分享
 
 
 

Yale CS的Reading List

王朝other·作者佚名  2006-01-10
窄屏简体版  字體: |||超大  

看看你都读过那些

Comprehensive Exam Reading List

Programming Languages and Systems:

1. "Computer architecture: a quantitative approach" Patterson & Hennessy

1 Fundamentals of Computer Design

2 Performance and Cost

3 Instruction Set Design

5 Basic Processor Implementation Techniques

6-6.5 Pipelining

8-8.8 Memory-Hierarchy Design

9-9.8 Input/Output

10 Future Directions

2. One of the following three books would be sufficient to prepare for

the Operating Systems component of the exam.

"Applied Operating System Concepts" A. Silberschatz, P. Galvin, and G. Gagne.

John Wiley & Sons, Inc., 2000.

"Modern operating systems" Tanenbaum

1 What is an Operating System?

2 Processes

3-3.6 Memory Management

4 Files Systems

5-5.2 Input/Output

6 Deadlock

7 Case Study: UNIX

(This is an alternative.)

"Operating Systems, Design and Implementation" Tanenbaum

(This is an alternative.)

3. "Essentials of programming languages" Friedman, Wand & Haynes

1 Tools for Symbolic Programming

2 Induction, Recursion, and Scope

3 Syntactic Abstraction and Data Abstraction

4 Reduction Rules and Imperative Programming

5 Interpreters

6 Parameter Passing

7 Object-Oriented Languages

4. "Compilers: principles, techniques, and tools" Aho, Sethi & Ullman

1 Introduction to Compiling

2 A Simple One-Pass Compiler

3 Lexical Analysis

4 Syntax Analysis

6 Type Checking

7 Run-Time Environments

9.1 Code Generation

10-10.2 Code Optimization

5. "Semantics with Applications: A Formal Introduction." Hanne Riis Nielson,

Flemming Nielson

1 Introduction

2 Operational Semantics

4 Denotational Semantics

(Available at:

http://www.daimi.au.dk/~bra8130/Wiley_book/wiley.html

***

Scientific Computing:

Introduction to Scientific Computing. 2nd Edition. Charles Van Loan,

Prentice Hall

Scientific Computing. An Introductory Survey. Second Edition. Michael

Heath. McGraw Hill.

*** AI:

Stuart Russell and Peter Norvig {\it Artificial Intelligence, A Modern

Approach}

A Guided Tour of Computer Vision

V. Nalwa

Addison Wesley, 1993

***

Theory:

Algorithms:

Topics:

analysis of algorithms: proving correctness and running time.

sorting and selection algorithms

data structures: hash tables, binary search trees, $k-{D}$ trees,

union-find, etc.

graph algorithms

combinatorial optimization: greedy algorithms, shortest paths,

dynamic programming, branch-and-bound

References:

Cormen, Leiserson, and Rivest. _Introduction to Algorithms_, MIT

Press, 1990.

Automata and computability theory:

Topics:

regular expressions and languages

finite automata

context-free grammars and languages

pushdown automata

recursive and r.e. languages

Turing machines

computability and undecidability (including diagonalization, the

halting problem, reductions, and Rice's theorem)

References:

Davis, Sigal, and Weyuker. _Computability, Complexity, and Languages_,

Academic Press, Harcourt, Brace & Company, 1994.

or

Floyd and Beigel, _The Language of Machines_, Computer Science Press,

1993.

Complexity theory:

Topics:

NP-completeness (Cormen et al, ch. 36; Davis et al, ch. 15; Floyd

et al, ch. 9; or Papadimitriou, ch. 9)

References:

any one of:

Papadimitriou. _Computational Complexity_, Addison-Wesley, 1994.

Cormen, Leiserson, and Rivest. _Introduction to Algorithms_, MIT

Press, 1990.

Davis, Sigal, and Weyuker. _Computability, Complexity, and Languages_,

Academic Press, Harcourt, Brace & Company, 1994.

Floyd and Beigel, _The Language of Machines_, Computer Science Press,

1993.

Enumeration (counting):

Topics:

permutations, Pascal's triangle, Stirling numbers

Fibonacci numbers, linear recurrences

sieve formulas

asymptotics, order of magnitude

References:

Graham, Knuth, and Patashnik. _Concrete Mathematics; a Foundation

for Computer Science_, Addison-Wesley, 1989.

or

Lovasz. _Combinatorial Problems and Exercises_, North-Holland,

1993 (chapters 1-4).

Graph Theory:

Topics:

graphs, trees, connectivity

flows and matchings

adjacency matrices

References:

or

Bondy and Murty. _Graph Theory with Applications_,

North-Holland, 1976.

 
 
 
免责声明:本文为网络用户发布,其观点仅代表作者个人观点,与本站无关,本站仅提供信息存储服务。文中陈述内容未经本站证实,其真实性、完整性、及时性本站不作任何保证或承诺,请读者仅作参考,并请自行核实相关内容。
2023年上半年GDP全球前十五强
 百态   2023-10-24
美众议院议长启动对拜登的弹劾调查
 百态   2023-09-13
上海、济南、武汉等多地出现不明坠落物
 探索   2023-09-06
印度或要将国名改为“巴拉特”
 百态   2023-09-06
男子为女友送行,买票不登机被捕
 百态   2023-08-20
手机地震预警功能怎么开?
 干货   2023-08-06
女子4年卖2套房花700多万做美容:不但没变美脸,面部还出现变形
 百态   2023-08-04
住户一楼被水淹 还冲来8头猪
 百态   2023-07-31
女子体内爬出大量瓜子状活虫
 百态   2023-07-25
地球连续35年收到神秘规律性信号,网友:不要回答!
 探索   2023-07-21
全球镓价格本周大涨27%
 探索   2023-07-09
钱都流向了那些不缺钱的人,苦都留给了能吃苦的人
 探索   2023-07-02
倩女手游刀客魅者强控制(强混乱强眩晕强睡眠)和对应控制抗性的关系
 百态   2020-08-20
美国5月9日最新疫情:美国确诊人数突破131万
 百态   2020-05-09
荷兰政府宣布将集体辞职
 干货   2020-04-30
倩女幽魂手游师徒任务情义春秋猜成语答案逍遥观:鹏程万里
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案神机营:射石饮羽
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案昆仑山:拔刀相助
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案天工阁:鬼斧神工
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案丝路古道:单枪匹马
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:与虎谋皮
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:李代桃僵
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:指鹿为马
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案金陵:小鸟依人
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案金陵:千金买邻
 干货   2019-11-12
 
推荐阅读
 
 
 
>>返回首頁<<
 
靜靜地坐在廢墟上,四周的荒凉一望無際,忽然覺得,淒涼也很美
© 2005- 王朝網路 版權所有