implementation of simple queue program in c++ [on hold]

//void queue::put(int item); // Insert an item in the queue //int queue::get(void); // Get the next item from the queue

//these are member function i didn't understand question

//Write a class to implement a simple queue. A queue is very similar to a stack //except the data is removed in first-in-first-out (FIFO) order.