Assignment Task:

As you can see, this is a Task Planner program that partitions tasks into a number of categories. The tasks in the same category form a priority list. All tasks are printed in a table format. The program provides very limited functionality and is for sure not competitive. Because of this, the customer requested the BuggySoft to add the following capabilities: 

— The user must be given an option to add new and delete existing categories. If a category is removed, all associated tasks should be removed as well. 
— The user must be given an option to delete an existing task. 
— It must be possible to move a task in its respective priority list by setting the place (priority). 
— It must be possible to move a task from one category to another. 
— It must be possible to highlight important tasks so that they appear in red in the terminal. 
— Every task must be characterised with a due date printed along with the name. This might need to enlarge the size of the table's columns. 

From what you see, the customer does not specify a particular design and leaves this to you. You, as a programmer, are also free to implement the internal logic of the program as you decide. However, the proper design will likely rely on composition. For example, you might have already noticed that tasks are to be "a part of the category and they are deleted along with their category. Remember that class composition ensures whole/part or parent/child relationship; that is, the life cycle of the part (or child) is controlled by the whole (or parent) that owns It. if the parent object is destroyed, then the child objects also cease to exist.

Note that you will likely need to create new classes to manipulate objects as data structures. For example, each task is characterised by a colour tag (to stress its importance) and a due date. This is not currently presented in the existing source code as well as any classes but the main class. Because we do not know how many classes you wish to create, we leave it to you and expect you to add them together to the 4F final code. c s', which is to be the only file that you must submit as your final solution. 

in addition, you will deal with a collection of objects to represent categories and task priority lists. Therefore, we recommend you to focus on the use of dynamic Lit.t<T> data structure rather than a quite static array. you are also allowed to alter the existing code in order to improve it. 

Finally, you will have to significantly extend the existing menu to interact with the user to serve their requests. 


This IT Assignment has been solved by our IT Experts at UniLearnO. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.

  • Uploaded By : Alex Cerry
  • Posted on : April 24th, 2019
  • Downloads : 289

Whatsapp Tap to ChatGet instant assistance