Deck 2: Distributed Systems and Resource Management

Question 1

------------------ all related objects moved and left to a server upon the first RPC

A)call by value
B)call by move
C)call by visit
D)call by reference

Answer 1

call by move

Question 2

What is the feature of stateful server?

A)longer server recovery time
B)quick recovery after reboot
C)file operations must be idempotent
D)simple server design

Answer 2

longer server recovery time

Question 3

------------------- 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

Answer 3

mutual exclusion

Question 4

Absolute time synchronization can be achieved using

A)vector time stamping method
B)christian's method
C)lamport's method
D)ricart-agrawala algorithm

Question 5

Which mutual exclusion algorithm is useful when the membership of the group is unknown?

A)centralized
B)lamport's.
C)token ring
D)decentralized algorithm

Question 6

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)

Question 7

A client gets a timestamp of 4:12:30.500 from atime server. The elapsed time between the requestand response was 20 msec (0.020 sec).The currenttime on the client is 4:12:30.510. Using Cristian'salgorithm, what is the time set to on theclient?

A)1970-01-01 04:12:30
B)1970-01-01 04:12:30.
C)1970-01-01 04:12:32
D)1970-01-01 04:12:32.

Question 8

NTP is-----------------layer protocol.

A)application
B)session
C)transport
D)physical

Question 9

Which of the following is an example of election algorithm.

A)berkley algorithm:
B)bully algorithm.
C)cristian's algorithm
D)lamport's

Question 10

For each critical section (CS) execution, Ricart-Agrawala algorithm requires  ----------------------  messages per CS execution and the Synchronization delay in thealgorithm is                          .

A)3(n ? 1), t
B)2(n ? 1), t
C)(n ? 1), 2t
D)(n ? 1), t

Question 11

For each critical section (CS) execution, maekawa's algorithm requires ----------------------messages per CS execution and the Synchronization delay in thealgorithm is                          .

A)?n , t
B)2?n , t
C)3?n , t
D)3?n , 2t

Question 12

RAYMOND'S TREE BASED ALGORITHM is an        

A)non- token based algorithm.
B)token based algorithm.
C)centralized based algorithm
D)physical clock synchronization algorithm.

Question 13

Suzuki-Kasami's Broadcast Algorithm is an

A)non- token based algorithm.
B)token based algorithm.
C)centralized based algorithm
D)physical clock synchronization algorithm.

Question 14

Full form of NTP is:

A)network time protocol
B)new time protocol
C)new timestamp protocol
D)network timestamp protocol

Question 15

Which algorithm requires "1 to ?" messages to enter and leave a critical region?

A)token ring algorithm
B)centralized algorithm
C)decentralized algorithm
D)distributed algorithm

Question 16

Pretransfering also known as

A)premigrating
B)precopying
C)prefiltering
D)postcopying

Question 17

change the state of thread from suspe

A)run()
B)yield()
C)destroy()
D)start()

Question 18

Distributed syatem consists of set of resour

A)printer
B)processor
C)cd
D)processes

Question 19

This is not feature of cooperative algorithm

A)complex
B)larger overhead
C)worst stability
D)better stability

Question 20

How is access to resources of various machines is done?

A)remote logging using ssh or telnet
B)zone are configured for automatic access
C)ftp is not used
D)ftp is used

Question 21

What are the characteristics of data migration?

A)transfer data by entire file or immediate portion required
B)transfer the computation rather than the data
C)execute an entire process or parts of it at different sites
D)execute an entire process or parts of it at same site

Question 22

What are the characteristics of computation migration?

A)transfer data by entire file or immediate portion required
B)transfer the computation rather than the data
C)execute an entire process or parts of it at different sites
D)execute an entire process or parts of it at same site

Question 23

What are the characteristics of process migr

A)transfer data by entire file or immediate portion required
B)transfer the computation rather than the data
C)execute an entire process or parts of it at different sites
D)execute an entire process or parts of it at same site

Question 24

When the process issues an I/O request

A)it is placed in an i/o queue
B)it is placed in a waiting queue
C)it is placed in the ready queue
D)it is placed in the job queue

Question 25

Absolute time ordering of all shared accesses matters in

A)sequential consistency
B)casual consistency
C)strict consistency
D)weak consistency