17-14 C++Instructions Write the definition of the function moveNthFront that takes as a parameter a positive integer, n. The function moves the nth element of the queue to the front. The order of the remaining elements remains unchanged. For example, suppose: queue = {5, 11, 34, 67, 43, 55} and n = 3. After a call to the function moveNthFront: queue = {34, 5, 11, 67, 43, 55} Add this function to the class queueType. Also, write a program (in main.cpp) to test your method. InstructionsInstructionsa. Add the following operation to the classlinkedStackType.void reverseStack (linkedStackType &otherStThis operation copies the elements of a stack in reverseorder onto another stack.Consider the following statements:linkedStackType stack1;linkedStackType stack2;The statementstack1.reverseStack (stack2);copies the elements of stack1 onto stack2 in reverseorder. That is, the top element of stack1 is the bottomelement of stack2, and so on. The old contents ofstack2 are destroyed, and stack1 is unchanged.b. Write the definition of the function template toimplement the operation reverseStack.Write a program to test the class linkedStackType.GradingWhen you have completed your program, click the Submitbutton to record your score.main.cpp1 //Header File: linkedStack.h23 #ifndef H_StackType4 #define H_StackType56 #include 7 #include 89 #include "stackADT.h"1011 using namespace std;12linkedStack.h13 //Definition of the node14 template 15 struct node Type16 {171819 };20Type info;nodeType *link;21 template 22 class linkedStackType: public stackADT23 {24 public:25262728293031const linkedStackType& operator=323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576 private:77787980818283 };84//Overload the assignment operator.//bool isEmptyStack() const;//Function to determine whether the stack is empty.//Postcondition: Returns true if the stack is empty;otherwise returns false.191192193194195bool isFullStack() const;//Function to determine whether the stack is full.//Postcondition: Returns false.//void initializeStack();//Function to initialize the stack to an empty state.//Postcondition: The stack elements are removed;stackTop = nullptr;//void push(const Type& newItem);//Function to add newItem to the stack.//Precondition: The stack exists and is not full.//Postcondition: The stack is changed and newItemis added to the top of the stack.////Type top() const;//Function to return the top element of the stack.//Precondition: The stack exists and is not empty.//Postcondition: If the stack is empty, the programterminates; otherwise, the topelement of the stack is returned.//void pop();//Function to remove the top element of the stack.//Precondition: The stack exists and is not empty.//Postcondition: The stack is changed and the topelement is removed from the stack.linkedStackType();//Default constructor//Postcondition: stackTop = nullptr;linkedStackType(const linkedStackType& otherStack);//Copy constructor//{-linkedStackType();//Destructor//Postcondition: All the elements of the stack areremoved from the stack.void reverseStack (linkedStackType &otherStack);nodeType *stackTop; //pointer to the stackvoid copyStack (const linkedStackType& otherStack);//Function to make a copy of otherStack.////Default constructor//Postcondition: A copy of otherStack is created andassigned to this stack.8586 template 87 linkedStackType ::linkedStackType()88 {8990 }9192 template 93 bool linkedStackType::isEmptyStack() const94 {95 return (stack Top == nullptr);96}//end isEmptyStackstackTop = nullptr;stackADT.h(const linkedStackType&);9798 template 99 bool linkedStackType :: is FullStack() const100 {101return false;102 //end isFullStack103104 template 105 void linkedStackType::initializeStack()106 {107 node Type *temp; //pointer to delete the node108109 while (stack Top != nullptr) //while there are elements in110//the stack111112113114115116117}118} //end initializeStack119120 template 121 void linkedStackType::push(const Type& newElement)122 {123124125126127128129 stackTop newNode;130131} //end push132133temp stackTop;//set temp to point to the//current nodestackTop stackTop->link; //advance stackTop to the//next nodedelete temp; //deallocate memory occupied by tempnodeType *newNode; //pointer to create the new node134 template 135 Type linkedStackType :: top() const136 {137138newNode = new nodeType; //create the nodenewNode->info = newElement; //store newElement in the nodenewNode->link= stackTop; //insert newNode before stackTop//set stackTop to point to the//top node139140 }//end top141return stackTop->info;assert (stackTop != nullptr); //if stack is empty,//terminate the program//return the top element142 template 143 void linkedStackType : :pop()144 {elseif (stackTop != nullptr){+145 node Type *temp; //pointer to deallocate memory146147148149150151152153154 }155156157 }//end pop158else{159 template 160 void linkedStackType::copyStack161162 {163 nodeType *newNode, *current, *last;164165166167168169170171172173174175176177178179180181182183184185186187188189190temp = stackTop; //set temp to point to the top nodestackTop = stackTop->link; //advance stackTop to the//next nodedelete temp; //delete the top node.cout << "Cannot remove from an empty stack." << endl;if (otherStack.stackTop ==stack Top = nullptr;if (stackTop != nullptr) //if stack is nonempty, make it emptyinitializeStack();(const linkedStackType& otherStack)current = otherStack.stackTop; //set current to point//to the stack to be copied//copy the stackTop element of the stackstack Top = new nodeType; //create the nodelast stackTop;current current->link;nullptr)stackTop->info = current->info; //copy the infostackTop->link = nullptr; //set the link field of the}//end while//copy the remaining stackwhile (current != nullptr){}//end else196}//end copyStacknewNode= new nodeType ;newNode->info = current->info;newNode->link = nullptr;last->link = newNode;last newNode;current = current->link;//node to nullptr//set last to point to the node//set current to point to//the next nodestack Top = nullptr;copyStack (otherStack);205 }//end copy constructor206197198 //copy constructor199 template 200 linkedStack Type ::linkedStackType(201202 {203204const linkedStackType& otherStack)207 //destructor208 template 209 linkedStackType::-linkedStackType()210 {211 initializeStack();212 }//end destructor213214 //overloading the assignment operator215 template 216 const linkedStackType& linkedStackType::operator=217(const linkedStack Type& otherStack)218 {219 if (this ! &otherStack) //avoid self-copy220copyStack (otherStack);221222return *this;223 }//end operator=224225 #endif226linkedStack.hmain.cpp1 #include 2 #include "linkedStack.h"34 using namespace std;56 int main() {789}// Write your main herereturn 0;stackADT.h+linkedStack.hmain.cpp1 //Header file: stackADT.h23 #ifndef H_StackADT4 #define H_StackADT56 template 7 class stackADT8 {9 public:1011121314151617181920212223242526272829303132333435363738virtual void initializeStack() = 0;//Method to initialize the stack to an empty state.//Postcondition: Stack is empty//virtual bool isEmptyStack() const = 0;//Function to determine whether the stack is empty.//Postcondition: Returns true if the stack is empty,otherwise returns false.//virtual bool isFullStack() const = 0;//Function to determine whether the stack is full.//Postcondition: Returns true if the stack is full,otherwise returns false.stackADT.h//+virtual void push(const Type& newItem) = 0;//Function to add newItem to the stack.//Precondition: The stack exists and is not full.//Postcondition: The stack is changed and newItemis added to the top of the stack.////virtual Type top() const = 0;//Function to return the top element of the stack.//Precondition: The stack exists and is not empty.//Postcondition: If the stack is empty, the programterminates; otherwise, the top elementof the stack is returned.39404142 };4344 #endif45virtual void pop() = 0;//Function to remove the top element of the stack.//Precondition: The stack exists and is not empty.//Postcondition: The stack is changed and the topelement is removed from the stack.//

C++ is an object oriented programming languages are used to create the web applications, games etc.…

Answered: C++ Instructions Write the definition…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

C++ Instructions Write the definition of the function moveNthFront that takes as a parameter a positive integer, n. The function moves the nth element of the queue to the front. The order of the remaining elements remains unchanged.