Hi all, I need to do a program to do something like the CPU scheduling using Round Robin technique .. The whole idea is in my mind but the problem with me that I'm having a problem in implementing the queue functions such as "Append" and "serve" As a circular linked queue.

These are my 2 classes:

Code:
class process
{
public:
	char name;
	int burst_time;
	process *next;
	process() {next = NULL;}
	process(char name1, int burst_time1, process *next1 = NULL)
	{
		name = name1;
		burst_time = burst_time1;
		next = next1;
	}
};

class queue
{
public:
	queue() {front= NULL; rear = NULL;}
	void append(char name, int burst_time);
	void serve();
	bool isEmpty() {return rear == front;}
private:
	process front;
	process rear;
};

Can someone please just show me how to do these two functions: "Append" and "Serve" one to add to list and the other to delete.

I tried alot but the whole circular linked queue idea is complicated in my mind.

Thanks very much, I really appreciate it if some one just implement these two functions for me using the features in my two classes.

zeid