bags

32. Consider the following two problems. Nearest Neighbors: Given an unsorted array of n floating-point numbers as input, return two of the numbers that are closest in value to each other. Farthest Neighbors: Given an unsorted array of n floating-point numbers as input, return two of the numbers that are farthest in value from each other. Assume that the only operations allowed on the data are • comparing the values of two entries in the array and identifying the larger value; • comparing the distance between two array entries (the absolute value of the difference between the two array entries) with the distance between two other array entries; • swapping two entries in the array. Further assume that each allowed operation has unit cost. What are the worst-case optimal asymptotic running times for algorithms that solve the two problems? Nearest Neighbors Farthest Neighbors (A) Theta(n log n) Theta(n) (B) Theta(n log n) Theta(n log n) © Theta(n^2) Theta(n) (D) Theta(n^2) Theta(n log n) (E) Theta(n^2) Theta(n^2) How to solve this? Ans :A

Hi All, Does anyone have ETS practice booklet published in 2007.If someone have it please reply.

67. Recall that a predicate logic statement is contingent if its truth value depends on the choice of the universe and on the interpretations of the predicate symbol S and the constant symbol b involved. Consider the following predicate logic statements in which b, x, and y are elements of the universe U. I. x S x, b y S x, y II. x y S x, y y x S x, y III. x S x, x S b, x Which of the following best describes the predicate logic statements? Statement I Statement II Statement III (A) Always true Always false Contingent (B) Always true Contingent Always false © Always true Contingent Contingent (D) Contingent Always true Always false (E) Contingent Always true Always true Where to find this concept?

Solve following Question: One approach to handling fuzzy logic data might be to design a computer using ternary (base-3) logic so that data could be stored as “true,” “false,” and “unknown.” If each ternary logic element is called a flit, how many flits are required to represent at least 256 different values? (A) 4 (B) 5 © 6 (D) 7 (E) 8 How to solve this problem? Ans: c

@sajid How are you preparing?What material you are using?

Hi all, Is anyone preparing for November 2011 GRE CS?