boris/G4G0-2
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

vault backup: 2025-03-16 18:59:42

Browse Source
This commit is contained in:
boris
2025-03-16 18:59:42 +00:00
parent 6befcc90d4
commit ae837183f1
188 changed files with 17794 additions and 409 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
Data Structures/GPT Answers to Past Paper/Question 2.md
View File

@@ -1,6 +1,7 @@
# Describe a scenario where a stack data structure would be more suitable than a Queue
# Describe a Scenario where a Stack Data Structure Would Be More Suitable than a Queue
A **stack data structure** is more suitable than a queue in scenarios where you need to process items in a **Last-In, First-Out (LIFO)** order
### Scenario: **Undo Operation in Text Editors**
- **Description**: In text editors, when a user types, deletes, or performs other actions, these operations are stored so they can be undone in reverse order of execution.
@@ -36,5 +37,5 @@ A **stack data structure** is more suitable than a queue in scenarios where you
- A **queue** is more suitable when processing items in a **First-In, First-Out (FIFO)** order, such as serving customer requests or scheduling tasks.
- A stack is better when you need **reversal** or to **process the most recent element first**, such as undo operations, recursion, or browser backtracking.
Describe a scenario where a stack data structure would be more suitable than a
Queue
Describe a scenario where a stack data structure would be more suitable than a
Queue