Opening the paper…

Programming, Data Structures and Algorithms using Python, Quiz 1

May 2025 term, 13 Jul 2025, Set QDD2

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: 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 When using the **binary search algorithm** on a *sorted* list, consider the **maximum number of** **comparisons** it might take in the worst-case scenario to find an item or confirm it's absent. If the **total number of items in this sorted list is doubled**, how does this **maximum number of** **comparisons** change?