Question

IN C++;

Develop a class for a queue. "Develop the appropriate methods to insert and remove data".

-I need to be explained step by step and the complete program to study in my exam.

Answer 1

It is a bad idea to apply word "insert" there. It's a semantically wrong way. Queue supports push and pop in a such a syntax : push_back / pop_front. It works like a unidirectional treadmill with opaque sides and with banned overtake. The runner can only enter through the entrance and the one can exit only through the exit there. Therefore, a chain of runners can not change their order in the simple queue. Those who have already tried to use queue tend call its an algorithm type as a FIFO (First In, First Out). Try it and you'll understand why.

1 #include <queue> 2 3 int main){ queue <int> q; / insert in queue 4 5 q.push(1); // inserts 1 in queue q.push(5); / inserts 5 in queue 6 7 // remove from queue 8 q.pop(); // removes 1 from queue q.pop();// removes 5 from queue 10 return 0; 11 12