Question

C++

((USE STL verison please))

Implement the queue class as shown above. Use your queue to store the names of 5 students waiting outside Student Services to meet with advisors. You may want to add more data to each node including student ID, Major, etc. Add a member function displayQueue which displays the contents of the queue. Write the main function to test the queue.

CLASS:

#ifdef queue_h
#define queue_h
namespace queues
{
struct queueNode{
char data;
queueNode *link;
};
typedef queueNode* queueNodePtr;
class queue {
public:
queue();
queue(const queue& aQueue);
~queue();
void add(char item);
char remove();
bool empty() const;
private:
queueNodePtr front;
queueNodePtr back;
};
}
#endif

Answer 1

//queue.h

#include<iostream>
using namespace std;
struct queueNode{
string name;
int ID;
string major;
struct queueNode *next;
};
typedef queueNode* queueNodePtr;
class queue {
public:
queue(){
   front=NULL;
   back=NULL;
}
queue(const queue& aQueue){
   this->front = aQueue.front;
   this->back = aQueue.back;
}
~queue(){
   front=NULL;
   back=NULL;
}
void add(queueNodePtr s){
   if(back ==NULL){
       back=s;
       front=back;
       back->next=NULL;
       return;
   }
   back->next = s;
   back=s;
   back->next=NULL;
}
queueNodePtr remove(){
   if(front==NULL)return NULL;
   queueNodePtr temp = front;
   if(front==back){
       front=NULL;
       back=NULL;
       return temp;
   }
   front=front->next;
   return temp;
  
}
bool empty(){
   return front==NULL;
}
void display(){
   queueNodePtr temp=front;
   while(temp){
       cout<<temp->ID<<"\t"<<temp->name<<"\t"<<temp->major<<"\n";
       temp=temp->next;
   }
   cout<<"\n";
}
  
private:
queueNodePtr front;
queueNodePtr back;
};

//main.cpp

#include"queue.h"
#include<iostream>
using namespace std;

int main(){
   queueNodePtr s1,s2,s3;
   s1 = new queueNode;
   s1->ID = 111;
   s1->name="abc";
   s1->major= "CSE";
   s1->next=NULL;
  
   s2 = new queueNode;
   s2->ID = 222;
   s2->name="jkl";
   s2->major= "CSE";
   s2->next=NULL;
  
   s3 = new queueNode;
   s3->ID = 333;
   s3->name="xyz";
   s3->major= "CSE";
   s3->next=NULL;
  
   queue q;
   q.add(s1);
   q.add(s2);
   q.add(s3);
  
   q.display();
   q.add(q.remove());
   q.display();
   return 0;
  
}

//sample output

C\Users\IshuManish\ Documents mainqueuee.exe jkl xyz CSE CSE CSE jkl xyz albc CSE CSE CSE rocess exited after 0.06367 seconds with return value 0 ress any key to continue - . -