1094

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...

 


valign="top" width="528">
  • If an extension of time to submit work is required, a Special Consideration Application must be submitted directly to the School's Administration Officer, in Melbourne on Level 6 or in Sydney on Level 7.  You must submit this application three working days prior to the due date of the assignment. Further information is available at:

http://www.mit.edu.au/about-mit/institute-


href="http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/special-considerationdeferment">publications/policies-procedures-and-

href="http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/special-considerationdeferment">guidelines/special
considerationdeferment

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 systems, Memory and process management

Purpose of the assessment (with ULO Mapping)


width="528">

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:

  1. Report on the basics, and provide examples, of operating systems structure and functionality, including memory allocation virtual memory, demand paging and process and device management.
  2. Describe the integration of hardware, operating systems and application software.

 

 

Weight

10% of the total marks

Total Marks


width="528">

70

Word limit

1000

Due Date

       5 PM, Thursday 31/8/2017 (week 7). 

(

Submission Guidelines

  • All work must be submitted on Moodle by the due date along with a Title Page.
    • The assignment must be in MS Word format, 1.5 spacing, 11-pt Calibri (Body) font and 2.54 cm margins on all four sides of your page with appropriate section headings. 
    • Reference sources must be cited in the text of the report, and listed appropriately at the end in a reference list using IEEE referencing style.

Extension

Academic Misconduct 

 

 

Marking criteria:

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

Marks

Online Quiz


width="359">

Complete the online Quiz on Moodle

20

Memory Allocation

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.

10

Memory replacement policy

Answer the question on memory replacement policy and justify the answer.

10

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.


width="89">

30

Reference style

Follow IEEE reference style (should have both in-text citation and reference list)

(refer to marking rubric for mark allocation).

 

Total

70

 

 

 

 

 

 

 

 

 

 

 

 

 

Example Marking Rubric for Assignment 1: Total Marks 50

Marking Rubrics for Assignment 1 (for written answers):

 


width="125">

Good

 

Excellent

Acceptable

Unsatisfactory

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

Presentation

 (10%)

Proper style, professionally presented.

Mostly good, but some presentation



problems

Some apparent presentation problems

Poor  structure, careless presentation

Reference style

 (10%)

 

Clear styles with excellent source of references

Generally good referencing/style

Some references missing or wrong style

No references or many errors

 


 

Assignment 1-Questions

A-QUIZ

20 marks

 

 

Attempt the Assignment 1 quiz after Week 6, and paste the summary of your quiz



result (from Moodle) in the assignment report.

 

 

 

 

 

 

B-Q1

10 marks

 

 

Memory Allocation

 

 

 

B-Q1a

6 marks

 

 

 

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.

 

 

 

 

 

 

B-Q1b

4 marks

 

 

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).

 

 

 

 

 

 

 

 

 

 

 

B-Q2

10 marks

 

 

Memory Replacement Policies

 

 


width="440">

 

B-Q2a

5 marks

 

Page

Time when page was loaded into memory

Page  3

55

Page  7

20

Page  9

110

Page 10

25

Page 13

100

Page 16

115

Page 17

30

Page 19

150

Given the following loading times, determine in



which order the pages are replaced by the FIFO algorithm (explain your reason in details).

 

 

 

 

 

 

 

 

 

 

 

 

 

 

B-Q2b

5 marks

 

 

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. 

 

Page

Referenced



Bit

Modified Bit

Page 1

0

0

Page  5

1

0

Page  7

1

1

Page  9

0

1

Page 13

1

1

Page 17

1

0

Page 20

0

1

Page



23

0

1

Page 26

0

0

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

B-Q3

30 marks

 

 

Process Management and Scheduling

 


align="left">

B-Q3a

20 marks

 

 

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:

  1. FCFS
  2. SJN
  3. SRT
  4. Round Robin

 

Given the following arrival time and CPU cycle times:

 


width="82">

B

Process

Arrival Time (sec)

CPU cycle

A

0

15

2

11

C

3

4

D

7

2

E

10

8

 

 

 

 

 

 

 

 

(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.  



                                         (2x4=8 marks)

 

For  Round Robin use time quantum of 3.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

B-Q3b

10 marks

 

 

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.

 

 


Question Field

Asked by nicolemcdowell
6 years ago
NO ANSWERS YET
RELATED QUESTIONS
84 Rank 414 Views
 CIS 111

Asked by christopher85 5 years ago

765 Rank 927 Views
691 Rank 501 Views
 -

Asked by morgan36 5 years ago

1005 Rank 947 Views
1259 Rank 699 Views
1138 Rank 87 Views
 Database Design

Asked by nbruce 5 years ago

611 Rank 999 Views
 Case Study Part 3

Asked by fwilliams 5 years ago

139 Rank 1211 Views
 Formula And Functions

Asked by rhensley 5 years ago

1025 Rank 566 Views