Simulation call center traffic distribution between call center worker

Creating a class Callers and Support and 3 derived class each represen

Page 1 of 1

1 Replies - 2658 Views - Last Post: 20 May 2009 - 09:44 PM Rate Topic: -----

#1 B_Wildered  Icon User is offline

  • New D.I.C Head

Reputation: 0
  • View blog
  • Posts: 2
  • Joined: 10-May 09

Simulation call center traffic distribution between call center worker

Post icon  Posted 20 May 2009 - 07:56 PM

I got this project from school and the textbook that they gave us is no help, but anyway the project is to create a call center traffic distributed between call center workers. The sim must have a Callers base class and tree derived class: Easy; Average & Difficult. It must also have a Support base class with three derived classes’ name: Novice; Standard & Advanced. Plus I need to write a class called CallerQueue which implements a queue data structure of which no one in my class really understand any of this. How do I start this, because so far all that I have is this?

#ifndef CALLERS_H
#define CALLERS_H
#include <string>
using namespace std;

class Callers
{
public:
   HandleCall(Call const& call, double currentTime) 
  { 
  
  }
   bool Busy() const;
   double NextFreeTime() 
  { 
   return (pCall_)(pCall->GetCallDuration() + callStartTime_):(0.0); 
  }
private:
   Call* pCall_;
   double callStartTime_;
};


I'm not to sure about this program as well.

** Edit ** :code:

Is This A Good Question/Topic? 0
  • +

Replies To: Simulation call center traffic distribution between call center worker

#2 r.stiltskin  Icon User is offline

  • D.I.C Lover
  • member icon

Reputation: 1831
  • View blog
  • Posts: 4,927
  • Joined: 27-December 05

Re: Simulation call center traffic distribution between call center worker

Posted 20 May 2009 - 09:44 PM

View PostB_Wildered, on 20 May, 2009 - 09:56 PM, said:

I'm not to sure about this program as well.

** Edit ** :code:

I think that what you posted can hardly be called a program.

A queue is just a linked list that only allows items to be added at one end (the "back") and allows items to be removed at the other end (the "front"). So, just think about implementing a linked list with just a few simple functions:
void add_item(item&)
item& remove_item()
bool is_empty()
print() (optional -- only if your application needs this)
contains(const item&) (optional -- only if your application needs this)
int size() (optional -- only if your application needs this)
Was This Post Helpful? 1

Page 1 of 1