pdfPrepared by: Sadia Aziz Moderated by: Dr Yuba Raj Kafle May, 2020 Assessment...

Question

pdfPrepared by: Sadia Aziz                Moderated by: Dr Yuba Raj Kafle May, 2020    Assessment Details and Submission Guidelines  Unit Code BN104  Unit Title Operating Systems  Assessment  Type  Individual Assessment  Assessment  Title  Assignment two  Purpose of the  assessment  (with ULO  Mapping)  The purpose of this assignment is to report on some important characteristics of  Operating Systems.  Students must answer Multiple Answer questions and  provide written answer about process, file and device management, deadlock,  and UNIX commands. 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.  c. Explain in detail the functioning of some devices such as peripherals (e.g.  printers and network connections).  d. Discuss the most common file systems structure and technology.  e. Explain the concept of user interfaces and their role in the functionality of an  OS.  f. Demonstrate competency in the use of a command line interface to  operate with and manage an OS such as UNIX, and perform simple UNIX  (Linux) administration.  g. Support and troubleshoot operating systems and applications at an  introductory level.    Weight 30% of the total marks  Total Marks 60  Word limit N/A  Due Date        11:55 PM, 5TH June , 2020 (Friday, week 11)    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 • If an extension of time to submit work is required, a Special Consideration  Application must be submitted directly AMS.  You must submit this  application three working days prior to the due date of the assignment.  Further information is available at:   BN104 Operating System     Prepared by: Sadia Aziz                Moderated by: Dr Yuba Raj Kafle May, 2020    2  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.                http://www.mit.edu.au/about http://www.mit.edu.au/about http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/special-considerationdeferment http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/special-considerationdeferment http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/special-considerationdeferment http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/special-considerationdeferment http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/special-considerationdeferment http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/special-considerationdeferment http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/special-considerationdeferment http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/special-considerationdeferment http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/special-considerationdeferment http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/special-considerationdeferment http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/special-considerationdeferment http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/special-considerationdeferment 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 http://www.mit.edu.au/about-mit/institute-publications/policies-procedures-and-guidelines/Plagiarism-Academic-Misconduct-Policy-Procedure BN104 Operating System     Prepared by: Sadia Aziz                Moderated by: Dr Yuba Raj Kafle May, 2020    3  Assignment Description  Assignment 2-Questions    Introduction to operating System(5+5 marks)  Question 1  Explain with an example (any application that is not mentioned in slides) all the steps which are taken  by all the managers of operating system  cooperating with each other from initiation till the complete  execution of the application. For example if you are clicking on video file how different resources are  allocated to play the video  Question 2  List all existing Operating Systems along with their features, Applications and suitability of the OS for  the applications mentioned. Process Management and Memory Management (12+3+5 marks)  Question 3   Given the following mix of job, job lengths, and arrival times, assume a time slice of 10 and  compute the completion time for each job. Also draw the time line for each job.   a. First-come, first-served scheduling (FCFS) algorithm.  b. Shortest Job First Scheduling (SJF) algorithm.  c. Shortest Remaining time (SRT) algorithm.  d. Non-preemptive priority Scheduling algorithm.  e. Preemptive priority Scheduling algorithm.  f. Round-Robin Scheduling algorithm.  . BN104 Operating System     Prepared by: Sadia Aziz                Moderated by: Dr Yuba Raj Kafle May, 2020    4 Question 4  Explain in your own words any three types of user interfaces in current devices. Question 5    The following is a memory diagram of a computer system at one particular moment. The OS decides  to do a memory compaction, what are the values of the base and limit registers after the compaction?  Show your result on new diagram.    Figure 1: memory diagram of computer system with three pages in the memory        Device Management and File Management(6+6+3 marks)    Question 6  On a hard disk, the queue of track requests is as follows:  95 180 34 119 11 123 62 64    Assuming that the head starts at track 50, Draw the diagrams for arm movement for the seek  strategies mentioned in the lecture. Calculate the total and average number of tracks travelled.    Question 7  Explain  RAID(Level 1 to Level 10)  with help of figure.    Question 8  On your own computer find 6 files that are stored in 6 different directories. For Each File, list both  the relative filename and its complete file name.  BN104 Operating System     Prepared by: Sadia Aziz                Moderated by: Dr Yuba Raj Kafle May, 2020    5                Android and Unix Operating Systems(5+5 marks)  Question 9  Android is open source software. Research the extent to which Android source code is available to  the public and explain whether or not Android could or should be a more open system. Cite your  sources and the dates of publication.  Question 10   Run any 5 Unix commands and paste the screen shots in answer. Also give the brief description of  each command. Marking criteria:  Marks are allocated as indicated on each question, considering the following aspects:  Section to be included  in the report  Description of the section Marks  Introduction to OS  Students need to providean example of application  execution   needs to explore the existing OS  10  Process and Memory  Management  Students have to show the execution of the  examples given in the questions  Describe user interfaces  Final values of Base register and Limit register    20  Device and File  Management  Students have to research and   Answer the questions with relevant figues and  examples.    15  Android and Unix  Operating systems  Students have to research about Android and Unix  and Answer the questions with relevant examples.  Students need to demonstrate their competency in  the use of UNIX commands.  10  Reference style Follow IEEE reference style (should have both in- text citation and reference list)  5   Total 60   Example Marking Rubric for Assignment 2: Total Marks 60  Grade  Mark  HD  50-60  DI  50-40  CR  40-30  P  30-20  Fail

Sandeep Kumar · Accepted Answer

Q1) When an application part begins and the application does not have any other components in process, the linux system begins a new Linux process for the application which is single threaded in terms of execution.  By default, all parts of the same application run in the concurrent process with main thread. When an application component is already running the new application takes the same thread of execution. Like when the video is played, a main thread for execution is created of the video player.
Q2) Some of the operating systems are Windows, Linux, Unix, MAC OSX, MS DOS, Solaris, Ubuntu, Fedora and QNX. Linux is the most suitable as it supports almost every application also for graphics based software the core recommendation is windows and Mac OS X.
Q3) a) Using FCFS algorithm, as FCFS processes in queue format the execution is P1->P2->P3->P4->P5, with average time as 4.
b) Using SJF, P4-> P2->P3->P1->P5 is executed in this manner with lowest Burst Time in increasing order.
c) Using SRT, executing is P1->P2->P3->P4->P5 order.
d) Non-preemptive priority Scheduling algorithm states the following order P1->P2->P3->P5->P4
e) Preemptive priority Scheduling algorithm has the following order P1->P2->P3->P4->P5
f) Using round-robin algorithm is P1->P2->P3->P4->P5-> P4->P5 with fixed time slots of 4 seconds
Q4) There are three types of user interfaces namely they are command line interfaces, menu driven interfaces and graphical user interfaces. The command line interface interacts uses a shell to interact with the system kernel like bash is used for linux. The user needs to remember the flags and keywords. In the menu driven interfaces the options to interact is provided in a drop down list and in a graphic user interface the user has access to different softwares in order to interact with the system kernel.
Q5)
Q 6) First the head from 50 goes to 95 then->95->180->34->119->11->123->62->64
The Total Head Movement Computation:

Prepared by: Sadia Aziz XXXXXXXXXXModerated by: Dr Yuba Raj Kafle May, 2020 Assessment Details and Submission Guidelines Unit Code BN104 Unit Title Operating Systems Assessment Type Individual...

Answer To: Prepared by: Sadia Aziz XXXXXXXXXXModerated by: Dr Yuba Raj Kafle May, 2020 Assessment Details and...

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment