Scribd
Upload
89 views2 pages

(Ij) Ej (Itill) : Fifth Semester B.E. Degree Examination, June-July 2009

1. The document contains questions from an Operating Systems exam covering topics like CPU scheduling algorithms, deadlock handling approaches, memory management techniques, file organization methods, disk scheduling algorithms, and Linux system components. 2. Questions assess understanding of process states, multithreading models, Banker's algorithm for safe state checking, page fault handling, file attributes, tree structured directories, disk space allocation, and various CPU and disk scheduling algorithms. 3. Students are required to answer 5 questions selecting at least 2 from each part, which covers concepts like critical section problem solution requirements, bounded buffer problem using semaphores, internal and external fragmentation, page replacement algorithms, access matrix model for protection.

Uploaded by

Ayushi Bolia
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
89 views2 pages

(Ij) Ej (Itill) : Fifth Semester B.E. Degree Examination, June-July 2009

1. The document contains questions from an Operating Systems exam covering topics like CPU scheduling algorithms, deadlock handling approaches, memory management techniques, file organization methods, disk scheduling algorithms, and Linux system components. 2. Questions assess understanding of process states, multithreading models, Banker's algorithm for safe state checking, page fault handling, file attributes, tree structured directories, disk space allocation, and various CPU and disk scheduling algorithms. 3. Students are required to answer 5 questions selecting at least 2 from each part, which covers concepts like critical section problem solution requirements, bounded buffer problem using semaphores, internal and external fragmentation, page replacement algorithms, access matrix model for protection.

Uploaded by

Ayushi Bolia
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 06CS53

Fifth Semester B.E. Degree Examination, June-July 2009


Operating Systems
Time: 3 hrs. Max. Marks: 100
Note: 1. Answer any FIVEfull questions, selecting atleast
TWO questions from each part.
2. Assume missing data if any.
PART-A
1 a. Explain the role of operating system with user and system viewpoints. (07 Marks)
b. Give the features of symmetric and asymmetric multiprocessing systems. (04 Marks)
c. Discuss the operating system functions
i) that are helpful to user.
ii) that are meant for ensuring the efficient operation of system. (09 Marks)

2 a. Describe the process states with the help of state diagram. (06 Marks)
b. Discuss various multithreading models with diagram. (06 Marks)
c. Consider the followinl! set of .
Process Burst time Arrival time Priority
PI 10 0 2
P2 5 2 1
P3 2 3 0
P4 20 5 3
Table Q2(c)
Draw Gantt charts and calculate average waiting time, average turnaround time
using following CPU scheduling algorithms.
i) Preemptive shortest Job First.
ii) Non preemptive priority ( 0 = HIGHPriority). (08 Marks)

3 a. What are the three requirements to be met by a solution to the critical section
problem? Explain. (06Marks)
b. Describe the Bounded - buffer problem and give a solution forthe same using
semaphores. Write the structure of producer and consumer processes. (08Marks)
c. Describe the following: i) Semaphore ii) Wait ( ) operation
iii) Signal ( ) operation. (06 Marks)

4 a. Consider the following snapshot of a system.


Allocation Maximum Available
A B C A B C [IJ]EJ
Po 0 1 0
2
7 5 3 [ITill]
PI 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
0 0 2 Table Q4(a)
P4 4 3 3
Answer following questions using Bankers algorithm.
i) Is the system in a safe state?
ii) If a request from PI arrives for (1, 0, 2), can the request be granted
immediately? (09 Marks)
Iof2
06CS53

b. Discuss the various approaches, used for deadlock recovery. (06Marks)


c. Consider the Resource allocation graphs given in fig.Q4(c) (i) and (ii), check
whether deadlock exists in the system, if yes, identify the processes involved in
deadlock. (05 Marks)
It, ~I
r:=\
~(10
/~l.~
. ..- -.,
~..

. -""11]/
R~
'~-6---,

~'L:J
~3
~~r
pJ)
Y-4 ~'- ~
Fig.Q4(c) (i) Fig. Q4(c) (ii)

PART- B
5 a. Assume we have a paged memory system with associative registers (TLBs) to hold
the most active page table entries. If the page table is normally held in memory and
memory access time is Imicro second, what would be the effective access time if
85% of all memory references find their entries in the associative registers. Assume
that associativeregistersaccesstime is zero. (04Marks)
b. Give the differences between: i) Internal and external fragmentation ii) Paging
and segmentation. (06Marks)
c. Discuss the steps involved in handling page fault, with diagram. (06Marks)
d. Consider the following page reference string 7,0, 1,2,0,3,0,4,2,3,0,3,2, 1,2,
0, 1, 7, 0, 1 . How many page faults would occur for FIFO page replacement
algorithm, assuming three frames? (04Marks)

6 a. Discuss the following in brief: i) File Attributes ii) File types


iii) Sequential File Access iv) Tree Structured Directories. (12Marks)
b. Explain contiguous, linked and ind'exedmethods of allocating disk space. (08Marks)

7 a. Explain the following disk scheduling algorithms in brief with examples.


i) F C F S Scheduling ii) S S T F Scheduling iii) seA N Scheduling
iv) L 0 0 K Scheduling, (12Marks)
b. Describe the access matrix model used for protection in a computer system.
(08 Marks)

8 Write short notes on any FOUR of the following:


a. Components of LINUX system.
b. Process management in LINUX.
c. Inter process communication.
d. Dynamic loading.
e. Process Control Block ( PCB). (20 Marks)

*****

20f2

You might also like