PDA

View Full Version : GRE Computer Science



Pages : [1] 2 3 4 5

  1. Introduction
  2. question 32 ETS practice book
  3. question 61 Practice book
  4. Need info on best resources
  5. Helpful Links
  6. Good score?
  7. the worth of the cs subject test
  8. Previous GRE CS guides
  9. Books/materials for GRE Computer Science Test
  10. Computer Science GRE Study Guide
  11. question number 1
  12. ETS Book online
  13. Universal Logic Gate
  14. Question 21 - ETS GRE CS Prep Guide
  15. recommended reference material
  16. From Schaum's OS
  17. From Schaum's OS (2)
  18. From Schaum's OS (3)
  19. From Schaum's OS (4)
  20. From Schaum's OS (5)
  21. From Schaum's OS (6)
  22. From Schaum's OS (7)
  23. From Schaum's OS (8)
  24. Basic Identities Of Boolean Algebra
  25. Monitors
  26. Processes ( Round Robin )
  27. CPU Effeciency
  28. Mean Turnaround time
  29. Aging
  30. Modern OS chap 2, Q 23
  31. SAFE Schools
  32. PHD in CS- please advise!!
  33. Networks
  34. Question 25
  35. From Schaum's Comp. Arch (1)
  36. From Schaum's Comp. Arch (2)
  37. Timing on GRE CS
  38. From Official Guide (#64)
  39. Looking for GRE CS preparation book
  40. From Schaum's Os (6)
  41. Question 49
  42. Best book for section 3 (automata/sorting)
  43. From Schaum's Os (6)
  44. Prog Language Concepts (Activation Record)
  45. Prog Language Concepts
  46. Link to GRE CS PRACTICE TEST SOLVED
  47. Link to few practice questions (MFT Exam) (Also Discuss Prob
  48. Context Free Grammer
  49. Data Structures(doubt) - Tenenbaum -Sorting
  50. Computer Theory
  51. Schaum's Computer Architecture
  52. Validity period of the Subject Test
  53. The GRE advanced test in computer science
  54. terminal masters programs
  55. Formal Languages (grammar)
  56. Compiler (Which grammer is better)
  57. Formal Languages (grammar) - tricky
  58. Formal Languages (grammar) - easy
  59. GRE Practice Test Q 52 - Sort Run Time wrt Input Ordering
  60. Food for Theoritical Thought !!
  61. nice introduction to sequential circuits
  62. Floating point numbers question
  63. K-ary tree
  64. Ban on subject test?
  65. Compilers/automata tutorial
  66. Cryptography
  67. Data File # Average Comparisons
  68. Circuits
  69. Floating-point computation of
  70. Languages
  71. Bound -> polynomial ?
  72. Regular Language Exercise
  73. Comp Arch (Hennessy & Patterson)
  74. Comp Arch (Hennessy & Patterson) - Cache
  75. Regular expressions (Hopcroft)
  76. Some Sadistic Regular Expressions
  77. Tightest Bounds in Distinguishable States
  78. Question 67 - ETS GRE CS Prep Guide
  79. parallel computing NC
  80. parallel computing sync rendezvous
  81. parallel computing SISD, SIMD, MISD, MIMD
  82. parallel computing - links
  83. Comp Arch (Hennessy & Patterson) - Multiproc Speedup
  84. Comp. Arch (Hennessy & Patterson) - Multiproc Speedup 2
  85. Algorithm analysis
  86. More Recurrence Problems
  87. I need more info
  88. Question
  89. Ques - OS -Virtual Memory
  90. Data Structure Question
  91. Comp. Arch (Hennessy & Patterson) - Multiproc Exec Time
  92. What do this functions do??
  93. The "spoons" problem
  94. Graphs
  95. deadlock
  96. linear programming
  97. 2 Questions from ets sample '99
  98. More question
  99. Comp. Arch (Hennessy & Patterson) - Disk Access
  100. Complexity
  101. Theory Ques
  102. Sorting Complexity
  103. Useful links
  104. Hashing
  105. Hashing Question!
  106. Combinatorix problems
  107. From Shaum's OS (4)
  108. Automata
  109. too late for Nov.8 but Dec... New GRE CS
  110. RISC vs CISC Pipelining among others
  111. Theory ques 2
  112. Binary Tree
  113. Why Quicksort average-case is close to its best-case?
  114. to test your CFG skills
  115. Advanced Algorithm Design Techniques
  116. Level of practice test
  117. build an LR(0) parser
  118. benefits of pipelining, multi-cycle architecture
  119. size of page table
  120. job scheduling
  121. file/database structure
  122. ECC
  123. Question 51 on test book ???
  124. Cache/Page replacement algorithm
  125. Networking
  126. Disk scheduling
  127. Doubt about Compilers !!
  128. Networking 2
  129. Kernel/User parts in UNIX
  130. UNIX i-node
  131. Distributed Systems
  132. Automata mind twisting stuff
  133. What is a glocal variable? (Thread)
  134. Eliminate immediate/inderect left recursion
  135. More theory stuff
  136. Topic 1D - Software engineering?
  137. 64-bit and bus
  138. routing protocols
  139. Memory compaction
  140. block linkage system
  141. symmetric and asymmetric operating systems
  142. network file systems
  143. banker's algorithm
  144. 2-phase commit
  145. LR parsing
  146. to allow programs to be loaded into memory in any location
  147. Simple transaction question
  148. Binomial Heaps
  149. Software engineering
  150. networking frame headers
  151. Need advice
  152. prime numbers, modulo arithmetic
  153. sieve of erastothenes
  154. Theory problems
  155. closure
  156. resource consumption
  157. Some questions
  158. "optimizations"
  159. Question 11 revisited just confused
  160. nervous.....
  161. page replacement
  162. variables, variables, variables
  163. compilers vs interpreters
  164. Question 9
  165. invariants
  166. cost of context switches
  167. Question 24
  168. threads and semaphores
  169. An interesting question
  170. OS questions <- new quest
  171. new question
  172. Sync. problem
  173. Matrix multiplication (Quest 39 CS GRE prep)
  174. two questions
  175. If anyone want Mishra's book "Automata, Language ..."
  176. finding the zero
  177. K graphs
  178. disk scheduling
  179. reentrant
  180. one's complement
  181. Signed binary numbers
  182. Binary Trees
  183. BNF question
  184. counting problem
  185. Bipartite Graphs
  186. Relative Error
  187. Contrapositive
  188. AI
  189. Summations
  190. Poker - Combinations
  191. Prime Numbers
  192. Parameter passing
  193. what does this do (1)
  194. what does this do (2)
  195. what does this do (3)
  196. what does this do (4)
  197. what does this do (6)
  198. famous algorithm
  199. run-time
  200. during the evaluation of...
  201. graphs and coloring
  202. Shaum's Outline (5)
  203. Recurrence
  204. Hello everyone and a question
  205. Another question about RSA?
  206. Could anybody help me?
  207. Type of Graphs
  208. ne alternative for pumping lemma???
  209. Traveling Salesman Problem (TSP)
  210. fun with karnaugh maps
  211. construct a boolean function
  212. three ways to write the following
  213. conversions
  214. pre/post fix
  215. order of operations
  216. tree traversal
  217. faults
  218. more recursions, by popular (Alba's) demand
  219. one more runtime
  220. Theoretical Computer Science Cheat Sheet
  221. Do you understand param. pass <- more (2)
  222. Static/Dynamic Scope
  223. Logarithmic Properties
  224. Exp
  225. Write a theta(n*log n) algorithm
  226. Min value in unordered array
  227. Sorting Algorithms - Stable/Unstable
  228. YARQ (Yet Another Recurrence Question)
  229. Graph and Combinatorics
  230. ADT Languages
  231. Formal Specifications
  232. Genetic Algorithms (AI)
  233. Safe Typed Languages
  234. Basic Collection Schemes
  235. Virtual Function Tables
  236. what sort is this?
  237. Conversions...
  238. Exceptions / Continuations
  239. First-class Functions
  240. Method Invocations
  241. Garbage Collector
  242. What is printed
  243. Overflow
  244. Hexidecimal conversion to 1 an 0's
  245. bipartite
  246. Inheritances
  247. Are the Qs in increasing order of difficulty??
  248. Preparation for the subject GRE
  249. Digital Logic... great ques
  250. Digital Logic... great ques part 2