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?
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 follows FIFO order: elements are added at the rear and removed 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 is a hierarchical structure, not FIFO.
- ✗
Array
Why it's wrong here
An array is a fixed-size collection, not inherently FIFO.
- ✓
Queue
Why this is correct
A queue operates on FIFO principle.
- ✗
Stack
Why it's wrong here
A stack follows LIFO (last-in-first-out) order.
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 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.