Opening the paper…

Mathematics for Data Science I, End Term

May 2024 term, 1 Sept 2024, Set QDF1

Learning mode

Question 1

+4−0Multiple correct

Which of the following is (are) correct?

Select all that apply

Select all that apply.

A.
Floyd-Warshall algorithm is used for all pair shortest paths.
B.
The Shortest path problem is not applicable to a graph with a negative weight cycle.
C.
Bellman-Ford algorithm is used for single source shortest path.
D.
Dijkstra’s algorithm is used for all pair shortest paths.

Report a problem

to report a problem with this question.

Choose a question

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 15

Discussion

Submit this paper?

You cannot change your answers after submitting.

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 2

Instructions

The palette shows the status of every question. Pick a number to go straight to it.

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 2

Save & Next moves to the next question. Answers are saved as you go.
Mark for Review & Next flags the question to come back to. A flagged answer still counts.
Clear Response removes your answer to the question on screen.
The ← and → keys move to the previous and next question.

Which of the following is (are) correct? Consider the following adjacency matrix | | $A$ | $B$ | $C$ | $D$ | $E$ | |---|---|---|---|---|---| | $A$ | 0 | 1 | 0 | 1 | 1 | | $B$ | 1 | 0 | 1 | 0 | 1 | | $C$ | 0 | 1 | 0 | 0 | 1 | | $D$ | 1 | 0 | 0 | 0 | 1 | | $E$ | 1 | 1 | 1 | 1 | 0 | which represents graph $G$ which has 5 vertices $A, B, C, D$ and $E$. Which of the following is true about the graph $G$? Figure from the original question paper