Opening the paper…

Programming, Data Structures and Algorithms using Python, Quiz 2

January 2025 term, 16 Mar 2025, Set QDD2

Learning mode

Question 1

+3−0Single correct

Select one option

A.
P R T S U Q V
B.
P R T S Q U V
C.
P R T U S V Q
D.
P R T S U V Q

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

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

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 What is the minimum and maximum number of nodes possible in AVL Trees with height **9**? Assume that the height of the empty tree is 0.