Implement the Queue Circular array and linked list implementation that study in the class. 1. For...

 

Transcribed Image Text:

Implement the Queue Circular array and linked list implementation that study in the class. 1. For Queue Circular array implementation, set the Max queue to 5. After completed the codes, run the main method as below: int main() ( Queue eyQ; syQ.enQueue('E'); wyQ.enQueue('L'); wyQ.enQueue('L'); myQ.enQueue('E'); syQ.enQueue("V"); syQ.enqueue('5'); cout << "\nFront : myQ.getFront(); cout << "\tRear :"<<myQ-getRear() << endl; myQ.dequeue(); wyQ.deQueue(); myQ.dequeue(); syQ.dequeue(); syQ.dequeue(); syQ.deQueue(); wyQ.enqueue('S'); cout << "\nFront: <<myQ.getFront(); cout << "\tRear : <<myQ-getRear(); Expected output: Ter insert in Try insert insert sestalt fry insert L Listert sccessful! try insert Einst Try Insert & Ceret fert & Que in fall! Bear: Y delete successtal Tay it & inext fal! 2. Apply the similar main method in Question 1 to Queue Circular linked list implementation. See the difference between Queue Circular array and Queue Circular linked list (no need to include the comparison in your answer). Implement the Queue Circular array and linked list implementation that study in the class. 1. For Queue Circular array implementation, set the Max queue to 5. After completed the codes, run the main method as below: int main() ( Queue eyQ; syQ.enQueue('E'); wyQ.enQueue('L'); wyQ.enQueue('L'); myQ.enQueue('E'); syQ.enQueue("V"); syQ.enqueue('5'); cout << "\nFront : myQ.getFront(); cout << "\tRear :"<<myQ-getRear() << endl; myQ.dequeue(); wyQ.deQueue(); myQ.dequeue(); syQ.dequeue(); syQ.dequeue(); syQ.deQueue(); wyQ.enqueue('S'); cout << "\nFront: <<myQ.getFront(); cout << "\tRear : <<myQ-getRear(); Expected output: Ter insert in Try insert insert sestalt fry insert L Listert sccessful! try insert Einst Try Insert & Ceret fert & Que in fall! Bear: Y delete successtal Tay it & inext fal! 2. Apply the similar main method in Question 1 to Queue Circular linked list implementation. See the difference between Queue Circular array and Queue Circular linked list (no need to include the comparison in your answer).

Answer rating: 100% (QA)

Below is the implementation of both Queue Circular Array and Queue Circular Linked List along with the provided main method include using namespace st... View the full answer