|Annual Report FY [Year]|
|Operating System IT241|
|You must submit two separate copies (one Word file and one PDF file) using the Assignment Template on Blackboard via the allocated folder. These files must not be in compressed format.It is your responsibility to check and make sure that you have uploaded both the correct files.Zero mark will be given if you try to bypass the SafeAssign (e.g. misspell words, remove spaces between words, hide characters, use different character sets or languages other than English or any kind of manipulation).Email submission will not be accepted.You are advised to make your work clear and well-presented. This includes filling your information on the cover page.You must use this template, failing which will result in zero mark.You MUST show all your work, and text must not be converted into an image, unless specified otherwise by the question.Late submission will result in ZERO mark.The work should be your own, copying from students or other resources will result in ZERO mark.Use Times New Roman font for all your answers.|
|Name: ### CRN: ### ID: ###|
2 Marks Learning Outcome(s): Describe the OS mechanism for process management, timing, memory, I/O, file and concurrency management. Question One
Consider the following snapshot of a system:
|Process||Allocation A B C D||Max A B C D||Available A B C D|
|P0||2 0 0 1||4 2 1 2||3 3 2 1|
|P1||3 1 2 1||5 2 5 2|
|P2||2 1 0 3||2 3 1 6|
|P3||1 3 1 2||1 4 2 4|
|P4||1 4 3 2||3 6 6 5|
Answer the following questions using the banker’s algorithm:
- How many instances of resources are present in the system under each type of a resource?
- What is the content of the matrix Need?
- Is the system in a safe state? (explain your answer)
- If a request from process P1 arrives for (1,1,0,0), can the request be granted immediately? (explain your answer)
2 Marks Learning Outcome(s): Recognize the impact of the interaction between design decisions and operating system features on the performance and robustness of the programs. Question Two
Provided memory partitions of 50K 150K, 500K, 200K, 300K, and 650K (sequentially). Determine how would each of the Best-fit, First-fit, and Worst-fit algorithms place processes of 223K, 489K, 200K, and 547K (sequentially)? Also mention which algorithm makes the best efficient use of memory
Algorithm that makes the best efficient use of memory.
1 Marks Learning Outcome(s): Describe the OS mechanism for process management, timing, memory, I/O, file and concurrency management. Question Three
One of the methods that could be used for handling deadlocks, is ensuring that the system will never enter a deadlock state. And that could be achieved by:
1) Deadlock Prevention,
2) Deadlock Avoidance.
Explains the differences between these two mechanisms in your own language.
Do you have a similar assignment and would want someone to complete it for you? Click on the ORDER NOW option to get instant services at essayloop.com
Do you have a similar assignment and would want someone to complete it for you? Click on the ORDER NOW option to get instant services at essayloop.com. We assure you of a well written and plagiarism free papers delivered within your specified deadline.