Dr.G.R.

Damodaran College of Science

(Autonomous, affiliated to the Bharathiar University, recognized by the UGC)Reaccredited at the 'A' Grade Level by the NAAC and ISO 9001:2008 Certified
CRISL rated 'A' (TN) for MBA and MIB Programmes
I MSc INFORMATION TECHNOLOGY[ 2014-2016 ]
FIRST SEMESTER
DISTRIBUTED OPERATING SYSTEM-163A
Multiple Choice Questions.
1. A tightly coupled system is also called _________.
A. parallel processing system.
B. distributed computing system.
C. pipelined processing system.
D. distributed operating system.
ANSWER: A
2. A loosely coupled system is ____________.
A. parallel processing system.
B. distributed computing system.
C. pipelined processing system.
D. real time system.
ANSWER: B
3. _______________ is a Distributed computing system based on minicomputer model.
A. ARPANET.
B. V system.
C. xerox parc.
D. amoeba.
ANSWER: A
4. Amoeba is a Distributed computing system based on ____________model.
A. minicomputer.
B. workstation
C. workstation server.
D. processor pool.
ANSWER: D
5. All or none operation execution is also called as _________.
A. atomic transaction.
B. fault tolerant system.
C. successful transaction.
D. reliable transaction.
ANSWER: A
6. A vendor independent computing environment was defined by__________.
A. open source foundation.
B. open system foundation
C. open software foundation.
D. open system inconnectivity.
ANSWER: C

7. DCE stands for ______________.

A. distributed computing environment.
B. distributed computing engine.
C. data computing environment.
D. distructive computing environment.
ANSWER: A
8. _____is a Distributed computing system based on the workstation model.
A. ARPANET.
B. V system.
C. xerox parc.
D. amoeba.
ANSWER: C
9. _________ is a Distributed computing system based on workstation server model.
A. ARPANET.
B. V system.
C. Xerox parc.
D. amoeba.
ANSWER: B
10. Implicit addressing is also called as ____________.
A. process addressing.
B. tagged addressing.
C. functional addressing.
D. primitive addressing.
ANSWER: C
11. IPC stands for ___________.
A. internet Protocol for Communication.
B. inter Process Communication.
C. inter Procedural Communication.
D. interchangeable Program Code.
ANSWER: B
12. RPC stands for ______________.
A. remote process communication.
B. read process control.
C. remote procedure call.
D. read process call.
ANSWER: C
13. Messages are transmitted in the form of_________over communication channel.
A. message.
B. data.
C. packet.
D. block.
ANSWER: C
14. _______is the process of converting the program object of a message to stream for suitable for
transmission.
A. decoding.
B. conversion.

C. encoding.
D. enriching.
ANSWER: C
15. Retransmission of data based on timeout is done for _____________.
A. reliability.
B. atomic transmission.
C. failure handling.
D. flexibility.
ANSWER: C
16. Number of pieces of programs involved in an RPC _______________.
A. 2
B. 3
C. 4
D. 5
ANSWER: D
17. Number of types of messages involved in implementing RPC ___________.
A. 1
B. 2
C. 3
D. 4
ANSWER: B
18. The value of the parameter is passed in____________method.
A. call by visit.
B. call by move.
C. call by value.
D. call by reference.
ANSWER: C
19. _____refers to the unit of sharing and data transfer.
A. throughput.
B. bytes.
C. block.
D. granularity.
ANSWER: D
20. ____________is a problem that occurs when data block moves from one node to another.
A. replacement.
B. replication.
C. granularity.
D. thrashing.
ANSWER: D
21. MUNIN system follows ______ consistency model.
A. release.
B. weak.
C. PRAM.
D. strict.
ANSWER: A
22. The consistency model which cannot be implemented is ________________.

A. weak.
B. release.
C. PRAM.
D. strict.
ANSWER: D
23. The two paradigms of IPC are ____________ and __________.
A. call, reply.
B. shared memory, message passing.
C. send, receive.
D. call by value, call by reference
ANSWER: B
24. ____________is a special type of message that entities it's holder to enter critical section
A. entity.
B. packet.
C. token.
D. frame.
ANSWER: C
25. __________ provides an overall view of the processes holding or waiting for various resources.
A. undirected graph.
B. deadlock graph.
C. process model.
D. resource allocation graph.
ANSWER: D
26. A system is said to be in _____ if it is not in a deadlock state.
A. safe state.
B. unsafe state.
C. stateful.
D. stateless.
ANSWER: B
27. Message delays and out of date wait for graph may cause false cycles such deadlocks
called_____________.
A. Photon deadlock.
B. fython deadlock.
C. phanton deadlock.
D. false deadlock.
ANSWER: C
28. Chandy-misra-hass algorithm is the other name for _________.
A. bully algorithm.
B. election algorithm.
C. probe based distributed algorithm.
D. WFG based distributed algorithm.
ANSWER: C
29. _______ is a binary semaphore that is in locked or unlocked state.
A. thread variable.
B. mutex variable.
C. empty variable.
D. environment variable

ANSWER: B
30. The main draw back of having cached data on a client's disk is____.
A. it doesn't work in diskful workstation.
B. it doesn't work in diskless workstation
C. server cannot access if it needs.
D. memory requirement will be move.
ANSWER: A
31. _____________ensures that once transaction completes successfully, the results of the operations
become permanent.
A. serializability.
B. synchronizability.
C. atomicity.
D. durability.
ANSWER: D
32. Permanence of a system is also called as _________ property.
A. ACID.
B. isolation.
C. durability.
D. all or nothing property.
ANSWER: B
33. The ____________ property ensures that concurrently executing transactions do not interface with
each other.
A. performance.
B. serializability.
C. durability.
D. atomicity.
ANSWER: B
34. Isolation property is also known as __________.
A. performance.
B. serializability.
C. durability.
D. atomicity.
ANSWER: B
35. Amoeba is a __________ based distributed operating system.
A. micro computer.
B. monolithic.
C. micro kernel.
D. workstation.
ANSWER: B
36. _____________ consistency model cannot be implemented in real life.
A. strict.
B. weak.
C. release.
D. acquire & release.
ANSWER: A
37. _________ refers to the power to survive crashes of the devices.

A. availability.
B. granurality.
C. throughput.
D. robustness.
ANSWER: D
38. Amoeba system follows ______approach.
A. distributed.
B. object oriented.
C. centralized.
D. parallel.
ANSWER: B
39. Processor pool model is followed by ____________.
A. Amoeba.
B. V system.
C. mach.
D. chorus.
ANSWER: A
40. Bullet server in amoeba system is used for ____________.
A. database management.
B. process management.
C. file management.
D. directory management
ANSWER: B
41. Workstation server model is followed by __________.
A. amoeba.
B. V system.
C. mach.
D. chorus.
ANSWER: B
42. A__________ system is a collection of processors interconnected by a communication network in
which each processor has its own local memory and other peripherals.
A. parallel processing
B. distributed computing
C. super computer
D. multiprocessing
ANSWER: B
43. Automatic job sequencing makes use of __________ to define the beginning and end of a job to
improve CPU utilization.
A. smart cards
B. punched cards
C. control cards
D. credit cards
ANSWER: C
44. The words process, team, and team space respectively means _________.
A. process, thread, process address space.
B. thread, process, process address space.
C. process, task, process address space.

D. process, thread, thread address space.

ANSWER: B
45. ___________ is an unstructured sequence of data.
A. file.
B. record.
C. table.
D. tuple.
ANSWER: A
46. Overwriting operation is not possible in a ___________.
A. mutable file.
B. immutable file.
C. sequential file.
D. index sequential file.
ANSWER: B
47. Amoeba system was developed at _____________.
A. vrije university.
B. standfort university.
C. illinois university.
D. AT & T lab.
ANSWER: A
48. _________ operation is not possible in an immutable file.
A. insertion.
B. deletion.
C. updation.
D. selection.
ANSWER: C
49. _________ transparency deals with masking from the user's partial failures in the system.
A. location
B. access
C. replication
D. failure
ANSWER: D
50. Sending information to all the nodes connected in the network is called _______.
A. broadcasting.
B. multicasting.
C. polling.
D. piggybacking.
ANSWER: A
51. The high paging activity is called ________.
A. inter process communication.
B. thrashing
C. context Switch.
D. none of the above.
ANSWER: B
52. The Hardware mechanism that enables a device to notify the CPU is called __________.
A. polling.

B. interrupt.
C. system Call.
D. none of the above.
ANSWER: B
53. In the running state ______________.
A. only the process which has control of the processor is found.
B. all the processes waiting for I/O to be completed are found.
C. all the processes waiting for the processor are found.
D. none of the above.
ANSWER: A
54. Which of the following is crucial time while accessing data on the disk?
A. Seek time.
B. Rotational time.
C. Transmission time.
D. Waiting time.
ANSWER: A
55. Who is called a supervisor of computer activity?
A. CPU.
B. operating system.
C. control unit.
D. application Program
ANSWER: B
56. Virtual memory is __________.
A. an extremely large main memory.
B. an extremely large secondary memory.
C. an illusion of extremely large main memory.
D. a type of memory used in super computers.
ANSWER: C
57. The kernel keeps track of the state of each task by using a data structure called _____.
A. process control block.
B. user control block.
C. memory control block.
D. none of the above.
ANSWER: A
58. A __________ is a mechanical or algorithmic defect that may generate an error.
A. bug
B. error
C. system overflow
D. fault
ANSWER: D
59. A binary semaphore __________.
A. has the values one or zero.
B. is essential to binary computers.
C. is used only for synchronisation.
D. is used only for mutual exclusion
ANSWER: A

60. In _________ case of failure, the system continues to function but produces wrong results.
A. fail-stop
B. byzantine
C. system
D. none of the above
ANSWER: B
61. ____________ is the ability of a system to continue functioning in the event of partial system
failure.
A. fault avoidance
B. fault tolerance
C. fault detection
D. fault recovery
ANSWER: B
62. A system is said to be ______ tolerant if it can continue to function even in the event of the failure
of k components.
A. k-fault
B. k+1 fault
C. k-1 fault
D. k(k+1) fault
ANSWER: A
63. A _________ property ensures that at any time at most one process accesses a shared resource,
which must not be used simultaneously by multiple processes if program operation is to be correct.
A. mutual-exclusion
B. no-starvation
C. no-deadlock
D. event-ordering
ANSWER: A
64. In the multi-programming environment, the main memory consisting of _________ number of
process.
A. greater than 100.
B. only one.
C. greater than 50.
D. more than one.
ANSWER: D
65. In a multithreaded environment _______.
A. each thread is allocated with new memory from main memory.
B. main thread terminates after the termination of child threads.
C. every process can have only one thread.
D. none of the above
ANSWER: B
66. Which of the following statement is not true?
A. multiprogramming implies multitasking.
B. multi-user does not imply multiprocessing.
C. multitasking does not imply multiprocessing.
D. multithreading implies multi-user.
ANSWER: D
67. In one of the deadlock prevention methods, impose a total ordering of all resource types, and

require that each process requests resources in an increasing order of enumeration. This voilates the
_______________ condition of deadlock
A. mutual exclusion.
B. hold and Wait.
C. circular Wait.
D. no Preemption.
ANSWER: C
68. In the ___________ method of data transfer, the participation of the processor is eliminated during
data transfer.
A. buffering.
B. caching.
C. direct Memory Access.
D. indirect Memory Access.
ANSWER: C
69. A thread is a __________ process.
A. heavy Weight.
B. multiprocess.
C. inter Thread.
D. lightweight.
ANSWER: D
70. The aim of __________ transparency is to ensure that the movement of the object is handled
automatically by the system in a user-transparent manner.
A. location
B. name
C. migration
D. scaling
ANSWER: C
71. The aim of __________ transparency is to allow the system to expand in scale without disrupting
the activities of the users.
A. performance
B. scaling
C. concurrency
D. migration
ANSWER: B
72. CPU Scheduling is the basis of _________ operating system
A. batch.
B. real time
C. multiprogramming
D. monoprogramming
ANSWER: C
73. Which of the following events interrupt the communication between two processes, resulting in the
loss of message?
A. node crash
B. communication link failure
C. stack overflow
D. Both A and B
ANSWER: D

74. In ______ kernel model, the operating system services such as process management, memory
management are provided by the kernel.
A. monolithic
B. micro
C. macro
D. complex
ANSWER: A
75. Which of the following approach depend on the history of the serviced request?
A. stateless server
B. stateful server
C. pool of server
D. None of the above
ANSWER: B
76. Saving the state of the old process and loading the saved state of the new process is called
________.
A. context Switch.
B. state.
C. multi programming.
D. none of the above.
ANSWER: A
77. The term " Operating System " means ________
A. a set of programs which controls computer working.
B. the way a computer operator works.
C. conversion of high-level language in to machine level language.
D. the way a floppy disk drive operates.
ANSWER: A
78. Resource locking ________.
A. allows multiple tasks to simultaneously use resource.
B. forces only one task to use any resource at any time.
C. can easily cause a dead lock condition.
D. is not used for disk drives.
ANSWER: B
79. A thread is a ______________.
A. lightweight process where the context switching is low.
B. lightweight process where the context swithching is high.
C. is used to speed up paging.
D. none of the above.
ANSWER: A
80. Which of the following is the central issue in the communication structure?
A. mutual exclusion
B. semaphore
C. synchronization
D. failure handline
ANSWER: C
81. In inter-process communication, _________ is strongly related to synchronization strategy.
A. message buffering
B. process addressing

C. failure handling
D. none of the above.
ANSWER: A
82. The Purpose of Co-operating Process is __________.
A. information Sharing.
B. convenience.
C. computation Speed-Up.
D. all of the above.
ANSWER: D
83. The kernel of the operating system remains in the primary memory because ________.
A. it is mostly called (used).
B. it manages all interrupt calls.
C. it controls all operations in process.
D. it is low level.
ANSWER: A
84. The process related to process control, file management, device management, information about
system and communication that is requested by any higher level language can be performed by
__________.
A. editors.
B. compilers.
C. system Call.
D. caching.
ANSWER: C
85. Which of the following buffering strategies are used in interprocess communication?
A. null buffer
B. single message buffer
C. multiple message buffer
D. all of the above
ANSWER: D
86. Multiprogramming systems ________.
A. are easier to develop than single programming systems.
B. execute each job faster.
C. execute more jobs in the same time.
D. are used only on large main frame computers
ANSWER: C
87. Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs
is slightly ___________.
A. lengthened; Shortened.
B. shortened; Lengthened.
C. shortened; Shortened.
D. shortened; Unchanged.
ANSWER: B
88. Multiprocessing ________.
A. make the operating system simpler.
B. allows multiple processes to run simultaneously.
C. is completely understood by all major computer vendors.
D. allows the same computer to have the multiple processors.

ANSWER: D
89. Which is not the state of the process?
A. Blocked.
B. Running.
C. Ready.
D. Privileged.
ANSWER: D
90. A set of resources allocations such that the system can allocate resources to each process in some
order, and still avoid a deadlock is called ________.
A. unsafe state.
B. safe state.
C. starvation.
D. greedy allocation.
ANSWER: B
91. In _______ representation, the type of each program object along with its value is encoded in the
message.
A. tagged
B. untagged
C. sparse
D. sequential
ANSWER: A
92. _________ ensures that every message sent to a group of receivers will be delivered to either all of
them or none of them.
A. Ordered delivery
B. Atomicity
C. Survivability
D. Reliability
ANSWER: B
93. The technique, for sharing the time of a computer among several jobs, which switches jobs so
rapidly such that each job appears to have the computer to itself, is called ________.
A. time Sharing.
B. time out.
C. time domain.
D. multitasking.
ANSWER: A
94. In __________ communication, message transfers simply fail whenever there is no more buffer
space.
A. successful
B. unsuccessful
C. flow-controlled
D. flow uncontrolled
ANSWER: B
95. Messages smaller than the MTU of the network can be sent in a single packet and are known as
____________.
A. maximum transfer unit
B. single-datagram messages
C. multidatagram messages

D. message passing
ANSWER: B
96. Failure during inter-process communication may be due to __________.
A. loss of request message
B. loss of response message
C. unsuccessful execution of the request
D. All of the above
ANSWER: D
97. Which technique was introduced because a single job could not keep both the CPU and the I/O
devices busy?
A. Time-sharing.
B. SPOOLing.
C. Preemptive scheduling.
D. Multiprogramming
ANSWER: D
98. A Four-message reliable IPC protocol for client-server communication works as _____________.
A. request,reply,acknowledgement
B. reply,acknowledgement,request,acknowledgement
C. request,acknowledgement,reply,acknowledgement
D. request,request,reply,acknowledgement
ANSWER: C
99. Idempotency basically means _____________.
A. reliability
B. repeatability
C. survivability
D. flexibility
ANSWER: B
100. _________ transparency means that a RPC should have exactly the same syntax as a local
procedure call.
A. Syntactic
B. Semantic
C. Location
D. Name
ANSWER: A
101. ___________ transparency means that the semantics of a RPC are identical to those of a local
procedure call.
A. Syntactic
B. Semantic
C. Location
D. Name
ANSWER: B
102. _____________ procedure calls are more vulnerable to failure than local procedure calls.
A. remote
B. called
C. calling
D. none of the above
ANSWER: A

103. To achieve the goal of semantic transparency, RPC implementation uses the concept of
___________.
A. stubs
B. tables
C. queries
D. data stream
ANSWER: A
104. The operating system of a computer serves as a software interface between the user and the
________.
A. hardware.
B. peripheral.
C. memory.
D. screen.
ANSWER: A
105. Super computers typically employ _______.
A. real time operating system.
B. multiprocessors OS.
C. desktop OS.
D. none of the above.
ANSWER: B
106. A process that is based on IPC mechanism which executes on different systems and can
communicate with other processes using message based communication, is called ________.
A. local Procedure Call.
B. inter Process Communication.
C. remote Procedure Call.
D. remote Machine Invocation.
ANSWER: C
107. A process is _________.
A. program in execution.
B. a concurrent program.
C. any sequential program.
D. something which prevents deadlock.
ANSWER: A
108. The collection of processes on the disk that is waiting to be brought into memory for execution
forms the ___________
A. ready queue.
B. device queue.
C. input queue.
D. priority queue.
ANSWER: C
109. The ________ is a user process that initiates a remote procedure call.
A. client
B. server
C. network
D. operating system
ANSWER: A

110. Which is not an Operating System?

A. Windows 95.
B. MS-DOS.
C. Windows 3. 1.
D. Windows 2000.
ANSWER: C
111. The operating system manages ________.
A. memory.
B. processor.
C. disk and I/O devices.
D. all of the above.
ANSWER: D
112. Which is not the layer of the Operating system?
A. Kernel.
B. Shell.
C. Application program.
D. Critical Section.
ANSWER: D
113. The ___________ handles transmission of messages across the network between client and server
machines.
A. client
B. client stub
C. RPCRuntime
D. server stub
ANSWER: C
114. Who is called a supervisor of computer acitvity?
A. CPU.
B. operating system.
C. control unit.
D. application Program.
ANSWER: B
115. Expansion of IDL is ___________.
A. Interface Definition Language
B. Interface Description Language
C. Internet Definition Language
D. Internet Description Language
ANSWER: A
116. The process related to process control, file management, device management, information about
system and communication that is requested by any higher level language can be performed by
__________.
A. editors.
B. compilers.
C. system Call.
D. caching.
ANSWER: C
117. Mutual exclusion
A. if one process is in a critical region others are excluded.

B. prevents deadlock.
C. requires semaphores to implement.
D. is found only in the Windows NT operating system.
ANSWER: A
118. A server program that implements procedures in an interface is said to _________ the interface.
A. extract
B. export
C. import
D. None of the above.
ANSWER: B
119. ___________ are independent of transport protocols.
A. RPC protocol
B. IPC protocol
C. TCP protocol
D. IP protocol
ANSWER: A
120. _________ is useful for identifying lost messages and duplicate messages in case of system failures
A. sequence number
B. acknowledgement
C. destination address
D. data size
ANSWER: A
121. Identify the correct format of RPC call message.
A. Message identifier,Message type,Client identifier,Remote procedure identifier, Arguments
B. Message identifier, Message type, Reply status, Result
C. Message identifier, Message type, Reply status, Reason for failure
D. Message identifier, message status, reply, acknowledgement
ANSWER: A
122. Which of the following is a correct RPC reply message?
A. Message identifier,Message type,Client identifier,Remote procedure identifier, Arguments
B. Message identifier, Message type, Reply status, Result
C. Message identifier, Message type, Reply status, Reason for failure
D. Both B and C
ANSWER: D
123. ________ process involves encoding and decoding of message data between two computers.
A. marshaling
B. encrypting
C. decrypting
D. unmarshaling
ANSWER: A
124. Maintaining separate life times for client and server processes is called as __________.
A. independence
B. dependence
C. parallelism
D. sequential
ANSWER: A

125. ________ servers exists only for duration of a single call.

A. instance per session servers
B. persistent servers
C. instance per call servers
D. instance servers
ANSWER: C
126. ___________ servers exist for the entire session.
A. instance per session servers
B. persistent servers
C. instance per call servers
D. instance servers
ANSWER: A
127. ____________ servers are useful for improving the overall performance and reliability of the
system.
A. persistent servers
B. instance per session servers
C. instance per call servers
D. instance servers
ANSWER: A
128. In the ________ method, all parameters are copied into a message that is transmitted from the
client to the server through the intervening network.
A. call-by-value
B. call-by-reference
C. call-by-visit
D. call-by-move
ANSWER: A
129. In an object-based system that uses the RPC mechanism for object invocation, the call-byreference semantics is known as call-by-_______.
A. visit
B. object-reference
C. value
D. move
ANSWER: B
130. The normal functioning of an RPC may get disrupted due to _________.
A. call message gets lost
B. response message gets lost
C. callee node and caller node crashes and is restarted
D. All of the above
ANSWER: D
131. Which of the following is the weakest call semantic used in RPC?
A. may-be call semantics
B. last-one call semantics
C. lost-of-many call semantics
D. at-least-once call semantics
ANSWER: A
132. Last-one semantics can be easily achieved when only ______ processors are involved in RPC
A. one

B. two
C. three
D. four
ANSWER: B
133. An _______ call is one whose parent has expired due to a node crash.
A. orphan
B. local procedure
C. remote procedure
D. possibly call
ANSWER: A
134. In which type of protocol, only one message per call is transmitted from client to server?
A. The Request Protocol
B. The Request/Reply Protocol
C. The Request/Reply/Acknowledgement Protocol
D. The Request/Reply/Acknowledgement-Reply Protocol
ANSWER: A
135. An RPC that uses the R protocol is called ________.
A. synchronous RPC
B. asynchronous RPC
C. reliable RPC
D. unreliable RPC
ANSWER: B
136. The implementation of _______ semantics with RR protocol requires the server to maintain a
record of the replies in its reply cache.
A. last-of-many call
B. at-least-once call
C. exactly-once call
D. last-one call
ANSWER: C
137. The process by which a client becomes associated with a server so that calls can take place is
known as ______.
A. abstraction
B. binding
C. linking
D. loading
ANSWER: B
138. A ________ and ________ are the two parts of an interface name.
A. class and object
B. member variable and member function
C. method and instance
D. type and instance
ANSWER: D
139. A binding agent is basically a ________ server used to bind a client to a server by providing the
client with the location information of the desired server.
A. name
B. file
C. database

D. print
ANSWER: A
140. A client may be bound to a server at _______ time
A. compile
B. link
C. call
D. All of the above
ANSWER: D
141. In which method, a client is bound to server at the time when it calls the server for the first time
during execution.
A. binding at compile time
B. binding at link time
C. binding at call time
D. none of the above
ANSWER: C
142. Which method is also called as indirect call method?
A. binding at compile time
B. binding at link time
C. binding at call time
D. none of the above
ANSWER: C
143. __________ is a connection establishment between a client and a server.
A. message passing
B. binding
C. message passing
D. buffering
ANSWER: B
144. The LRPC was introduced by _______.
A. Bershad et al.
B. Schroeder
C. Horus
D. Jones et al
ANSWER: A
145. The __________ is a communication facility designed and optimized for cross-domain
communications.
A. LRPC
B. HRPC
C. RPC
D. FRPC
ANSWER: A
146. _________ involves communication between domains on the same machine.
A. Cross-machine
B. Cross-domain
C. Single-machine
D. Single-domain
ANSWER: B

147. ___________ refers to the block size of a DSM system.

A. cohesion
B. thrashing
C. heterogeneity
D. granularity
ANSWER: D
148. Access transparency is _______.
A. users unaware of the whether the resource is remote or local.
B. users are unaware of multiple copies.
C. name of the resource should not reveal the physical location the resources.
D. partial failure in the system.
ANSWER: A
149. Replication transparency refers to the fact that ______________.
A. users unaware of the whether the resource is remote or local.
B. users are unaware of multiple copies.
C. name of the resource should not reveal the physical location the resources.
D. partial failure in the system.
ANSWER: B
150. ______,_________ and ______ are the three primitives of building agent interface.
A. register, deregister, lookup
B. register, deregister, likelihood
C. register, deregister, distance
D. none of the above
ANSWER: A
151. LRPC achieves a ________ performance improvement over traditional approaches.
A. factor-of-one
B. factor-of-two
C. factor-of-three
D. factor-of-four
ANSWER: C
152. Expansion of DSVM is ________.
A. Distributed Simple Virtual Memory
B. Distributed Shared Virtual Memory
C. Distributed Simple Visual Memory
D. Distributed Sample Virtual Memory
ANSWER: B
153. Which of the following is a solution to the address memory access latency?
A. Data Caching
B. Data Binding
C. Dynamic Binding
D. Data Sharing
ANSWER: A
154. A ______ model refers to the degree of consistency that has to be maintained for the sharedmemory data for the memory to work correctly for a certain set of applications
A. granularity
B. consistency
C. ISO reference

D. Process
ANSWER: B
155. A shared-memory system is said to support the ______ consistency model if the value returned by
a read operation on a memory address is always the same as the value written by the most recent write
operation to that address.
A. Sequential
B. Strict
C. Casual
D. Processor
ANSWER: B
156. The processor consistency model was proposed by ___________.
A. Goodman
B. Sandberg
C. Dubois
D. Lamport
ANSWER: A
157. Implementation of _________ consistency model requires the existence of an absolute global time
so that memory read/write operations can be correctly ordered.
A. strict
B. sequential
C. casual
D. weak
ANSWER: A
158. DSM system used a special variable called a ___________ variable.
A. system
B. environment
C. synchronization
D. private
ANSWER: C
159. Expansion of PRAM is
A. Parallel Random-Access Memory
B. Pipelined Random-Access Memory
C. Parallel Read-Access Memory
D. Pipelined Read-Access Memory
ANSWER: B
160. Which of the following consistency model provides a mechanism to clearly tell the system whether
a process is entering a critical section or exiting from the critical section.
A. Strict Consistency Model
B. Sequential Consistency Model
C. Release Consistency Model
D. Processor Consistency Model
ANSWER: C
161. A barrier defines the _______ of execution of a group of concurrently executing processes.
A. beginning of a phase
B. middle of a phase
C. end of a phase
D. full execution phase

ANSWER: C
162. All accesses to acquire and release synchronization variables obey _______ semantics.
A. strict consistency
B. processor consistency
C. release consistency
D. PRAM consistency
ANSWER: B
163. Which of the following strategy for implementing a sequentially consistent DSM system?
A. Nonreplicated, nonmigrating blocks
B. Nonreplicated, migrating blocks
C. Replicated, migrating blocks
D. Replicated, nonmigrating blocks
ANSWER: A
164. Which of the following is not used for locating data in the NRMB strategy?
A. Single copy of each block
B. broadcasting
C. centralized-server
D. fixed distributed-server
ANSWER: A
165. In broadcasting method, each node maintains _______ table that contains an entry for each block
for which the node is the current owner.
A. Lookup table
B. Truth table
C. Routing table
D. Owned blocks table
ANSWER: D
166. RMB stands for ________.
A. Replicated, Migrating Blocks
B. Read, Migrating Blocks
C. Random Migrating Blocks
D. None of the above
ANSWER: A
167. A major disadvantage of the nonreplication strategies is ____________.
A. lack of distribution
B. lack of parallelism
C. lack of memory
D. lack of information
ANSWER: B
168. In which scheme, all copies of a piece of data except one are invalidated before a write can be
performed on it.
A. write-update
B. write-validate
C. write-invalidate
D. read-update
ANSWER: C
169. In ______ scheme, a write operation is carried out by updating all copies of the data on which the

write is performed.
A. write-update
B. write-validate
C. write-invalidate
D. write-nonupdate
ANSWER: A
170. The shared-memory space of Munin is structured as a collection of _____________.
A. private variables
B. protected variables
C. shared variables
D. environment variables
ANSWER: C
171. Which of the following is not a characteristic of RNMB strategy?
A. The replica locations of a block never change
B. All replicas of a data block are kept consistent
C. keep track of nodes that currently have a valid copy of the block
D. Only a read request can be directly sent to one of the nodes having a replica of the block
ANSWER: C
172. _________ is an example of usage-based algorithm.
A. FIFO
B. LIFO
C. Rand
D. LRU
ANSWER: D
173. __________ algorithm are not suitable for a DSM system.
A. usage based algorithm
B. non-usage based algorithm
C. fixed space algorithm
D. variable-space algorithm
ANSWER: D
174. ___________ is said to occur when the system spends a large amount of time spent doing the
useful work of executing application processes.
A. Thrashing
B. Congestion
C. granularity
D. consistency
ANSWER: A
175. An external time source that is often used as a reference for synchronizing computer clocks with
real time is ________.
A. UTC
B. ITC
C. GEOS
D. WWV
ANSWER: A
176. In which of the following method, mutual exclusion is achieved by using a single token that is
circulated among the processes in the system.
A. centralized approach

B. distributed approach
C. token-passing approach
D. none of the above.
ANSWER: C
177. A ________ is a special type of message that entitles its holder to enter a critical section.
A. block
B. bit
C. token
D. byte
ANSWER: C
178. Which of the following condition is not necessary for a deadlock situation to occur in a system?
A. Mutual-exclusion
B. Semaphore
C. Hold-and-wait
D. No-preemption
ANSWER: B
179. What condition will occur if a resource is held by a process, any other process requesting for that
resource must wait until the resource has been released?
A. Mutual-exclusion
B. Hold-and-wait
C. No-preemption
D. Circular-wait
ANSWER: A
180. In ________ condition, processes are allowed to request for new resources without releasing the
resources that they are currently holding.
A. Mutual-exclusion
B. Hold-and-wait
C. No-preemption
D. Circular-wait
ANSWER: B
181. In ____________ condition, a resource that has been allocated to a process becomes available for
allocation to another process only after it has been voluntarily released by the process holding it.
A. Mutual exclusion
B. Hold-and-wait
C. No-preemption
D. Circular-wait
ANSWER: C
182. In __________ condition, two or more processes must form a circular chain in which each process
is waiting for a resource that is held by the next member of the chain.
A. Mutual exclusion
B. Hold-and-wait
C. No-preemption
D. Circular-wait
ANSWER: D
183. Deadlock can be modeled using _________.
A. directed graph
B. undirected graph

C. undirected acyclic graph

D. directed acyclic graph
ANSWER: A
184. For deadlock modeling, a directed graph, called a ________ is used.
A. undirected acyclic graph
B. undirected graph
C. resource allocation graph
D. directed acyclic graph
ANSWER: C
185. The probe-based distributed deadlock detection algorithm was proposed by ___________.
A. Chandy et al.
B. Silberschatz and Galvin
C. Gray et al.
D. Rosenkratz et al.
ANSWER: A
186. Which of the following method is not used in a system to recover from a deadlock?
A. Asking for operator intervention
B. Initiation of processes
C. Termination of processes
D. Rollback of processes
ANSWER: B
187. ____________ algorithms are meant for electing a coordinator process from among the currently
running processes in such a manner that at any instance of time there is a single coordinator for all
processes in the system.
A. deadlock detection
B. scheduling algorithm
C. election algorithm
D. none of the above.
ANSWER: C
188. _____________ is the state of permanent blocking of a set of processes each of which is waiting
for an event that only another process is in the set can cause.
A. Running
B. Wait
C. Blocked
D. Deadlock
ANSWER: D
189. Which of the following is used as a strategy to handle deadlocks?
A. avoidance
B. prevention
C. detection and recovery
D. All of the above
ANSWER: D
190. Which of the following approach is the recommended for handking deadlocks in distributed
systems?
A. avoidance
B. prevention
C. detection and recovery

D. none of the above.

ANSWER: C
191. The ring algorithm requires _________ messages on an average for recovery action.
A. n/2
B. n2
C. 2n
D. n(n+1)
ANSWER: A
192. In worst case, the bully algorithm requires ________ messages.
A. O(npower2)
B. O(n)
C. O(n-1)
D. O(n+1)
ANSWER: A
193. __________ deals with the process of deciding which process should be assigned to which
processor.
A. process migration
B. processor allocation
C. threads
D. none of the above.
ANSWER: B
194. ____________ is the relocation of a process from its current location to another node.
A. process allocation
B. process migration
C. threads
D. process association
ANSWER: B
195. ___________ time is defined as the time period for which the execution of the process is stopped
for transferring its information to the destination node.
A. turn around
B. latency
C. freezing
D. execution
ANSWER: C
196. Which of the following is not a major sub-activity involved in process migration?
A. freezing the process on its source node and restarting it on its destination node
B. transferring the process's address space from its source node to its destination node.
C. freezing the process on its destination node and restarting it on its source
D. forwarding messages meant for the migrant process.
ANSWER: C
197. In case of message lost during the communication __________________can be followed.
A. idempotency protocol.
B. non Idempotency protocol.
C. acknowledgement.
D. timeout based retransmissions.
ANSWER: D

198. __________________refers to the capability of a system to adapt to increased service load.

A. performance.
B. scalability.
C. flexibility.
D. reliability.
ANSWER: B
199. In a DCE system,a cell is agroup of____________.
A. mobiles.
B. users.
C. machines.
D. uses of machines or other resources.
ANSWER: D
200. ______________is a group of users or machine.
A. cell.
B. cluster.
C. cloud.
D. DCE.
ANSWER: A
201. In a RPC, the caller is________________.
A. server process.
B. client process.
C. stub.
D. runtime routine.
ANSWER: B
202. In a RPC, the callee is________________.
A. server process.
B. client process.
C. stub.
D. runtime routine.
ANSWER: A
203. _________________is more vulnerable to failure.
A. local procedure call.
B. remote procedure call.
C. remote message.
D. local message.
ANSWER: B
204. ___________________consumes more time.
A. local procedure call.
B. remote procedure call.
C. remote message.
D. local message.
ANSWER: B
205. Timestamping is used in _________________ approach for mutual exclusion.
A. token passing.
B. centralized approach.
C. distributed approach.
D. top down approach.

ANSWER: C
206. Prolonged waiting for resources lead to______________.
A. starvation.
B. exclusion.
C. waiting.
D. critical section.
ANSWER: A
207. The section of the program that need exclusive access to shared resources are referred to as
__________________.
A. program section.
B. execution section.
C. locked section.
D. critical section.
ANSWER: D
208. Which of the following call reduce thrashing?.
A. locking data.
B. interleaving data access.
C. making all the data read only.
D. moving data blocks.
ANSWER: A
209. Which of the following block will be first replaced?.
A. read owned.
B. writable.
C. unused.
D. read only.
ANSWER: C
210. Which of the following block will be first replaced?.
A. read only.
B. read owned.
C. nil block.
D. writable.
ANSWER: C
211. Random replacement is __________________ based algorithm.
A. fixed space.
B. variable space.
C. usage based.
D. non usage based.
ANSWER: D
212. First in first out is ___________________ based algorithm.
A. fixed space.
B. variable space.
C. usage based.
D. non usage based.
ANSWER: D
213. Least recently used is a _____________ based algorithm.
A. fixed space.

B. variable space.
C. usage based.
D. non usage based.
ANSWER: C
214. Shared variables that are automatically modified belong to the annotation type _________.
A. read only.
B. reduction.
C. conventional.
D. migratory.
ANSWER: B
215. Which of the following is not an annotation type in munin?
A. read only.
B. migratory
C. producer consumer.
D. write update.
ANSWER: D
216. Which approach is very expensive?
A. write-update.
B. write-invalidate.
C. write-validate.
D. write-write.
ANSWER: A
217. Tuple means _____________.
A. record.
B. table.
C. database.
D. values.
ANSWER: A
218. ________________defines the end of a phase of execution of a group of concurrently executing
processes.
A. acquire.
B. release.
C. barrier.
D. block.
ANSWER: C
219. Which is not the factor influencing block size?
A. paging overhead
B. false sharing
C. thrashing
D. deadlock
ANSWER: D
220. ____________ ensures that if a transaction's work is interrupted by a failure, any partially
completed results
A. atomocity
B. failure atomocity
C. consurrecny
D. consistency

ANSWER: B
221. _________ property is also known as isolation property.
A. atomicity
B. serializability
C. concurrency atomicity
D. all-or-nothing property.
ANSWER: B
222. Which of the following property is also known as durability property?
A. atomicity
B. serializability
C. performance
D. none of the above
ANSWER: C
223. Which technique ensures file recoverability by avoiding overwriting the actual data in physical
storage?
A. File Versions Approach
B. The Write-Ahead Log Approach
C. Locking
D. None of the above
ANSWER: A
224. The simplest approach for concurrency control would be to allow the transactions to be run
__________.
A. one at a time
B. two at a time
C. three at a time
D. many at a time
ANSWER: A
225. The __________ refers to the unit of lockable data items.
A. granularity of locking
B. optimized locking
C. two-phase locking
D. shadow locking
ANSWER: A
226. The most crucial part in the design of a distributed transaction service is the ___________ of
distributed transactions.
A. granting
B. revoking
C. rollbacking
D. committing
ANSWER: D
227. In a distributed transaction service, ________ is responsible for deciding whether the transaction
should be aborted or committed.
A. client
B. node
C. host
D. coordinator
ANSWER: D

228. ________ is used in describing relationships among the transactions belonging to the same family.
A. tree
B. undirected graph
C. directed graph
D. none of the above
ANSWER: A
229. Amoeba is an ___________ system in which the entire software is structured as objects.
A. object-based
B. operational-based
C. relational-based
D. object-oriented relational based
ANSWER: A
230. The mechanism used in Amoeba for locating a server is based on __________.
A. broadcast queries
B. unicast queries
C. multicast queries
D. range queries
ANSWER: A
231. A ______________ is a subsystem of an operating system that performs file management
activities.
A. file system
B. process management system
C. memory management system
D. interprocess communication system
ANSWER: A
232. Which of the following are file management activities?
A. organization
B. storing
C. retrieval
D. all of the above
ANSWER: D
233. What benefit is offered by replication of files in a distributed file system?
A. Increased availability
B. Increased readability
C. Improved response time
D. All of the above
ANSWER: D
234. Amoeba was started in the year _______.
A. 1980
B. 1981
C. 1982
D. 1983
ANSWER: B
235. Amoeba was started by ____________ as a research project in distributed and parallel computing.
A. Andrew.S.Tanenbaum
B. Thomas Anderson

C. Gregory R. Ganger
D. Silberschatz
ANSWER: A
236. Amoeba system was developed at __________.
A. Vrije University
B. Alfred University
C. Athena University
D. Bastyr University
ANSWER: A
237. What type of distributed computing system model is used in Amoeba system?
A. Workstation Model
B. Workstation server Model
C. Processor-pool Model
D. Hybrid Model
ANSWER: C
238. ___________ are used to link two or more Amoeba systems over wide area networks.
A. Bridges
B. Gateways
C. Routers
D. Switches
ANSWER: B
239. Each object in Amoeba is both identified and protected by a __________.
A. capability
B. reliability
C. serializability
D. flexibility
ANSWER: A
240. __________ is a 48-bit logical address that identifies the server that manages the object referred to
by the capability.
A. object number
B. server port
C. rights
D. check
ANSWER: B
241. Each server in Amoeba runs __________, which removes all unused objects.
A. garbage collector
B. processor pool
C. recycle bin
D. disk cleaner
ANSWER: A
242. The process of mapping a human-oriented object name to its system-oriented name is known as
___________.
A. name resolution
B. domain name service
C. dynamic binding
D. server locating
ANSWER: A

243. In Amoeba, __________ servers are used to perform the name resolution
A. name
B. file
C. directory
D. domain name
ANSWER: C
244. In Amoeba, a processor pool is represented by a directory called __________.
A. pooldir
B. curdir
C. mvdir
D. rndir
ANSWER: A
245. Which server in Amoeba system, deals with storage and manipulation of files?
A. bullet server
B. directory server
C. replication server
D. name server
ANSWER: A
246. The IPC primitives provided by the kernel of the Amoeba system __________
A. trans
B. get_request
C. send_reply
D. all of the above
ANSWER: D
247. Which of the following property is not supported by RPC in Amoeba system?
A. asynchronous type of communication
B. unbuffered messages
C. use of at-most-once semantics
D. use of stateless servers.
ANSWER: A
248. Group Communication mechanism of Amoeba ensures ________.
A. ordered delivery of messages
B. reliable delivery of messages
C. withstand of loss of an arbitrary collection of k processors
D. all of the above
ANSWER: D
249. Amoeba uses ________ protocol for communication purposes.
A. FTP
B. FLIP
C. TCP
D. TCP/IP
ANSWER: B
250. How many levels of protection is used in Amoeba to ensure the genuineness of a client?
A. one
B. two
C. three

D. four
ANSWER: B