Question 1

------------------- is a process that prevents multiple threads or processes from accessing shared resources at the same time.

Accepted Answer

A) critical section 
B) deadlock 
C) message passing 
D) mutual exclusion 
A) critical section 
B) deadlock 
C) message passing 
D) mutual exclusion D

Question 2

What is the feature of stateful server?

Accepted Answer

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

Question 3

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

Accepted Answer

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

Question 4

What are the characteristics of data migration?

Accepted Answer

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

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?

Accepted Answer

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

Suzuki-Kasami's Broadcast Algorithm is an

Accepted Answer

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

Question 7

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

Accepted Answer

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

Question 8

Absolute time ordering of all shared accesses matters in

Accepted Answer

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

Question 9

What are the characteristics of computation migration?

Accepted Answer

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

Full form of NTP is:

Accepted Answer

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

Question 11

How is access to resources of various machines is done?

Accepted Answer

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

Question 12

Distributed syatem consists of set of resour

Accepted Answer

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

Question 13

This is not feature of cooperative algorithm

Accepted Answer

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

Question 14

RAYMOND'S TREE BASED ALGORITHM is an

Accepted Answer

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

Question 15

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

Accepted Answer

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

Question 16

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

Accepted Answer

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

Question 17

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

Accepted Answer

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

Question 18

Pretransfering also known as

Accepted Answer

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

Question 19

When the process issues an I/O request

Accepted Answer

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

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

Accepted Answer

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

------------------- is a process that prevents multiple threads or processes from accessing shared resources at the same time.

What is the feature of stateful server?

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

What are the characteristics of data migration?

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?

Suzuki-Kasami's Broadcast Algorithm is an

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

Absolute time ordering of all shared accesses matters in

What are the characteristics of computation migration?

Full form of NTP is:

How is access to resources of various machines is done?

Distributed syatem consists of set of resour

This is not feature of cooperative algorithm

RAYMOND'S TREE BASED ALGORITHM is an

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

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

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

Pretransfering also known as

When the process issues an I/O request

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

Distributed Systems and Communication Protocols

Distributed Systems and File System

Distributed File System and Remote Procedure Calls

Distributed Systems and Synchronization

File System and Multimedia Management in Distributed Systems

Network Communication and Frameworks for Distributed Systems

Filters

Exam 2: Distributed Systems and Resource Management

------------------- is a process that prevents multiple threads or processes from accessing shared resources at the same time.

What is the feature of stateful server?

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

What are the characteristics of data migration?

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?

Suzuki-Kasami's Broadcast Algorithm is an

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

Absolute time ordering of all shared accesses matters in

What are the characteristics of computation migration?

Full form of NTP is:

How is access to resources of various machines is done?

Distributed syatem consists of set of resour

This is not feature of cooperative algorithm

RAYMOND'S TREE BASED ALGORITHM is an

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

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

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

Pretransfering also known as

When the process issues an I/O request

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

Distributed Systems and Communication Protocols

Distributed Systems and File System

Distributed File System and Remote Procedure Calls

Distributed Systems and Synchronization

File System and Multimedia Management in Distributed Systems

Network Communication and Frameworks for Distributed Systems

Filters