M.Sc. (Semester IV) (CBCS) Examination Oct/Nov-2017
Computer Science
DISTRIBUTED OPERATING SYSTEM
Day Date: Friday, 17-11-2017 Max. Marks: 70
Time: 02.30 PM to 05.00 PM
Instructions: Question no. 1 and 2 are compulsory.
Attempt any 3 questions from Q. no. 3 to Q. no. 7
Figures to the right indicate full marks.
Q.1 Choose correct alternatives. 10
The allows millions machines all over earth to be
connected at speeds varying from 64 kbps to gigabites per second.
Local Area Network Simple mail Transfer
Protocol
Wide Area Network Switch based multiprocessor
are tightly coupled software on loosely coupled
hardware.
Network operating system Operating systems
Distributed systems None of these
is standard rules that govern the format, contents, and
meaning of the messages sent and received.
Processor allocation Protocol
Director server Communication medium
in primitive, the sending process can continue
computing in parallel with the message transmission, instead of having
the C.P.U. go idle.
Buffered Blocking
Compressive Non-blocking
means that packets containing a certain address are
delivered to all machines.
Uni-casting Broadcasting
Multicasting Point to Point
A transaction is which means if two or more transaction
are running at the same time, to each of them and to other processes,
the final result looks as though all transaction ran sequentially in some
order.
Atomicity Consistent
Isolated Durable
In allocation algorithms, a process can be moved even if
it has already started execution.
Migratory Remote procedure call
Non-migratory Unstable allocation
In Paris, each laboratory tells The Bureau International de Heure
that how many times its clock has ticked. The BIH average these to
produce abbreviated as TAI.
Page 2 of 2
SLR-MG-313
International Atomic Tick
International Atomic Tower
International Time Time
International Atomic Test
A is a process that runs on some machine and helps to
implement the file service.
Process State Process Control Block
File Server File Control Block
10) interface uses text commands and a method for
entering them.
Graphical user Batch
Command line Textual
State True or False. 04
Device sharing allows many users access to a common database.
In loosely coupled system, the inter-machine message delay is large
and data rate is low.
With connectionless protocols, no setup in advance is needed.
In close group outsiders cannot send messages to the group as a
whole.
Q.2 Write short notes of the following. 08
Berkeley Algorithm
ii) Properties of Transaction.
Answer the following:- 06
What do you mean by Happens-Before Relation?
ii) Define the meaning of Client and Server.
Q.3 Answer the following.
What do you mean by Multi-computers? Discuss its various advantages
and disadvantages of Distributed OS.
07
Discuss in detail Centralized Algorithm for Mutual Exclusion in Distributed
OS.
07
Q.4 Answer the following.
What do you mean by System Model? Discuss registry based algorithm
for finding and using an idle workstations.
07
Define Deadlock. State and describe distributed deadlock detection with
suitable example?
07
Q.5 Answer the following.
What is mean by Process? Discuss in detail concept of thread usage. 07
Discuss in detail comparison of MS-Windows NT and Novel Netware. 07
Q.6 Answer the following.
Define the term Virtual Memory. Explain in detail concept of demand
paging with suitable example?
07
What is the meant by Distributed File System? Discuss in detail concept
of file service interface.
07
Q.7 Answer the following.
Discuss in detail mechanism of Remote Procedure Cell with suitable
example.
07
Discuss concept of Election algorithms with suitable example. 07