To-do List – 20210621Z

The purpose of this assignment is to give you practice implementing your own classes. It also provides extra practice with arrays. Because it is the end of the semester and we have a short deadline for submitting grades, absolutely no late assignments can be accepted for credit. Implement a class Task, which is used to represent a job that should be done. It should contain the following private fields: Implement at least the following public methods within the Task class: For example, we should be able to do something like the following: Write a very short driver program (a separate class containing a main()) to test your code to make sure it’s working. You are not required to write JUnit tests. Implement a class HoneyDoList, which is used to manage a collection of Task. It should contain the following private fields: Implement at least the following public methods within the HoneyDo class: For example, we should be able to do something like the following: Write a very short driver program to test your code to make sure it’s working. You are not required to write JUnit tests. One of the purposes of this assignment is give you practice managing fixed-sized arrays. Although you may use the Arrays class, please refrain from using ArrayList or any other class in Java’s Collections Framework. (We’ll get to these soon ?.) Suppose that we have a HoneyDoList with a capacity of 10 items and contains 4. We can visualize it this way: name text description of what job should be done (e.g., take out the trash, finish 1068 homework). priority, a non-negative integer which stores the importance of a Task. estMinsToComplete, a non-negative integer which holds the anticipated number of minutes it should take to complete the task extra credit: whenDue a java.time.LocalDateTime object representing the date and time when the task should be completed a constructor, which initializes each of the fields accessor methods for each of the fields. Use the naming convention getXXX() where XXX is the name of the field, e.g., you’ll write a method called getName() which returns the name of the Task. mutator methods for each of the fields except for priority. Use the naming convention setXXX() where XXX is the name of the field, e.g., you’ll write a method called setName(String newName), which would update the name field of the Task to newName. toString( ), which returns a String representation of the Task. increasePriority(int amount) increases the priority level by amount. If a negative amount is specified, the method returns without making any changes. decreasePriority(int amount) decreases the priority level by amount. If the decrease is more than the current value of priority (and subtracting this amount would result in a negative priority), priority should be set to 0. extra credit: overdue() returns true if the current date/time is later than whenDue or false otherwise. tasks[] an array of Task numTasks, a non-negative integer storing the number of items contained in tasks[]. INITIAL_CAPACITY, a constant non-negative integer. This is how large the task array should be at creation time. a constructor, which creates the tasks[] array, giving it the capacity of INITIAL_CAPACITY, and setting numTasks to 0. toString( ), which returns a String representation of each Task in tasks[]. Do not include in the String null for entries in tasks[] that are empty. find(String name), which returns the index of the first occurence of a Task whose name matches the name specified ignoring case. Recall that there is an equalsIgnoreCase() method in the String class. The method should return -1 if no match is found. addTask(), which appends a new Task to the occupied end of tasks[]. If tasks[] is already full when you attempt to add the new Task, a new array is created, all of the items are copied from the old array into the new one, and tasks[] is set to point to the new array. totalTime() which returns the total time in minutes required to complete all tasks in the list. shortestTime() which returns the index of the task that should take the least amount of time to finish or -1 if the list is empty. completeTask(int index), which removes and returns the Task at the specified index shifting all subsequent tasks in the array one position to the left. If index is invalid, returns null. See example. extra credit: overdueTasks() returns an array of Task consisting of only the items in tasks[] that are overdue.