Gre Computer Science Question 61

Summary

62. The Fibonacci sequence Fn is defined by F1 1, F2 1, and Fn Fn 2 Fn 1 for all integers n 3. What is the minimal number of D ... 60. Suppose that stacks and queues are provided as opaque data types, offering only operations to add elements, to remove ... 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 ... 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 ... 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 ... 25. Consider the pseudocode block below. Assume that the variables x and y are integers. // Precondition: ???? x x + y y x - y x x ... 54. In order to create a good solution for the mutual exclusion problem for concurrent processes, which of the following conditions ... 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, ... 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 ...