2010年7月10日 星期六

99台灣大學電機研究所考試筆試參考內容-2

作業系統:

1. Hardware Support for Operating Systems

2. Operating system structure

3. Operating System operations

4. Process management

5. Memory management

6. Operating system services

7. System calls

8. Process scheduling

9. Operations on processes

10. Interprocess communications

11. Thread management

12. Thread programming

13. CPU scheduling

14. Critical section problems

15. Process synchronizations

16. Atomic transactions

17. Deadlocks

18. Virtual memory

19. File systems

20. Secondary storage management

21. RAID
 
22. Distributed systems


資料結構:(對應課程:資料結構)

1. PRELIMINARIES: Introduction. Order Notation. Recursion. Recurrence relations.

2. ABSTRACT DATA TYPES: Stacks. Queues. Lists.

3. LISTS: List operations. List representations. List traversals. Doubly linked lists.

4. TREES: Tree operations. Tree representations. Tree traversals. Threaded trees. Binary trees.

5. DICTIONARIES: Binary search trees. AVL trees. 2-3 trees. B-trees. Red-black trees.

Binomial trees. Splay trees.

6. SETS: Set operations. Set representations. Leftist trees. Heaps. Min-max heaps. Fibonacci

heaps. Union-find. Path compression.

7. HASHING: Chaining. Open addressing. Collision handling.

8. GRAPHS: Graph operations. Graph representations. Basic graph algorithms.

9. MEMORY MANAGEMENT: Garbage collection. Buddy systems.

沒有留言: