Gre Computer Science Question 47

Summary

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 ... 49. One garbage collection algorithm is semispace copying collection. Which of the following characteristics of garbage collection ... 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 ... 26. Which of the following best describes the difference between paging and segmentation? (A) Paging breaks a process' virtual ... 37. A hash function h maps 16-bit inputs to 8-bit hash values. What is the largest k such that in any set of 1000 inputs, there are at ... 53. Consider a regular language L over 0, 1 . Which of the following languages over 0, 1 must also be regular? I. the w L length of ... 54. In order to create a good solution for the mutual exclusion problem for concurrent processes, which of the following conditions ... 35. Consider a recursive algorithm for sorting an array of n 2 integers that works as follows. (a) If there are only 2 elements to be ... 38. Consider three processes P1, P2, and P3 with respective arrival times of 0 ms, 10 ms, and 20 ms and respective processing ... 50. Which of the following statements about caches is (are) true? I. A direct-mapped cache can have a lower miss rate than an ...