Opening the paper…

Programming, Data Structures and Algorithms using Python, End Term

September 2022 term, 11 Dec 2022, Set ETD1

Learning mode

Question 1

+3−0Single correct

Select one option

A.
B.
C.
D.

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: 29

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 A BFS traversal from a source node s in an unweighted, connected and undirected graph results in a BFS tree T. The tree T is a data structure for computing\_\_\_