DA0-002 Data Analysis Practice Question
A data scientist is using K-means clustering with k=3. After the first iteration, the centroids are recalculated. Which step occurs next in the algorithm?
Answer choices
Why each option matters
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
Assign each point to the nearest centroid
In K-means, after recalculating centroids, each point is reassigned to the nearest centroid, then centroids are updated again, iterating until convergence.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✗
Calculate the sum of squared errors
Why it's wrong here
SSE may be calculated to evaluate clustering but is not the next algorithmic step.
- ✗
Stop the algorithm because k is fixed
Why it's wrong here
Algorithm continues until centroids stabilize or max iterations reached.
- ✗
Compute the elbow curve
Why it's wrong here
Elbow method is used to choose k, not during algorithm iteration.
- ✓
Assign each point to the nearest centroid
Why this is correct
After centroid update, points are reassigned based on distance.
Go deeper
Related to this question
About these practice questions
This DA0-002 question is part of Courseiva's 986-question bank — original exam-style content with full explanations and wrong-answer analysis, never real exam questions or exam dumps. Learn why practice questions differ from exam dumps →
JA
Written by Johnson Ajibi, MSc IT Security
Senior Network & Security Engineer · founder of Courseiva
This DA0-002 practice question is part of Courseiva's free CompTIA certification practice question bank. Courseiva provides original exam-style practice questions with explanations, topic-based practice, mock exams, readiness tracking, and study analytics to help learners prepare for the DA0-002 exam.