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

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 possibility of two different keys k1 & k2 yielding the same hash address is called__________.

  • (A) merge.
  • (B) obstacle.
  • (C) overlapping.
  • (D) collision.

A

Admin • 833.24K Points
Coach

Q. Uniform distribution of the hash address throughout the given set L is __________.

  • (A) reduce the number of collision.
  • (B) increase the number of collision.
  • (C) totally avoid collision.
  • (D) manage address.

A

Admin • 833.24K Points
Coach

Q. An edge E is called _________ if it has identical endpoints.

  • (A) multiple edges.
  • (B) loops.
  • (C) finite.
  • (D) digraph.

A

Admin • 833.24K Points
Coach

Q. __________involves maintaining two tables in memory.

  • (A) Arranging.
  • (B) Bonding.
  • (C) Combing.
  • (D) Chaining.

A

Admin • 833.24K Points
Coach

Q. An _________ is a well defined list of steps for solving a problem.

  • (A) Algorithm.
  • (B) Program.
  • (C) Procedure.
  • (D) Process.

A

Admin • 833.24K Points
Coach

Q. The data items in a record form a ________ structure which can be described by means of level numbers.

  • (A) hierarchical.
  • (B) procedural.
  • (C) indexed.
  • (D) leveled.

A

Admin • 833.24K Points
Coach

Q. A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.

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

A

Admin • 833.24K Points
Coach

Q. A vertex of degree one is called __________.

  • (A) padent
  • (B) isolated vertex
  • (C) null vertex
  • (D) colored vertex

A

Admin • 833.24K Points
Coach

Q. A connected graph T without any cycles is called _____________.

  • (A) a tree graph.
  • (B) free tree.
  • (C) a tree.
  • (D) all of the above.

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) isolate.
  • (B) complete.
  • (C) finite.
  • (D) Strongly connected.

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.