Information Technology

BN104 Operating Systems

12 April 2023 06:28 AM | UPDATED 12 months ago

BN104 Operating Systems :

For solution: +610482078788

+61482073403

+61482072848

BN104  Operating Systems
BN104 Operating Systems
Assessment Details and Submission Guidelines
Year and TermT2, 2022
Unit CodeBN104
Unit TitleOperating Systems
Assessment TitleMemory 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 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:     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. Describe the integration of hardware, operating systems and application software.Explain in detail the functioning of some devices such as peripherals
WeightPart A and Part B: 20%
Total Marks30
Word limitN/A
Due Date11:55PM, Sunday, 29th September, 2022 (Week 11) 
Submission GuidelinesAssignment structure and 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.
ExtensionIf an extension of time to submit work is required, a SpecialConsideration 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 thedue date of the assignment. Further information is available at: http://www.mit.edu.au/about-mit/institute-publications/policies- procedures-and-guidelines/specialconsiderationdeferment
Academic MisconductAcademic Misconduct is a serious offence. Depending on theseriousness 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 andprocedure  availableat:                          http://www.mit.edu.au/about-mit/institute- publications/policies-procedures-and- guidelines/Plagiarism-Academic-Misconduct-Policy-Procedure. Forfurther information, please refer to the Academic Integrity Section inyour Unit Description.  

Assignment Description:

The assignment has following two parts:

Part A – Lecture contents related questions for Memory Allocation                                                                  (12 Marks)

Part B – Case Study based question for Efficient Memory Management                                                          (18 Marks)

Part A: Answer the Following Questions

  1. Briefly differentiate between the 8 Memory Allocation Scheme we discussed in class (A comparison Table can be drawn).                                                                                                                                         (4 Marks)
  • What is a Cache Memory? Pen down different levels of Cache and provide advantages of using it.

(3 Marks)

  • Calculate cache hit ratio and average memory access time using the formula presented below assuming that the total number of requests is 3,056 and 540 of those requests are found in the cache. The Average Cache Access Time is 50 sec and Average Main Memory Access Time is 70 sec.

(3 Marks)

· Referencing

Report needs to be properly cited and referenced following IEEE referencing style.                      (2 Marks)

Part B: Case Study: Efficient Memory Management for MIT Database and OS Scheduling Algorithms

  1. A new memory management system needs to be incorporated to make the existing system more efficient. The below memory diagram consists of memory associated with the email addresses and names of students taking BN 104 course (referred as M1, M3, M6, M9 and M10 in Table 1).

Being an OS manager, your task is to evaluate memory compaction and write down the base and limit registers assigned by the OS after compaction. Also show the results in a new table. (15 Marks)

M1     M6   M3 M9 M10    

1K

5K

9K

13K

15K

18K

19K

20K

22K

Figure 1. Memory diagram of Computer System with five pages in the memory (M1, M3, M6, M9, M10)

  • Based on the Arrival Time and CPU Cycle you as an OS Specialist needs to calculate the Average Turnaround Time and draw Gantt Chart (timeline). The Scheduling algorithms are listed as follows:
ProcessArrival TimeCPU cycle
A020
B23
C46
D52
E88
  1. First-come, first-served (FCFS)
    1. Shortest job next (SJN)
    1. Priority scheduling
    1. Shortest remaining time (SRT)
    1. Round robin
    1. Multiple-level queues
    1. Earliest deadline first (EDF)

·         Referencing

BN104 Operating Systems Report needs to be properly cited and referenced following IEEE referencing style.                       (3 Marks)

Marking criteria: Marks are allocated as follows:

Section to be included in the reportDescription of the sectionMarks
Question No 1– 8 Memory Allocation Scheme4
Question No 2– Cache Memory, its levels and advantages in system performance3
Question No 3– Calculating Hit ration and average memory access time3
Reference styleFollow IEEE reference style and in-text citation2
    Case Study EvaluationEfficient Memory Management for MIT Database8
OS scheduling algorithm7
Reference styleFollow IEEE reference style and in-text citation3

Marking Rubric for Assignment 2: Total Marks: 30

Grade MarkHD >=80%D 70%-79%CR 60%-69%P 50%-59%Fail <50%
 ExcellentVery GoodGoodSatisfactoryUnsatisfactory
  Efficient Memory Management – Case Study  Concise and specific to the project.Scope relevant and soundly analyzed.Generally relevant and analyzed.Some relevance and briefly presented.This is not relevant to the assignment topic.
  OS Scheduling algorithms – Case Study  Concise and specific to the project.Scope relevant and soundly analyzed.Generally relevant and analyzed.Some relevance and briefly presented.This is not relevant to the assignment topic.
    Reference style  Clear styles with excellent source of references.  Clear referencing style  Generally good Referencing style  Sometimes clear referencing style  Lacks       consistency with many errors
    Question No 1  Concise and specific  Mostly consistent  Generally relevant  Some relevance is there  not relevant with many errors
    Question No 2Concise and specific  Mostly consistent  Generally relevant  Some relevance is there  not relevant with many errors
    Question No 3  Concise and specific  Mostly consistent  Generally relevant  Some relevance is there  not relevant with many errors
    Reference style  Clear styles with excellent source of references.  Clear referencing style  Generally good Referencing style  Sometimes clear referencing style  Lacks consistency with many errors

Visit:https://auspali.info/

Also visit:https://www.notesnepal.com/archives/767

For solution: +610482078788

+61482073403

+61482072848