Data Structure and Algorithms (DSA) MCQs with answers Page - 1

Dear candidates you will find MCQ questions of Data Structure and Algorithms (DSA) here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.
Share your questions by clicking Add Question

A

Admin • 617.67K Points
Coach

Q. Which of the following data structures are indexed structures

  • (A) linear arrays
  • (B) linked lists
  • (C) both of above
  • (D) none of above

A

Admin • 617.67K Points
Coach

Q. Which of the following is not the required condition for binary search algorithm

  • (A) there must be mechanism to delete and/ or insert elements in list
  • (B) the list must be sorted
  • (C) there should be the direct access to the middle element in any sublist
  • (D) none of the above

A

Admin • 617.67K Points
Coach

Q. 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 expen- sive when a lot of insertion and dele- tions are needed
  • (D) there must be a mechanism to access middle element directly

A

Admin • 617.67K Points
Coach

Q. Two dimensional arrays are also called

  • (A) tables arrays
  • (B) matrix arrays
  • (C) both of the above
  • (D) none of the above

A

Admin • 617.67K Points
Coach

Q. The term “push” and “pop” is related to the

  • (A) Array
  • (B) Lists
  • (C) stacks
  • (D) all of above

A

Admin • 617.67K Points
Coach

Q. 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

A

Admin • 617.67K Points
Coach

Q. The following sorting algorithm is of divide- and-conquer type

  • (A) Bubble sort
  • (B) Insertion sort
  • (C) Quick sort
  • (D) None of the above

A

Admin • 617.67K Points
Coach

Q. An algorithm that calls itself directly or indi- rectly is known as

  • (A) Recursion
  • (B) Polish notation
  • (C) Traversal algorithm
  • (D) None of the above

A

Admin • 617.67K Points
Coach

Q. The elements of an array are stored suc- cessively 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

A

Admin • 617.67K Points
Coach

Q. The memory address of the first element of an array is called

  • (A) base address
  • (B) floor address
  • (C) foundation address
  • (D) first address

Browse Categories

Click on category to learn MCQs of that category.