C++ Data Structure

Здраствуйте, необходимо сегодня до 17 00 по Киеву сделать 2 задания для теста по Data Structure.

Implement an unbounded Queue (a First-In-First-Out structure using sequential memory storage) as a template structure (aimed at storing values of any type), and the methods operating on this structure (not more than listed below; it is allowed to omit these which are not used in the program one submits):

• the default constructor,

• the destructor,

• the copy-constructor,

• the comparison operator==,

• push – adding a value to the queue,

• pop – removing the first value from the queue or throwing an empty queue exception,

• removeGreater – removing from the queue all the values greater than the one given as the parameter,

• front – returning the first value or throwing an empty queue exception,

• back – returning the last value or throwing an empty queue exception,

• empty – informing whether the queue is empty,

• print – printing all the items from the queue.

Implement a structure of a Task with a description, a project name and a duration (in hours), the default constructor, proper setters and gettters for the attributes and all the operators necessary to complete the further part of the task.

Write a program which implements operations on schedules being queues of Task structures. Use the Queue structure to create schedules for two employees.

Allow the user to choose among the following operations:

• add a new task (with attributes given by the user) at the end of chosen schedule,

• print the description and the duration of the first task in the chosen schedule (or print a message if the schedule is empty),

• compare both schedules if they are the same or not (contain the same tasks),

• [*] print all the data of all the tasks of the chosen schedule (using the print method of the schedule),

• [*] move the first task from the beginnig of one schedule to the end of another, but only if the last task in the target schedule belongs to the same project as the one to be moved (or print a message),

• [**] remove from the chosen schedule all the tasks longer than the value given by the user,

• [**] copy all the tasks from one schedule to the end of another (preserving their original order, the source schedule remains unchanged).