Bihar STET Computer Science – Data Structures & Algorithms SET-1

Questions 66-70 of 100

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

Question 66

MCQ · Single Correct 1 mark

Which algorithm computes a minimum spanning tree by repeatedly choosing the smallest edge that does not create a cycle?

Answers for question 66

Question 67

MCQ · Single Correct 1 mark

Which algorithm grows an MST by repeatedly adding the minimum-weight edge connecting the current tree to an outside vertex?

Answers for question 67

Question 68

MCQ · Single Correct 1 mark

What does a topological ordering of a DAG guarantee for every directed edge u → v?

Answers for question 68

Question 69

MCQ · Single Correct 1 mark

Which shortest-path algorithm can handle negative edge weights, provided there is no reachable negative-weight cycle?

Answers for question 69

Question 70

MCQ · Single Correct 1 mark

What is the time complexity of Floyd-Warshall for a graph with V vertices?

Answers for question 70
Scroll to Top