Opening the paper…

Programming, Data Structures and Algorithms using Python, Quiz 2

May 2024 term, 4 Aug 2024, Set QDD2

Learning mode

Question 1

+4−0Single correct

Select one option

A.
A, C, F, B, E, D
B.
A, C, F, B, D, E
C.
A, C, B, F, E, D
D.
A, C, B, F, D, E

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.

Figure from the original question paper Figure from the original question paper Consider a directed graph **G** with equal edge weights. Which of the following algorithms is **most** **efficient** to compute the shortest distance between every pair of nodes in **G**?