Opening the paper…

Programming, Data Structures and Algorithms using Python, Quiz 2

September 2023 term, 3 Dec 2023, Set QDD2

Learning mode

Question 1

+3−0Single correct

Select one option

A.
a, b, c, d, e
B.
a, b, c, e, d
C.
a, b, d, c, e
D.
a, b, d, e, c

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 Let G = (V, E) be an undirected graph having distinct positive edge weights. Let V be partitioned into two non-empty sets X and Y. Let e = (s, t) be the minimum cost edge, with s belonging to X and t belonging to Y. Which of the following statement(s) is/are true?\ 1\. The edge e must belong to each path from s to t.\ 2\. The edge e must belong to the minimum cost spanning tree of G. Figure from the original question paper