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

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. Arrays are best data structures

  • (A) for relatively permanent collections of data
  • (B) for the size of the structure and the data in the structure are constantly changing
  • (C) for both of above situation
  • (D) for none of above situation

A

Admin • 833.24K Points
Coach

Q. The disadvantage in using a circular linked list is …………………….

  • (A) it is possible to get into infinite loop.
  • (B) last node points to first node.
  • (C) time consuming
  • (D) requires more memory space

A

Admin • 833.24K Points
Coach

Q. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

  • (A) singly linked list
  • (B) circular linked list
  • (C) doubly linked list
  • (D) linear linked list

A

Admin • 833.24K Points
Coach

Q. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.

  • (A) circular queue
  • (B) random of queue
  • (C) priority
  • (D) dequeue

A

Admin • 833.24K Points
Coach

Q. In a priority queue, insertion and deletion takes place at ………………

  • (A) front, rear end
  • (B) only at rear end
  • (C) only at front end
  • (D) any position

A

Admin • 833.24K Points
Coach

Q. The time complexity of quick sort is …………..

  • (A) o(n)
  • (B) o(n2)
  • (C) o(n log n)
  • (D) o(log n)

A

Admin • 833.24K Points
Coach

Q. Which of the following is an application of stack?

  • (A) finding factorial
  • (B) tower of hanoi
  • (C) infix to postfix conversion
  • (D) all of the above

A

Admin • 833.24K Points
Coach

Q. The data structure which is one ended is ………………

  • (A) queue
  • (B) stack
  • (C) tree
  • (D) graph

A

Admin • 833.24K Points
Coach

Q. A list which displays the relationship of adjacency between elements is said to be

  • (A) linear
  • (B) non linear
  • (C) linked list
  • (D) trees

A

Admin • 833.24K Points
Coach

Q. ……………….. level is where the model becomes compatible executable code

  • (A) abstract level
  • (B) application level
  • (C) implementation level
  • (D) all of the above

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