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)

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:

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

b.      Describe the integration of hardware, operating systems and application software.

 

Weight

10% of the total marks

Total Marks

70

Word limit

500

Due Date

       5 PM, 5 May 2017 (Friday, week 7)

Submission Guidelines

•     All work must be submitted on Moodle by the due date along with a completed Assignment Cover Page.

•    The assignment must be in MS Word format, 1.5 spacing, 11-pt Calibri (Body) font and 2 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

•    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-publications/policies-procedures-and-guidelines/specialconsiderationdeferment

Academic Misconduct 

•    Academic Misconduct is a serious offence. Depending on the seriousness of the case, penalties can vary from a written warning or zero marks to exclusion from the course or rescinding the degree. Students should make themselves familiar with the full policy and procedure available at:http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/Plagiarism-Academic-Misconduct-Policy-Procedure.For further information, please refer to the Academic Integrity Section in your Unit Description.

Section to be included in the report

Description of the section

Marks

Online Quiz

Complete the online Quiz on Moodle

20

Fragmentation and memory mapping

Answer question related to internal/external fragmentation and memory compaction, 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 timeline for different process scheduling algorithm 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.

30

Reference style

Follow IEEE reference style

 

 

Total

70

 

Excellent

Good

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

B-Q1

10 marks

 

 

Memory Fragmentation and Compaction

 

B-Q1a

5 marks

 

 

 

Compare and contrast internal fragmentation and external fragmentation (explain with simple example, do not use the example from the lecture). In your opinion, which one might be preferred over the other. Give reason for your answer (word limit 150 words).

 

 

 

 

B-Q1b

5 marks

 

 

Memory compact/relocation is done for using the memory efficiently. In your opinion, how often should memory compaction/relocation be performed? What do you think the advantages and disadvantages would be of performing it even more often? (Word limit:  100 words).

You must provide references and cite the sources if you consult any external source for this task.

 

 

 

 

B-Q2

10 marks

 

 

Memory Replacement Policies

 

B-Q2a

5 marks

 

 

Page       Time when page was loaded into memory

Page  1   50

Page  3   10

Page  4   100

Page  8   15

Page 12  120

Page 15  105

Page 16  11

Page 18  85

Given the following loading times, determine in which order the pages are replaced by the FIFO algorithm (explain your reason).

 

 

 

 

 

 

 

 

 

 

 

 

B-Q2b

5 marks

 

 

Describe how the simplified version of LRU works. Using the given values in 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  0   0              1

Page  3   0              0

Page  6   1              0

Page  8   0              0

Page 12  1              1

Page 14  1              0

Page 16  1              0

Page 18  1              1

 

 

 

 

 

 

 

 

 

 

B-Q2

30 marks

 

 

Process Management and Scheduling

 

B-Q3a

20 marks

 

 

Given the following arrival time and CPU cycle times.

Job       Arrival Time    CPU cycles required

A          0          11

B          2          13

C          5          5

D          7          1

E          13        3

 

 

 

 

 

 

 

 

Draw a timeline for each of the following scheduling algorithms and also show the details of the ready queue formation during the time line.   (5 marks each)

i)     FCFS

ii)    SJN

iii)   SRT

iv)   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-Q2-a (Details of the calculations is essential).

You must provide references and cite the sources that you consulted for this task.