0
363views
Operating Systems Question Paper - Dec 16 - Electronics And Telecomm (Semester 6) - Mumbai University (MU)
1 Answer
0
0views

Operating Systems - Dec 16

Electronics And Telecomm (Semester 6)

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.

Q1

a) What is an operating system? Explain the different function of OS.
(5 marks) 00

b) What is a file directory? Describe methods of organizing directories in an OS.
(5 marks) 00

c) What are the characterstics of a Real Time OS?
(5 marks) 00

d) What is system call? Explain any five system calls.
(5 marks) 00

Q2

a) Define the meaning of a race condition, use an execution sequence to illustrate your answer.
(10 marks) 00

b) Explain clearly how UNIX performs file managment using I-nodes.
(10 marks) 00

Q3

a) Suppose that a disk drive has 5000 cylinders,numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the prvious request was at cylinder 125. The queue of pending requests, in FIFO order is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 starting from the current head position, wat is the total distance that the disk arm moves to satisfy all a pending requets, for each of the follwoing disk scheduling algorithms?
(10 marks) 00

i) FCFS ii) SSTF iii) SCAN iv) LOOK

b) Explain the different allocation method for file.
(10 marks) 00

Q4

a) Consider the following process:
(10 marks) 00

Process Arrival Time Service Time
P1 0 8
P2 1 4
P3 2 9
P4 3 5

Solve the above given problem with shortest remaining time first by drawing gantt chart also calculate the average waiting time, turn around time, and throughout.

b) Explain RAID with different levels.
(10 marks) 00

Q5

a) Explain the working of EDF and RMA real time scheduling algorithms.
(10 marks) 00

b) Describe process managment in Linux.
(10 marks) 00

Q6

a) What is deadlock? Explain deadlock prevention and avoidance.
(10 marks) 00

b) What is Semaphore? Give an implementation of bounded buffer producer consumer problem using semaphore.
(10 marks) 00

Please log in to add an answer.