Stacks And Queues

What is a stack?

• A data structure that follows a last-in, first-out (LIFO) order
• A data structure that follows a first-in, first-out (FIFO) order
• A data structure that follows a random order
• A data structure that follows a sorted order
• A data structure that follows a reverse-sorted order

What is a queue?

• A data structure that follows a first-in, first-out (FIFO) order
• A data structure that follows a last-in, first-out (LIFO) order
• A data structure that follows a random order
• A data structure that follows a sorted order
• A data structure that follows a reverse-sorted order

Which data structure is more suitable for implementing a print spooler?

• Queue
• Stack
• Tree
• Graph
• Array

Which operation adds an element to the top of a stack?

• Push
• Pop
• Enqueue
• Dequeue
• Peek

Which operation removes an element from the top of a stack?

• Pop
• Push
• Enqueue
• Dequeue
• Peek

Which operation adds an element to the back of a queue?

• Enqueue
• Dequeue
• Push
• Pop
• Peek

Which operation removes an element from the front of a queue?

• Dequeue
• Enqueue
• Push
• Pop
• Peek

What is the time complexity of adding an element to a stack?

• O(1)
• O(n)
• O(log n)
• O(n log n)
• O(n^2)

What is the time complexity of removing an element from a stack?

• O(1)
• O(n)
• O(log n)
• O(n log n)
• O(n^2)

What is the time complexity of adding an element to a queue?

• O(1)
• O(n)
• O(log n)
• O(n log n)
• O(n^2)