FC0-U71 Software Development Concepts Practice Question
A junior developer is learning about data structures. The developer needs to choose a data structure for the following scenarios: - Storing a list of items where order matters and items can be accessed by index. - Storing key-value pairs for fast lookups. Which TWO data structures should the developer consider?
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
✓
Dictionary
An array (or list) allows indexed access and maintains order. A dictionary (hash map) allows fast key-based lookups.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✓
Dictionary
Why this is correct
Dictionaries store key-value pairs for fast lookups.
- ✗
Tree
Why it's wrong here
Trees are hierarchical and not primarily for indexed access or key-value pairs.
- ✓
Array
Why this is correct
Arrays store items in order and allow index-based access.
- ✗
Stack
Why it's wrong here
Stacks are LIFO and not typically accessed by index.
- ✗
Queue
Why it's wrong here
Queues are FIFO and not typically accessed by index.
Go deeper
Related to this question
About these practice questions
This FC0-U71 question is part of Courseiva's 988-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 FC0-U71 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 FC0-U71 exam.