Gre Computer Science Question 64

Summary

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 ... 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 ... 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 ... 24. Let M0 , M1, M2 , . . . , be an effective enumeration of all Turing machines. Which of the following 51. A k-sorted array is a nearly sorted array in which no element is more than k locations away from its final position in the sorted ... 38. Consider three processes P1, P2, and P3 with respective arrival times of 0 ms, 10 ms, and 20 ms and respective processing ... 66. Query optimizers typically use summaries of data distributions to estimate the sizes of the intermediate tables generated ... 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 ...