Opening the paper…

Algorithms for Data Science, End Term

May 2025 term, 31 Aug 2025, Set QDB1

Quiz Space

Study music

Nothing playing

Pick a song below

Volume40%

Search a song or an artist

Popular this year

Lo-fi radio stations

Or your own song: paste its YouTube link

Learning mode

Question 1

+2−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: 21

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 Consider a sample of 5 data-points for a classification problem with 3 classes. We can have at most *k* different labellings of these 5 points. What is the tightest upper bound for *k*? Figure from the original question paper