Gre Computer Science Question 41

Summary

42. An algorithm's real-time readiness (RTR) ratio is defined as the ratio of its average-case running time to its worst-case running ... 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 ... 50. Which of the following statements about caches is (are) true? I. A direct-mapped cache can have a lower miss rate than an ... 56. Consider a single-issue processor with an in-order five-stage pipeline (IF, ID, EX, MEM, and WB) and with the following ... 45. If the delay through a single-bit adder is 3 (measured in gate delays) to the sum output and 2 to the carry output, what is the ... 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 ... 47. Consider the following concurrent tasks, in which each assignment statement executes atomically. Initially, the shared ... 19. Consider the following pseudocode in which all variables are integers and m 1. Pseudocode I sum = 0 for i = 1 to m sum = sum ... 54. In order to create a good solution for the mutual exclusion problem for concurrent processes, which of the following conditions ... 17. Consider the following instruction sequence in a single-issue in-order 5-stage pipeline (IF, ID, EX, MEM, and WB). Opcode ... 24. Let M0 , M1, M2 , . . . , be an effective enumeration of all Turing machines. Which of the following 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 ...