Question

build a bank simulator system using the C++ STL queue library. You are required to create your
own ADT for that system that:
First, Read from a file the data of incoming customers which includes
ArrivalID, StartTime, and ProcessTime.
You have one line in your Bank in which you will serve your customers as per to their arrival time.
For example if you read the following data from the file
A 1 5
B 2 5
C 4 5
D 20 5
E 22 5
F 24 5
G 26 5
H 28 5
I 30 5
J 88 3
At the beginning the queue in the bank is empty customer A will be arriving at time 1 and will be
served immediately. At time 2 customer B arrives he has to wait until customer 1 is served.
Customer A needs 5 time intervals to be served so he will finish at time 6.
At time 6 customer B will be served and in the queue customer C is waiting.
You are required to simulate this process and print out at the end the following:
Customer No, StartTime, EndTime, and Wait time:
• endTime represents the time the customer left the Bank (fully served). For the above
example the endTime for customer A is 6.
• The wait time is the time interval the customer waited in the queue to be served for
customer A he did not wait so the waitTime is 0 while for customer B the wait time is 4.
See below example of the final runtime for the above data:

Hello, Welcome to the Bank simulator System! No Start 2 20 End Wait 4 16 25 30 35 40 45 50 91 24 26 28 30 9 12 15 Final Statics: 10 Total number of people processed Avreage amount of time spent waiting: 5.6

EXTRA CREDIT: You can get up to a 30/20 by completing simulating another prioryQueue
simulator where you will read a priority token form the user; the user with the highest priority will
be served first. Even though this is extra credit, you should at least look at it (as you are likely to
see it again very soon). The priority token has two categories VIP, Normal. If you have more than
one VIP customer so you will serve the one that arrives first. You cannot serve any Normal
customer until all the VIP customers are done.
Files: You must submit at least the following files: Bank.h, Bank.cpp, main.cpp, inputFile.txt,
Readme and makefile.

Answer 1

Bank.h

#include <string.h>
using namespace std;
class Customer{
public:
string arrivalId;
int no;
int start;
int process;
int turnAround;
int finish;
int wait;

Customer();
void display();
};

Bank.cpp

#include <iostream>
#include <fstream>
#include<string.h>
#include <vector>
#include <queue>
#include <stdlib.h>
#include "Bank.h"
using namespace std;

Customer::Customer()
{
no=start=finish=process=turnAround=wait=0;
}

void Customer:: display()
{
cout<<"\n"<<arrivalId<<"\t"<<start<<"\t"<<finish<<"\t"<<wait;
}

vector<string> getWords(char* line){
vector<string> v;
string word="";

for(int i=0;i<strlen(line);i++){

if(line[i]==' '){
v.push_back(word);
word="";
}
else {
word=word+line[i];
}

}
v.push_back(word);
return v;

} ///getWords

void printCustomers(Customer customer[100],int customerIndex){
cout<<"\nHello , Welcome to the Bank simulator System \n";
cout<<"\nNo\tStart\tEnd\tWait\n";
int time=0;
for(int i=0;i<customerIndex;i++)
{
time+=customer[i].wait;
customer[i].display();
}

cout<<"\nFinal Statistics:\n";
cout<<"\t Total no of peoples processed :"<<customerIndex;
cout<<"\n\t Average amount of time spent waiting :"<<time/(double)customerIndex<<"\n";

}
///sort based on arrival/start time
void sort(Customer customer[100],int customerIndex){

for (int i = 0; i < customerIndex; i++) {
for (int j = 1; j < (customerIndex - i); j++) {

if (customer[j - 1].start > customer[j].start) {
Customer temp = customer[j - 1];
customer[j - 1] = customer[j];
customer[j] = temp;
}

}
}

}

int main()
{
Customer customer[100];
int customerIndex=0;
char* inputFile="input.txt";
char line[100]; /// read line of file ans store int line char-array

ifstream myfile (inputFile); ///open inputFile for read
int linecount=0; /// no of lines read to 0

if (myfile.is_open()){ ///check whether file is opened for read && write successfully or not
while ( myfile.getline (line,100)){
vector<string> v;
v=getWords(line);
int cnt=0;
for(vector<string>::iterator i = v.begin(); i != v.end(); i++)
{
string value=*i; ///get value
///for ID
if(cnt==0)
{
customer[customerIndex].arrivalId=*i;
cnt++;
continue;
}
char char_array[value.size()+1];
strcpy(char_array, value.c_str()); ///convert string to char* array
int number=atoi(char_array); ///convert char* to int
///start
if(cnt==1)
{
customer[customerIndex].start=number;
}
///process
if(cnt==2)
{
customer[customerIndex].process=number;
}
cnt++;
} ///end for

///increment customer count
customerIndex++;
} ///while line
}//if

///print customers
//cout<<"\n**INITIAL**\n";
//printCustomers(customer,customerIndex);

///if input file contains customer with start tie not sorted then
///sort based on start time
sort(customer,customerIndex);

///set time to 0
int time=0;
//for all customers
for(int i=0;i<customerIndex;i++){
///if time is less/equal to start time of customer
///then wait=0 & time=start
if(time<=customer[i].start)
{
customer[i].wait=0;
time=customer[i].start;
}
///if time is greater than start time of customer
///then wait=time-start
else
{
customer[i].wait=time-customer[i].start;

}
/// finish = time+ process
customer[i].finish=time+customer[i].process;
/// turnAround = finish -start
customer[i].turnAround=customer[i].finish-customer[i].start;
///set time to finish
time =customer[i].finish;
}

//cout<<"\n**FINAL**\n";
printCustomers(customer,customerIndex);
return 0;
}

input.txt

A 1 5
B 2 5
C 4 5
D 20 5
E 22 5
F 24 5
G 26 5
H 28 5
I 30 5
J 88 3

Output

Priority Queue is not implemented as input file does not contain priority information