Gre Computer Science Question 43

Summary

42. An algorithm's real-time readiness (RTR) ratio is defined as the ratio of its average-case running time to its worst-case running ... 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 ... 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 ... 48. Five balls are placed randomly into four boxes, labeled A, B, C, and D. Each ball has an equal chance of being placed into any ... 47. Consider the following concurrent tasks, in which each assignment statement executes atomically. Initially, the shared ... 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, ... 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 ... 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 ... 41. Given a directed graph G V, E , it is convenient to represent the connectivity properties of G using an associated directed ...