Virtual Labs

4. Which of the following data structures works on the principle of First In, First Out (FIFO)?

a: Stack Explanation

Explanation

b: Queue Explanation

Explanation

c: Tree Explanation

Explanation

d: Graph Explanation

Explanation

1. What are the strategies or principles used in Stacks and Queues?

a: LILO and FILO Explanation

Explanation

b: FILO and LILO Explanation

Explanation

c: FIFO and LIFO Explanation

Explanation

d: LIFO and FIFO Explanation

Explanation

2. In a standard linked implementation, how many primary reference pointers are typically used for a stack and a queue?

a: 1 and 2 Explanation

Explanation

b: 2 and 1 Explanation

Explanation

c: Depends only on the number of elements Explanation

Explanation

d: The number cannot be determined Explanation

Explanation

3. How many queues are needed to implement a stack when no other data structure, such as an array or linked list, is available?

a: 1 Explanation

Explanation

b: 2 Explanation

Explanation

c: 3 Explanation

Explanation

d: 4 Explanation

Explanation

4. Which operation adds an element to a stack?

a: Enqueue Explanation

Explanation

b: Dequeue Explanation

Explanation

c: Push Explanation

Explanation

d: Peek Explanation

Explanation

5. Which operation removes an element from a stack?

a: Pop Explanation

Explanation

b: Push Explanation

Explanation

c: Enqueue Explanation

Explanation

d: Rear Explanation

Explanation

6. If a stack contains 5, 8, and 12 from bottom to top, which sequence of operations removes 12 first and then 8?

a: dequeue(), dequeue() Explanation

Explanation

b: pop(), pop() Explanation

Explanation

c: push(12), push(8) Explanation

Explanation

d: enqueue(12), enqueue(8) Explanation

Explanation

7. A queue initially contains A, B, and C from front to rear. If D is enqueued and two dequeue operations are performed, what remains from front to rear?

a: A, B Explanation

Explanation

b: B, C Explanation

Explanation

c: C, D Explanation

Explanation

d: D, C Explanation

Explanation

8. Why is a queue generally preferred over a stack when requests must be processed in the same order in which they arrive?

a: A queue follows FIFO ordering Explanation

Explanation

b: A queue automatically sorts requests Explanation

Explanation

c: A queue always uses less memory than a stack Explanation

Explanation

d: A queue provides random access to every request Explanation

Explanation

9. Which statement correctly distinguishes a stack from a queue?

a: A stack inserts at the rear and a queue inserts at the top Explanation

Explanation

b: A stack uses LIFO ordering while a queue uses FIFO ordering Explanation

Explanation

c: A stack and queue both always remove the oldest element Explanation

Explanation

d: A stack uses FIFO ordering while a queue uses LIFO ordering Explanation

Explanation