Question

Project

Lists and Object-oriented Programming

Note: using c++

This project is an individual assignment that focuses on object-oriented programming and lists. The list will be a doubly-linked list and it will be implemented using nodes and pointers. The data contained in the list will be objects from a class.

1. Project data: You will choose one of the following classes to define: Boat, Earthquake, Game, Sport, State, Website, House, Phone, Activist, Plant, Fish, Parrot, and Course. Your class code will include a .h class interface file and a .cpp class definition file. You will choose the data attributes of your class. There should be at least 3 data attributes. At least one of these attributes will be a string, and at least one attribute will be numeric.

2. Project data structure: Additionally, you will create classes for a doubly-linked list that will manage a collection of your class objects (e.g., Boats). The list will use dynamically allocated nodes.
3. For a user to work with your data and list, you should write a fully functional menu with the following options:
4. 1. Adding to the front of the list
   2. Adding to the back of the list
   3. Searching for and displaying a specific item in the list
   4. Editing a specified item from the list
   5. Removing an identified item from the list
   6. Displaying the entire list
   7. Ending the program

Answer 1

// course.h

#ifndef COURSE_H_
#define COURSE_H_

#include <iostream>
using namespace std;

class Course
{
private:
   string name;
   int id;
   double marks;
   static int nextID;
public:
   Course();
   Course(string name, double marks);
   void setMarks(double marks);
   int getID();
   string getName();
   double getMarks();
   void print();
};

#endif

//end of course.h

// course.cpp

#include "course.h"

// static variable used to populate the course id
int Course::nextID = 1;

Course::Course()
{
   id = 0;
   name = "";
   marks=0;
}

// constructors
Course::Course(string name, double marks)
{
   this->id = nextID;
   nextID++;
   this->name = name;
   this->marks = marks;
}

// setters
void Course::setMarks(double marks)
{
   this->marks = marks;
}

// getters
int Course::getID()
{
   return id;
}

string Course::getName()
{
   return name;
}

double Course::getMarks()
{
   return marks;
}

// function to print the course details
void Course::print()
{
   cout<<"ID: "<<id<<" Name: "<<name<<" Marks: "<<marks;
}

//end of course.cpp

// node.h

#ifndef NODE_H_
#define NODE_H_

#include "course.h"

class Node
{
private:
   Course course;
   Node *next;
   Node *prev;
public:
   Node(Course course);
   Node(Course course, Node *next, Node *prev);
   void setCourse(Course course);
   void setNext(Node *next);
   void setPrev(Node *prev);
   Course getCourse();
   Node *getNext();
   Node* getPrev();
};

#endif

//end of node.h

// node.cpp

#include "node.h"

// constructors
Node::Node(Course course)
{
   this->course = course;
   next = NULL;
   prev = NULL;
}

Node::Node(Course course, Node *next, Node *prev)
{
   this->course = course;
   this->next = next;
   this->prev = prev;
}

// setters
void Node::setCourse(Course course)
{
   this->course = course;
}

void Node::setNext(Node *next)
{
   this->next = next;
}

void Node::setPrev(Node *prev)
{
   this->prev = prev;
}

// getters
Course Node::getCourse()
{
   return course;
}

Node* Node::getNext()
{
   return next;
}

Node* Node::getPrev()
{
   return prev;
}

//end of node.cpp

// doubleLinkedList.h

#ifndef DOUBLELINKEDLIST_H_
#define DOUBLELINKEDLIST_H_

#include "node.h"

class DoubleLinkedList
{
private:
   Node *front;
   Node *back;
public:
   DoubleLinkedList();
   ~DoubleLinkedList();
   void addFront(Course course);
   void addBack(Course course);
   void search(int ID);
   void editCourse(int ID, double marks);
   void removeCourse(int ID);
   void displayList();
};

#endif

//end of doubleLinkedList.h

// doubleLinkedList.cpp

#include "doubleLinkedList.h"

// constructor
DoubleLinkedList::DoubleLinkedList()
{
   front = NULL;
   back = NULL;
}

// destructor
DoubleLinkedList::~DoubleLinkedList()
{
   while(front != NULL)
   {
       Node *temp = front;
       front = front->getNext();
       delete(temp);
   }

   back = NULL;
}

// function to add a course at the front
void DoubleLinkedList::addFront(Course course)
{
   Node *node = new Node(course);
   if(front == NULL)
   {
       front = node;
       back = node;
   }else
   {
       node->setNext(front);
       front->setPrev(node);
       front = node;
   }
   cout<<"Course: ";
   course.print();
   cout<<" added to the front of the list"<<endl;
}

// function to add a course at the back
void DoubleLinkedList:: addBack(Course course)
{
   Node *node = new Node(course);
   if(front == NULL)
   {
       front = node;
       back = node;
   }else
   {
       node->setPrev(back);
       back->setNext(node);
       back = node;
   }
   cout<<"Course: ";
   course.print();
   cout<<" added to the back of the list"<<endl;
}

// function to search for a course
void DoubleLinkedList:: search(int ID)
{
   Node *node = front;
   bool found = false;

   while(node != NULL)
   {
       if(node->getCourse().getID() == ID)
       {
           node->getCourse().print();
           cout<<endl;
           found = true;
           break;
       }

       node = node->getNext();
   }

   if(!found)
   {
       cout<<"Course with ID: "<<ID<<" not found "<<endl;
   }
}

// function to edit a course
void DoubleLinkedList::editCourse(int ID, double marks)
{
   Node *node = front;
   bool found = false;

   while(node != NULL)
   {
       if(node->getCourse().getID() == ID)
       {
           Course course = node->getCourse();
           course.setMarks(marks);
           node->setCourse(course);

           cout<<"Course with ID: "<<ID<<" edited successfully"<<endl;
           found = true;
           break;
       }

       node = node->getNext();
   }

   if(!found)
   {
       cout<<"Course with ID: "<<ID<<" not found "<<endl;
   }

}

// function to remove a course
void DoubleLinkedList::removeCourse(int ID)
{
   Node *node = front;
   bool found = false;

   while(node != NULL)
   {
       if(node->getCourse().getID() == ID)
       {

           if(node == front)
           {
               front = front->getNext();

               if(front != NULL)
                   front->setPrev(NULL);
               else
                   back = NULL;
           }else if(node == back)
           {
               back = back->getPrev();
               if(back != NULL)
                   back->setNext(NULL);
               else
                   front = NULL;
           }else
           {
               node->getPrev()->setNext(node->getNext());
               node->getNext()->setPrev(node->getPrev());
           }

           cout<<"Course with ID: "<<ID<<" removed successfully"<<endl;
           found = true;
           break;
       }

       node = node->getNext();
   }

   if(!found)
       cout<<"Course with ID: "<<ID<<" not found "<<endl;

}

// function to display all the courses
void DoubleLinkedList:: displayList()
{
   if(front == NULL)
       cout<<"No courses present"<<endl;
   else
   {
       cout<<"Courses: "<<endl;
       Node *node = front;

       while(node != NULL)
       {
           node->getCourse().print();
           cout<<endl;
           node = node->getNext();
       }
   }
}

//end of doubleLinkedList.cpp

// main.cpp : C++ driver program to implement the DoubleLinkedList class

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

int main()
{
   DoubleLinkedList list;
   int ID, choice;
   string name;
   double marks;
   // loop that continues till the user exits
   do
   {
       // display the menu
       cout<<"Menu"<<endl;
       cout<<"1. Adding a course to the front of the list"<<endl;
       cout<<"2. Adding a course to the back of the list"<<endl;
       cout<<"3. Searching for and displaying a specific course in the list"<<endl;
       cout<<"4. Editing a specified course from the list"<<endl;
       cout<<"5. Removing an identified course from the list"<<endl;
       cout<<"6. Displaying the entire list"<<endl;
       cout<<"7. Quit"<<endl;
       cout<<"Enter your choice(1-7): ";
       cin>>choice;

       // validate the choice and re-prompt until valid
       while(choice < 1 || choice > 7)
       {
           cout<<"Invalid choice"<<endl;
           cout<<"Enter your choice(1-7): ";
           cin>>choice;
       }

       switch(choice)
       {
           case 1:
               cin.ignore(100,'\n');
               cout<<"Enter the course name: ";
               getline(cin,name);
               cout<<"Enter the course marks: ";
               cin>>marks;
               list.addFront(Course(name,marks));
               break;

           case 2:
               cin.ignore(100,'\n');
               cout<<"Enter the course name: ";
               getline(cin,name);
               cout<<"Enter the course marks: ";
               cin>>marks;
               list.addBack(Course(name,marks));
               break;

           case 3:
               cout<<"Enter the course id to search: ";
               cin>>ID;
               list.search(ID);
               break;

           case 4:
               cout<<"Enter the course id to edit: ";
               cin>>ID;
               cout<<"Enter the new marks: ";
               cin>>marks;
               list.editCourse(ID,marks);
               break;

           case 5:
               cout<<"Enter the course id to remove: ";
               cin>>ID;
               list.removeCourse(ID);
               break;

           case 6:
               list.displayList();
       }
       cout<<endl;

   }while(choice != 7);

   return 0;
}

//end of program

Output: