📚 Topic Summary
Lists, Stacks, and Queues are fundamental data structures in computer science. A List is an ordered collection of elements allowing duplicates and access to elements by index. A Stack operates on the LIFO (Last-In, First-Out) principle, where the last element added is the first one removed. A Queue, on the other hand, follows the FIFO (First-In, First-Out) principle, similar to a waiting line. These structures offer different ways to organize and manage data, each suited for specific applications.
🧠 Part A: Vocabulary
Match the following terms with their definitions:
| Term |
Definition |
| 1. Stack |
A. A data structure where elements are added and removed from both ends. |
| 2. Queue |
B. A data structure where elements are added to the rear and removed from the front. |
| 3. List |
C. An ordered collection of elements, allowing duplicates. |
| 4. LIFO |
D. Last-In, First-Out principle. |
| 5. FIFO |
E. First-In, First-Out principle. |
✍️ Part B: Fill in the Blanks
Complete the following paragraph with the correct terms: Stack, Queue, List, LIFO, FIFO.
A ________ is a data structure that operates on the ________ principle. This means the last element added is the first one removed. Conversely, a ________ works on the ________ principle, where the first element added is the first one removed. A ________ is a general ordered collection that allows for duplicate elements and access by index.
🤔 Part C: Critical Thinking
Describe a real-world scenario where using a Queue data structure would be more appropriate than using a Stack. Explain your reasoning.