Gre Computer Science Question 24

Summary

25. Consider the pseudocode block below. Assume that the variables x and y are integers. // Precondition: ???? x x + y y x - y x x ... 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 ... 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 ... 17. Consider the following instruction sequence in a single-issue in-order 5-stage pipeline (IF, ID, EX, MEM, and WB). Opcode ... 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 ... 26. Which of the following best describes the difference between paging and segmentation? (A) Paging breaks a process' virtual ... 16. A full binary tree is a rooted tree in which every internal node has exactly two children. How many internal nodes are there in a ... 58. Amdahl's Law pertains to the speedup achieved when running a program on parallel processors versus using a single serial ... 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 ... 39. Which of the following statements about fixed-length and variable-length instruction set architectures (ISAs) is (are) true?