Download Mumbai University (MU) MCA 2019 May 2nd Sem 54703 Operating Systems Question Paper

Code: 54703 / Operating Systems

Firstranker's choice

NB:

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

FirstRanker.com

(3 Hours) [Total Marks: 100]

1. Q1 is compulsory
2. Attempt any 4 from Q.2 to 7.
3. Assumptions should be made whenever required and should be clearly stated.

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

4. Answers to sub questions should be answered together.
5. Draw neat diagram whenever required.

Q1(a) For the processes listed below the table, draw Gantt chat and calculate (12)

average waiting time and average turnaround time using :-

1. FCFS (first come first serve)

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

2. SJF (Shortest Job First) in both condition preemptive and non-preemptive
3. Round — robin (Quantum = 2)

Processes | Arrival Time(ms) | Burst Time(ms)
P1 0 5
P2 1 7

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

Q1(b) What is process? Explain about five-state Process model in detail. (08)

Q2(a) Which criteria’s are important in choosing a file organization? List and (10)

briefly explain any three file organizations.

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

Q2(b) Differentiate between (10)

1. Paging and Segmentation
2. Monolithic kernel and Micro kernel

Q3(a) Suppose a disk drive has 200 cylinders, numbered 0 to 199. The driver is (10)

currently serving request at cylinder 50 and previous request was a

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

cylinder 100. The queue is pending request in FIFO order is: -

95,180, 34, 119, 11, 123, 62, 64

What is the total head movement under following scheduling algorithm?

1. FCFS
2. SSTF

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

3. SCAN
4. C-SCAN

Q3(b) What is Dynamic and Fixed Partitioning? What are the problems with them (10)

and how can we solve these problems? Explain.

Q4(a) What do you mean by concurrency control? Explain the use of semaphore (10)

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

and monitors in concurrency control with example.

Q4(b) Given a reference string to the following pages by a program (10)

2,3,4,1,2,3,0,3,2,4,1,5,3,2,1

How many page faults will occur for the following page replacement

algorithms, assuming four frames?

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

1. LRU replacement
2. FIFO replacement
3. Optimal replacement

Q5(a) Consider the following snapshot of the system: (10)

Processes | Allocation Max Available

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

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

Using Banker’s algorithm

1. What is the context of matrix need?
2. Is the system in safe state? Give the sequence.
3. Consider the request from process P1 arrives for (1,0,0). Can the request be immediately granted?

Q5(b) Explain the access matrix model of protection. How does it serve a useful (10)

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

abstraction for reasoning about protection mechanisms in a computer

system?

Q6(a) What is deadlock? Explain in-brief deadlock prevention methods. (10)

Q6(b) What is the principle of locality? What is the purpose of Translation Look (10)

aside buffer? How to calculate number of bits in logical address and

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

physical address when logical address space of 8 pages of 1024 word each,

mapped to physical memory of 32 frames?

Q7 Write short notes on any four (20)

1. Process Control Block
2. Buffering

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

3. Multiprogramming, Multitasking, Multiprocessing
4. Clock Hardware and clock software
5. Features of LINUX operating system
6. Password selection strategies

FirstRanker.com

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