hw2.docxHomework #2Please complete the homework problems on th.docx

hw2.docxHomework #2
Please complete the homework problems on the following page
using a separate piece of paper. Note that this is an individual
assignment and all work must be your own. Be sure to show
your work when appropriate. This assignment is due in lab
1. [3] Remove 5 from the following AVL tree; draw the results:
2. [3] Insert the value "8" into the following AVL tree; draw the
result:
3. Given the following AVL tree:
A. [3] Add 45 to the tree.
B. [3] Ignoring all previous tasks, add values 9 and 8 to the
tree.
C. [3] Ignoring all previous tasks, remove values 10 and 30
from the tree.
D. [3] Ignoring all previous tasks, remove 80 and 100 from the
tree.
4. Binary Heaps (i.e. Priority Queues) Starting with an empty
binary min heap, show the following. Be sure to clearly label
each diagram.
A. [3] The final state of the heap, in tree form, after adding in
the values: 5, 4, 3, 6, 7, 8, 10, 2, 9, 1
B. [3] The state of the heap, in tree form, after two Dequeue()
operations

C. [2] The final, array-based version of the heap
0
1
2
3
4
5
6
7
8
9
results.csvJob NameStarting TickEnding
TickDurationJ2220J11109J44128J66148J1010144J99178J88191
1J772013J552520J333734
PA4.docxProgramming Assignment #4
Your organization has purchased a new parallel computer (or
"cluster") which has several processors. Your task is to design
and implement a simple shortest-job-first scheduler that allows
multiple users to access the cluster at the same time, as per the

following specification:
The scheduler performs all required functions at regular
intervals, often called "ticks." During each tick, the scheduler
must take into consideration several pieces of information:
1. Are there jobs in our input file that contains a list of jobs to
be run? If so, add that job to our list of current jobs. Note that
our jobs file contains one job per line in the following format:
"<JOB_NAME> <CPUS_REQUIRED> <DURATION>". Only
one job may be added to the jobs queue during any given tick.
If a job has a name of "NULL," skip that job for the current tick
(i.e. no jobs will be added during this tick). If a job requires
more CPUs than the cluster contains, you should output an error
and terminate execution of the program.
2. Are there jobs in the jobs queue? If so, find the job with the
shortest duration. Are there enough CPU resources for this job
to run? If so, begin execution (i.e. add to the active jobs
queue). If, after adding the previous job, are there enough
resources to run the next job in the queuejob? If so, go back to
the beginning of step #2. Stop adding to the list of active jobs
when there are not enough CPU resources available for the job
to execute. Try again in the future.
3. For each executing job (note that there may be multiple
concurrent jobs), perform one tick's worth of work. After,
check to see if the job is done executing. If complete, remove
from the active jobs queue and allocate the job's CPU resources
back into the resource pool. Note that it is possible for a job
with a duration of 1 to be scheduled, executed, and completed
during the same tick.
Upon completion, your program should produce a CSV file
called "result.csv" that documents the point at which each job
enters the jobs queue, finishes its execution, and the difference
between these two values.
Sample Jobs File
Below is a sample jobs file that you can use for testing:

12
J1 8 10
J2 2 1
J3 12 12
J4 10 2
J5 5 8
J6 4 2
J7 4 6
J8 2 5
J9 4 3
J10 6 2
Sample Output
Included with this document is the file "output.txt" that contains
the output of my program running the sample jobs list with a
CPU count of 12 (as specified in the first line of the input file).
Also included is the generated CSV file.
Header Comment, and Formatting
1. Be sure to modify the file header comment at the top of your
script to indicate your name, student ID, completion time, and
the names of any individuals that you collaborated with on the
assignment.
2. Remember to follow the basic coding style guide. A basic
list of rules is included with this document.
Deliverables
You must upload your program and reflection as a ZIP file
through Canvas. Remember that your submission must either
contain a CodeBlocks or Visual Studio project file!Reflection
Essay
In addition to the programming tasks listed above, your
submission must include an essay that reflects on your
experiences with this homework. This essay must be at least
350 words long. Note that the focus of this paper should be on

your reflection, not on structure (e.g. introductory paragraph,
conclusion, etc.). The essay is graded on content (i.e. it shows
deep though) rather than syntax (e.g. spelling) and structure.
Below are some prompts that can be used to get you thinking.
Feel free to use these or to make up your own.
· Describe a particular struggle that you overcame when
working on this programming assignment.
· Conversely, describe an issue with your assignment that you
were unable to resolve.
· Provide advice to a future student on how he or she might
succeed on this assignment.
1. Describe the most fun aspect of the assignment.
1. Describe the most challenging aspect of the assignment.
1. Describe the most difficult aspect of the assignment to
understand.
1. Provide any suggestions for improving the assignment in the
future.
Grading
Your grade will be determined as follows:
· [10] Your program uses a priority queue to model the
scheduler.
· Your program uses good Object Oriented Programming
principles. As evidence of this, your program uses classes to
represent:
· [5] A given job
· [5] A CPU within the cluster
· [5] The cluster of CPUs itself
· [10] Your reflection essay satisfies the requirements as
specified earlier in this document.
· [5] Your code is well documented and generally easy to read.
· [60] Does the code compile and run successfully on my test
cases? Does the generated CSV file appear to be correct?
output.txt

*** Tick: 1 ***
Processing jobs file...
The next job in the list is: J1.
Adding job to jobs queue...
Processing jobs queue...
Current number of scheduled jobs: 1.
Adding highest priority job:
J1 8 10
Jobs queue is empty.
Running active jobs...
*** Tick: 2 ***

J2 2 1
Job "J2" is complete. Freeing up resources.
*** Tick: 3 ***

Not enough free CPUs (requested: 12, actual: 4). Waiting for
resources...
*** Tick: 4 ***
resources...

*** Tick: 5 ***
resources...
*** Tick: 6 ***

resources...
*** Tick: 7 ***
resources...

*** Tick: 8 ***
resources...
*** Tick: 9 ***

resources...
*** Tick: 10 ***

resources...
*** Tick: 11 ***
There are no more jobs in the jobs file.
J4 10 2
resources...

*** Tick: 12 ***
resources...
*** Tick: 13 ***

J6 4 2
J10 6 2
resources...
*** Tick: 14 ***

resources...
*** Tick: 15 ***
J9 4 3
J8 2 5

J7 4 6
resources...
*** Tick: 16 ***
resources...

*** Tick: 17 ***
resources...
*** Tick: 18 ***

J5 5 8
resources...
*** Tick: 19 ***
resources...

*** Tick: 20 ***
resources...
*** Tick: 21 ***

resources...
*** Tick: 22 ***
resources...

*** Tick: 23 ***
resources...
*** Tick: 24 ***

resources...
*** Tick: 25 ***
resources...

*** Tick: 26 ***
J3 12 12
*** Tick: 27 ***

*** Tick: 28 ***

*** Tick: 29 ***
*** Tick: 30 ***

*** Tick: 31 ***
*** Tick: 32 ***

*** Tick: 33 ***

*** Tick: 34 ***
*** Tick: 35 ***

*** Tick: 36 ***
*** Tick: 37 ***

jobs.txt
12
J1 8 10
J2 2 1
J3 12 12
J4 10 2
J5 5 8
J6 4 2
J7 4 6

hw2.docxHomework #2Please complete the homework problems on th.docx

Recommended

Recommended

More Related Content

Similar to hw2.docxHomework #2Please complete the homework problems on th.docx

Similar to hw2.docxHomework #2Please complete the homework problems on th.docx (20)

More from wilcockiris

More from wilcockiris (20)

Recently uploaded

Recently uploaded (20)

hw2.docxHomework #2Please complete the homework problems on th.docx