Gre Computer Science Question 44

Summary

47. Consider the following concurrent tasks, in which each assignment statement executes atomically. Initially, the shared ... 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 ... 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 ... 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 ... 49. One garbage collection algorithm is semispace copying collection. Which of the following characteristics of garbage collection ... 50. Which of the following statements about caches is (are) true? I. A direct-mapped cache can have a lower miss rate than an ... 24. Let M0 , M1, M2 , . . . , be an effective enumeration of all Turing machines. Which of the following 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 ... 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 ... 22. Consider a relational database schema with the following instance of a relation R A, B, C . A B C 1 1 2 1 2 2 1 3 4 Assuming ... 66. Query optimizers typically use summaries of data distributions to estimate the sizes of the intermediate tables generated ...