Gre Computer Science Question 60

Summary

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 ... See also (NFA to DFA): youtube.com/watch?v=KSKJQ0c5QsE 65. Consider the following three statements. 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 ... 50. Which of the following statements about caches is (are) true? I. A direct-mapped cache can have a lower miss rate than an ... 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, ... 20. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1 Assuming there are 4 page frames ... 49. One garbage collection algorithm is semispace copying collection. Which of the following characteristics of garbage collection ... 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 ... 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 ... 47. Consider the following concurrent tasks, in which each assignment statement executes atomically. Initially, the shared ...