Gre Computer Science Question 31

Summary

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 ... 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 ... 30. Consider the following directed graph. Which of the following is a topological sort of the nodes of the graph? (A) 5, 7, 10, 13, ... 20. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1 Assuming there are 4 page frames ... 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 ... 39. Which of the following statements about fixed-length and variable-length instruction set architectures (ISAs) is (are) true? 60. Suppose that stacks and queues are provided as opaque data types, offering only operations to add elements, to remove ... 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 ...