50-100 distributed

Question 51 :When a process is splited into pieces, it is called as-

• Tasks
• Program
• Processors
• Routines

Question 52 :Which of the following algorithms is less sensitive to crashes.

• Centralized
• Decentralized
• Distributed
• Token ring

Question 53 :A middleware layer between the stub skeleton and transport.

• remote layer
• instruction layer
• reference layer
• remote reference layer

Question 54 :In ----- Any read on a data item x returns a value corresponding to the results of the most recent write on x

• Strict consistency
• Linear consistency
• Sequential consistency
• parallel consistency

Question 55 :In Singal's algorithm, the manner In which cardinality decreases, leads to a ___ pattern, topologically.

• mesh
• ring
• stepwise
• staircase

Question 56 :What are characteristics of Naming and Name resolution ?

• name systems in the network
• address messages with the process-id
• virtual circuit
• message switching

Question 57 :Distributed Mutual Exclusion Algorithm does not use

• Coordinator process
• Token
• Logical clock for event ordering
• Request and Reply messages

Question 58 :Maekawa's algorithm doesn’t require ____ to handle deadlocks

• FAILED message
• INQUIRE message
• PRIORITY message
• YIELD message

Question 59 :Which Distributed System Model deals with Communication?

• Security Model
• Fault Model
• Interaction Model
• Architecture Model

Question 60 :Processes do not communicate with each other and creates their own check points.

• User Triggered
• Uncoordinated check points
• Coordinated check points
• Message based check pointing.