Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

We need to create a queue of items defined by the following structure. struct Qu

ID: 3848934 • Letter: W

Question

We need to create a queue of items defined by the following structure.

struct QueueItem

{

string fname;

string lname;

double salary;

QueueItem *next;

};

Use the following class definition to create a queue.

class Queue

{

private:

QueueItem *front;

QueueItem *back;

bool isempty;

public:

Queue()

{

front=NULL;

back=NULL;

isempty=true;

}

void enque(QueueItem *item);

void deque();

};

Write definition for the enque and deque function. Use the following main function to test your code.

int main()

{

ifstream fin;

fin.open("HW3Data.dat");

Queue my_queue;

string fname, lname;

double salary;

QueueItem *item=new QueueItem;

while(fin>>fname>>lname>>salary)

{

item->fname=fname;

item->lname=lname;

item->salary=salary;

my_queue.enque(item);

}

for (int i=0;i<9;++i)

my_queue.deque();

return 0;

}

You must get the following output.

John Harris 50000

Lisa Smith 75000.5

Adam Johnson 68500.1

Sheila Smith 150000

Tristen Major 75800.8

Yannic Lennart 58000.6

Lorena Emil 43000

Tereza Santeri 48000

Queue is empty. Nothing to remove.

Explanation / Answer

struct QueueItem

{

string fname;

string lname;

double salary;

QueueItem *next;

};

Use the following class definition to create a queue.

class Queue

{

private:

QueueItem *front;

QueueItem *back;

bool isempty;

public:

Queue()

{

front=NULL;

back=NULL;

isempty=true;

}

void enque(QueueItem *item){

if(front == NULL){

front = item;

item->next=NULL;

}

else{

QueueItem *temp;

for(temp=front;temp->next!=NULL;temp=temp->next);

temp->next = item;

item->next=NULL;

}

}

void deque(){

QueueItem *temp;

temp=front;

front=front->next;

free(temp);

}

};

int main()

{

ifstream fin;

fin.open("HW3Data.dat");

Queue my_queue;

string fname, lname;

double salary;

QueueItem *item=new QueueItem;

while(fin>>fname>>lname>>salary)

{

item->fname=fname;

item->lname=lname;

item->salary=salary;

my_queue.enque(item);

}

for (int i=0;i<9;++i)

my_queue.deque();

return 0;

}

Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
Chat Now And Get Quote