Gre Computer Science Question 56

Summary

57. A hiker faces the 0/1 Knapsack problem. There are 7 items to be packed into the knapsack, each with value vi and weight wi ... 50. Which of the following statements about caches is (are) true? I. A direct-mapped cache can have a lower miss rate than an ... the upside-down a's and backwards e's will not copy to this description. sorry. 55. What is the negation of the predicate x y p y q x ... 58. Amdahl's Law pertains to the speedup achieved when running a program on parallel processors versus using a single serial ... 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 ... 60. Suppose that stacks and queues are provided as opaque data types, offering only operations to add elements, to remove ... 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 ... 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 ... 67. Recall that a predicate logic statement is contingent if its truth value depends on the choice of the universe and on the ... 49. One garbage collection algorithm is semispace copying collection. Which of the following characteristics of garbage collection ... 31. Consider a brute-force password-guessing attack that can submit authentication requests at a rate of one every millisecond. 16. A full binary tree is a rooted tree in which every internal node has exactly two children. How many internal nodes are there in a ...