IT 241 SEU Operating Systems Features and Functionalities Case Study

Description


College of Computing and Informatics
Operating Systems
IT241
Assignment #2
Deadline: Sunday 10/04/2022 @ 23:59
[Total Mark for this Assignment is 8]
Student Details:
Name: ###
ID: ###
CRN: ###
Instructions:










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, convert text into image 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.
Question One
Pg. 01
Learning
Outcome(s):
Question One
1.5 Marks
1. What is a system deadlock? Provide an example to clarify the definition. (0.5
marks)
CLO 5: Explain the
rational for storage
management,
memory
management and
virtual memory
concepts.
CLO 6: Evaluate
the effectiveness of
different techniques
in processes,
devices and
memory
management.
2. Draw a figure that shows a system with deadlocks. Use your own Resource
Allocation Graph Example. Justify and discuss the figure properly. (0.5
marks)
3. Draw a figure that shows a system with free deadlocks. Use your own
Resource Allocation Graph Example. Justify and discuss the figure properly.
(0.5 marks)
Question Two
Pg. 02
Learning
Outcome(s):
2.5 Marks
Question Two
Consider
the following system snapshot:
In the following table, we have several processes (P1, P2, P3, and P4) where each
process needs to use the resources of A, B, and C. Let us assume that the resources are
CLO 6: Evaluate
the effectiveness of
different techniques
in processes,
devices, and
memory
management.
CPU (A), printer (B), and memory (C). For each resource, there are several
instances/copies. Let us assume that when every process finishes its execution, it will
release its allocated resources.
Allocation
Max
Available
Need
Process
A
B
C
A
B
C
A
B
C
P1
2
0
2
3
3
2
2
2
2
P2
3
2
1
3
3
4
P3
1
3
2
1
5
4
P4
1
2
1
2
3
1






Final available
resources
A
B
C



Answers the following questions using Banker’s algorithm. Note that, you must Fill
Out the white empty cells in the above table with the correct values.
1- What are the contents of the Need matrix? Justify and show your answer and
used equations (1 marks)
2- Is the system in a safe state? Justify and show your answer. You must fill the
available matrix above (1.5 marks).
Question Three
Pg. 03
Learning
Outcome(s):
Question Three
2 Marks
The LRU page replacement algorithm is considered efficient. However, applying this
approach to select an order for the frames determined by the time of last usage is
problematic. Discuss the two approaches to the situation.
CLO 5: Explain the
rational for storage
management,
memory
management and
virtual memory
concepts.
Question Four
Pg. 04
Learning
Outcome(s):
Question Four
2 Marks
Consider the following references page:
8, 2, 3, 1, 2, 5, 3, 4, 6, 8, 8, 1, 0, 5, 4, 6, 2, 3, 0, 1.
CLO 6: Evaluate
the effectiveness of
different techniques
in processes,
devices, and
memory
management.
Using three frames of demand paging, how many page faults would occur with the
following replacement algorithms?
1- FIFO (first-in-first-out) algorithm.
2- Optimal algorithm.

Purchase answer to see full
attachment

ORDER ASSIGNMENT



Essays Assignment Help

We are a professional paper writing website. If you have searched a question and bumped into our website just know you are in the right place to get help in your coursework. We offer HIGH QUALITY & PLAGIARISM FREE Papers.

How It Works

To make an Order you only need to click on “Order Now” and we will direct you to our Order Page. Fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.

Are there Discounts?

All new clients are eligible for upto 20% off in their first Order. Our payment method is safe and secure. Hire a tutor today CLICK HERE to make your first order