Tag: computer science

Last GRE Computer Science Syllabus

Overview

  • The test consists of approximately 70 multiple-choice questions, some of which are grouped in sets and based on such materials as diagrams, graphs and program fragments.
  • The approximate distribution of questions in each edition of the test according to content categories is indicated by the following outline.
  • The percentages given are approximate; actual percentages will vary slightly from one edition of the test to another.

Content Specifications

I. SOFTWARE SYSTEMS AND METHODOLOGY — 40%

A. Data organization

  • Data types
  • Data structures and implementation techniques

B. Program control and structure

  • Iteration and recursion
  • Procedures, functions, methods and exception handlers
  • Concurrency, communication and synchronization

C. Programming languages and notation

  • Constructs for data organization and program control
  • Scope, binding and parameter passing
  • Expression evaluation

D. Software engineering

  • Formal specifications and assertions
  • Verification techniques
  • Software development models, patterns and tools

E. Systems

  • Compilers, interpreters and run-time systems
  • Operating systems, including resource management and protection/security
  • Networking, Internet and distributed systems
  • Databases
  • System analysis and development tools

II. COMPUTER ORGANIZATION AND ARCHITECTURE — 15%

A. Digital logic design

  • Implementation of combinational and sequential circuits
  • Optimization and analysis

B. Processors and control units

  • Instruction sets
  • Computer arithmetic and number representation
  • Register and ALU organization
  • Data paths and control sequencing

C. Memories and their hierarchies

  • Performance, implementation and management
  • Cache, main and secondary storage
  • Virtual memory, paging and segmentation

D. Networking and communications

  • Interconnect structures (e.g., buses, switches, routers)
  • I/O systems and protocols
  • Synchronization

E. High-performance architectures

  • Pipelining superscalar and out-of-order execution processors
  • Parallel and distributed architectures

III. THEORY AND MATHEMATICAL BACKGROUND — 40%

A. Algorithms and complexity

  • Exact and asymptotic analysis of specific algorithms
  • Algorithmic design techniques (e.g., greedy, dynamic programming, divide and conquer)
  • Upper and lower bounds on the complexity of specific problems
  • Computational complexity, including NP-completeness

B. Automata and language theory

  • Models of computation (finite automata, Turing machines)
  • Formal languages and grammars (regular and context-free)
  • Decidability

C. Discrete structures

  • Mathematical logic
  • Elementary combinatorics and graph theory
  • Discrete probability, recurrence relations and number theory

IV. OTHER TOPICS — 5%

Example areas include numerical analysis, artificial intelligence, computer graphics, cryptography, security and social issues.

Note: Students are assumed to have a mathematical background in the areas of calculus and linear algebra as applied to computer science.

Computer Science

Computing

奚梅成《数值分析方法》中国科学技术大学出版社

林成森《数值计算方法》科学出版社

谭浩强《C语言程序设计》清华大学出版社

黄刘生《数据结构》中国科学技术大学出版社

周佩玲《16位微机原理接口技术及其应用》中国科学技术大学出版社

李翰荪《电路分析》高等教育出版社

刘同怀《模拟电子线路》中国科学技术大学出版社

康华光《电子技术基础（数字部分）》高等教育出版社

德国Stoer的“数值分析引论”。

算法：Corman等著的”Introduction to Algorithms”

”现代计算机常用数据结构与算法“

形式语言与自动机。我们用过北邮的教材，

数据结构：初级算法课，另一种高级的程序设计课。北大的红皮书(许卓群等著，高教版)和

清华的绿皮书(严蔚敏等著，清华版)。

汇编预言和微机原理

模拟电路: 邱关源的“电路原理”，

教材：康华光的“电子技术基础”还是不错的。有兴趣也可以参考童诗白的书。

数字电路: 阎石的书也算一本好教材，遗憾的一点是集成电路讲少了些。

计算机系统结构：Stallings的”Computer Organization and Architecture:Designing for Performance”

“Computer architecture: a quantitative approach”, by Patterson & Hennessy。

操作系统：Tanenbaum的”Operating System Design and Implementation”和

“Modern Operating  System” 

形式语言: 编译原理中的前端我看只要学四个算法：１最容易实现的递归下降；２最好的自顶向下算法LL(k)；３最好的自底向上算法LR(k)；４LR(1)的简化SLR(也许还有另一简化LALR?)。５后端完全属于工程性质，自然又是another story。

推荐教材： Aho等人的著名的Dragon Book: “Compilers: Principles, Techniques and Tools”. 或者

Appel的”Modern Compiler Implementation in C”. 

学数据库：Silberschatz, et al., “Database System Concepts”. 

Tanenbaum:”Computer Networks”(清华影印本)。

集合论，数理逻辑与元数学。图论，算法图论；组合数学，组合算法。抽象代数。代数是无所不在的，

D.E.Knuth在Stanford开设了一门全新的课程Concrete Mathematics。有两层含义：

Computing

Xi Meicheng of the numerical analysis method of the University of science and technology of China press

Lin chengsen of the numerical method of the science press

Tan haoqiang C Programming language in Tsinghua University Press

Liusheng Huang of the data structure of the University of science and technology of China press

Zhou Peiling 16 Interface technique of microcomputer principle and application of University of science and technology of China Press

Li Han-sun of the circuit analysis of the higher education press

Liu Tonghuai of analog electronic circuit, China University of science and technology publishing house

Kang Hua Guang electronic technology Foundation (number of) higher education press

Germany Stoer “An introduction to numerical analysis”.

Algorithm: Corman Waiting for “Introduction to Algorithms”

“Modern computers commonly used data structures and algorithms”

Formal languages and automata. Bupt we used textbooks

Data structures: elementary algorithms class, another advanced programming class. North of the Red Book ( Xu Zhuoqun waiting, higher education ) and

Tsinghua’s Green Paper ( Yan Wei-min wait, Tsinghua University ) 。

Compilation of prophecy and of microcomputer principle

Analog circuits : Qiu Guanyuan “circuit”,

Book: Kang Hua Guang “electronic technology” is pretty good. Are interested can refer to the book Tong Shibai.

Digital circuit : Yan Shi’s book is a good textbook, it is regrettable that IC telling little some.

Computer architecture: Stallings “Computer Organization and Architecture:Designing for Performance”

” Computer architecture: a quantitative approach”, by Patterson & Hennessy 。

Operating system: Tanenbaum “Operating System Design and Implementation”

“Modern Operating System”

Formal languages : Compiler front end I do as long as the four algorithms: 1 is best achieved by recursive descent; 2 the best top-down method LL(k)And 3 best bottom-up algorithms LR(k) ;4 LR(1) Simplified SLR ( perhaps another simplified LALR?) 。 5 back-end belongs entirely to engineering properties, nature is another story.

Recommended book: Aho Famous people such as Dragon Book: “Compilers: Principles, Techniques and Tools”. Or

Appel “Modern Compiler Implementation in C”.

Database: Silberschatz, et al., “Database System Concepts”.

Tanenbaum: “Computer Networks” ( copy of Tsinghua University ) 。

Set theory, mathematical logic and metamathematics. Graph theory, algorithms, graph theory, combinatorics, and combinatorial algorithms. Abstract algebra. Algebra is omnipresent,

D.E.Knuth Stanford Opened a new course Concrete Mathematics 。 Has two meanings: