Gre Computer Science Question 42

Summary

43. Which of the following properties must be true of a Minimum Spanning Tree (MST) of a connected graph G with at least 3 ... 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 ... 49. One garbage collection algorithm is semispace copying collection. Which of the following characteristics of garbage collection ... 56. Consider a single-issue processor with an in-order five-stage pipeline (IF, ID, EX, MEM, and WB) and with the following ... 40. Consider the following pseudocode program. int i main () { i = 3 S () R () } void S () { print i // prints the value of i on the current ... 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 ... 67. Recall that a predicate logic statement is contingent if its truth value depends on the choice of the universe and on the ... 50. Which of the following statements about caches is (are) true? I. A direct-mapped cache can have a lower miss rate than an ... 38. Consider three processes P1, P2, and P3 with respective arrival times of 0 ms, 10 ms, and 20 ms and respective processing ...