Quiz: Data structures stack and queue implementation
This set of flashcards covers the implementation of stack and queue data structures, including their definitions, operations, and applications in computer science.
Quiz(48 questions)
1. What is the primary principle that a stack operates on?
Terms in this Study Set(48)
Stack Basics(16)
What is a stack?
A stack is a linear data structure that follows the Last In First Out (LIFO) principle, meaning the last element added is the first one to be removed.
Key operations of a stack?
- Push: Add an item - Pop: Remove the top item - Peek: View the top item without removing it
True or False: A stack allows random access to its elements.
False. Stacks only allow access to the top element, following the LIFO principle.
Comparing Stack and Queue: Access order?
Stack: Last In First Out (LIFO) Queue: First In First Out (FIFO)
What does 'push' do?
Push adds an element to the top of the stack, increasing its size by one.
What does 'pop' return?
Pop returns the top element of the stack and removes it from the stack.
Fill in the blank: The _____ operation does not change the stack but shows the top element.
Peek
Example of using a stack?
Using a stack to track function calls in programming. Each call is pushed onto the stack, and completed calls are popped.
What is an empty stack?
An empty stack is a stack with no elements. It cannot perform pop or peek operations.
True or False: You can remove a bottom element without removing others in a stack.
False. You can only remove the top element in a stack.
What happens during a stack overflow?
Stack overflow occurs when too many elements are pushed onto the stack, exceeding its capacity.
Describe the stack data structure.
A stack is often implemented using arrays or linked lists, with operations limited to the top element.
Cause → Effect: Push operation followed by pop.
Push adds an element, then pop retrieves and removes the last added element.
What is 'stack underflow'?
Stack underflow occurs when a pop operation is attempted on an empty stack.
Difference between stack and array?
Stack: LIFO access Array: Random access to any element
True or False: Stacks are ideal for backtracking algorithms.
True. Stacks help remember previous states during backtracking.
Queue Fundamentals(16)
What is a queue?
A queue is a linear data structure that follows the First In, First Out (FIFO) principle. Elements are added at the back and removed from the front.
Key operations of a queue?
- Enqueue: Add an element - Dequeue: Remove an element - Peek: View the front element - IsEmpty: Check if the queue is empty
True or False: A queue allows random access.
False. A queue does not allow random access; elements can only be accessed in the order they were added.
Fill in the blank: The queue data structure is based on the _____ principle.
FIFO (First In, First Out)
What is the time complexity of enqueue?
The time complexity of enqueue operation in a queue is O(1) since it involves adding an element to the back.
Cause → Effect: What happens when you dequeue from an empty queue?
An error or exception is raised indicating that no elements are available to remove.
What is the difference between a queue and a stack?
A queue uses FIFO, while a stack uses LIFO (Last In, First Out). This affects how elements are added and removed.
Describe the peek operation.
The peek operation retrieves the front element of the queue without removing it, allowing you to check which item is next in line.
Example of enqueue operation.
If a queue contains [1, 2, 3] and you enqueue 4, the queue becomes [1, 2, 3, 4].
What is the primary use of queues?
Queues are commonly used in scenarios like scheduling, managing tasks, and handling requests in servers.
What data structure can implement a queue?
A queue can be implemented using arrays or linked lists, each having its own pros and cons.
True or False: Queues can be circular.
True. Circular queues allow for efficient use of space by connecting the end of the queue back to the front.
What do we call a queue that can grow in size?
A dynamic queue. Unlike static queues, dynamic queues can expand as needed.
Time complexity of dequeue?
The time complexity of the dequeue operation is O(1), as it simply removes the front element.
What is meant by 'queue underflow'?
Queue underflow occurs when a dequeue operation is attempted on an empty queue, leading to errors.
How do you check if a queue is empty?
You can check if the queue's size is 0 or use an isEmpty() function, returning true if it is empty.
Applications of Stacks and Queues(16)
What is a common application of stacks?
Stacks are used in function calls to maintain the order of execution and keep track of local variables.
True or False: Stacks can be used for undo mechanisms.
True. Stacks store previous states, allowing users to revert to earlier actions.
Fill in the blank: A stack is often used in ____ parsing.
syntax. It helps manage nested structures.
What data structure is used in breadth-first search?
Queues are used to explore nodes level by level.
Compare stacks and queues in terms of data access.
Stacks follow LIFO (Last In, First Out), while queues follow FIFO (First In, First Out).
What application uses queues for managing requests?
Web servers use queues to manage incoming requests efficiently.
Describe how stacks assist in backtracking.
Stacks track previous states, allowing the algorithm to return to prior positions easily.
True or False: Queues are ideal for scheduling tasks.
True. Queues help manage tasks in the order they arrive.
What is an example of a stack in a programming language?
Programming languages use call stacks to manage function calls and returns.
List two features of queues in real-time applications.
- Task scheduling - Print job management
How do stacks help in expression evaluation?
Stacks are used to evaluate postfix (RPN) and infix expressions by managing operators and operands.
What role do queues play in handling customer service?
Queues manage customers as they arrive, ensuring they are served in the order they enter.
Fill in the blank: Stacks are essential for ____ algorithms.
recursive. They maintain state during recursive calls.
What is a real-world example of a stack?
Browser history allows users to navigate back through recently visited pages.
Name a common data structure used in message passing.
Queues are often used to handle messages between processes or threads.
Cause of using stacks in programming?
They provide a simple way to manage function calls and memory.
Questions in this Study Set(48)
1. What is the primary principle that a stack operates on?
2. What does FIFO stand for in the context of queues?
3. What is a primary application of stacks in programming?
4. Which operation would you use to add an element to a stack?
5. Which operation adds an element to a queue?
6. True or False: Stacks can be utilized to implement backtracking algorithms.
7. What does the 'Peek' operation do in a stack?
8. What will happen if you try to dequeue from an empty queue?
9. Fill in the blank: A queue is commonly used in ____ management systems.
10. In what scenario would you experience a stack overflow?
11. Which of the following is NOT a common operation of a queue?
12. What data structure is primarily used for depth-first search?
13. Which of the following statements is true regarding stacks?
14. What is the primary purpose of a queue in computing?
15. How do stacks compare to queues in terms of data retrieval?
16. What happens during a stack underflow?
17. How can you determine if a queue is empty?
18. Which application relies on queues for managing tasks?
19. What is one way stacks are commonly used in programming?
20. In what scenario is a circular queue particularly useful?
21. What is the role of a stack in expression evaluation?
22. Which of the following is NOT a characteristic of a stack?
23. What is the time complexity of the dequeue operation?
24. True or False: Queues are suitable for implementing a priority scheduling algorithm.
25. What is the result of performing a pop operation on an empty stack?
26. Which of the following describes the peek operation?
27. Which scenario is NOT a typical use case for stacks?
28. How does a stack compare to a queue in terms of access order?
29. What is queue underflow?
30. How do queues function in customer service systems?
31. If you push three elements onto a stack and then pop two, how many elements remain in the stack?
32. What distinguishes a queue from a stack?
33. Fill in the blank: Stacks are essential for ____ algorithms, as they keep track of execution states.
34. Which operation would you use to remove the top element of a stack?
35. Which data structures can be used to implement a queue?
36. What is a common example of a queue in everyday applications?
37. Why are stacks useful in backtracking algorithms?
38. What is a dynamic queue?
39. Which of the following is a reason for using stacks in programming?
40. What type of data structure is a stack commonly implemented with?
41. What is the effect of enqueueing an element when the queue is full?
42. Which data structure is commonly used for inter-process communication?
43. Which of the following operations does not change the contents of the stack?
44. What is the expected time complexity of the isEmpty() operation?
45. How do stacks assist in maintaining history in applications?
46. Which of the following best describes the stack data structure?
47. What happens to the order of elements in a queue when you dequeue an element?
48. Which of the following is NOT an application of queues?
Related Study Sets
Informatyka studia – Algorytmy i struktury danych
Hashing Kollisionsauflösung Prüfungsfragen
Minimaler Spannbaum Kruskal Prim Klausurvorbereitung
AVL-Bäume Rotationen Klausurvorbereitung
Sortieren einfach erklärt Karteikarten
Breitensuche und Tiefensuche Definitionen
Heap und Heapsort Karteikarten
Mergesort und Quicksort Laufzeit Definitionen
Create Your Own Study Set
Upload a PDF, paste your notes, or describe a topic – AI generates flashcards, quizzes and more in seconds.
