HT TP: //qpa Pe R.W But .Ac .In: 2010-11 Advanced Operating System

Name : ……………………………………………………………
htt
Roll No. : ……………………………………………..…………..
Invigilator’s Signature : ………………………………………..
CS/B.Tech (CSE)/SEM-7/CS-704D/2010-11
p:/
2010-11
ADVANCED OPERATING SYSTEM
Time Allotted : 3 Hours Full Marks : 70
/q
The figures in the margin indicate full marks.
Candidates are required to give their answers in their own words
pap
as far as practicable.
GROUP – A
( Multiple Choice Type Questions )
er.
1. Choose the correct alternatives for the following : 10 × 1 = 10
i) .................... type of transparency is major issue for the

design of RPC facility
wb
a) Syntactic transparency
b) Semantic transparency
c) Both (a) & (b)

ut .
d) None of these.
ii) Minimum .................... number(s) of processes can

a c.
create deadlock.
a) four b) three
c) two d) one.
in
7404 [ Turn over

iii) Fruitless migration of processes is known as

htt
a) process thrashing
b) load balancing
p:/
c) load sharing
d) process scheduling.
/q
iv) Wait-die scheme is a .................... scheme.
a) deadlock detection b) deadlock prevention

pap
c) deadlock avoidance d) deadlock recovery.
v) For designing distributed file system ....................
transparency is required.
er.
a) access
b) naming
wb
c) replication
d) all of these.
vi) Granularity of a Distributed Shared Memory ( DSM )

ut .
system refers to the
a) block size of the DSM

a c.
b) total size of the DSM
c) block size of the process

in
d) none of these.
7404 2
vii) A thread shares with other threads belonging to the

htt
same process of its
a) code section and data section
b) other operating system resources

p:/
c) both (a) & (b)
d) none of these.
/q
viii) Critical region is
a) a code segment of a program that needs exclusive

pap
access to shared resources
b) a high level synchronization construct
c) a region of a program which is shared among other

er.
cooperative processes
d) a region or portion of operating system used for

handling critical situations.
wb
ix) According to Ricart-Agrawala algorithm if P1 wants to

execute the critical section and P2 is already executing
in the critical section, then P2 will reply to the request
ut .
of P1
a) always
a c.
b) if timestamp of P1 < P2
c) if timestamp of P1 > P2
d) when P2 has finished.

in
7404 3 [ Turn over

x) If a is the event of sending a message M in process Pi

htt
and b is the event of receiving the same message M at
process P j which of the following timestamp relations
! is
true ?
p:/
!
a) Ci (a) < Ci (b) b) Ci (a) < C j (b)
c) C j (a) < C j (b) d) Ci (a) = C j (b) .

/q
! !
GROUP – B
! ( Short Answer Type
! Questions )
pap
Answer any three of the following. 3 × 5 = 15
2. Briefly describe the distributed computing system models.

er.
3. With diagram describe the differences between loosely
coupled system and tightly coupled system.

wb
4. What is critical section problem and how is it solved by
semaphore ? 2+3
ut .
5. Briefly describe the models of deadlock.

a c.
6. Write down the difference between virus and worms. Briefly
describe digital signature. 2+3

in
7404 4
GROUP – C
htt
( Long Answer Type Questions )
Answer any three of the following. 3 × 15 = 45
p:/
7. a) What are the limitations of Distributed System ?
Explain any one distributed deadlock algorithm.

/q
b) Discuss how process migration is done in a distributed

pap
system. (4+5)+6
8. a) Briefly describe the Lamport’s logical clock. What are its

er.
limitations ?
wb
b) What do you mean by happened-before relation ? What
are the conditions and implementation rules for

ut .
happened-before relations to satisfy ?

a c.
c) Describe Lamport’s distributed mutual exclusion
algorithm. (3+2)+(2+3)+5
in
7404 5 [ Turn over

9. a) What is distributed scheduler ? Write down the

htt
techniques for scheduling process of a distributed
system.
p:/
b) Explain load balancing technique for scheduling
/q
processes in distributed system.
pap
c) “Load sharing is more important than Load balancing.”
Explain. (2+4)+6+3
er.
10. a) Briefly describe the basic classes of multiprocessor

wb
operating systems.
b) Write down the general structure of a cryptographic

ut .
system. Name the different types of cryptographic
system.
a c.
c) Define global state and local state in distributed system.

6+(3+2)+4
in
7404 6
11. Write short notes on any three of the following : 3×5

htt
a) Distributed shared memory
p:/
b) Transparency properties in distributed system
c) Multistage interconnection network

/q
d) Remote procedure call ( RPC )

pap
e) Network OS.
er.
wb
ut .
a c.
in
7404 7 [ Turn over

HT TP: //qpa Pe R.W But .Ac .In: 2010-11 Advanced Operating System

Uploaded by

Copyright:

Available Formats

HT TP: //qpa Pe R.W But .Ac .In: 2010-11 Advanced Operating System

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

HT TP: //qpa Pe R.W But .Ac .In: 2010-11 Advanced Operating System

Uploaded by

Copyright:

Available Formats

Name : ……………………………………………………………

1. Choose the correct alternatives for the following : 10 × 1 = 10

i) .................... type of transparency is major issue for the

c) Both (a) & (b)

ii) Minimum .................... number(s) of processes can

7404 [ Turn over

iii) Fruitless migration of processes is known as

a) deadlock detection b) deadlock prevention

c) deadlock avoidance d) deadlock recovery.

v) For designing distributed file system ....................

vi) Granularity of a Distributed Shared Memory ( DSM )

system refers to the

a) block size of the DSM

b) total size of the DSM

c) block size of the process

vii) A thread shares with other threads belonging to the

a) code section and data section

b) other operating system resources

a) a code segment of a program that needs exclusive

access to shared resources

b) a high level synchronization construct

c) a region of a program which is shared among other

d) a region or portion of operating system used for

ix) According to Ricart-Agrawala algorithm if P1 wants to

d) when P2 has finished.

7404 3 [ Turn over

x) If a is the event of sending a message M in process Pi

c) C j (a) < C j (b) d) Ci (a) = C j (b) .

2. Briefly describe the distributed computing system models.

3. With diagram describe the differences between loosely

coupled system and tightly coupled system.

4. What is critical section problem and how is it solved by

5. Briefly describe the models of deadlock.

6. Write down the difference between virus and worms. Briefly

describe digital signature. 2+3

Explain any one distributed deadlock algorithm.

b) Discuss how process migration is done in a distributed

8. a) Briefly describe the Lamport’s logical clock. What are its

b) What do you mean by happened-before relation ? What

are the conditions and implementation rules for

happened-before relations to satisfy ?

c) Describe Lamport’s distributed mutual exclusion

7404 5 [ Turn over

9. a) What is distributed scheduler ? Write down the

c) “Load sharing is more important than Load balancing.”

10. a) Briefly describe the basic classes of multiprocessor

b) Write down the general structure of a cryptographic

system. Name the different types of cryptographic

c) Define global state and local state in distributed system.

11. Write short notes on any three of the following : 3×5

c) Multistage interconnection network

d) Remote procedure call ( RPC )

7404 7 [ Turn over

You might also like