1.. Theworsto aseoccurinlinearsearch algorithmwhen A. Item is somewhere in the middle of the B. Item is not in the array at all C. Item is the last element in the array D, Item is the last element in the array or is not there at all -2. Afin tesetofstatementsthat?? guarantees an optimal solution in finite interval of time is A. Data structure B. Solution C. Plan D. Algorithm 3. Which of the following is not a limitation of binary4. The complexity of Binary search search algorithm? A. must use a sorted array B. requirement of sorted array is expensive when a lot of algorithm is A. O(n) B. O(log n) C. O(n2) D. O(n log n) IS insertion and deletions are needed C. there must be a mechanism to access middle element directly f D. binary search algorithm is not efficient when the data elements are more than 1000. 6. Traversing a doubly linked list can 5. Linked lists are best suited A. for relatively permanent collections of data B. for the size of the structure and the data in the structure be done are constantly changing for both of above situation for none of above situation A. At any point in the list. B. From the top of the list C. From either end of the list D. None of the above C. D. s. A variable P is called pointer if A. P contains the address of an element in form of access is used to add remove nodes from a stack. ?.LIFO B. FIFC C. Both A and B D. None of these DATA P points to the address of first element in DATA B. C. P can store only memory addresses D. P contain the DATA and the address of DATA 10. The complexity of merge sort 9. The complexity of Bubble sort algorithm is algorithm is A. O(n) B. O(log n) C. O(n) D. O(n log n) O(n) B. O(log n) C. O(n2) D. O(n log n)