CSE PhD degree requirements are changed

PSU의 CSE PhD requirement가 바뀌었다.

9 subject area중에서 3과목의 수업을 듣고,

Data Structures and Alorithms, Programming Languages중의 1과목
Operating System, Computer Architecture 중의 1과목의 시험을 봐야한다.

그리고, 시험본 과목 이외에서 2과목의 수업을 들어야 한다.

그래서...

나는 Data Structures and Algorithms, Computer Architecture, Computer Networks

세과목의 수업을 듣고,

Data Structures and Algorithms, Operating Systems 의 시험을 보는게 어떨까 생각중이다.

Subject Area 2: Computer Architecture and Organization


The following Penn State course(s) are recommended as providing a minimal background in the above topics:

CSE 331: Computer Organization and Design
CSE 431: Introduction to Computer Architecture

Suggested references:

Patterson and Hennessy. Computer Organization and Design: The Hardware/Software Interface (3 rd Edition). Morgan Kaufmann, 2004.
Hamacher et. al. Computer Organization (5 th Edition) . McGraw Hill, 2002.
Hennessy and Patterson. Computer Architecture A Quantitative Approach ( 3 rd Edition ). Morgan Kaufmann.

이탤릭체는 사야할 책
Graduate Breadth Courses:
CSE 530: Fundamentals of Computer Architecture
645673, T R 09:45A - 11:00A, Credit 3.0
이 수업을 들어야지..


Subject Area 3: Computer Networks


The following Penn State course(s) are recommended as providing a minimal background in the above topics:

CSE/EE 458: Data Communications

Suggested references:

Computer Networks: A Top-Down Approach Featuring the Internet, Third Edition, J. Kurose and K. Ross 2005.
Computer Networks, Fourth Edition, Andrew Tanenbaum, Prentice Hall 2005.

Graduate Breadth Courses:
CSE 514: Computer Networks
645664, T R 02:30P - 03:45P, Credit 3.0
이 수업을 들어야지

Subject Area 5: Data Structures and Algorithms

Exam covers the following topics:

• Representation of Basic Data Structures: arrays, stacks, queues, linked lists, trees, graphs, binary search trees, balanced trees, hash tables.
• Algorithmic Design Techniques: divide and conquer, greedy, dynamic programming.
• Sorting and Order Statistics.
• Graph Algorithms: searching, minimum spanning trees, shortest paths (single-source and all-pairs).
• Growth of Functions, Recurrences and Time Analysis.

The following Penn State course(s) are recommended as providing a minimal background in the above topics:

CSE 465: Data Structures and Algorithms

Suggested references:

Cormen, Leiserson, Rivest, and Stein. Introduction to Algorithms, MIT Press, 2001.
Baase and Van Gelder, Computer Algorithms, Introduction to Design & Analysis. 3rd Edition, Addison-Wesley, 2000.
이탤릭체 : 사야할 책

Graduate Breadth Courses:
CSE 565: Algorithm Design and Analysis
645685, M W F 10:10A - 11:00A, Credit 3.0
이 수업을 들어야지.

Subject Area 7: Operating Systems

Exam covers the following topics:
• Process Management: processes, threads, context switching, scheduling, interprocess communication.
• Memory Management: virtual memory, swapping, allocation/de-allocation, paging, segmentation.
• Input-Output: devices, device interface, I/O software.
• File Systems: structure, management, directories, user interface, protection.
• Protection: protection domains, access rights, capabilities.
• Concurrent Programming: synchronization problems, synchronization mechanisms, deadlocks.

Suggested references:

Silberschatz and Galvin. Operating Systems Concepts (Fourth Edition). Addison-Wesley, 1994.
Tanenbaum. Modern Operating Systems. Prentice Hall, 1992.

The following Penn State course(s) are recommended as providing a minimal background in the above topics:

CSE 411: Operating Systems

7월 한달동안 빡시게 살아야할듯..