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:

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

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 

• 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:

  ---

  href="http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/Plagiarism-Academic-Misconduct-Policy-Procedure">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

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.

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

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

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

A-QUIZ

20 marks

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

 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

B-Q2

10 marks

Memory Replacement Policies

B-Q2a

5 marks

Given the following loading times, determine in

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. 

B-Q3

30 marks

Process Management and Scheduling

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:

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

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

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