A sorted list of numbers contains 500 elements. Which of the following is closest to the maximum number of list elements that will be examined when performing a binary search for a value in the list?

If a list of elements is already sorted in ascending order, how many comparisons are needed in the worst-case scenario to find an element using Binary Search?

What is the maximum number of comparisons necessary when performing a binary search of100,000 items?a) 13b) 14c) 15d) 16# e) 17

Let's say we are performing a binary search on the list [3, 7, 8, 11, 23, 48, 52, 65] to look for the number 8. What numbers would 8 be compared to determine it is in the list?Question 29Select one:65, 23, 8cross out3, 7, 8cross out23, 8cross out11, 7, 8

What is the maximum number of comparisons required to find an element in a sorted array of size 31 using Binary Search?4567

. If the machine is to store the data items in this array using row-major ordering, what will be theaddress location of an item located at A[0][0][0] if the base address is 1000.a) 1081b) 1078c) 1243#d) 1000e) 103450. What is the maximum number of comparisons necessary when performing a binary search of100,000 items?a) 13b) 14c) 15d) 16# e) 1751. On average, how many items must be moved to delete an item from an unsortedarray with N items?#a) N/2b) N/4c) N/6d) N/8e) N/1052. On average, how many items must be moved to insert a new item into an unsortedarray with N items?a) N/2b) N/4c) N/6d) N/8#e) None53. On average, how many items must be examined to find a particular item in anunsorted array with N items?#a) N/2b) N/4c) N/6d) N/8e) N/1054. Which of the following statements is true:#a) Stacks and queues restrict access to certain datab) Arrays are more often used as programmer’s toolsc) Arrays are more abstract,being defined by their interfaced) Stacks are FIFO data structurese) The line of people waiting at the bank is an example of a stack55. If there’s only one item in a stack, the bottom of the stack is the same as the top.a)False#b)True56. The OS of a computer may periodically collect all the free memory space to form contiguousblock of free space. This is called(A) Concatenation#(B) Garbage collection(C) Collision(D) Dynamic Memory Allocation(E)Disk cleaner57. The complexity of multiplying two matrices of order m*n and n*p is#(A) mnp(B) mp(C) mn(D) np(E)pnm58. A linear list of elements in which deletion can be done from one end (front) and insertion cantake place only at the other end (rear) is known as a#(A)queue(B)stack(C) trees(D)linkedlist(E)array59. Consider a linked list of n elements. What is the time taken to insert an element after an elementpointed by some pointer?#(A) O (1)(B) O ( n log2)(C) O (n)(D) O ( n log n 2)(E)O(2)60. The smallest element of an array’s index is called its# (A) lower bound.(B) upper bound.(C) range.(D) extraction.(E)size61. In a circular linked list(A) components are all linked together in some sequential manner.#(B) there is no beginning and no end.(C) components are arranged hierarchically.(D) forward and backward traversal within the list is permitted.(E) none of the above62. The data structure required for Breadth First Traversal on a graph is# (A) queue(B) stack(C) array(D) tree(E) linkedlist63. In a linked list with n nodes, the time taken to insert an element after an element pointed by somepointer is# (A) 0 (1)(B) 0 (log n)(C) 0 (n)(D) 0 (n 1og n)(E) O(nlog2n)64. The data structure required to evaluate a postfix expression is(A) queue# (B) stack(C) array