Notes for assignment

[sebha01]

You can’t change the names of the methods provided or invent new public methods or attributes. You are also required to code everything yourself, restricting your use of libraries to and only. Make sure that you handle exceptions (e.g. when removing an item from an empty stack or queue).

The scheduling algorithm needs to provide the following functionality, as discussed in lectures:

• Be a subclass of the Queue class
• Use an int value as a process ID
• Use an int value as a priority (i.e. 1 = low, 10 = high)
• Handle exceptions in case the priority value exceeds the above range
• Be able to schedule as many processes as there is memory available; this memory will need to be allocated on demand from the heap

Additional marks will then be awarded for:

• Incorporating a system of prioritisation that allows each process to have a priority value assigned to it and to then be processed in order of that priority outside of the default FIFO ordering
• Developing a system that prevents blocking – e.g. when the continual addition of high priority events prevent lower priority events from being processed

Extra marks will be awarded to those who:

• Utilise efficient ways to deliver some of the above functionality (e.g. O(log N))

The video should demonstrate the program working. It is of particular importance that your code is well explained. The quality of your explanations will contribute significantly to your overall mark. Your code demo should attempt to describe the functionality of each section of code and how it fits into the overall behaviour of the program rather than just superficially describing what each line of code does in isolation.

Make sure the code demo runs the code and presents the results of all the individual tests provided in the code template. It should also be noted that the marks awarded for video will be weighted in favour of the feature complexity they are attempting to describe; with comments successfully describing the more advanced features resulting in the most marks being earned.

[sebha01]

Additional photos for reference on what to do for the assignment:

First photo shows the "rubric" on what will award the levels of marks The second shows the classes and the scheduler being a child of the queue class The third shows the linear search algorithm and the pseudocode for it so that it makes it easier to implement in the assignment