Gre Computer Science Question 07

Summary

57. A hiker faces the 0/1 Knapsack problem. There are 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 ... 67. Recall that a predicate logic statement is contingent if its truth value depends on the choice of the universe and on the ... 47. Consider the following concurrent tasks, in which each assignment statement executes atomically. Initially, the shared ... 54. In order to create a good solution for the mutual exclusion problem for concurrent processes, which of the following conditions ... 53. Consider a regular language L over 0, 1 . Which of the following languages over 0, 1 must also be regular? I. the w L length of ... 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 ... 58. Amdahl's Law pertains to the speedup achieved when running a program on parallel processors versus using a single serial ... 17. Consider the following instruction sequence in a single-issue in-order 5-stage pipeline (IF, ID, EX, MEM, and WB). Opcode ... 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 ...