Question

ALL CODE MUST BE IN C++

Before you begin, you must write yourself a LinkedList class and a Node class (please name your classes exactly ​as I did here). Please follow the below specifications for the two classes.

Node.cpp

● This must be a generic class.

● Should contain a generic member variable that holds the nodes value.

● Should contain a next and prev Node* as denoted here.

● All member variables should be private.

● Use public and private member functions as you deem fit.

LinkedList.cpp

● This class should be the only class creating and manipulating Node objects.

● This class must be able to handle (1) singly, (2) doubly, (3) singly-circularly, and (4) doubly-circularly linked list. When the list is created, it must be given input to which type of list it will be.

● This class must also have generic functions that are able to properly handle the generic node values.

● Your class must at least have the following public prototypes implemented.

○ bool perform_operation(int op_code, T value);

● Your class must at least have the following private prototypes implemented.

○ void append(Node* n); (Opcode 1)

○ void remove_tail(); (Opcode 2)

○ void push(Node* n); (Opcode 3)

○ Node* pop(); (Opcode 4)

○ void remove_i(int i); (Opcode 5)

○ Node* get_i(int i); (Opcode 6)

○ void add_i(Node* n, int i); (Opcode 7)

○ void print(); (Opcode 8)

○ void delete(); (Opcode 9)

○ void reverse(); (Opcode 10)

○ void rotate(int rotations); (Opcode 11)

○ void random_shuffle(); (Opcode 12)

○ int size(); (Opcode 13)

● I am not specifying all the little details in the error checking, but remember we would like to write code that does not behave unexpectedly without informing the user of error.

● The perform_opertation function should be the only function the uses the private member functions of the class. It will also be responsible for creating the nodes in memory.

Using the LinkedList class you just created, you will need to implement a priority stack through the creation of the PriorityStack class. A priority stack is similar to a stack but as in the priority queue we will pop the higher priority items first. You will need to write a main function that will test the functionality of all of your classes.

Answer 1

/* This progream gives example of classes using pointers*/

#include<iostream.h>
#include<conio.h>
class student
   {
   private:
       int r_number;
       char sex;
       int age;
       float height;
       float weight;
   public:
       void getdata()
       {
       cout<<"Enter r_number\t";
       cin>>r_number;
       cout<<endl;
       cout<<"Enter sex\t";
       cin>>sex;
       cout<<endl;
       cout<<"Enter age\t";
       cin>>age;
       cout<<endl;
       cout<<"Enter height\t";
       cin>>height;
       cout<<endl;
       cout<<"Enter weight\t";
       cin>>weight;
       cout<<endl<<endl;
       }

       void display()
       {
       cout<<"r_number"<<"\t"<<r_number<<endl<<endl;
       cout<<"sex"<<"\t\t"<<sex<<endl<<endl;
       cout<<"age"<<"\t\t"<<age<<endl<<endl;
       cout<<"height"<<"\t\t"<<height<<endl<<endl;
       cout<<"weight"<<"\t\t"<<weight<<endl<<endl;
       }
   };

   void main()
   {
   student *obj;
   int i,j,n;
   clrscr();
   cout<<"enter how many students"<<endl<<endl;
   cin>>n;
   cout<<"Enter information "<<endl<<endl;
   for(i=0;i<=n-1;++i)
   {
   j=i;
   j=j+1;
   cout<<"RECORD NO\t"<<j<<endl<<endl;
   obj->getdata();
   }
   for(i=0;i<=n-1;++i)
   {
   j=i;
   cout<<"RECORD NO\t"<<j+1<<endl<<endl;
   obj->display();
   }
   getch();
   }