Question Paper: Operating Systems Question Paper - Dec 18 - Information Technology (Semester 4) - Mumbai University (MU)
0

Operating Systems - Dec 18

Information Technology (Semester 4)

Total marks: 80
Total time: 3 Hours
INSTRUCTIONS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Draw neat diagrams wherever necessary.

1.a. Explain the two main categories of services and functions of operating system. Compare and contrast them.
(10 marks) 9693

1.b. What is context-switch? Describe the actions taken by a kernel to context-switch between processes
(10 marks) 9696

2.a. Explain the differences in how much the following scheduling algorithms discriminate in favor of short processes:

a. FCFS

b. RR

c. Multilevel feedback queues

(10 marks) 9697

2.b. Describe the differences among short-term, medium-term, and long-term scheduling.
(10 marks) 9698

3.a. Explain the timestamp based protocols to ensure serializability with the help of example
(10 marks) 9705

3.b. Consider the following set of processes, with the length of the CPU burst given in milli seconds. The processes are assumed to have arrived in order P1, P2, P3, P4,P5 all at time 0.

Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2

Calculate the average turnaround time and maximum waiting time for pre-emptive priority scheduling algorithm

(10 marks) 9699

4.a. Compare and contrast paging and segmentation.
(10marks) 9710

4.b. What is address translation? Consider a logical address space of 32 pages with 1,024 words per page, mapped onto a physical memory of 16 frames.

a. How many bits are required in. the logical address?

b. How many bits are required in the physical address?

(10 marks) 9711

5.a. Describe how the Swap () instruction can be used to provide mutual exclusion that satisfies the bounded-waiting requirement.
(10 marks) 9720

5.b. What is deadlock? What are the essential conditions for deadlock to occur?
(10 marks) 9706

Write Short note on: (Any four)

6.a. Linked Allocation.
(5 marks) 9717

6.b. Memory segmentation
(5 marks) 9716

6.c. Deadlock detection
(5 marks) 9707

6.d. Translation Lookaside Buffer
(5 marks) 9712

6.e. Open () and Close () operations.
(5 marks) 9694

6.f. Page replacement algorithms
(5 marks) 9713

ADD COMMENTlink
modified 12 weeks ago  • written 12 weeks ago by gravatar for Ankit Pandey Ankit Pandey70
Please log in to add an answer.