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

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. In a graph G if e=(u,v), then u and v are called ___________.

  • (A) endpoints.
  • (B) adjacent nodes.
  • (C) neighbours.
  • (D) all of the above.

A

Admin • 833.24K Points
Coach

Q. Which of the following is true while inserting a new node in the list?

  • (A) Check there is node in the list.
  • (B) Check in the free node in the pool.
  • (C) There is no node.
  • (D) Underflow.

A

Admin • 833.24K Points
Coach

Q. Which of the following data structures are indexed structures?

  • (A) Linear arrays.
  • (B) Linked lists.
  • (C) Arrays.
  • (D) First address.

A

Admin • 833.24K Points
Coach

Q. The efficiency of a BFS algorithm is dependent on _______.

  • (A) Algorithm.
  • (B) Tree.
  • (C) Problem.
  • (D) Graph.

A

Admin • 833.24K Points
Coach

Q. The average number of key comparisons done in a successful sequential search in a list of length n is ____________.

  • (A) log n.
  • (B) n-1/2.
  • (C) n/2.
  • (D) n+1/2.

A

Admin • 833.24K Points
Coach

Q. Divide and conquer is an important algorithm design paradigm based on _______.

  • (A) multi-branched recursion.
  • (B) single-branched recursion.
  • (C) two-way recursion.
  • (D) None.

A

Admin • 833.24K Points
Coach

Q. The correctness of a divide and conquer algorithm is usually proved by _________.

  • (A) mathematical theorem.
  • (B) de-Morgan `s law.
  • (C) mathematical induction.
  • (D) none.

A

Admin • 833.24K Points
Coach

Q. The ____________ is used in an elegant sorting algorithm.

  • (A) Heap sort.
  • (B) Quick sort.
  • (C) Merge sort.
  • (D) Radix sort.

A

Admin • 833.24K Points
Coach

Q. ____________ is finding a path/tour through the graph such that every vertex is visited exactly once.

  • (A) Travelling Salesman tour.
  • (B) Eulerian tour.
  • (C) Hamiltonian tour.
  • (D) None.

A

Admin • 833.24K Points
Coach

Q. ____________ data structure is used to implement Depth First search.

  • (A) Array.
  • (B) Linked list.
  • (C) Queue.
  • (D) Stack.

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.