Gre Computer Science Question 30

Summary

31. Consider a brute-force password-guessing attack that can submit authentication requests at a rate of one every millisecond. 50. Which of the following statements about caches is (are) true? I. A direct-mapped cache can have a lower miss rate than an ... 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 ... 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 ... the upside-down a's and backwards e's will not copy to this description. sorry. 55. What is the negation of the predicate x y p y q x ... 33. Which of the following typically occurs when a procedure call is executed on a processor? I. Program counter is updated. II. 57. A hiker faces the 0/1 Knapsack problem. There are 7 items to be packed into the knapsack, each with value vi and weight wi ... 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 ... 21. Consider the following binary search tree. Starting from an empty binary search tree, the insertion of which of the following ... 28. Which of the following statements about positive integers is NOT true? (A) If x is a composite integer, then x has a prime divisor ... 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 ... 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 ...