Download JNTUH MCA 2nd Sem R13 2018 June-July 812AG Operating Systems Question Paper

FirstRanker.com

Code No: 812AG R13

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

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

FirstRanker.com

MCA 1I Semester Examinations, June/July - 2018

OPERATING SYSTEMS

Time: 3 Hours Max. Marks: 60

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

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

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.

PART - A 5 x 4 Marks =20

1. a) What are the advantages and disadvantages of Batch processing systems? [4]
2. b) Write down the differences between a semaphore and a monitor. [4]
3. c) Explain briefly about demand paging. [4]

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

4. d) Discuss the objectives for a file management system. [4]
5. e) Explain briefly about the four conditions of a deadlock situation. [4]

PART -B 5 x 8 Marks = 40

1. Compare and Contrast client-server and peer-to-peer models of a distributed system. Explain the services provided by an operating system from user-perspective. [4+4]

   OR

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

   What is a virtual machine? Explain the concept and working principle of a virtual machine. [8]

2. Consider the following set of processes, with the length of the CPU burst given in milliseconds:

   Process Burst Time Priority

   P1 20 3

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

   P2 26 1

   P3 02 4

   P4 19 1

   P5 16 2

   The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Draw the Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, SRTF and Priority. Also determine the average waiting time and average turnaround time for each of the algorithms. [8]

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

   OR

   What is a race condition? When it occurs in producer-consumer problem? Describe how monitors are used to solve synchronization problem. [8]

3. Define paging scheme. How is it different from segmentation? Explain paging technique along with its merits and demerits. [4+4]

   OR

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

   How many page faults occur for the following reference string with three page frames using FIFO, LRU and OPTIMAL page replacements algorithms? Assume that initially frames are empty.

   1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2 [8]

4. Compare and contrast chained allocation with indexed allocation technique of file allocation. What is the need for mounting in a file system? [5+3]

   OR

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

   Explain various techniques implemented for free space management, discuss with suitable examples. [8]

5. Consider a system with five processes P0 through P4 and three resource types A, B, C. Resource type A has 10 instances, resource type B has 5 instances, and resource C has 7 instances. Suppose that, at time T0, the following snapshot of the system has been taken:

   Processes Allocation Max Available

   ABC ABC ABC

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

   P0 010 753 332

   P1 200 322

   P2 302 902

   P3 211 222

   P4 002 433

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

   Answer the following questions using the Banker’s algorithm:

   a) What is the content of the matrix Need?

   b) Is the system in a safe state? [4+4]

   OR

   Explain the deadlock detection algorithm for multiple instance of resource types with an example. [8]

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

---00000---

FirstRanker.com