Data structure and algorithm MCQ’s Chapter 03

Posted by

Data structure and algorithm MCQ’s with answers. With 100% free PDF Download

41. Which of the following is not a limitation of binary search algorithm ?
(A) binary search algorithm is not efficient when the data elements are more than 1000.
(B) must use a sorted array
(C) requirement of sorted array is expensive when a lot of insertion and deletions are needed
(D) there must be a mechanism to access middle element directly

42. Two dimensional arrays are also called
(A) tables arrays
(B) matrix arrays
(C) both of the above
(D) none of the above

43. The term “push” and “pop” is related to the
(A) Array
(B) Lists
(C) stacks
(D) all of above

44. A data structure where elements can be added or removed at either end but not in the middle is referred as
(A) Linked lists
(B) Stacks
(C) Queues
(D) Deque

45. The following sorting algorithm is of divideand-conquer type
(A) Bubble sort
(B) Insertion sort
(C) Quick sort
(D) None of the above

46. An algorithm that calls itself directly or indirectly is known as
(A) Recursion
(B) Polish notation
(C) Traversal algorithm
(D) None of the above

47. 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 the addresses of other elements can be calculated
(B) the architecture of computer memory does not allow arrays to store other than serially
(C) A and B both false
(D) A and B both true

48. The memory address of the first element of an array is called
(A) base address
(B) floor address
(C) foundation address
(D) first address

49. The memory address of fifth element of an array can be calculated by the formula
(A) LOC(Array[5])=Base(Array[5])+(5-lower boun(D), where w is the number of words per memory cell for the array
(B) LOC(Array[5])=Base(Array[4])+(5-Upper boun(D), where w is the number of words per memory cell for the array
(C) LOC(Array[5]=Base(Array)+w(5-lower boun(D), where w is the number of words per memory cell for the array
(D) None of the above

50. The following data structure can’t store the non-homogeneous data elements
(A) Arrays
(B) Records
(C) Pointers
(D) None of the above

51. The in order traversal of tree will yield a sorted listing of elements of tree in
(A) Binary trees
(B) Binary search trees
(C) Heaps
(D) None of above

52. In a Heap tree values in a node is greater than
(A) every value in left sub tree and smaller than right sub tree
(B) every value in children of it
(C) Both of above conditions are true
(D) None of above conditions are true

53. In a graph if e=[u, v], Then u and v are called
(A) endpoints of e
(B) adjacent nodes
(C) neighbors
(D) all of the above

54. A connected graph T without any cycles is called
(A) tree graph
(B) free tree
(C) tree
(D) All of the above

55. The difference between linear array and a record is
(A) An array is suitable for homogeneous data but hte data items in a record may have different data type
(B) In a record, there may not be a natural ordering in opposed to linear array.
(C) A record form a hierarchical structure but a linear array does not
(D) All of above

56. The following data structure store the homogeneous data elements
(A) Arrays
(B) Records
(C) Pointers
(D) None of the above

57. Which of the following data structure is not linear data structure?
(A) Arrays
(B) Linked lists
(C) A and B are true
(D) None is true


Answer Sheet:   41. (A) 42. (C) 43. (C) 44. (D) 45. (B)
46. (A) 47. (A) 48. (A) 49. (C) 50. (A)
51. (B) 52. (B) 53. (D) 54. (D) 55. (D)
56. (B) 57. (C)