not yet, but you can help me?
do you know what is my problems?
User Profile
Collapse
-
I have made two file:
MAIN:
[CODE=cpp]// Implement a FIFO-queue ( first in, first out ) as a ring buffer using
// a static array. The program must be able to add elements into the
// end of the queue, tell the value of the oldest element and remove it
// from the queue. The capacity of the ring buffer n is 10000 elements.
#include <iostream>
#include <cstdlib>
...Leave a comment:
-
FIFO-Data Structures
Hi for me this is th first time that I use c++. I have to do this exercise. Somebody can help me?
Thanx.
Implement a FIFO-queue ( first in, first out ) as a ring buffer. Use a static array as the data structure. The program needs to be able to add elements to the end of the queue, tell the value of the oldest element and remove from the queue. The capacity n of the ring buffer is 10000 elements.
The program must handle...
No activity results to display
Show More
Leave a comment: