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

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 linked list the _________field contains the address of next element in the list.

  • (A) Link field.
  • (B) Next element field.
  • (C) Start field.
  • (D) Info field .

A

Admin • 833.24K Points
Coach

Q. A list that has no nodes is called________.

  • (A) End list.
  • (B) Zero list.
  • (C) Null list.
  • (D) Sentinel list.

A

Admin • 833.24K Points
Coach

Q. The special list which consists of unused memory space is called __________.

  • (A) Free space.
  • (B) Empty space.
  • (C) Available space.
  • (D) Free storage list.

A

Admin • 833.24K Points
Coach

Q. The efficient searching algorithm for algorithm for a sorted array is _________.

  • (A) Binary search.
  • (B) Linear search.
  • (C) Indexed search.
  • (D) Repeated search.

A

Admin • 833.24K Points
Coach

Q. To insert a new node in linked list free node will be available in ___________.

  • (A) Available list.
  • (B) Avail list.
  • (C) Free node list.
  • (D) Memory space list.

A

Admin • 833.24K Points
Coach

Q. A ______________ list is a header list where the node points back to the header node.

  • (A) Circular header.
  • (B) Grounded header.
  • (C) Two way header.
  • (D) One way header.

A

Admin • 833.24K Points
Coach

Q. How many pointers are necessarily changed for the insertion in a Linked List?

  • (A) 1.
  • (B) 2.
  • (C) 3.
  • (D) 5.

A

Admin • 833.24K Points
Coach

Q. An algorithm that calls itself directly or indirectly is known as ____________.

  • (A) Sub algorithm. .
  • (B) Recursion.
  • (C) Polish notation.
  • (D) Traversal algorithm.

A

Admin • 833.24K Points
Coach

Q. If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.

  • (A) 2
  • (B) 100
  • (C) 17
  • (D) none

A

Admin • 833.24K Points
Coach

Q. An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of

  • (A) O(n*n*logn)
  • (B) O(n*logn)
  • (C) O(n*n)
  • (D) O(n *logn *logn)

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.