Bihar STET Computer Science – Data Structures & Algorithms Set 2

Questions 36-40 of 100

0% completed (0/100 answered)
Your score 0/100 0 answered
Correct 0 Incorrect 0 Unanswered 100 Accuracy 0%

Question 36

MCQ · Single Correct 1 mark

Topological Sorting can be applied to which type of graph structure?

Answers for question 36

Question 37

MCQ · Single Correct 1 mark

Which algorithm finds All-Pairs Shortest Paths in a weighted graph using dynamic programming?

Answers for question 37

Question 38

MCQ · Single Correct 1 mark

Which shortest path algorithm handles negative edge weights and detects negative weight cycles?

Answers for question 38

Question 39

MCQ · Single Correct 1 mark

Which Minimum Spanning Tree (MST) algorithm uses a Disjoint Set Union (DSU) data structure to detect cycles?

Answers for question 39

Question 40

MCQ · Single Correct 1 mark

Prim's Minimum Spanning Tree algorithm operates greedily by growing a tree from a starting vertex using a:

Answers for question 40
Scroll to Top