1. A hash function converts a search key into an integer called a(n) a. hash function b. hash code c. search index d. ideal number 2. Finding an unused location in the hash table is called a. open addressing b. hash searching c. Separate Chaining d. Collision e. Linear probing Given the following infix expression, which one of the following is the corresponding postfix expression? (a+b) (c-d)/(e+ 3. a. abed+ ef+ b. abcdef+. c ab+cd-ef+ d. none of the above 4 In an adjacency matrix, each row and each column corresponds to a. an edge in the graph b. both a &b c. a vertex in the graph d. none of the above matrix, you can determine if an edge exists between any In a graph represented by an adjacency two given vertices in operations. 5. b. O(n) c. O(log n) d, 0(n) 6. Which one of the following is considered a safe and secure programming practice? a. making no assumptions about the actions of clients and users b. using @SupressWarning Cunchecked") c. adding the comments and headers of the public methods to the class by copying them from the interface all of the above d. 7. Using the evaluatePostfix algorithm, evaluate the following postfix expression ab cd-. Assume that a = 5, b=7. c 6, and d 2. a. 39 b. 48 c. 55 d. none of the above activation records than the allocated When too many recursive calls are made creating more program memory can handle, what kind of error occurs? 8. a. b. c. recursive overflow activation record overflow stack overflow