Description
Q1-Consider having the following reference string:
6 9 9 0 1 2 2 11 3 6 1 0 6 8 1 2 6
Use FIFO, OPT, LRU page replacement algorithms and compare between them based on page faults, knowing that 4 pages can be in memory at a time per process.
Q2-Using below disk scheduling algorithms, illustrate the request queue (0-199) and compare between them.
99, 61, 112, 145, 23, 45, 65
Knowing that the Head pointer starts at 122.
- FCFS
- SCAN
- C-SCAN
- Q3-What are the types of memory fragmentation? How it could happen? and what is the worst dynamic memory allocation that can increase it?
College of Computing and Informatics
Assignment #
Deadline: Day 05/05/2024 @ 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.
Restricted – مقيد
Question One
Pg. 01
Learning
Outcome(s):
Instructors: State
the Learning
Outcome(s) that
match this
question
Restricted – مقيد
Question One
3 Marks
Consider having the following reference string:
6 9 9 0 1 2 2 11 3 6 1 0 6 8 1 2 6
Use FIFO, OPT, LRU page replacement algorithms and compare between them
based on page faults, knowing that 4 pages can be in memory at a time per process
Question Two
Pg. 02
Learning
Outcome(s):
Question Two
3 Marks
Using below disk scheduling algorithms, illustrate the request queue (0-199) and compare
Instructors: State
the Learning
Outcome(s) that
match this
question
between them.
99, 61, 112, 145, 23, 45, 65
Knowing that the Head pointer starts at 122.
1. FCFS
2. SCAN
3. C-SCAN
Restricted – مقيد
Question Three
Pg. 03
Learning
Outcome(s):
Question Three
2 Marks
What are the types of memory fragmentation? How it could happen? and what is the worst
Instructors: State
the Learning
Outcome(s) that
match this
question
Restricted – مقيد
dynamic memory allocation that can increase it?
Purchase answer to see full
attachment
Assignment #
Deadline: Day 05/05/2024 @ 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.
Restricted – مقيد
Question One
Pg. 01
Learning
Outcome(s):
Instructors: State
the Learning
Outcome(s) that
match this
question
Restricted – مقيد
Question One
3 Marks
Consider having the following reference string:
6 9 9 0 1 2 2 11 3 6 1 0 6 8 1 2 6
Use FIFO, OPT, LRU page replacement algorithms and compare between them
based on page faults, knowing that 4 pages can be in memory at a time per process
Question Two
Pg. 02
Learning
Outcome(s):
Question Two
3 Marks
Using below disk scheduling algorithms, illustrate the request queue (0-199) and compare
Instructors: State
the Learning
Outcome(s) that
match this
question
between them.
99, 61, 112, 145, 23, 45, 65
Knowing that the Head pointer starts at 122.
1. FCFS
2. SCAN
3. C-SCAN
Restricted – مقيد
Question Three
Pg. 03
Learning
Outcome(s):
Question Three
2 Marks
What are the types of memory fragmentation? How it could happen? and what is the worst
Instructors: State
the Learning
Outcome(s) that
match this
question
Restricted – مقيد
dynamic memory allocation that can increase it?
Purchase answer to see full
attachment
