Operating Systems 2014F: Assignment 3
This assignment is not yet finalized.
Please submit the answers to the following questions via CULearn by midnight on Wednesday, September 24, 2014. There 10 points in ?? questions.
Submit your answers as a single text file named "<username>-comp3000-assign3.txt" (where username is your MyCarletonOne username). The first four lines of this file should be "COMP 3000 Assignment 3", your name, student number, and the date of submission. You may wish to format your answers in Markdown to improve their appearance.
No other formats will be accepted. Submitting in another format will likely result in your assignment not being graded and you receiving no marks for this assignment. In particular do not submit an MS Word or OpenOffice file as your answers document!
Don't forget to include what outside resources you used to complete each of your answers, including other students, man pages, and web resources. You do not need to list help from the instructor, TA, or information found in the textbook.
Questions
- [3] For each of the following workloads, say which simple scheduling algorithm would be most appropriate and explain your choice. Choose from the following algorithms as defined in Chapter 7 of the textbook: FIFO, SJF, STCF, RR.
- [2] "Preemptive schedulers are always less efficient than non-preemptive schedulers." Explain how this statement can be true if you define efficiency one way and how it is false if you define efficiency another way.