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

Here, you will find a collection of MCQ questions on Data Structure and Algorithms (DSA). Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 833.24K Points
Coach

Q. The following data structure allows deleting data elements from front and inserting at rear

  • (A) Stacks
  • (B) Queues
  • (C) Deques
  • (D) Binary search tree

A

Admin • 833.24K Points
Coach

Q. This data structure allows deletions at both ends of the list but insertion at only one end.

  • (A) Input-restricted deque
  • (B) Output-restricted deque
  • (C) Priority queues
  • (D) None of the above

A

Admin • 833.24K Points
Coach

Q. The following data structure is non-linear type

  • (A) Strings
  • (B) Lists
  • (C) Stacks
  • (D) None of the above

A

Admin • 833.24K Points
Coach

Q. The following data structure is linear type

  • (A) Strings
  • (B) Lists
  • (C) Queues
  • (D) All of the above

A

Admin • 833.24K Points
Coach

Q. To represent hierarchical relationship be- tween elements, the following data structure is not suitable

  • (A) Deque
  • (B) Priority
  • (C) Tree
  • (D) All of above

A

Admin • 833.24K Points
Coach

Q. A binary tree whose every node has either zero or two children is called

  • (A) Complete binary tree
  • (B) Binary search tree
  • (C) Extended binary tree
  • (D) None of above

A

Admin • 833.24K Points
Coach

Q. The depth of a complete binary tree is given by

  • (A) Dn = n log2n
  • (B) Dn = n log2n+1
  • (C) Dn = log2n
  • (D) Dn = log2n+1

A

Admin • 833.24K Points
Coach

Q. The complexity of Binary search algorithm is

  • (A) O(n)
  • (B) O(log )
  • (C) O(n log n)
  • (D) None of the above

A

Admin • 833.24K Points
Coach

Q. The complexity of Bubble sort algorithm is

  • (A) O(n)
  • (B) O (n2)
  • (C) O(n log n)
  • (D) None of the above

A

Admin • 833.24K Points
Coach

Q. When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return

  • (A) FAEKCDBHG
  • (B) FAEKCDHGB
  • (C) EAFKHDCBG
  • (D) FEAKDCHBG

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.