CS GRE: Difference between revisions

From dankwiki
Line 26: Line 26:
{| border="1" width="100%"
{| border="1" width="100%"
! align="left"| Area <small>''vocabulary listings follow each area in small, italicized text''</small>
! align="left"|Area <small>''vocabulary listings follow each area in small, italicized text''</small>
! References and Supplements
! References and Supplements

Revision as of 09:05, 5 August 2009

Anything above a 800 (it's on a 200-990-point scale) seems pretty good. It appears that quality single-volume preparation materials cannot be had at any price. Perhaps one ought be written?

(This second link is pretty dubiously-formed; YMMV. Go to the GRE page, click on Subject Info details, click on Computer Science --Dank 14:58, 30 July 2009 (UTC))

<countdown time="10/10/2009 8:30 AM UTC-0500"><D> days, <H> hours, <M> minutes, seconds until the 2009-10-10 CS GRE</countdown>

Books I'm using for general preparation

Further texts are listed in the applicable sections below.

Online courseware

Subject Material

Outline taken from the ETS CS GRE page, 2009-07-30 1500 UTC)

Area vocabulary listings follow each area in small, italicized text References and Supplements
Data Organization
Data types
Data structures and implementation techniques
Program control and structure
Iteration and recursion
Procedures, functions, methods, and exception handlers
Concurrency, communication, and synchronization
Programming languages and notation
Constructs for data organization and program control
Scope, binding, and parameter passing
Expression evaluation
Software engineering
Formal specifications and assertions
Verification techniques
Software development models, patterns, and tools
Compilers, interpreters, and run-time systems
Operating systems, including resource management and protection/security
Networking, Internet, and distributed systems
System analysis and development tools
Digital logic design
Implementation of combinational and sequential circuits
Optimization and analysis
Processors and control units
Instruction sets
Computer arithmetic and number representation
Register and ALU organization
Data paths and control sequencing
Memories and their hierarchies
Performance, implementation, and management
Cache, main, and secondary storage
Virtual memory, paging, and segmentation
Networking and communications
Interconnect structures (e.g., buses, switches, routers)
I/O systems and protocols
High-performance architectures
Pipelining superscalar and out-of-order execution processors
Parallel and distributed architectures
Algorithms and complexity
Exact and asymptotic analysis of specific algorithms
Algorithmic design techniques (e.g. greedy, dynamic programming, divide and conquer) Divide+Conquer, Dynamic Programming and Greedy algorithm lectures from MIT's 6.046J
Upper and lower bounds on the complexity of specific problems
Computational complexity, including NP-completeness
Automata and language theory
Models of computation (finite automata, Turing machines)
Formal languages and grammars (regular and context free)
Discrete structures
Mathematical logic
Elementary combinatorics and graph theory
Discrete probability, recurrence relations, and number theory
OTHER TOPICS - 5% "Example areas include..."
Numerical analysis
Artificial intelligence
Computer graphics
...and social issues.