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

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. Which of the following statement is false ?

  • (A) Arrays are dense lists and static data structure
  • (B) Data elements in linked list need not be stored in adjacent space in memory
  • (C) Pointers store the next data element of a list
  • (D) Linked lists are collection of the nodes that contain information part and next pointer

A

Admin • 833.24K Points
Coach

Q. Binary search algorithm cannot be applied to

  • (A) Sorted binary trees
  • (B) Sorted linear array
  • (C) Pointer array
  • (D) Sorted linked list

A

Admin • 833.24K Points
Coach

Q. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called

  • (A) Housefull
  • (B) Saturated
  • (C) Underflow
  • (D) Overflow

A

Admin • 833.24K Points
Coach

Q. The situation when in a linked list START=NULL is

  • (A) Underflow
  • (B) Overflow
  • (C) Housefull
  • (D) Saturated

A

Admin • 833.24K Points
Coach

Q. The following is two-way list

  • (A) Grounded header list
  • (B) Circular header list
  • (C) Linked list with header and trailer nodes
  • (D) None of above

A

Admin • 833.24K Points
Coach

Q. The following name does not relate to stacks

  • (A) FIFO lists
  • (B) LIFO list
  • (C) Piles
  • (D) Push-down lists

A

Admin • 833.24K Points
Coach

Q. In a binary tree, certain null entries are re- placed by special pointers which point to nodes higher in tree for efficiency. These special pointers are called

  • (A) Leaf
  • (B) Branch
  • (C) Path
  • (D) Thread

A

Admin • 833.24K Points
Coach

Q. In a graph if e=(u, v) means

  • (A) e begins at u and ends at v
  • (B) u is processor and v is successor
  • (C) both B and C are true
  • (D) none is true

A

Admin • 833.24K Points
Coach

Q. If every node u in G is adjacent to every other node v in G, A graph is said to be

  • (A) Isolated
  • (B) Complete
  • (C) Finite
  • (D) Strongly connected

A

Admin • 833.24K Points
Coach

Q. A variable P is called pointer if

  • (A) P points to the address of first element in DATA
  • (B) P can store only memory addresses
  • (C) P contain the DATA and the address of DATA
  • (D) P contains the address of an element in DATA.

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.