Question 8 of 9intermediate🔧 ApplyShort Answer4 marks

Show the status of deque after each operation peek() insertFront(12) insertRear(67) deletionFront() insertRear(43) deletionRear() deletionFront() deletionRear()

Correct Answer

Initial Status: Empty Deque []

  1. peek(): Deque is empty, prints "Queue underflow". Status: []

  2. insertFront(12): Inserts 12 at front. Status: [12]

  3. insertRear(67): Inserts 67 at rear. Status: [12, 67]

  4. deletionFront(): Removes 12 from front. Status: [67]

  5. insertRear(43): Inserts 43 at rear. Status: [67, 43]

  6. deletionRear(): Removes 43 from rear. Status: [67]

  7. deletionFront(): Removes 67 from front. Status: []

  8. deletionRear(): Deque is empty, prints "Queue underflow". Status: []

Exercise: EXERCISE | Q: 7 | (Page 14)
For More Understanding

Explanation

This question tests understanding of deque operations. A deque allows insertion and deletion at both ends. peek() reads front without removing. insertFront() adds at front using insert(0, element). insertRear() adds at rear using append(). deletionFront() removes from front, and deletionRear() removes from rear using pop(). When deque is empty, deletion operations cause underflow.

Solution Steps

  1. Step 1: Start with empty deque []

  2. Step 2: peek() on empty deque - underflow, status: []

  3. Step 3: insertFront(12) - status: [12]

  4. Step 4: insertRear(67) - status: [12, 67]

  5. Step 5: deletionFront() removes 12 - status: [67]

  6. Step 6: insertRear(43) - status: [67, 43]

  7. Step 7: deletionRear() removes 43 - status: [67]

  8. Step 8: deletionFront() removes 67 - status: []

  9. Step 9: deletionRear() on empty deque - underflow, status: []

PreviousNext