. 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

Consider the following array declaration and use it to answer questions 46-49:int A[4][5][6];46. What will be the total memory in bytes that is to be reserved by the machine to store the dataitems in this array:a) 580 bytesb) 680 bytes#c) 480 bytesd) 380 bytese) 280 bytes47. 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[2][3][5] if the base address is 200.a) 332b) 846c) 733# d) 532e) 63248. What will be the address of the same data item in question 47 above if the items in the arraywere stored using column-major ordering?a) 456b) 650#c) 656d) 556e) 532

. 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

Consider a two-dimensional array C[12][6] stored in row-major order. Assume there are 3 words per memory cell, the base address of array C is 300, and the first element is C[0][0].What is the address of C[9][2]?

The elements of an array are stored successively in memory cells because#a)by this way computer can keep track only the address of the first element and theaddresses of other elements can be calculatedb) the architecture of computer memory does not allow arrays to store other than seriallyc)both of aboved) because the computer memory is linearly structurede) none of the above90. The memory address of the first element of an array is calleda) floor addressb) foundation addressc)first address#d) base addresse) the index address

Interpret where the elements of an array LA are stored, if the base address of LA is 320 & LB =0Assume that int(s) are stored in 4 bytes and double(s) in 8 bytes.a. double LA[12]