DATA STRUCTURE AND ALGORITHM DESIGN Question

1. Which one of the following is an application of Stack Data Structure? a. Managing function calls b. The stock span problem Arithmetic expression evaluation d. All of the above 2. In what manner is a state-space tree for a backtracking algorithm constructed? a. Breadth First Search b. Depth First Search C. First Come First Serve d. Nearest Neighbour First 3. What is the Breadth-First order of the nodes? H F B a. L,K,A,J,B,C,1,H,E,D,F,G b. A,B,C,J,K,1,D,E,F,G,H,L. c. L,K,1,H,A,J,E,F,G,B,C,D d. L, K, I, H, A, J, B, C, E, F, G, D 4. Which of the following points is/are true about Linked-List data structure when it is compared with array? a. Arrays have better cache locality that can make them better in terms of performance. b. It is easy to insert and delete elements in Linked List C. Random access is not allowed in a typical implementation of Linked Lists d. The size of array has to be pre-decided, linked lists can change their size any time. e. All of the above