A GRE computer science test practice book, containing: actual tests; complete instructions and answer sheets; answers; score comparison data; and test-taking . Discover ideas about Computer Science. GRE - Computer Science Test Practice Book. Computer ScienceComputer Technology. More information. Saved by. The Computer Science test is primarily based on the concepts that you have studied in your undergraduate days but you can not ignore preparing for it.

Author: | GLADY ROBATEAU |

Language: | English, Spanish, Dutch |

Country: | France |

Genre: | Environment |

Pages: | 301 |

Published (Last): | 22.09.2015 |

ISBN: | 517-4-28939-563-3 |

ePub File Size: | 23.61 MB |

PDF File Size: | 8.47 MB |

Distribution: | Free* [*Register to download] |

Downloads: | 37949 |

Uploaded by: | VERLENE |

GRE G r a d u a t e R e c o r d E x a m i n a t i o n s® Computer Science Test Practice Book This practice book contains n one actual, full-length GRE® Computer. PRACTICE. BOOK. This practice book contains one actual full-length GRE. Computer Science Test test-taking strategies. Become familiar with test structure and. Science Test. Practice Book. This practice book contains one actual full-length GRE Computer Science Test test-taking strategies. Become familiar with.

To browse Academia. Skip to main content. You're using an out-of-date version of Internet Explorer. Log In Sign Up. Ahmed Ayoub.

In a finite automaton diagram, states are represented by circles, with final or accepting states indicated by two concentric circles. An arc from state s to state t labeled a indicates a transition from s to t on input a. A label a b indicates that this transition produces an output b. A label a1, a2 , Unless otherwise stated, concurrent programs execute on a platform in which shared memory is not cached, assignment statements execute atomically, and the scheduling algorithm is fair, but no other assumptions are made.

The following mechanisms are used to control concurrency: The operation returns 0 in the child process and 1 in the parent process. For a semaphore s: A binary semaphore is a semaphore restricted to have a value of either 0 or 1, with an initial value of 1. A mutual exclusion lock m, with accompanying lock m and unlock m operations, is synonymous with a binary semaphore.

A loop invariant for a while statement while B do S is an assertion that is true each time the guard B is evaluated during execution of the while statement. Then go to the back cover of the test book page 50 and follow the instructions for completing the identifica- tion areas of the answer sheet. When you are ready to begin the test, note the time and begin marking your answers on the answer sheet.

The contents of this test are confidential. Disclosure or reproduction of any portion of it is prohibited. A B is the set of all elements that are in A or in B or in both; A B is the set of all elements that are in both A and B; A B is the set of all elements in A that are not in B; A is the set of all elements not in A that are in some specified universal set; A is the cardinality of A.

In a string expression, if S and T denote strings or sets of strings, then: In a grammar: Unless otherwise specified, i symbols appearing on the left-hand side of productions are nonterminal symbols; the remaining symbols are terminal symbols; ii the leftmost symbol of the first production is the start symbol; and iii the start symbol is permitted to appear on the right-hand side of productions.

Binary tree traversal is defined recursively as follows. Each of the questions or incomplete statements below is followed by five suggested answers or comple- tions. Select the one that is the best of the choices offered and then mark the corresponding space on the answer sheet. Consider the following pseudocode of the recursive function goAgain. What will be the values of the remaining elements in the array after one delete-max operation from the heap?

A [7, 4, 2, 6, 1, 3] B [7, 4, 6, 2, 1, 3] C [7, 4, 6, 2, 3, 1] D [7, 6, 4, 2, 1, 3] E [7, 6, 4, 2, 3, 1] Unauthorized copying or reuse of any part of this page is illegal.

Assume that any n-bit positive integer x is stored as a linked list of bits so that the first element of the list is the least significant bit.

For example, x 14 is stored as the linked list 0, 1, 1, 1 of size n 4.

Consider the following nondeterministic finite state automaton over alphabet x, y with start state S. Which of the following is the regular expression corresponding to the automaton above?

Which of the following grammars over alphabet x, y generates the language recognized by the automaton above? Consider the following function. A privileged instruction may be executed only while the hardware is in kernel mode.

Which data structure would be most appropriate to implement a collection of values with the following three characteristics? A researcher is preparing a questionnaire with 6 questions. A programmer is designing a data structure to collate the responses to this questionnaire.

The programmer decides to use a base structure containing 6 memory locations, one for each question.

What will be the number of entries in the array? Consider the following truth table and implementation. The line labeled S is correct. The line labeled T is correct. The line labeled U is correct. Which of the following statements is are necessarily true? A polynomial-time algorithm for A implies P NP.

A polynomial-time algorithm for B implies P NP. A polynomial-time algorithm for A implies a polynomial-time algorithm for B. Which of the following are the design paradigms used by these algorithms? Consider the following pseudocode.

Which of the following is the most appropriate data structure to store the symbol table of a compiler? A software requirements specification is I. A full binary tree is a rooted tree in which every internal node has exactly two children. How many internal nodes are there in a full binary tree with leaves? Suppose that Professor X develops a new model of computation, called a neutron machine.

Which of the following would be a consequence of the Church-Turing thesis? A No neutron machine can solve the Traveling Salesman problem in polynomial time. B No neutron machine can solve the Maximum Matching problem for bipartite graphs in polynomial time.

C No neutron machine can determine whether the decimal expansion of has 7 consecutive 7s. D No neutron machine can simulate a given Turing machine in polynomial time. E No neutron machine can determine in polynomial time whether a given Turing machine halts when its input tape is initially blank. Unauthorized copying or reuse of any part of this page is illegal.

Consider the following pseudocode in which all variables are integers and m 1. Consider the following page reference string: Consider the following binary search tree.

Starting from an empty binary search tree, the insertion of which of the following sequences of integer keys could produce the binary tree above? A 5, 9, 1, 7, 3, 4 B 5, 7, 4, 9, 3, 1 C 5, 4, 7, 3, 9, 1 D 5, 3, 4, 9, 1, 7 E 5, 3, 1, 7, 9, 4 Unauthorized copying or reuse of any part of this page is illegal.

Consider a relational database schema with the following instance of a relation R A, B, C. A C III. A computer memory system has a 64KB byte-addressable main memory with bit addresses. This same system has a one-level cache memory that can hold 16 blocks of data, where each block contains 16 bytes. Assuming this is a direct-mapped cache, to which cache block will main memory address 9A map?

Which of the following problems is are decidable? Given a natural number n, does M n starting with an empty tape halt in fewer than n steps?

Given a natural number n, does M n starting with an empty tape halt in exactly n steps? Given a natural number n, does M n starting with an empty tape halt after at least n steps? Consider the pseudocode block below. Assume that the variables x and y are integers.

Which of the following best describes the difference between paging and segmentation? B Paging suffers from external fragmentation, whereas segmentation suffers from internal fragmentation. C Paging requires page tables for address translation, whereas segmentation does not require segment tables for address translation. D Paging requires one page table per process, whereas segmentation requires only one global segment table for the entire system.

E Page tables are typically very small, whereas segment tables are always very large.

Consider the following two fragments of Java programs. A For all x, y, and z, P1 x, y, z and P2 x, y, z have the same behavior. B For all x and y, there exists z such that P1 x, y, z and P2 x, y, z behave differently. C For all x and z, there exists y such that P1 x, y, z and P2 x, y, z behave differently. D For all y and z, there exists x such that P1 x, y, z and P2 x, y, z behave differently.

E For all x, y, and z, P1 x, y, z and P2 x, y, z behave differently. Which of the following statements about positive integers is NOT true? A If x is a composite integer, then x has a prime divisor less than or equal to the square root of x.

B There are infinitely many prime integers. C Integers a and b are congruent modulo m if and only if there is an integer k such that a b km. D If a divides bc, then either a divides b or a divides c. E If a divides b and b divides c, then a divides c. Any pair of adjacent nodes are within range of each other, and nonadjacent nodes do not interfere. If the link bandwidth is L bits per second for successful transmissions and reliable transmission is desired, what is the maximum possible total bandwidth attainable for this network, in bits per second?

Consider the following directed graph. Which of the following is a topological sort of the nodes of the graph? A 5, 7, 10, 13, 14, 17, 20, 30 B 10, 5, 13, 14, 7, 30, 17, 20 C 10, 5, 13, 17, 20, 14, 7, 30 D 10, 5, 20, 13, 17, 30, 14, 7 E 10, 20, 5, 17, 13, 14, 7, 30 Unauthorized copying or reuse of any part of this page is illegal.

Consider a brute-force password-guessing attack that can submit authentication requests at a rate of one every millisecond.

Assume that a password consists of 1—6 characters from a symbol alphabet. In the average case, approximately how many seconds would it take to determine the password using this type of attack?

A B C D 1, E 1, Consider the following two problems. Nearest Neighbors: Given an unsorted array of n floating-point numbers as input, return two of the numbers that are closest in value to each other.

Farthest Neighbors: Given an unsorted array of n floating-point numbers as input, return two of the numbers that are farthest in value from each other. Further assume that each allowed operation has unit cost. What are the worst-case optimal asymptotic running times for algorithms that solve the two problems?

Which of the following typically occurs when a procedure call is executed on a processor? Program counter is updated. Stack pointer is updated. Data cache is flushed to avoid aliasing problems. The routing table below uses the longest prefix match in its routing decisions. Next Hop to Next Hop to Consider a recursive algorithm for sorting an array of n 2 integers that works as follows.

What is the asymptotic running time complexity of this algorithm measured in terms of the number of comparisons made? Consider the following Java code. A For all x, y, and z, P1 x, y, z and P2 x, y, z have the same behavior. B For all x and y, there exists z such that P1 x, y, z and P2 x, y, z behave differently.

C For all x and z, there exists y such that P1 x, y, z and P2 x, y, z behave differently. D For all y and z, there exists x such that P1 x, y, z and P2 x, y, z behave differently.

E For all x, y, and z, P1 x, y, z and P2 x, y, z behave differently. Which of the following statements about positive integers is NOT true? A If x is a composite integer, then x has a prime divisor less than or equal to the square root of x.

B There are infinitely many prime integers. C Integers a and b are congruent modulo m if and only if there is an integer k such that a b km. D If a divides bc, then either a divides b or a divides c.

E If a divides b and b divides c, then a divides c. Any pair of adjacent nodes are within range of each other, and nonadjacent nodes do not interfere. If the link bandwidth is L bits per second for successful transmissions and reliable transmission is desired, what is the maximum possible total bandwidth attainable for this network, in bits per second?

Candidates should contact graduate schools of choice to determine which, if any, of the GRE subject tests should be taken. The Scoring Process In calculating reported scores for traditional paper-and-pencil tests, the number of questions answered correctly is adjusted according to the difficulty level of the questions on the test form. Thus, the same number of correct responses on different test forms will not necessarily result in the same reported score.

In paper-and-pencil tests, the differences in difficulty among test forms are relatively small and are adjusted through a process known as score equating.

The number of questions answered is also figured into the calculation of the reported score because it limits the number that can be answered correctly. Scoring of the Subject Tests is a two-step process. First, a raw score is computed. The raw score is the number of questions you answered correctly minus one-fourth the number of questions you answered incorrectly.

The raw score is then converted to a scaled score through a process known as equating that accounts for differences in difficulty among the different test editions. Thus, a given scaled score reflects approximately the same level of ability regardless of the edition of the test that was taken.

- BLACKBERRY ADDRESS BOOK TO COMPUTER
- PRACTICAL PHOTOSHOP MAGAZINE PDF
- BRIAN GREENE THE HIDDEN REALITY EPUB
- INTRODUCTION TO COMPUTER BY SHELLY CASHMAN PDF
- MR GREY LIBRO PDF
- LOGICAL REASONING TEST PDF
- COMPUTER AIDED DESIGN AND MANUFACTURING EBOOK
- 50 SHADES OF GREY PDF FOR IPHONE
- ZENOS CONSCIENCE PDF
- KINGSLEY AMIS LUCKY JIM PDF