- A
Z-score standardization
Why wrong: Z-score is better for algorithms assuming Gaussian distribution, not mandatory for distance-based.
- B
Min-max normalization
Min-max normalization ensures all features contribute equally to distance calculations.
- C
No transformation needed
Why wrong: k-NN is sensitive to scale; transformation is necessary.
- D
Log transformation
Why wrong: Log transformation is for reducing skewness, not scaling.
Question 660 of 1,000
DA0-001 Analysing Data Practice Question
This DA0-001 practice question tests your understanding of analysing data. Read the scenario carefully and evaluate each option against the stated constraints before committing to an answer. After answering, compare your reasoning against the explanation and wrong-answer breakdown below. Once you have made your selection, read the full explanation to reinforce the concept and understand why each distractor is designed to mislead on exam day.
A dataset contains a feature 'Age' with values ranging from 18 to 95. To prepare data for a k-nearest neighbors algorithm, which transformation should be applied to 'Age'?
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
✓
Min-max normalization
Min-max normalization scales features to a fixed range (e.g., 0-1), which is appropriate for distance-based algorithms like k-NN.
Key principle: OSPF neighbour adjacency depends on matching area, hello/dead timers, network type, and authentication — IP reachability alone is not enough.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✗
Z-score standardization
Why it's wrong here
Z-score is better for algorithms assuming Gaussian distribution, not mandatory for distance-based.
- ✓
Min-max normalization
- ✗
No transformation needed
Why it's wrong here
k-NN is sensitive to scale; transformation is necessary.
- ✗
Log transformation
Why it's wrong here
Log transformation is for reducing skewness, not scaling.
Common exam traps
Common exam trap: OSPF can fail even when IP connectivity looks correct
OSPF neighbour formation depends on matching areas, timers, network type, authentication and passive-interface behaviour. Do not choose an answer only because the devices can ping.
Detailed technical explanation
How to think about this question
OSPF questions usually test the details that control adjacency and route selection. Read the neighbour state, area, router ID and interface configuration before deciding what is wrong.
KKey Concepts to Remember
- OSPF neighbours must agree on key parameters.
- Router ID selection can affect neighbour relationships and LSDB output.
- OSPF cost influences the preferred path.
- A route can appear in OSPF information but not become the installed route.
TExam Day Tips
- Check area mismatch first when OSPF adjacency fails.
- Review passive interfaces when a network is advertised but no neighbour forms.
- Use show ip ospf neighbor and show ip route clues carefully.
Key takeaway
OSPF neighbour adjacency depends on matching area, hello/dead timers, network type, and authentication — IP reachability alone is not enough.
Real-world example
How this comes up in practice
A network engineer at a university connects two campus buildings via a fibre link. Both routers run OSPF, but no adjacency forms — even though both routers can ping each other. The engineer finds one router is in area 0 and the other in area 1. OSPF adjacency requires matching area numbers, hello/dead timers, and network type. IP reachability alone is not enough.
What to study next
Got this wrong? Here's your next step.
Review OSPF neighbour requirements — matching area type, hello and dead timers, network type, stub flags, and authentication. Study show ip ospf neighbor states (INIT, 2-WAY, FULL). Then practise related DA0-001 OSPF questions on adjacency and route selection.
- →
Analysing Data — study guide chapter
Learn the concepts, then practise the questions
- →
Analysing Data practice questions
Targeted practice on this topic area only
- →
All DA0-001 questions
1,000 questions across all exam domains
- →
CompTIA Data+ DA0-001 study guide
Full concept coverage aligned to exam objectives
- →
DA0-001 practice test guide
How to use practice tests most effectively before exam day
Related practice questions
Related DA0-001 practice-question pages
Use these pages to review the topic behind this question. This is how one missed question becomes focused revision.
Data Concepts and Environments practice questions
Practise DA0-001 questions linked to Data Concepts and Environments.
Analysing Data practice questions
Practise DA0-001 questions linked to Analysing Data.
Visualising Data practice questions
Practise DA0-001 questions linked to Visualising Data.
Reporting Insights practice questions
Practise DA0-001 questions linked to Reporting Insights.
Mining Data practice questions
Practise DA0-001 questions linked to Mining Data.
Comparing and Contrasting Data Concepts practice questions
Practise DA0-001 questions linked to Comparing and Contrasting Data Concepts.
Mining and Acquiring Data practice questions
Practise DA0-001 questions linked to Mining and Acquiring Data.
Analyzing and Modeling Data practice questions
Practise DA0-001 questions linked to Analyzing and Modeling Data.
Visualizing Data practice questions
Practise DA0-001 questions linked to Visualizing Data.
Communicating Data Insights practice questions
Practise DA0-001 questions linked to Communicating Data Insights.
CompTIA A+ hardware practice questions
Practise DA0-001 questions linked to CompTIA A+ hardware.
CompTIA A+ mobile devices practice questions
Practise DA0-001 questions linked to CompTIA A+ mobile devices.
Practice this exam
Start a free DA0-001 practice session
Short sessions build daily habit. Longer sessions build exam-day stamina. Try a timed session to simulate real conditions.
FAQ
Questions learners often ask
What does this DA0-001 question test?
Analysing Data — This question tests Analysing Data — OSPF neighbours must agree on key parameters..
What is the correct answer to this question?
The correct answer is: Min-max normalization — Min-max normalization scales features to a fixed range (e.g., 0-1), which is appropriate for distance-based algorithms like k-NN.
What should I do if I get this DA0-001 question wrong?
Review OSPF neighbour requirements — matching area type, hello and dead timers, network type, stub flags, and authentication. Study show ip ospf neighbor states (INIT, 2-WAY, FULL). Then practise related DA0-001 OSPF questions on adjacency and route selection.
What is the key concept behind this question?
OSPF neighbours must agree on key parameters.
About these practice questions
Courseiva creates original exam-style practice questions with explanations and wrong-answer analysis. It does not publish real exam questions, exam dumps, or protected exam content. Learn why practice questions differ from exam dumps →
Last reviewed: Jul 4, 2026
This DA0-001 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-001 exam.
Question Discussion
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
Sign in to join the discussion.