FC0-U71 Software Development Concepts Practice Question
A developer writes code to store a collection of employee names in a structure that allows adding names at the end and removing names from the front, following a first-in-first-out (FIFO) order. Which data structure is the developer implementing?
⚠ Common exam trap
FC0-U71 often tests the distinction between FIFO (queue) and LIFO (stack), and candidates may confuse the two when the question describes adding at one end and removing from the other.
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
✓
Queue
A queue is a linear data structure that follows First-In-First-Out (FIFO) order, where elements are added at the rear (enqueue) and removed from the front (dequeue). This exactly matches the requirement of adding names at the end and removing them from the front.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✗
Tree
Why it's wrong here
A tree stores hierarchical parent-child relationships and supports traversal, insertion and deletion by key; it enforces no FIFO ordering. It is the right structure for hierarchical data such as file systems or decision models, not for a queue with append-at-rear and remove-at-front behaviour.
- ✗
Array
Why it's wrong here
An array stores elements at fixed indices; removing from the front requires shifting every remaining element, and it enforces no FIFO ordering itself. It is tempting because arrays underpin fixed-size, index-accessed collections, which suit scenarios needing fast random reads rather than ordered insertion and removal.
- ✓
Queue
Why this is correct
A queue enforces first-in-first-out ordering: elements are appended at the rear and removed from the front, exactly matching the stem's requirement to add names at the end and remove them from the front. A stack would reverse this, removing the most recently added item instead.
- ✗
Stack
Why it's wrong here
A stack removes the most recently added item first (LIFO), so it cannot deliver the FIFO behaviour the developer needs. It is tempting because stacks are the standard structure for undo operations, expression evaluation and depth-first traversal, where last-in-first-out ordering is exactly the requirement.
Go deeper
Related to this question
About these practice questions
Courseiva writes every FC0-U71 question from scratch — 988 in total, each with an explanation and a wrong-answer breakdown. None are copied from real exams or dumps. Learn why practice questions differ from exam dumps →
JA
Written and reviewed by Johnson Ajibi, MSc IT Security
Senior Network & Security Engineer · founder of Courseiva
Last reviewed September 2026 · checked against the official CompTIA exam blueprint
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.