ASAP

JAVA Application

Create a class EventItem that holds the location of an event called location(a String), the name of the event called eventName (a String), a start hour (in 24hour format) called startTime (an integer) and an end hour (in 24 hour format) called endTime (an integer). All state values are public and a constructor is needed that takes all four parameters.

Part 2:

Create a class DailyScheduler that holds EventItem objects in an array called dailySchedule (The maximum size of the array is 100). It must also have a variable that holds the maximum number of EventItems(100) and another for the actual number of EventItems.

All state variables must be initialized in a single constructor that takes no parameters.

[0.5 marks for all necessary class state declarations]

The class DailyScheduler has the following operations:

void sortAscendingByEventName() - This method sorts the EventItems in ascending order using insertion sort by their eventName. [1.25 marks]

void sortAScendingByStartTime() - This method sorts the EventItems in ascending order using insertion sort by their startTime. [0.5 marks]

void sortDescendingByLength() - This method sorts the EventItems in descending order using selection sort by their length of time (endTime startTime). [1.5 marks]

String printDayScheduleByStartTime() - This method returns a string of all EventItems with their location, eventName, startTime and endTime in ascending order by their starting time. [0.5 marks]

String printDayScheduleByLongestTime() - This method returns a string of all EventItems with their location, eventName, startTime and endTime in ascending order by their starting time. [0.25 marks]

int binarySearch(String eventName) This method uses binary search to return the location of an EventItem with the eventName matching the parameters, or -1 if not. YOU MUST ASSSUME THE ARRAY IS SORTED IN ORDER BY EVENTNAME. [2 marks]

boolean addEventItem(String location,String eventName,int startTime,int endTime) - This method must in order:

1. Check if there is space to add a new EventItem (returns false if not)
2. Sort the list in ascending order by eventName. [0.25 marks for 1 and 2]
3. Uses binarySearch to check if there is an item with the same eventName in the array. [1 mark]
4. Creates an EventItem and adds it to the end of the array if there is no item with the same eventName and location. (returns false if there is a clash and true if not)[0.75 marks]

YOU MAY ASSUME EVENT NAMES ARE UNIQUE (two EventItems will not have the same eventNames).

Part 3

Write a main program that:

1. Adds the following event items to a DailyScheduler. [0.5 marks]

Order of adding to Queue	Location	Event name	Start time	End time
1	Library	breakFast1	7	9
2	Main Hall	Conference3	12	13
3	Boardroom1	breakFast1	8	11
4	Boardroom1	Meeting2	14	17

(Note that item 3 will not be added to the list by the program as it has the same eventName as item 1)

2. Prints the dailySchedule (in ascending order by startTime). [0.25 marks]
3. Prints all the items in descending order by their length of time. [0.25 marks]