Download JNTUH MCA 2nd Sem R13 2017 August 812AG Operating Systems Question Paper

FirstRanker.com

Code No: 812AG R13

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

--- Content provided by​ FirstRanker.com ---

MCA I Semester Examinations, August - 2017

OPERATING SYSTEMS

Time: 3 Hours Max. Marks: 60

Note: This question paper contains two parts A and B.

Part A is compulsory which carries 20 marks. Answer all questions in Part A. Part B consists of 5 Units. Answer any one full question from each unit. Each question carries 8 marks and may have a, b, c as sub questions.

--- Content provided by‌ FirstRanker.com ---

PART - A 5 x 4 Marks = 20

1. What is a system call? How it is executed? [4]
2. What is thread scheduling? Give an example of thread scheduling? [4]
3. What is thrashing? Why it occurs? [4]
4. Discuss about directory structure? [4]

--- Content provided by⁠ FirstRanker.com ---

5. How to detect whether a deadlock occurred or not? [4]

PART -B 5 x 8 Marks = 40

1. a) Briefly explain typical functions of an Operating-System Kernel.
   b) What are the different types of operating systems? Explain them in detail. [4+4]
   OR
   

   --- Content provided by‍ FirstRanker.com ---

   c) Discuss about the Operating System components.
2. a) Explain about distributed systems. [4+4]
3. a) Assume the following jobs are to be executed with one processor:
   Job Burst Time Arrival
   1 10 3
   

   --- Content provided by⁠ FirstRanker.com ---

   2 10 4
   3 2 1
   4 11 2
   5 5 0
   Give Gantt-Chart illustrating the execution of these jobs using RR (quantum =2) and Shortest Remaining Time First (Preemptive). Compare their performance in terms of average turn-around time, and average waiting time? [8]
   

   --- Content provided by⁠ FirstRanker.com ---

   OR
   b) Explain about readers writers problem. Give a solution to the above problem using semaphores. [8]
4. a) Five pages, A, B, C, D, and E are referred by a process in the following order- A; B; C;B; E; A; D; A; B; E; A; B; C; D; E. If the page replacement algorithm is
   i) FIFO, calculate the number of page faults with empty frames of size 3? Compare its performance with optimal page replacement?
   ii) LRU, calculate the number of page faults with empty frames of size 4 ? compare its performance with optimal page replacement? [4+4]
   

   --- Content provided by FirstRanker.com ---

   OR
   b) With a neat diagram explain the actions that take place when a page fault occurs?
5. a) Give an overview of continuous memory allocation strategies. [4+4]
6. a) Discuss about free space management. [8]
   OR
   

   --- Content provided by⁠ FirstRanker.com ---

   b) Explain the three allocation methods in file system implementation Illustrate with proper diagram. [8]
7. a) Explain Banker’s algorithm for deadlock avoidance.
   b) What are the goals of protection? [8]
   OR
   c) What is unsafe state? Differentiate between unsafe state and deadlock state.

--- Content provided by‌ FirstRanker.com ---

8. a) Explain about capability based systems. [4+4]

FirstRanker.com