FirstRanker.com
Firstranker's choice
FirstRanker.com
--- Content provided by FirstRanker.com ---
Code: 9F00204
MCA II Semester Supplementary Examinations June/July 2018
OPERATING SYSTEMS
(For students admitted in 2011 (LC), 2012, 2013, 2014, 2015 & 2016 only)
Time: 3 hours Max. Marks: 60
--- Content provided by FirstRanker.com ---
Answer any FIVE questions
All questions carry equal marks
Explain the purpose and importance of system calls and discuss the calls related to device management and communication in brief.
Explain the layered structure of an operating system by giving typical operations and the objects that are operated in each layer.
Consider the following set of processes, with the length of the CPU burst given in milliseconds:
--- Content provided by FirstRanker.com ---
| Process | Burst time | Priority |
|---|---|---|
| P1 | 1 | 1 |
| P2 | 4 | 2 |
| P3 | 8 | 4 |
| P4 | 2 | 2 |
| P5 | 5 | 3 |
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.
(a) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (a larger priority number implies a higher priority) and RR (quantum = 2).
(b) What is the turnaround time of each process for each of the scheduling algorithms in part a?
(c) What is the waiting time of each process for each of these scheduling algorithms?
(d) Which of the algorithms results in the minimum average waiting time (over all processes)?
--- Content provided by FirstRanker.com ---
Describe the semaphore. How the semaphores help in the process synchronization?
Draw the schematic view of monitors and model the solution for dining philosopher’s problem.
Compare and contrast paging and segmentation. Explain the address translation schemes of these memory management schemes with neat sketch.
Explain advantages and disadvantages of following file allocation methods:
(a) Contiguous allocation.
--- Content provided by FirstRanker.com ---
(b) Linked allocation.
(c) Indexed allocation.
Explain about the RAID structure in disk management with various RAID levels of organization in detail.
Difference between stable storage and tertiary storage.
Consider a system consisting of m resources of the same type being shared by n processes only one at a time. Show that the system is deadlock free if the following condition hold:
--- Content provided by FirstRanker.com ---
(i) The maximum need of each process is between 1 and m resources.
(ii) The sum of all maximum need is less than m + n.
(iii) Why is deadlock state more critical than starvation? Describe resource allocation graph with a deadlock, with a cycle but no deadlock.
Describe the details of cryptography and how to use in computer security with an example.
(b) Compare active attacks with passive attacks.
--- Content provided by FirstRanker.com ---
This download link is referred from the post: JNTUA MCA 2nd Sem last 10 year 2010-2020 Previous Question Papers (JNTU Anantapur)
--- Content provided by FirstRanker.com ---