Master of Computer Application II (Computer Science)
Examination: Oct /Nov 2016 Semester IV (New CGPA)
SLR No. Day
Date Time Subject Name Paper
No. Seat No.
SLR U
26
Thursday
17/11/2016
02:30 PM
to
05:00 PM
Distributed Operating
System
C

Instructions: Question no. 1 2 are compulsory
Attempt any three questions from Q. No. 3 to Q. No. 7
Figures to the right indicate full marks.
Total Marks: 70
Q.1 Choose the correct alternatives 10
Once a file has been created, it cannot be changed. Such a file is said to be

Mutable file Immutable file
Non-Alterable file Variable file
In the process first acquires all the locks it needs during growing
phase.
Rollback locking Write-ahead log locking
Two phase locking Privates workspace
It is possible to program a timer to generate an interrupt 60 times a second,
or at any other desired frequency. Each interrupt is called one
Clock Hour Solar day
Clock tick Clock skew
If the system is transparent, the users will not notice the
existence of other users.
Parallelism Migration
Location Concurrency
The mechanism of is to group bits into units, called as frames.
Information Layer TCP/IP Layer
Network layer Data link layer
A technique that is commonly used in threads packages is the
which is a kind of semaphore.
Monitor Condition variable
Mutex Page fault
Subdirectories can contain their own subdirectories, and so on, leading to a
tree of directories, often called a
Remote access file system Hierarchical file system
Subdirectories file system General file system
A is a directory entry that maps onto a (Server, File name) string,
which can be looked up on the server named to find the binary name.
Binary name Symbolic link
File pointer None of these
Page 1 of 2
When a packet is sent to one of addresses, it is automatically delivered to all
machines listening to the address, this technique is called
Unicasting Point to point
Multicasting None of these
10) With allocation, a process can be moved even if it has already
started execution and allows better load balancing
Migratory Non-migratory
Linked Contiguous
State True or False 04
If the cache is large enough, the portability of success, called the success
rate will be low.
The file server accept request from user programs running on different
machines, called clients, to read and write files.
The algorithm is known as wait-die, because one transaction is supposedly
wounded and other waits
A global time ordering is that delivers all messages in the exact order in
which they were sent.
Q.2 Write a short note on the following: 08
Blocking versus Non-blocking primitives (Client Server Model)
Bus-based Multiprocessor
Answer the following 06
What do you mean by Hierarchical group?
Briefly explain the concept of Stable Storages.
Q.3 Answer the following
What do you mean by Distributed OS? Discuss its various advantages and
disadvantages.
What do you mean by clock Synchronization? Discuss Centralized algorithm to
achieve Mutual Exclusion in Distributed OS.
07
07
Q.4 Answer the followings
What do you mean by Idle Workstation? Discuss registry based algorithm for
finding and using an idle workstations.
Define Deadlock. State and describe distributed deadlock detection with
suitable example.
07
07
Q.5 Answer the followings:
What do you mean by Processor allocation? Discuss in detail various design
issues for processor Allocation Algorithms.
07
Discuss in detail comparative study 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 do you mean by Distributed File System? Discuss in detail various trends
in Distributed file system.
07
Q.7 Answer the following
Discuss in detail the basic operations and mechanism of Remote Procedure Call
with suitable example
07
State and describe the comparison of Election algorithm with suitable example. 07