Assessment Details And Submission Guidelines Unit Code BN104/BN104D Unit Title Operating Systems Assessment Type Individual, Online Quiz And Written Answer. Assessment Title Assignment One - Introduction To Operating...
Assessment Details and Submission Guidelines
Individual, online quiz and written answer.
Assignment one - Introduction to operating systems, Memory and process management
Purpose of the assessment (with ULO Mapping)
The purpose of this assignment is to report on some important characteristics of Operating Systems and explain their functions. Students must answer Multiple Answer questions about OS operation, and report on selected OS aspects and algorithms such as virtual memory, process scheduling and mobile operating systems. After successful completion of this assignment, students should be able to:
10% of the total marks
5 PM, Thursday 31/8/2017 (week 7).
Marks are allocated as indicated on each question, taking the following aspects into account:
Section to be included in the report
Description of the section
Complete the online Quiz on Moodle
Answer questions relating to memory allocation, and based on the understanding on the topic student need to do some critical analysis on the given topic.
Memory replacement policy
Answer the question on memory replacement policy and justify the answer.
Process Management and Scheduling
Draw the timeline for different process scheduling algorithms and detailed calculation of waiting and turnaround time. Student also need to do some research and answer questions related to waiting and turnaround time for process.
Follow IEEE reference style (should have both in-text citation and reference list)
(refer to marking rubric for mark allocation).
Example Marking Rubric for Assignment 1: Total Marks 50
Marking Rubrics for Assignment 1 (for written answers):
Analysis, technical explanation (40%)
Logic is clear and easy to follow
Consistent and convincing
OK, but with some shortcomings
Confused or disjointed
Expression, justification (40%)
Writing is correct and well integrated
Mostly good expression, and reasonable well integrated
Expression not clear, English only acceptable
Poor English expression
Proper style, professionally presented.
Mostly good, but some presentation
Some apparent presentation problems
Poor structure, careless presentation
Clear styles with excellent source of references
Generally good referencing/style
Some references missing or wrong style
No references or many errors
Attempt the Assignment 1 quiz after Week 6, and paste the summary of your quiz
result (from Moodle) in the assignment report.
Memory allocation is the process of assigning blocks of memory spaces to processes competing for memory; two of the well-known
policies are Best fit and First fit. Using examples, explain each of the policies in your own words (use your own example – do not use the example from the lecture slides). The word limit is 300 words (excluding figures/diagrams).
You must provide references and cite the sources if you consult any external source for this task.
Worst-fit is an allocation algorithm that allocates the largest free block to a new job. It is the opposite of the best-fit algorithm. Compare it to best-fit conditions for the example that you have given in
the answer for B-Q1a and explain in your own words what advantages the worst-fit algorithm could offer (Word limit: 200 words).
Memory Replacement Policies
Given the following loading times, determine in
which order the pages are replaced by the FIFO algorithm (explain your reason in details).
Describe how the simplified version of LRU works in your own words. Using the given values in the table below for the Referenced and Modified bits, determine in which order the pages are replaced by the simplified LRU algorithm and explain why you think so.
Process Management and Scheduling
In a multiprogramming environment, scheduling algorithms are used for better utilisation of processor resources, maximising the system performance and to achieve fairness among difference processes. There are a number of scheduling algorithms that could be used in a multiprogramming environment, such as:
Given the following arrival time and CPU cycle times:
(i) Draw a timeline for each of the above scheduling algorithms and explain the timeline in your own words. (3x4=12 marks)
(ii) Show the details of the ready queue formation during the time line.
For Round Robin use time quantum of 3.
Using either internet resources or books, understand the concept of waiting time and turnaround time. Define those terms (waiting time and turnaround
time) in your own words. Then calculate turnaround time for every job for all four scheduling algorithms mentioned in B-Q3-a (Details of the calculations is essential).
You must provide references and cite the sources that you consulted for this task.
Asked by rebeccacox 5 years ago