Question: For Q1 Solution need Algorithm not code

Question:

For Q1 Solution need Algorithm not code ..

Q1. Write lgorithm of ouput restricted queue, here you can either make a single algorithm or 3 different algorithms. Do remember that in above algorithm you can insert value only at rear but deletion can be done at either side of the queue.

For Q2 , Q3 , Q4 need Code on Dev C++

Q2. Write program where you have to make a circular queue of your choice. You are here required to add and delete a number. Apply above using both array and link list.

Q3. You already read the algorithms of input and output restricted dequeue. Write program where you are required to implement insertion and deletion in input restricted dequeue.

Q4. Write program to perform deletion in minimum priority queue.