Scribd
Upload
52 views2 pages

OS14

The document is an exam for an Operating Systems course that contains 5 questions with multiple parts each. It covers key topics in operating systems including: 1) The differences between multiprocessing and multithreading, and functions of the OS related to process and memory management. 2) Differences between user/kernel threads and processes, and scheduling algorithms like FCFS, SJF, and RR. 3) Synchronization problems like the critical section problem and readers-writers problem, and solutions using semaphores and monitors. 4) Deadlock issues and the Banker's algorithm for resource allocation. 5) Memory management techniques like paging, segmentation, and page replacement algorithms.

Uploaded by

Anurekha Prasad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
52 views2 pages

OS14

The document is an exam for an Operating Systems course that contains 5 questions with multiple parts each. It covers key topics in operating systems including: 1) The differences between multiprocessing and multithreading, and functions of the OS related to process and memory management. 2) Differences between user/kernel threads and processes, and scheduling algorithms like FCFS, SJF, and RR. 3) Synchronization problems like the critical section problem and readers-writers problem, and solutions using semaphores and monitors. 4) Deadlock issues and the Banker's algorithm for resource allocation. 5) Memory management techniques like paging, segmentation, and page replacement algorithms.

Uploaded by

Anurekha Prasad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

USN l0cs53

Fifth Semester B.B. Degree Examination, Dec.2014 lJan.20l5


Operating Systems
Time: 3 hrs. Max. Marks:100
a)
O
U Note: Answer FIVE full questions, selecting
L
c- atleast TWO questions from each part.

O
o PART _ A

2
Ia. D i fferentiate between multipro grammi ng and multiproc ess ing. (05 Marks)
b. Explain the various functions of operating system with respect to process and memory
aiu
-a rnanagement. (05 Marks)
I
bJr
.=-X l What are the different ways in which the Pthread terminates? (05 Marks)
.= al
d. Explain any two facilities provided for irnplementing interacting process in programming
language and operating system. (05 Marks)
og
e.)

c>
t= 2a. Difl'erentiate bcnveen :
/.: i) User level and kemel level threads
;) ') ii) Process and thread. (06 Marks)
b. Following is the snapshot ofa cpu

Process CPU Burst Arrival time


Pr l0 0
'-c!
.=' .!
^ Pz 29
P: 03 2
=:1
-X
P+ 07 J
').
Draw Gantt charts and calculate the waiting and tumaround time using FCFS, SJF and RR
=P

=v c ;i',1iil':$Hi.*1:ffi'J",lx':1?,;l?"il1ffi,st be kept in mind wh'e choo,,"JTffif*


>.
-^o
c+'
scheduling algorithms. (05 Marks)

o 3a. Explain critical section problem. What are the requirements that critical section problem
U< nrust satisfy? (05 NIarks)
-i 6i b. Explain Reader's - writers problem and provide a semaphore solution using semaphore's for
t)
reader's priority problem. (10 Marks)
z U. What are monitors? Compare with semaphores with their relative advantages and
cC
disadvantages. (05 Marks)
o
e.

I of2
10css3
4 a. Consider a system containing m resources of the same type being sharecl by n processes.
Resources can be requested and released by processes only one at a time. Show that the
system is deadlock free if the following two conditions hold :
i) The maximum need of each process is between 1 and m resources
ii) The sum of all maximurn needs is less than m * n. (10 Marks)
b. For the given snapshot :

Max Available
A B C D A B C D A B C D
Pr 0 0 2 0 0 2 I 5 2 0
Pz 0 0 0 I 7 5 0
l
P3 ) 5 4 2 -) 5 6
Pa 0 6 -) 2 0 6 5 2
Ps 0 0 4 0 6 5 6

Using Banker's algorithm :


i) What is the need matrix content?
ii) ls the system in safe state?
iii) If a request frorn process P2(0,4, 2, 0) arrivers, can it be granted? (10 Marks)

PART -B
5 a. What is locality of reference? Differentiate befween paging and segmentation. (05 Marks)
b. Explain the differences between :
i) Logicai and physical address space
ii) Internal and extemal fragmentation. (05 Marks)
c. For the following page reference calculate the page faults that occur using FIFO and LRU
for3 and 4pageframes respectively,5,4,3,2, 1,4,3,5,4,3,2, l, 5. (l0Marks)

6 a. What are the different'techniques with which a file can be shared among users? (06 Marks)
b. Given memory parlitions of 100 k, 500 k, 200 k, 600 k (in order), which algorithrn from best
fit, worst fit and first fit p laces processes with requirernents 2I2 k, 417 k, I I 2 k and 426 k in
an efficient manner? (06 Marks)
c. Explain the various storage mechanisms available to store files, with neat diagram.(08 Marks)

a. Given the following queue 95, 180, 34,1I9,11,723,62,64 with head initially at track 50
and ending at track 199 calculate the number of moves using F'CFS, SSTF, Elevator and C
look algorithm. (12 Marks)
b. What are access matrices? Explain its implementation. (04 Marks)
c. Differentiate between protection and security. (04 Marks)

a. Explain the different IPC mechanism available in Linux. (08 Marks)


b. Explain how process is managed on Linux platform. (08 Marks)
c. Write a brief note on the design principles of Linux. (04 Marks)

x****
2 of2

You might also like