Download to read offline
File name a2.cppTaskFor this assignment, you are required to ei.pdf
- 1. File name: a2.cpp Task Forthis assignment, you are required to either A) modify your linked list code to implement a queue or B) modify the provided stack code to implement a queue. Your program should implement a C++ queue class with the following member functions: - Void enq(int) - Void deq() - Void front() - Bool isEmpty() - Void printq() Your program will take in a command file called “cmd.txt” which will instruct your program what operations to run File Format <0 or 1 arguments> Commands - 1 enq - 2 deq - 3 front - 4 isEmpty - 5 printq Example File 1 1 5 1 2 5 1 3 5 1 4 5 3 2 5 2 5 3
- 2. Expectations You should notuse any already pre implemented code for your queue such as a standard library object Your code should be well formatted with proper spacing and proper naming Your code should have well named variables. No a’s b’s or c’s as names unless it is for something like a loop counter Your code should have the same output formatting you see below Your code MUST follow the formatting you see below Your file MUST be named a2.cpp My example file does not contain all possible test cases it is up to you to determine any other special cases to test your program against. Example Output //LinkedList class #include #include #include #include #include using namespace std; struct Node { int data; Node *next; }; class LinkedList { private: Node *head; Node *tail; public: LinkedList(); //constructor void prepend(int num); void append(int num); void removeFront(); void removeBack(); void remove(int num);
- 3. int search(int num); voidprintList(); }; //constructor LinkedList::LinkedList() { head=NULL; tail=NULL; } //prepend() method void LinkedList::prepend(int num) { //allocate space for new node Node *node=new Node; //populate node node->data=num; node->next= NULL; //attach new node to start of list //if linked list empty if(head==NULL) { head=node; tail=node; } else //linked list not empty { node->next=head; head=node; } } //append() method void LinkedList::append(int num) { //allocate space for new node
- 4. Node *node=new Node; //populatenode node->data=num; node->next= NULL; //attach new node to end of list //if linked list empty if(head==NULL) { head=node; tail=node; } else //linked list not empty { tail->next=node; tail=node; } } //removeFront() method void LinkedList::removeFront() { //if linked list empty, then underflow if(head==NULL) { cerr<<"Underflow"<next; //delete node cout<<"Removing "<data<<" from the list"<next!=NULL) { /*if(curr==tail) break;*/ prev=curr; curr=curr->next; } prev->next=NULL;
- 5. tail=prev; //delete node cout<<"Removing "<data<<"from the list"<data=num) break; prev=curr; curr=curr->next; } //preserve node Node *temp=curr; //detach node from linked list prev->next=curr->next; //delete node cout<<"Removing "<data<<" from the list"<data=num) { found=1; //num found break; } curr=curr->next; } return found; } //printList() method void LinkedList::printList() { //traverse linked list Node *curr=head; while(curr!=NULL) { cout<data<<"->"; curr=curr->next; }
- 6. } --------------------------- main() method ------------------------------ //read datafrom file string line; while(getline(infile,line)) { stringstream ss(line); int op; //operation to be performed ss>>op; int num; switch(op) { case 1: ss>>num; cout<<"Prepending "<>num; cout<<"Appending "<>num; if(ll.search(num)==1) cout<<"Found "<>num; ll.remove(num); break; } } infile.close(); return 0; } Back K-- Front 1 Front Back 2 1 Front Back 3 2 1 K-- Front Back 4 3 2 1 Front Front 1 De q 1. Front Back 2 4 3 2 K- Deq Back 4 3 K-- Front Front 3 Queue is not empty Back 4 3 Front Back 4 3 Front Solution #include #include #include #include
- 7. #include using namespace std; structNode { int data; Node *next; }; class LinkedList { private: Node *head; Node *tail; public: LinkedList(); //constructor void prepend(int num); void append(int num); void removeFront(); void removeBack(); void remove(int num); int search(int num); void printList(); }; //constructor LinkedList::LinkedList() { head=NULL; tail=NULL; } //prepend() method void LinkedList::prepend(int num) { //allocate space for new node Node *node=new Node; //populate node node->data=num;
- 8. node->next= NULL; //attach newnode to start of list //if linked list empty if(head==NULL) { head=node; tail=node; } else //linked list not empty { node->next=head; head=node; } } //append() method void LinkedList::append(int num) { //allocate space for new node Node *node=new Node; //populate node node->data=num; node->next= NULL; //attach new node to end of list //if linked list empty if(head==NULL) { head=node; tail=node; } else //linked list not empty { tail->next=node; tail=node;
- 9. } } //removeFront() method void LinkedList::removeFront() { //iflinked list empty, then underflow if(head==NULL) { cerr<<"Underflow"<next; //delete node cout<<"Removing "<data<<" from the list"<next!=NULL) { /*if(curr==tail) break;*/ prev=curr; curr=curr->next; } prev->next=NULL; tail=prev; //delete node cout<<"Removing "<data<<" from the list"<data=num) break; prev=curr; curr=curr->next; } //preserve node Node *temp=curr; //detach node from linked list prev->next=curr->next; //delete node cout<<"Removing "<data<<" from the list"<data=num)
- 10. { found=1; //num found break; } curr=curr->next; } returnfound; } //printList() method void LinkedList::printList() { //traverse linked list Node *curr=head; while(curr!=NULL) { cout<data<<"->"; curr=curr->next; } } --------------------------- main() method ------------------------------ //read data from file string line; while(getline(infile,line)) { stringstream ss(line); int op; //operation to be performed ss>>op; int num; switch(op) { case 1: ss>>num; cout<<"Prepending "<>num;
- 11.