1. A distributed system contains ____________ nodes.
a. zero node
b. one node
c. two node
d. multiple node
2. A distributed system is defined as a collection of autonomous computers linked by a network with software designed to produce an integrated computing facility.
a. FALSE
b. TRUE
3. A distributed system is a collection of __________ computers that appears to its users as a single coherent system.
a. Independent
b. Interconnected
c. Interrelated
d. Shared
4. A system in which the components of an information system are distributed to multiple locations in a computer network is known as
a. database system
b. networked system
c. distributed system
d. communication system
5. What is false about distributed system?
a. It is a collection of processor
b. They do not share memory
c. All processors are synchronized
d. None of the above
6. Various Components of distributed systems are _________________.
a. Client
b. Server
c. server network links
d. client, server, network links
7. Distributed systems should have
a. High security
b. better resource sharing
c. Better system utilization
d. Low system overhead
8. The characteristics of a distributed system are:
a. Resource sharing, heterogeneity, openness, security
b. Scalability, fault handling
c. Concurrency, transparency
d. All the above
9. Among the following option which is not main focus of Distributed System
a. Availability
b. Reliability
c. Scientific Performance
d. Resource sharing
10. In distributed system, If one node (site) fails then __________
a. The remaining sites can continue operating
b. All the nodes (sites) will stop working
c. Directly connected sites will stop working
d. None of the mentioned
11. Which of the following will be true distributed system?
a. tightly-coupled software on loosely-coupled hardware
b. loosely-coupled software on tightly-coupled hardware
c. tightly coupled software on tightly-coupled hardware
d. loosely-coupled software on loosely-coupled hardware
12. What are the advantages of distributed systems over independent PCs?
a. Data sharing
b. Resource sharing
c. Communication
d. All of the above
13. Which of the following is not an Advantage of Distributed Systems?
a. All the nodes in the distributed system are connected to each other
b. It can be scaled as required
c. Failure of one node does not lead to the failure of the entire distributed system
d. Some messages and data can be lost in the network while moving from one node to another
14. In distributed system, each processor has its own ___________
a. local memory
b. clock
c. Both A and B
d. None of the above
15. What is not a major reason for building distributed systems?
a. resource sharing
b. computation speedup
c. reliability
d. simplicity
16. There are four requirements in the design of a distributed system. Choose the correct combination from the list below:
a. Network performance, Quality of Service (QoS), Caching and replication, Dependability issues
b. Network dependency, Quantity of service (QoS), cookies and replication, Dependability issues
c. Network integrity, Quality of software (QoS), caching and alteration, Dependability issues
d. Network accessibility, Quality of Hardware (QoH), caching and replication, Dependability issues
17. _____________ defines the way in which the components of the system interact with each other & mapped onto an underlying network of component.
a. Interaction model
b. Fault model
c. Architectural model
d. Security model
18. Which among below is not Distributed system models are ___________________.
a. Architectural model
b. Interaction model
c. Fault model
d. Performance model
19. The nodes in the distributed systems can be arranged in the form of
a. client/server systems
b. peer to peer systems
c. Both A and B
d. None of the above
20. In which system, tasks are equally divided between all the nodes?
a. client/server systems
b. peer to peer systems
c. user to client system
d. All of the above
21. In a peer-to-peer architecture, peers can serve as ________________
a. Clients
b. Servers
c. Middle-system
d. Both a and b
22. In which model, there is no distinction between the client & server process?
a. client-server model
b. master-slave model
c. P2P Model
d. fault model
23. Which Distributed System Model deals with Communication?
a. Security model
b. Fault model
c. Interaction model
d. Architecture model
24. A type of the failure model where a server fails to responds to incoming requests
a. Crash failure
b. Response failure
c. Omission failure
d. Arbitrary failure
25. Channel omission failure is
a. Loss of messages occurs between the sending process and the outgoing message buffer.
b. Loss of messages occurs between the incoming message buffer and the receiving process.
c. Loss of messages occurs between the incoming buffer and the outgoing buffer
d. Loss of messages occurs between the incoming buffer and the system.
26. Arbitrary failure may occur in form of
a. duplicate message
b. protocol
c. reliable communication
d. address space
27. The _____________ fault describes the worst possible fault semantics where any type of error may occur.
a. Timing
b. Arbitrary
c. Omission
d. Non-timing
28. A server changes from the correct flow of control _________________.
a. Crash Failure
b. Byzantine failure
c. Response Failure
d. Timing Failure
29. Which failures Response lies outside a specified time interval
a. Timing Failure
b. Omission failure
c. Crash Failure
d. Arbitrary Failure
30. The ________ is used to provide security to the shared resources, processes & channels used for their interactions.
a. Interaction model
b. Fault model
c. Architectural model
d. Security model
31. Security for information resource does not include
a. Availability
b. Concurrency
c. Confidentiality
d. Integrity
32. The security of a distributed system can be achieved by __________ used for their interactions.
a. securing the processes and the channels
b. securing the channels not process
c. not securing the processes and the channels
d. securing the processes not the channels
33. The security of distributed system can be achieved in terms of various security goals, which one is not the goal
a. Authentication
b. Authorization
c. Confidentiality
d. Denial Service
34. Following is concerned with extension and improvements of distributed system
a. Openness
b. Concurrency
c. fault tolerance
d. Resource sharing
35. The __________ of distributed system is determined primarily by the degree to which new resource- sharing services can be added and be made available for use by a variety of client programs.
a. Openness
b. Resource Sharing
c. Transparency
d. Scalability
36. In distributed systems, ____________ offers services according to standard rules that describe the syntax and semantics of those services.
a. Openness
b. Scalability
c. Reliability
d. fault tolerance
37. What are design issues in distributed system structure?
a. Scalability
b. fault-tolerance
c. flexibility
d. all of the mentioned
38. The capability of a system to adapt the increased service load is called
a. Capacity
b. Tolerance
c. Scalability
d. None of the above
39. Which amongst the following is not an advantage of distributed systems?
a. Resource sharing
b. Incremental growth
c. Reliability
d. None of the above
40. Increased service load handled by capability of system is known as ______________.
a. Capacity
b. Scalability
c. Tolerance
d. Expansion
41. Fault tolerance in distributed systems is the method used for
a. Heterogeneity
b. Security
c. Flexibility
d. Reliability
42. __________ is the ability of system to provide a service, even in the presence of errors
a. Replication
b. Fault tolerance
c. Concurrency
d. Consistency
43. ____________ of data is a major fault tolerance method in distributed system
a. Replication
b. Recovery
c. Concurrency
d. Consistency
44. The characteristic of distributed system that cares reliability of system so that in case of any failure, system continues to operate properly –
a. Scalability
b. Concurrency
c. Fault tolerance
d. Openness
45. Following is not need of fault tolerance in distributed system.
a. Reliability
b. Availability
c. Security
d. Maintainability
46. A system is fault tolerant if it can continue to operate in the _________________.
a. presence of failures
b. absence of failures
c. presence of replication
d. absence of replication
47. File services should be provided across different operating systems and hardware platforms is called as _________.
a. Openness
b. Scalability
c. Reliability
d. Heterogeneity
48. Characteristics of distributed system that allows variety of devices to be part of it is also called
a. Heterogeneity
b. Openness
c. Scalability
d. Security
49. The ability of distributed system to hide the fact is known as _______________.
a. Openness
b. Scalability
c. Transparency
d. Homogeneity
50. Hiding the complicacy of the system from user in distributed environment is known as _____________
a. Heterogeneity
b. Security
c. Flexibility
d. Transparency
51. Which of the following is NOT type of transparency?
a. Access transparency
b. Location transparency
c. Replication transparency
d. Clock Synchronization Transparency
52. Scaling transparency hides ______________
a. system collaboration
b. system failure
c. system security
d. system expansion
53. ____________ hides differences in data representation and the way an object can be accessed
a. Location transparency
b. Access transparency
c. Migration transparency
d. Replication transparency
54. Hide differences in data representation and how a resource is accessed” which type of transparency is this?
a. Relocation
b. Failure
c. Concurrency
d. Access
55. The transparency that enables accessing local and remote resources using identical operations is called ___________
a. Access transparency
b. Concurrency transparency
c. Performance transparency
d. Scaling transparency
56. Which transparency deals with providing efficient access to the system by hiding the implementation details?
a. Location Transparency
b. Access Transparency
c. Network Transparency
d. Failure Transparency
57. Location transparency allows for which of the following
a. Users to treat the data as if it is at one location
b. Programmers to treat the data as if it is at one location
c. Managers to treat the data as if it is at one location
d. All of the above
58. System that provides access to the resources irrespective of their location is called ___________
a. Relocation Transparency
b. Location Transparency
c. Migration transparency
d. Access transparency
59. Hide where a resource is located which type of transparency is this?
a. Location
b. Migration
c. Relocation
d. Access
60. Hide that a resource may move to another location which type of transparency is this?
a. Location
b. Migration
c. Relocation
d. Access
61. Resources and clients transparency that allows movement within a system is called __________
a. Mobility transparency
b. Concurrency transparency
c. Replication transparency
d. Performance transparency
62. Which of the following is correct about migration transparency?
a. Local and remote objects should be accessed in a uniform way
b. Objects are referred by logical names which hide the physical location of the objects
c. Movement of object from one system to the other is invisible to user
d. Sharing of objects without interference
63. ____________ transparency makes sure that even if the servers are migrated from one location to to the other, they will not affect the performance of system.
a. Location
b. Migration
c. Network
d. Concurrent
64. _____________ transparency hides that a resource may move to the another location.
a. Access transparency
b. Migration transparency
c. Replication transparency
d. Failure transparency
65. The transparency that enables multiple instances of resources to be used, is called _____________
a. Performance transparency
b. Scaling transparency
c. Concurrency transparency
d. Replication transparency
66. Hide that a resource is replicated is known as _____________ transparency
a. Replication
b. Location
c. Migration
d. Relocation
67. ______________ transparency hides failure and recovery of a resources.
a. Location transparency
b. Access transparency
c. Failure transparency
d. Migration transparency
68. Hide the failure and recovery of a resource is known as which transparency
a. Failure
b. Location
c. Migration
d. Relocation
69. ____________ enables users and application programs to complete their tasks despite the failure of hardware or software components
a. Concurrency transparency
b. Failure transparency
c. Replication transparency
d. Migration transparency
70. A “glue” between client and server parts of application
a. Middleware
b. Firmware
c. Package
d. system software
71. Middleware called ______________ for connecting independent systems together and makes them work together.
a. Homogeneous
b. Glue-code
c. Heterogeneous
d. concurrent
72. Concurrency is one of the intrinsic characteristics of distributed systems. Here, parallel execution occurs because _____
a. Many users simultaneously invoke commands or interact with (the same) application programs.
b. Many server processes run concurrently, each corresponding to a single request from a client process
c. Both a and b
d. None of these
73. In a distributed system, information is exchanged through
a. Memory sharing
b. Message passing
c. E-mail sending
d. Network sharing
74. All communication in distributed system is based on message passing.
a. True
b. False
75. In message passing systems, a message-passing facility provides at least two operations ___________
a. send (message) and delete (message)
b. delete (message) and receive (message)
c. send (message) and receive (message)
d. write (message) and delete (message)
76. If timestamps of two events are same, then the events are ____________
a. concurrent
b. non-concurrent
c. monotonic
d. non-monotonic
77. What are the problems of clock synchronization in distributed operating systems?
i. Processes make decision based only on local information
ii. The relevant information is scattered among multiple machines
iii. A single point of failure in the system should be avoided
iv. No common clock or other precise global time source exists
a. II, III and IV
b. I, II and IV
c. I, III and IV
d. I, II, III, IV
78. An external time source that is often used as a reference for synchronizing computer clocks with real time is the _______
a. Universal Centralized Time
b. Unique Coordinated Time
c. Unique Centralized Time
d. Universal Coordinated Time
79. What is UTC?
a. Universal Centralized Time
b. Unique Coordinated Time
c. Universal Coordinated Time
d. Unique Centralized Time
80. We define the clock drift as __________
a. The difference in time values between any two clocks
b. The period of time between two consecutive clock synchronization actions
c. The adjustment that needs be made to a clock so that its value achieves the average time
d. The rate by which the value of a clock separates gradually from the ideal time
81. The computer clock differs from the real time clock is known as
a. Quartz crystal
b. Clock drift
c. Clock skew
d. None of the above
82. Difference in precision between a prefect reference clock and a physical clock is known as _____________
a. Clock drift rate
b. Drift
c. Skew
d. Clock synchronization
83. Define the clock skew as ______________
a. The difference in time values between any two clocks
b. The period of time between two consecutive clock synchronization actions
c. The rate by which the value of a clock drifts from the ideal time
d. The adjustment that needs be made to a clock so that its value achieves the average time
84. The difference in the time value of two Clocks is called _____________
a. Clock drift
b. Clock skew
c. Clock synchronization
d. Difference clock
85. Two clocks are said to be synchronized at a particular instance of time if the difference in time values of the two clocks is less than some specified constant. The difference in time values of two clocks is called ____________
a. Clock Frequency
b. Clock drift
c. Clock skew
d. Clock Ticks
86. Which of the following statements about physical clocks in distributed systems is false?
a. Algorithms can synchronize physical clocks externally or internally
b. Algorithms can provide perfect synchronization of physical clocks
c. Physical clocks need to be synchronized due to clock skew and clock drift
d. Physical clocks need to be synchronized every R time units, where R< δ / 2ρ , being δ the maximum allowed clock skew and ρ the clock drift
87. _____________ is a physical clock synchronization algorithm
a. Cristian
b. Vector
c. Lamport
d. Ring
88. Absolute time synchronization can be achieved using
a. vector time stamping method
b. Christian’s method
c. Lamport’s method
d. Ricart-Agrawala algorithm
89. _____________ algorithm requires clients to periodically synchronize with central time server.
a. Cristian’s algorithm
b. Berkeley algorithm
c. Lamport algorithm
d. Election algorithm
90. _____________ algorithm works fine with low latency algorithm.
a. Berkeley
b. Lamport’s
c. Vector
d. Cristian
91. Cristian’s Algorithm is ______________
a. Passive Time Server Algorithm
b. Active Time Server Algorithm
c. Both a and b
d. None of the above
92. In Cristian algorithm the time server is ______________
a. Passive
b. Active
c. Some internal passive some internal active
d. None of the above
93. In Cristian’s Algorithm, Accuracy of result ______________
a. ±(T(1)-T(0))/2+T(min)
b. ±(T(1)-T(0))/2-T(min)
c. ±(T(0)-T(1))/2-T(min)
d. None of the above
94. In Cristian’s Algorithm, T(new)=?
a. T(new)=T(server)+(T(1)+T(0)-I)/2
b. T(new)=T(server)-(T(1)-T(0)-I)/2
c. T(new)=T(server)+(T(1)-T(0)-I)/2
d. T(new)=T(server)-(T(1)+T(0)-I)/2
95. Which of the following statements about the Cristian’s Algorithm to synchronize physical clock is false?
a. Each client asks the time to the server at every resynchronization interval
b. Each client sets its time to TS + RTT , being TS the time within the message received from the server and RTT the round-trip time ( i.e. the elapsed time between the client’s request and the server’s response)
c. Accuracy of client’s clock is ±(RTT/2 – Min), being RTT the round-trip time and Min the minimum latency between the client and the server
d. The resynchronization interval must be lower than δ / 2ρ, being δ the maximum allowed clock skew and ρ the clock drift
96. A client’s clock reads 3:20:00. The server’s clock reads 3:10:00 when they synchronize using Cristian’s algorithm. Assume message delays are negligible. What is the time at the client after synchronization?
a. 03:20:00
b. 03:05:00
c. 03:15:00
d. 03:10:00
97. A client gets a timestamp of 4:12:30.500 from a time server. The elapsed time between the request and response was 20 msec (0.020 sec). The current time on the client is 4:12:30.510. Using Cristian’s algorithm, what is the time set to on the client?
a. 04:12:30.480
b. 04:12:30.490
c. 04:12:30.510
d. 04:12:30.520
98. Berkely’s and Christian’s clock synchronization methods are type of
a. Logical clock synchronization method
b. Physical clock synchronization method
c. Scalar clock synchronization method
d. Vector clock synchronization method
99. Barkely Algorithm is ______________
a. Passive Time Server Algorithm
b. Active Time Server Algorithm
c. Both a and b
d. None of the above
100. Which of the following algorithm uses active time daemon for clock Synchronization
a. Berkley’s Algorithm
b. Cristian’s Algorithm
c. Lamport’s Algorithm
d. Bully Algorithm
101. A client’s clock reads 3:20:00. The server’s clock reads 3:10:00 when they synchronize using the Berkeley algorithm. Assume message delays are negligible. What is the time at the client after synchronization?
a. 03:15:00
b. 04:15:00
c. 05:15:00
d. 06:15:00
102. Full form of NTP is:
a. Network Time Protocol
b. New time Protocol
c. New Timestamp Protocol
d. Network Timestamp Protocol
103. The network Time protocol (NTP) which is widely used for clock synchronization on the Internet uses the ___________ method. The design of NTP involves a ______________ of time servers.
a. Differential Delay, Binary tree
b. Offset delay estimation, Hierarchical tree
c. NTP time stamps, Quorum
d. Physical clock delay, hierarchical tree
104. You are synchronizing your clock from a time server using NTP and observe the following times: [4 points] a. timestamp at client when the message leaves the client: 6:22:15.100 b. timestamp at which the server receives the message: 7:05:10.700 c. timestamp at which the server sends the reply: 7:05:10.710 d. timestamp at client when the message is received at client: 6:22:15.250 To what value do you set the client’s clock?
a. 07:05:11
b. 08:05:11
c. 09:05:11
d. 10:05:11
105. Chandy-Lamport algorithm is for
a. To capture consistent global state of a distributed system
b. To synchronize the process sates
c. To mark the state in a sequence
d. To do the election in a distributed system
106. The chandy-Lamport global snapshot algorithm works correctly for channels
a. Non-FIFO
b. FIFO
c. Non-LIFO
d. LIFO
107. Lamport’s algorithm is used for __________synchronization
a. Deadlock
b. Physical Clock
c. Logical Clock
d. Election process
108. Which of the following is the Logical Clock Synchronization algorithm?
a. Berkley’s Algorithm
b. Cristian’s Algorithm
c. Lamport’s Algorithm
d. Bully Algorithm
109. What problem with Lamport clocks to vector clocks solve?
a. With Lamport clocks, you cannot tell whether two events are causally related or concurrent by looking at the timestamps. Just because L(a)<L(b) does not mean that a>b
b. Lamport clock resolve the problem in concurrency
c. Vector clock is more accurate in synchronization
d. All of the above
110. What is the advantage of a vector clock over Lamport’s logical clock?
a. Catch causality
b. avoid deadlock
c. avoid linear relationship
d. set nonlinear relationship
111. ___________defined a relation called happens-before
a. Berkeley
b. Lamport
c. Vector
d. Cristian
112. Which of the following statements is true?
a. happens before is a transitive relation
b. happens before is a symmetric relation
c. happens before is a reflexive relation
d. happens before is a complex relation
113. Which event is concurrent with the vector clock (2, 8, 4)?
a. (3, 9, 5)
b. (3, 8, 4)
c. (1, 7, 3)
d. (4, 8, 2)
114. In distributed systems, a logical clock is associated with __________.
a. Each instruction
b. Each process
c. Each register
d. None of the above
115. The difference between logical and physical clocks –
a. Logical clock measures the time of day and Physical clocks are used to mark relationships among events in a distributed system
b. Both are the same
c. Physical clock measures the time of day and Logical clocks are used to mark relationships among events in a distributed system
d. None of the above
116. In distributed system, each process has its own ______________
a. Local memory
b. Clock
c. Both local memory and clock
d. None of the above
117. Logical time provides a mechanism to define the causal order in which events occur at different processes. The ordering is
a. Two events occurring at the same process happens in the order in which they are observed by the process
b. If a message is sent from one process to another, the sending of the message happened before the receiving of the message
c. If e occurred before e’ and e’ occurred before e” then e occurred before e”
d. All the above
118. ___________ is a process that prevents multiple threads or processes from accessing shared resources at the same time.
a. critical section
b. deadlock
c. message passing
d. mutual exclusion
119. In __________ only one process at a time is allowed into its critical section, among all processes that have critical sections for the same resource.
a. Mutual Exclusion
b. Synchronization
c. Deadlock
d. Starvation
120. In mutual exclusion algorithm, number of messages per Critical Section invocation should be_________.
a. Minimized
b. Maximized
c. Remain same
d. monotonic
121. Distributed Mutual Exclusion Algorithm does not use
a. Coordinator process
b. Token
c. Logical clock for event ordering
d. Request and Reply messages
122. In which algorithm, one process is elected as the coordinator
a. Distributed mutual exclusion algorithm
b. Centralized mutual exclusion algorithm
c. Token ring algorithm
d. None of the above
123. Select the message which is not used in Centralized algorithm of Mutual Exclusion
a. Release
b. Request
c. Hello
d. Reply
124. A centralized mutual exclusion algorithm requires _______ messages per entry/exit
a. 1
b. 2
c. 3
d. 4
125. In mutual exclusion, processes requests to enter in
a. Network
b. Critical region
c. Storage space
d. Main memory
126. Which of the following is not basic requirements of Mutual Exclusion Algorithms
a. Safety property
b. Liveness property
c. Fairness
d. System throughput
127. In mutual exclusion, ‘no deadlock or starvation’ is guaranteed by the property of ___________.
a. Serialization
b. Liveness
c. Safety
d. Deadlock detection
128. If a process is executing in its critical section, ______________
a. Any other process can also execute in its critical section
b. No other process can execute in its critical section
c. One more process can execute in its critical section
d. None of the above
129. The section of a program that need exclusive access to shared resources is referred to as
a. Coordinator
b. Critical Section
c. Time Server
d. Mutual Area
130. A process can enter into its critical section _______________
a. Anytime
b. When it receives a reply message from its parent process
c. When it receives a reply message from all other processes in the system
d. None of the above
131. Each process should get fair chance to execute the critical region, defines which property of mutual exclusion?
a. Safety
b. Liveness
c. Fairness
d. Scheduling
132. Time interval from a request send to its critical region execution completed is called ______________.
a. System throughput
b. Message complexity
c. Synchronization delay
d. Response time
133. What are the characteristics of mutual exclusion using centralized approach?
a. One process as coordinator which handles all requests
b. It requires request, reply and release per critical section entry
c. The method is free from starvation
d. All of the above
134. Why is Lamports algorithm said to be fair?
a. Time is determined by logical clocks
b. Time is synchronized
c. Timestamp ordering is deployed
d. A request for Critical Section are executed in the order of their timestamps and time is determined by logical clocks.
135. The Lamport’s mutual exclusion algorithm requires ____________ messages per Critical Section invocation
a. (N – 1)
b. 3(N – 1)
c. 2(N – 1)
d. 5(N – 1)
136. Lamport algorithm requires __________ messages per Critical Section invocation and the synchronization delay in the algorithm is _________
a. 3(N-1), T
b. 3(N-1), 2T
c. 3(N), T-1
d. 3(N), 2(T-1)
137. In __________ critical section requests are executed in the increasing order of timestamps i.e. a request with smaller timestamp will be given permission to execute critical section first than a request with larger timestamp.
a. Cristian’s algorithm
b. Berkeley algorithm
c. Lamport algorithm
d. Election algorithm
138. Ricart-Agrawala Algorithm is
a. Election Algorithm
b. Clock synchronization Algorithm
c. Mutual Exclusion Algorithm
d. Event ordering
139. The Ricart & Agrawala distributed mutual exclusion algorithm is:
a. Less efficient and less fault tolerant than a centralized algorithm.
b. More efficient and more fault tolerant than a centralized algorithm.
c. More efficient but less fault tolerant than a centralized algorithm.
d. Less efficient but more fault tolerant than a centralized algorithm.
140. The Ricart Agrawala mutual exclusion algorithm requires ___________ messages per Critical Section invocation
a. (N – 1)
b. 3(N – 1)
c. 2(N – 1)
d. 5(N -1 )
141. For each critical section (CS) execution, Ricart-Agrawala algorithm requires ___________ messages per CS execution and the Synchronization delay in the algorithm is __________.
a. 3(N − 1), T
b. 2(N − 1), T
c. (N − 1), 2T
d. (N − 1), T
142. Maekawa’s algorithm is a ___________ mutual exclusion algorithm.
a. Token-based
b. Voting-based
c. Non-token based
d. Tree-based
143. Maekawa’s algorithm doesn’t require ______________ to handle deadlocks
a. FAILED message
b. INQUIRE message
c. PRIORITY message
d. YIELD message
144. The Mekawa mutual exclusion algorithm requires _______ messages per Critical Section invocation
a. 2N
b. 2 √N
c. 3N
d. 3 √N
145. For each critical section (CS) execution, maekawa’s algorithm requires ___________ messages per CS execution and the Synchronization delay in the algorithm is _________.
a. √N , T
b. 2√N , T
c. 3√N , T
d. 3√N , 2T
146. The maximum number of messages required per CS execution in Maekawa’s algorithm for deadlock handling is
a. 4√N
b. √N
c. 5√N
d. 2√N
147. Which algorithms are used to handle mutual exclusion in distributed systems?
a. Centralized
b. Distributed
c. Token ring
d. All of the above
148. Election Algorithm
a. Election Algorithm choose a process from group of processes to act as coordinator
b. Election algorithm assumes that every active process in the system has a unique priority number
c. A and b is correct
d. None of the above
149. In distributed systems, election algorithms assumes that ________________
a. A unique priority number is associated with each active process in system
b. There is no priority number associated with any process
c. Priority of the processes is not required
d. None of the above
150. Which algorithms are used for selecting a process to act as a coordinator?
i. Centralized algorithm
ii. Election algorithm
iii. Ring algorithm
iv. Chandy-Mishra-Haas algorithm
a. (ii) and (iv)
b. (ii), (iii) and (iv)
c. (ii) and (iii)
d. (ii)
151. Election message is always sent to the process with _______________
a. Lower numbers
b. Waiting processes
c. Higher numbers
d. Requesting lower number of resources
152. Suppose that two processes detect the demise of the coordinator simultaneously and both decide to hold an election using the bully algorithm. What happens?
a. Each of the higher-numbered processes will get two ELECTION messages, but will ignore the first one. The election will proceed as usual
b. Each of the lower-numbered processes will get two ELECTION messages, but will ignore the first one. The election will proceed as usual
c. Each of the lower-numbered processes will get two ELECTION messages, but will ignore the second one. The election will proceed as usual
d. Each of the higher-numbered processes will get two ELECTION messages, but will ignore the second one. The election will proceed as usual
153. Which of the following is an example of election algorithm?
a. Berkley algorithm
b. Bully algorithm
c. Cristian’s algorithm
d. Lamport’s algorithm
154. In case of failure, a new coordinator can be elected by _____________
a. Bully algorithm
b. Ring algorithm
c. Both bully and ring algorithm
d. None of the mentioned
155. In case of failure, a new coordinator can be elected by ____________
a. Cristian’s algorithm
b. Bully algorithm
c. Both bully and cristian’s algorithm
d. None of the mentioned
156. In the Bully algorithm, process which is elected as the coordinator is the one having
a. Highest process ID
b. Lowest process ID
c. Highest timestamp value
d. Lowest Timestamp value
157. ___________ algorithm for coordinator election assumes that no process can fail during the election procedure until the new coordinator has been selected.
a. Bully algorithm
b. Ring algorithm
c. Lamport algorithm
d. Suzuki Kasami algorithm
158. What is key idea to select coordinator in Bully Algorithm?
a. Select process with highest ID
b. Select process with lowest ID
c. Any process who identified that coordinator is failed
d. Random
159. A bully election algorithm:
a. picks the first process to respond to an election request.
b. relies on majority vote to pick the winning process.
c. assigns the role of coordinator to the process holding the token at the time of election.
d. picks the process with the largest ID.
160. According to the ring algorithm, links between processes are _____________.
a. Bidirectional
b. Unidirectional
c. Both bidirectional and unidirectional
d. None of the above
161. Which one is coordinator selection algorithm?
a. Ring Algorithm
b. Lamport’s Algorithm
c. NTP
d. Berkeley Algorithm
162. The ring election algorithm works by:
a. Having all nodes in a ring of processors send a message to a coordinator who will elect the leader.
b. Sending a token around a set of nodes. Whoever has the token is the coordinator.
c. Sending a message around all available nodes and choosing the first one on the resultant list.
d. Building a list of all live nodes and choosing the largest numbered node in the list.
163. Consider the following statements about termination detection (TD) algorithm
Statement 1: Execution of a termination detection algorithm cannot indefinitely delay the underlying computation
Statement 2: The termination detection algorithm required addition of new communication channels between processes
a. Statement 1 is true and statement 2 is false
b. Statement 1 is false and statement 2 is true
c. Both statements are false
d. Both statements are true
164. A state in which a process has finished its computation and will not restart any action unless it receives a message is called as
a. Partially terminated state
b. Terminating state
c. Globally terminated state
d. Locally terminated state
165. A problem with the ____________ protocol is that when the coordinator has crashed, participants may not be able to reach a final decision
a. three-phase commit
b. one-phase commit
c. two-phase commit
d. virtual synchrony