Question

MUST USE C++

PLEASE READ THE QUESTION CAREFULLY

ADD COMMENTS AND EXPLAIN THE CODES PLEASE.

Given the following skeleton of an unsorted list class that uses an unsorted linked list:

template < class ItemType >

struct NodeType

{

                ItemType item;

                NodeType* next;

};

template < class ItemType >

class UList

{

public:

                UList(); // default constrctor

                UList(const UList &x); // we implement copy constructor with deep copy

                UList& operator = (UList &x); // equal sign operator with deep copy

                bool IsThere(ItemType item) const; // return true of false to indicate if item is in the list

                void Insert(ItemType item); // if item is not in the list, insert it into the list

                void Delete(ItemType item); // delete item from the list

                void Print(); // Print all the items in the list on screen

                int Length();   // return the number of items in the list

                ~UList(); // we do not implement destructor: programmer should be responsible to deallocate the linked list

private:

                NodeType < ItemType > * listPtr;

};

Task 1: Implement the template class UList on the basis of the above skeleton. Compile your program.

Task 2: Write a simple driver that reads values from file float.dat, inserts them into an instance, x, of the list, prints the length of the final list, and prints the values of all the list elements.

float.dat contains:

5.5

6.2

7.1

8.0

9.0

40.0

1.0

2.0

53.3

4.4

Task 3: Add code to your driver to test the remaining member functions. Delete 2.0, 9.0, and 6.2 from x and print the list to be sure they are gone.

Task 4: Create another instance, y, through the copy constructor such that the content of y is the same as that of x, but a deep copy should be done. Print out the all the list elements of y.

Task 5: Declare an instance, z, and assign the content of x to z through the operation “=”. Print out the all the list elements of z.

Task 6: Test if 9.0 is in the lists x and y via the member function: IsThere(ItemType item) and print out the test results.

Task 7: What is the Big-O notation for the time complexity of IsThere( ) function?

Answer 1

//UList.h

template < class ItemType >

struct NodeType

{

ItemType item;
   NodeType* next;

};

template < class ItemType >

class UList

{

public:

UList(); // default constrctor

UList(const UList &x); // we implement copy constructor with deep copy

UList& operator = (UList &x); // equal sign operator with deep copy

bool IsThere(ItemType item) const; // return true of false to indicate if item is in the list

void Insert(ItemType item); // if item is not in the list, insert it into the list

void Delete(ItemType item); // delete item from the list

void Print(); // Print all the items in the list on screen

int Length(); // return the number of items in the list

~UList(); // we do not implement destructor: programmer should be responsible to deallocate the linked list

private:

NodeType < ItemType > * listPtr;

};

//UList.cpp

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

template < class ItemType >
UList<ItemType>::UList(){
   listPtr = NULL;
}

template < class ItemType >
UList<ItemType>::UList(const UList &x){
   NodeType < ItemType >*current = x.listPtr , *tail = NULL, *newNode;
   while(current!=NULL){
       newNode = new NodeType < ItemType >;
       newNode->item = current->item;
       newNode->next = NULL;
      
       if(tail == NULL){
           listPtr = newNode;
           tail = listPtr;
       }
       else{
           tail->next = newNode;
           tail = newNode;
       }
       current = current->next;
   }
}

template < class ItemType >
UList<ItemType>& UList<ItemType>::operator = (UList<ItemType> &x){
   NodeType < ItemType >*current = x.listPtr , *tail = NULL, *newNode;
   UList *list = new UList();
   while(current!=NULL){
       newNode = new NodeType < ItemType >;
       newNode->item = current->item;
       newNode->next = NULL;
      
       if(tail == NULL){
           list->listPtr = newNode;
           tail = list->listPtr;
       }
       else{
           tail->next = newNode;
           tail = newNode;
       }
       current = current->next;
   }
   return *list;
}

template < class ItemType >
bool UList<ItemType>::IsThere(ItemType item) const{
   NodeType < ItemType >*current = listPtr;
  
   while(current!=NULL){
       if(current->item == item)return true;
       current = current->next;
   }
   return false;
}

template < class ItemType >
void UList<ItemType>::Insert(ItemType item){
   if(this->IsThere(item))return;
   NodeType < ItemType >*current = listPtr , *newNode;
   newNode = new NodeType < ItemType >;
   newNode->item = item;
   newNode->next = NULL;
  
   if(listPtr == NULL){
       listPtr = newNode;
       return;
   }
  
   while(current->next!=NULL){
       current = current->next;
   }
   current->next = newNode;
}

template < class ItemType >
void UList<ItemType>::Delete(ItemType item){
   NodeType < ItemType >*current = listPtr , *prev = NULL ;
  
   if(listPtr->item == item){
       listPtr = listPtr->next;
       delete current;
   }
  
   while(current!=NULL && current->item != item){
       prev = current;
       current = current->next;
   }
   if(current == NULL)return;
  
   prev->next = current->next;
   delete current;
}

template < class ItemType >
void UList<ItemType>::Print(){
   NodeType < ItemType >*current = listPtr ;
  
   while(current!=NULL){
       cout<<current->item<<" ";
       current = current->next;
   }
}

template < class ItemType >
int UList<ItemType>::Length(){
   NodeType < ItemType >*current = listPtr ;
   int count = 0;
  
   while(current!=NULL){
       count++;
       current = current->next;
   }
   return count;
}

template < class ItemType >
UList<ItemType>:: ~UList(){
   NodeType < ItemType >*current = listPtr , *next;

   while (current != NULL)
   {
   next = current->next;
   delete(current);
   current = next;
   }
   listPtr = NULL;
}

//main.cpp

#include "UList.cpp"
#include <fstream>

int main(){
   UList<float> x ;
   ifstream in;
   in.open("float.dat");
   float num;
  
   if(!in){
       cout<<"File not opened\n";
       exit(1);
   }
   cout<<"read\n";
   while(!in.eof()){
       in>>num;
       x.Insert(num);
   }
  
   cout<<"Your list \n ";
   x.Print();
  
   cout<<"\nLength of list : "<<x.Length()<<endl;
   x.Delete(2.0);
   cout<<"\nYour list \n ";
   x.Print();
   x.Delete(9.0);
   cout<<"\nYour list \n ";
   x.Print();
   x.Delete(6.2);
   cout<<"\nYour list \n ";
   x.Print();
  
   UList<float> y(x);
   cout<<"\nYour list \n ";
   y.Print();
   UList<float> z ;
   z = x;
   cout<<"\nYour list \n ";
   z.Print();
  
   if(x.IsThere(9.0)){
       cout<<"\n9.0 is in the list y\n";
   }
   else{
       cout<<"\n9.0 is not in the list y\n";
   }
  
   if(y.IsThere(9.0)){
       cout<<"\n9.0 is in the list y\n";
   }
   else{
       cout<<"\n9.0 is not in the list y\n";
   }
  
   return 0;
}
//Time complexity of IsThere( ) function = O(N) where N is length of list.