Question

Problem : Simulate a call center queue system

Simulate a call center queue system. When a customer calls to the call center, it will take the

account number and name as input and put the customer in a queue. Consider a queue of

customer type with maximum size of 6. Use circular queue for your solution. The customer

structure is described below:

Typedef struct Customer

{

int account_no;

char name[100];

} customer;

In an infinite loop, randomly choose between option ‘c’ (call) or ‘s’ (serve). Maybe put ‘c’ and

‘s’ in a character array and use rand() method to choose between array index.

-

If ‘c’ is picked, we assume a call is made. If the queue is full, inform the user that the system

reached maximum capacity and to call later. If the queue is not full, ask the user to enter the

account_no and name. Then put the user into Queue and display the queue with all the user

account no and name based on their priority.

-

If ‘s’ is picked we assume the front customer will be served. Remove the customer from the

queue and display the queue based on their priority.

Press ctrl+c to close your program whenever you want to.

Answer 1

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define SIZE 6

typedef struct Customer
{
int account_no;
char name[100];
}customer;
customer queue[SIZE];
int front = -1, rear =-1;
int isFull()
{
if( (front == rear + 1) || (front == 0 && rear == SIZE-1))
return 1;
return 0;
}

int isEmpty()
{
if(front == -1)
return 1;
return 0;
}

void enQueue()
{
if(isFull())
printf("\nSystem reached maximum capacity. Please call later\n");
else
{

//when queue is not full we take the customer details and push him to queue
int account_no;
char name[100];
if(front == -1)
front = 0;
rear = (rear + 1) % SIZE;
printf("Enter account number and name\n");
scanf("%d",&account_no);
scanf("%s",name);
queue[rear].account_no = account_no;
strcpy(queue[rear].name,name);
printf("You are now in queue\n");
display();
}
}

void deQueue()
{
if(isEmpty()) {
printf("\nNo customers in queue !! \n");
return(-1);
}
else
{

//when queue is not empty we serve him so dequeueing
if (front == rear)
{
front = -1;
rear = -1;
}
else
{
front = (front + 1) % SIZE;
  
}
printf("You are now moved out of queue\n");
display();
}
}

//function to display the state of the queue
void display()
{
int i;
if(isEmpty())
printf(" \nNo customers in queue !! \n");
else
{
printf(" \nQueue State\n");
for( i = front; i!=rear; i=(i+1)%SIZE)
{
printf("%d %s\n",queue[i].account_no,queue[i].name);
}
printf("%d %s\n",queue[i].account_no,queue[i].name);
}
}

int main()
{
while(1)
{

//randomly generating a choice between 0 and 1. 0 means c call, 1 means s serve
int n = rand() % 2;
if(n==0)
enQueue();
else
deQueue();
}
return 0;
}

OUTPUT: