Operating Systems Question Paper - Dec 18 - Electronics And Telecomm (Semester 6)

0views

written 5.3 years ago by

Operating Systems - Dec 18

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.

a) Define a file system. What are various components of a file system? State and explain commonly used operation on file.

(5 marks) 00

b) What is the difference between a system call and an interrupt?

(5 marks) 00

c) Give memory partition of 100K, 500K, 200K, 300K and 600K. how would each of the first fir, best fit and worst fit algorihtm place process of 212K, 417K, 112K, and 426K? Which algorithm makest the most suffucient use of memory?

(5 marks) 00

d) Write four optimizing criteria for CPU scheduling.

(5 marks) 00

a) Consider the following page refrence string A,B,C,D,B,A,E,F,A,B,C,G,F,C,F. How many oages faults would occur for the following page replacement algorithm using three and four frames? Remember all frames are intially empty:

(10 marks) 00

i) FIFO

ii) Optimal

iii) LRU

b) Justify the need for process synchronization & Design a solution for producer consumer problem using semaphore

(10 marks) 00

a) Consider the following snapshot of the process to be executed. Draw the Gantt chart and determine the average. Waiting time and average time for FCFS, SJF and round robin(Quantum =2) scheduling algorithm.

(10 marks) 00

Process	Arrival Time	Burst Time
P1	0	4
P2	2	5
P3	4	6
P4	5	2

b) Consider the following snapshot

(10 marks) 00

Process	Allocation	Max	Available
	ABCD	ABCD	ABCD
P0	0 2 1 2	0 3 2 2	2 5 3 2
P1	1 1 0 2	2 7 5 2
P2	2 2 5 4	2 3 7 6
P3	0 3 1 2	1 6 4 2
P4	2 4 1 4	3 6 5 8

Answer the following using Banker's algorithm.

i) What is the content if matrix Nedd?

ii) Is the system in the safe state?

iii) If the request from process PI arrives for (1,3,2,1) can request be granted immediately?

a) Suppose the head of moving-head desk with 200 tracks, numbered 0 to 199 is currently serving a request at track 143 and has just finished a request at track 125. If the queue of requests is kept in the FIFO order 86,147,177,91,94,150,100,175,130 What is total head movement to satisfy these requests for the follwoing disk scheduling algorithms?

(10 marks) 00

i) FSFC ii) SSTF iii) C-SCAN

b) Explain working of EDF and RMA real-time scheduling algorihtms.

(10 marks) 00

a) What is the Virtual memory? Explain with the neat diagram in a segmentation/paging system

(10 marks) 00

b) Explain process managment in LINUX.

(10 marks) 00

a) State and explain the necessary conditions that lead to deadlock situation.

(10 marks) 00

b) Explain how LINUX performs file managment.

(10 marks) 00

ADD COMMENT EDIT