Q#1: The algorithm Enqueue may fails even though there is memory space available. One way to avoid this problem is to rewrite the algorithm Enqueue and Dequeue. Suggestion 1: Rewrite the program Enqueue in C++ using Arrays Whenever the rare pointer gets to the end of the queue, test whether the pointer FRONT is at location 1 or not; if not, shift all the elements so that they are wrapped from the beginning and thus make room for new item. Suggestion 2: Rewrite the program Dequeue in C++ using Arrays After the end of each deletion, all the elements at the trail and shifted once towards the front; here the idea is to fix the FRONT pointer always at 1. The queue which follows such operations is termed as dynamic queue. Rewrite operations ENQUEUE and DEQUEUE for a dynamic queue