Question

Could anyone help me solve this problem in C++? Thanks a lot.

Develop an OOP program to maintain a list of homework assignments. When an assignment is assigned, add it to the list, and when it is completed, remove it. You should keep track of the due date. Your program should provide the following services:

• Add a new assignment.

• Remove an assignment.

• Provide a list of the assignments in the order they were assigned.

• Find the assignment(s) with the earliest due date.

create a class called assignments to complete the task and use STL to implement the linked list.

Answer 1

Screenshot

Program

assignment.h

/*
Create a class Assignment
with attributes of name and due date
*/
#include<iostream>
#include<string>
using namespace std;
class Assignment {
   //Attributes
private:
   string assignmentName;
   string dueDate;
   //Member functions
public:
   Assignment(string name = "",string date = "");
   friend ostream& operator<<(ostream& out, Assignment as);
   bool operator==(Assignment& as);
   string getName()const;
   string getDate()const;
};
//Constructor assign values
Assignment::Assignment(string name,string date) {
   assignmentName = name;
   dueDate = date;
}
//Output operator overload
//Display assignments details as coma separated values
ostream& operator<<(ostream& out, Assignment as) {
   out << as.assignmentName << ", " << as.dueDate;
   return out;
}
//Check 2 assignmnets are equal or not
bool Assignment::operator==(Assignment& as) {
   return this->assignmentName==as.assignmentName && this->dueDate==as.dueDate;
}
//Attributes getters
string Assignment::getName()const {
   return assignmentName;
}
string Assignment::getDate()const{
   return dueDate;
}

Tester.cpp

/*
Tester
*/
#include "assignment.h"
#include<list>
#include<iterator>
#include <ctime>

//Function prototypes
int getOption();
void addAssignment(list<Assignment>& assignments);
void removeAssignment(list<Assignment>& assignments);
void displayAssignments(list<Assignment>& assignments);
void earliestAssignments(list<Assignment>& assignments);

int main()
{
   //Create a list for assignmnets storage
   list<Assignment> assignments;
   //Get option
   int opt = getOption();
   //Loop until exit
   while (opt != 5) {
       //Add assignment
       if (opt == 1) {
           addAssignment(assignments);
       }
       //Remove assignment
       else if (opt == 2) {
           removeAssignment(assignments);
       }
       //Display all assignments
       else if (opt == 3) {
           displayAssignments(assignments);
       }
       //Display earliest assignments details
       else if (opt == 4) {
           earliestAssignments(assignments);
       }
       //Repetition of loop
       cout << endl;
       opt = getOption();
   }
   cout << "\nEnding.....\n";
}
/*
Function to get an option from user
Display user options
Ask for user choice
Do error check
And return option
*/
int getOption() {
   int opt;
   cout << "USER OPTIONS:-\n1. Add a new assignment\n2. Remove an assignment\n"
       << "3. Provide list of assignment\n4. Earliest due date assignment\n5. Exit\n";
   cin >> opt;
   while (opt < 1 || opt>5) {
       cout << "Error!!!Option must be 1-5\n";
       cout << "USER OPTIONS:-\n1. Add a new assignment\n2. Remove an assignment\n"
           << "3. Provide list of assignment\n4. Earliest due date assignment\n5. Exit\n";
       cin >> opt;
   }
   return opt;
}
/*
Function to add a new assignemnt in the list
*/
void addAssignment(list<Assignment>& assignments) {
   string name, date;
   cin.ignore();
   //Get assignment details from user
   cout << "Enter assignment name: ";
   getline(cin, name);
   cout << "Enter assignment date(d/m/yyyy): ";
   cin >> date;
   //Create an assignment object
   Assignment assignment(name, date);
   //Get current date as string
   time_t now = time(0);
   tm *ltm = localtime(&now);
   string current = to_string(ltm->tm_mday) + "/"+to_string(1+ltm->tm_mon)+"/"+to_string(1900 + ltm->tm_year);
   //Compare new assignment less than current date ,generate error msg
   if (assignment.getDate()<current){
       cout << "Date is less than current date,not added!!!" << endl;
   }
   //Otherwise
   else {
       //Check already present in list
       bool flag = false;
       list <Assignment> ::iterator it;
       for (it = assignments.begin(); it != assignments.end(); ++it) {
           Assignment as = *it;
           if (as==assignment) {
               cout << "Assignment already added!!!So not newly addd!!!" << endl;
               flag = true;
               break;
           }
       }
       //Otherwise add into list
       if (!flag) {
           assignments.push_back(assignment);
           cout << "Added successfully!!!\n";
       }
   }
}
/*
Function get an assignment details
if found in list remove
otherwise not found error message
*/
void removeAssignment(list<Assignment>& assignments) {
   string name, date;
   cin.ignore();
   //Get assignment details
   cout << "Enter assignment name: ";
   getline(cin, name);
   cout << "Enter assignment date(d/m/yyyy): ";
   cin >> date;
   //Create an assignment object
   Assignment assignment(name, date);
   //Check present or not
   bool flag = false;
   list <Assignment> ::iterator it;
   for (it = assignments.begin(); it != assignments.end(); ++it) {
       Assignment as = *it;
       if (as==assignment) {
           flag = true;
           assignments.erase(it);
           cout << "Assignment removed successfully!!!" << endl;
           break;
       }
   }
   if (!flag) {
       cout << "Not found in list!!!\n";
   }
}
/*
Function to display all assignments as added way
*/
void displayAssignments(list<Assignment>& assignments) {
   list <Assignment> ::iterator it;
   for (it = assignments.begin(); it != assignments.end(); ++it)
       cout << *it << endl;
}
/*
Display detail of an assignment as earliest submission due
*/
void earliestAssignments(list<Assignment>& assignments) {
   list <Assignment> ::iterator it;
   it = assignments.begin();
   Assignment assignment = *it;
   for (it = assignments.begin(); it != assignments.end(); ++it) {
       Assignment as = *it;
       if (as.getDate()<assignment.getDate()) {
           assignment = as;
       }
   }
   cout << "Earliest assignmnet = " << assignment << endl;
}

--------------------------------------

Output

USER OPTIONS:-
1. Add a new assignment
2. Remove an assignment
3. Provide list of assignment
4. Earliest due date assignment
5. Exit
1
Enter assignment name: A1
Enter assignment date(d/m/yyyy): 28/2/2020
Added successfully!!!

USER OPTIONS:-
1. Add a new assignment
2. Remove an assignment
3. Provide list of assignment
4. Earliest due date assignment
5. Exit
1
Enter assignment name: A2
Enter assignment date(d/m/yyyy): 11/1/2020
Date is less than current date,not added!!!

USER OPTIONS:-
1. Add a new assignment
2. Remove an assignment
3. Provide list of assignment
4. Earliest due date assignment
5. Exit
1
Enter assignment name: A1
Enter assignment date(d/m/yyyy): 28/2/2020
Assignment already added!!!So not newly addd!!!

USER OPTIONS:-
1. Add a new assignment
2. Remove an assignment
3. Provide list of assignment
4. Earliest due date assignment
5. Exit
1
Enter assignment name: A3
Enter assignment date(d/m/yyyy): 28/1/2020
Added successfully!!!

USER OPTIONS:-
1. Add a new assignment
2. Remove an assignment
3. Provide list of assignment
4. Earliest due date assignment
5. Exit
3
A1, 28/2/2020
A3, 28/1/2020

USER OPTIONS:-
1. Add a new assignment
2. Remove an assignment
3. Provide list of assignment
4. Earliest due date assignment
5. Exit
4
Earliest assignmnet = A3, 28/1/2020

USER OPTIONS:-
1. Add a new assignment
2. Remove an assignment
3. Provide list of assignment
4. Earliest due date assignment
5. Exit
2
Enter assignment name: A3
Enter assignment date(d/m/yyyy): 28/1/2020
Assignment removed successfully!!!

USER OPTIONS:-
1. Add a new assignment
2. Remove an assignment
3. Provide list of assignment
4. Earliest due date assignment
5. Exit
3
A1, 28/2/2020

USER OPTIONS:-
1. Add a new assignment
2. Remove an assignment
3. Provide list of assignment
4. Earliest due date assignment
5. Exit
5

Ending.....