Virtual Labs

1. What is the main advantage of using a linked-list implementation of a stack over an array implementation?

a: Pushing into the stack is always faster in a linked-list implementation Explanation

Explanation

b: Popping from the stack is always faster in a linked-list implementation Explanation

Explanation

c: A linked-list implementation can grow dynamically without a fixed array capacity Explanation

Explanation

d: A linked-list implementation never requires additional memory Explanation

Explanation

2. Insertion and deletion operations in a Queue and Stack are known as respectively:

a: Enqueue and Dequeue; Push and Pop Explanation

Explanation

b: Push and Pop; Enqueue and Dequeue Explanation

Explanation

c: Pop and Push; Dequeue and Enqueue Explanation

Explanation

d: Dequeue and Enqueue; Pop and Push Explanation

Explanation

3. What is the time complexity of popping an element from a stack and dequeuing an element from a queue in standard implementations?

O(n)

and

O(1)

Explanation

O(1)

and

O(n)

Explanation

O(1)

and

O(1)

Explanation

O(n)

and

O(n)

Explanation

4. Which of the following is commonly used to implement a priority queue efficiently?

a: Heap Explanation

Explanation

b: Unordered array only Explanation

Explanation

c: Linnked List Explanation

Explanation

d: Stack Explanation

Explanation

5. What happens when a pop operation is performed on an empty stack?

a: Stack overflow Explanation

Explanation

b: Stack underflow Explanation

Explanation

c: Queue overflow Explanation

Explanation

d: The stack automatically creates an element Explanation

Explanation

6. What happens when an insertion is attempted in a full fixed-size array-based queue?

a: Queue overflow Explanation

Explanation

b: Queue underflow Explanation

Explanation

c: Stack overflow Explanation

Explanation

d: The oldest element is always deleted automatically Explanation

Explanation

7. A stack contains 10, 20, and 30 from bottom to top. If pop() is performed twice and then push(40) is performed, what is the final stack from bottom to top?

a: 10, 40 Explanation

Explanation

b: 40, 10 Explanation

Explanation

c: 10, 20, 40 Explanation

Explanation

d: 30, 20, 40 Explanation

Explanation

8. A queue contains 15, 25, and 35 from front to rear. After dequeue() and enqueue(45), which element is at the front?

a: 15 Explanation

Explanation

b: 25 Explanation

Explanation

c: 35 Explanation

Explanation

d: 45 Explanation

Explanation

9. Which application is most directly associated with using a stack?

a: Scheduling requests in their arrival order Explanation

Explanation

b: Managing function calls and returns during program execution Explanation

Explanation

c: Serving customers strictly in arrival order Explanation

Explanation

d: Processing packets according to a FIFO service policy Explanation

Explanation

Stacks and Queues