Gre Computer Science Question 65

Summary

See also (NFA to DFA): youtube.com/watch?v=KSKJQ0c5QsE 66. Query optimizers typically use summaries of data distributions to estimate the sizes of the intermediate tables generated ... 64. Consider the following instruction sequence for a hypothetical RISC processor. T. U. V. W. X. Y. Z. R1 R2 R3 R4 R5 R6 R5 ... 59. Let T n be defined by T 0 T 1 4 and 2 4 T n T n T n cn for all integers n 2, where c is a positive constant. What is the asymptotic ... 70. If L1 is a decidable language and L2 is an undecidable language, then L1 L2 , the union of L1 and L2 , is (A) possibly finite ... 50. Which of the following statements about caches is (are) true? I. A direct-mapped cache can have a lower miss rate than an ... 49. One garbage collection algorithm is semispace copying collection. Which of the following characteristics of garbage collection ... 69. Suppose that in RSA encryption, the public encryption key is the pair e, n 3, 55 and the private decryption key is the pair d, n d, ... 46. Consider the following pseudocode fragment. i = 0; j = 0; k = 0; while (i less-than 10 and j less-than 10) { if (A[i] greater-than ... 68. In the graph below, each edge label represents the probability that the connection between its endpoints is working. If these ... 45. If the delay through a single-bit adder is 3 (measured in gate delays) to the sum output and 2 to the carry output, what is the ... 63. An algorithm takes a list of 2n numbers 1 2 2 a , a , , a n and replaces it with 1 2 1 2 b , b , , b n , where b1 max a1, a2 , b2 max ... 43. Which of the following properties must be true of a Minimum Spanning Tree (MST) of a connected graph G with at least 3 ...