Oakland University Graduate Students:
This material is no longer the basis for the core exam.
Question 01 - time complexity
Question 02 - binary heap Question 03 - time complexity Question 04 - automaton Question 05 - grammar Question 06 - program logic Question 07 - instruction set Question 08 - data structure Question 09 - combinatorics Question 10 - circuit Question 11 - P/NP Question 12 - MST algo's Question 13 - call by reference Question 14 - symbol table Question 15 - sw req spec Question 16 - full binary tree Question 17 - pipelaine Question 18 - turing machine Question 19 - program logic Question 20 - page frames Question 21 - BST Question 22 - relational db Question 23 - caching Question 24 - turing machine Question 25 - program logic Question 26 - paging, seg'n Question 27 - java Question 28 - integer math Question 29 - wirelss net Question 30 - graph theory Question 31 - combinatorics Question 32 - time complexity Question 33 - programming language Question 34 - net address Question 35 - time complexity |
Question 36 - java
Question 37 - discrete math Question 38 - process scheduling Question 39 - instruction sets Question 40 - static scoping Question 41 - graph theory Question 42 - sorting algo's Question 43 - MST properties Question 44 - rgb gray shading Question 45 - ripple carry adder Question 46 - loop invariant Question 47 - concurrent progs Question 48 - probabilities Question 49 - garbage collection Question 50 - caching Question 51 - time complexity Question 52 - subtype properties Question 53 - regular languages Question 54 - critical region Question 55 - logic theory Question 56 - pipeline stalls Question 57 - knapsack problem Question 58 - amdahl's law Question 59 - time complexity Question 60 - stacks and queues Question 61 - time complexity Question 62 - circuit d-flip-flops Question 63 - probabilities Question 64 - out-of-order processor Question 65 - language theory Question 66 - query optimizer Question 67 - logic theory Question 68 - probabilities Question 69 - RSA encryption Question 70 - language theory |
After all that work, it turns out the GRE Computer Science will be discontinued, effective April 2013. Bummer. But the videos of the concepts are still worthwhile.
|