And i suggest you to type question if you need answer to only 1 question.
This file contains answers for following questions Q1. Assume you have the following jobs to execute with one processor:
Calculate the turnaround time, waiting time, average turnaround time, average waiting time, throughput and processor utilization for the above given set of processes that arrive at a given arrive time shown in the table, with the length of processing time given in milliseconds using FCFS, SJF, RR (with quantum 2) and SRTN scheduling algorithms. Also draw their corresponding Gantt Charts.
Q2. Using C programming, write a semaphore based solution to Dining Philosopher’s problem and explain the program.
Q3. (a) Discuss how fragmentations manifest itself in each of the following types of virtual storage system.
i) Segmentation
ii) Paging
iii) Combined segmentation and paging
(b) Compare direct file with indexed sequential file organization.
Q4. (a) Explain take-grant model for operating system security with an example. Also explain the mechanisms of security in WIN 2000 operating system?
b) Explain Bell and La-Padula Model for security and protection. Why is security a critical issue in a distributed OS environment?
Q5. Write and explain an algorithm used for ordering of events in a distributed environment. Implement the algorithm with an example and explain?
Q5. Discuss in detail the Process management, Memory management, I/O management, File management and Security and Protection for the following Operating Systems:
(a) WINDOWS 10 (b) ANDROID Version 9.0 (PIE)
You can download the PDF from this link
MCS-041 Solved Assignment
And i suggest you to type question if you need answer to only 1 question.
This file contains answers for following questions
Q1. Assume you have the following jobs to execute with one processor:
Calculate the turnaround time, waiting time, average turnaround time, average waiting time, throughput and processor utilization for the above given set of processes that arrive at a given arrive time shown in the table, with the length of processing time given in milliseconds using FCFS, SJF, RR (with quantum 2) and SRTN scheduling algorithms. Also draw their corresponding Gantt Charts.
Q2. Using C programming, write a semaphore based solution to Dining Philosopher’s problem and explain the program.
Q3. (a) Discuss how fragmentations manifest itself in each of the following types of virtual storage system.
i) Segmentation
ii) Paging
iii) Combined segmentation and paging
(b) Compare direct file with indexed sequential file organization.
Q4. (a) Explain take-grant model for operating system security with an example. Also explain the mechanisms of security in WIN 2000 operating system?
b) Explain Bell and La-Padula Model for security and protection. Why is security a critical issue in a distributed OS environment?
Q5. Write and explain an algorithm used for ordering of events in a distributed environment. Implement the algorithm with an example and explain?
Q5. Discuss in detail the Process management, Memory management, I/O management, File management and Security and Protection for the following Operating Systems:
(a) WINDOWS 10 (b) ANDROID Version 9.0 (PIE)