Deck 5: Distributed Systems and Synchronization

Question 1

Which one of the following hides the location where in the network the file is stored?

A)transparent distributed file system
B)hidden distributed file system
C)escaped distribution file system
D)spy distributed file system

Answer 1

transparent distributed file system

Question 2

In a distributed file system, when a file's physical storage location changes ___________

A)file name need to be changed
B)file name need not to be changed
C)file's host name need to be changed
D)file's local name need to be changed

Answer 2

file name need not to be changed

Question 3

In a distributed file system, _______ is mapping between logical and physical objects.

A)client interfacing
B)naming
C)migration
D)heterogeneity

Answer 3

naming

Question 4

In a distributed file system, a file is uniquely identified by ___________

A)host name
B)local name
C)the combination of host name and local name
D)none of the mentioned

Question 5

There is no need to establish and terminate a connection through open and close operation in ___________

A)stateless file service
B)stateful file service
C)both stateless and stateful file service
D)none of the mentioned

Question 6

In distributed file system, file name does not reveal the file's ___________

A)local name
B)physical storage location
C)both local name and physical storage location
D)none of the mentioned

Question 7

Which one of the following is a distributed file system?

A)andrew file system
B)network file system
C)novel network
D)all of the mentioned

Question 8

What are the characteristics of mutual exclusion using centralized approach?

A)one processor 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 mentioned

Question 9

What are the advantages of token(with rings) passing approach?
i. One processor as coordinator which handles all requests
ii. No starvation if the ring is unidirectional
iii. There are many messages passed per section entered if few users want to get in section
iv. One processor as coordinator which handles all requests
v. Only one message/entry if everyone wants to get in

A)i
B)ii and iii
C)i, ii and iii
D)i, ii and iv

Question 10

What are the characteristics of atomicity?

A)all operations associated are executed to completion or none are performed
B)one processor as coordinator which handles all requests
C)when responses are received from all processes, then the process can enter its critical section
D)use communication links

Question 11

What things are the transaction coordinator is responsible for?

A)starting the execution of the transaction
B)breaking transaction into a number of subtransactions
C)coordinating the termination of the transaction
D)all of the mentioned

Question 12

Which of the following advantages follows the single coordinator approach?

A)simple implementation
B)simple deadlock handling
C)bottleneck
D)all of the mentioned

Question 13

Which of the following disadvantages follows the single coordinator approach?

A)bottleneck
B)slow response
C)deadlock
D)one request per second

Question 14

What are the parts of a global unique identifier?

A)local unique timestamp
B)remote timestamp
C)clock number
D)all of the mentioned

Question 15

In distributed systems, a logical clock is associated with ______________

A)each instruction
B)each process
C)each register
D)none of the mentioned

Question 16

If timestamps of two events are same, then the events are ____________

A)concurrent
B)non-concurrent
C)monotonic
D)non-monotonic

Question 17

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 mentioned

Question 18

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 mentioned

Question 19

For proper synchronization in distributed systems ____________

A)prevention from the deadlock is must
B)prevention from the starvation is must
C)prevention from the deadlock & starvation is must
D)none of the mentioned

Question 20

In the token passing approach of distributed systems, processes are organized in a ring structure ____________

A)logically
B)physically
C)both logically and physically
D)none of the mentioned

Question 21

In distributed systems, what will the transaction coordinator do?

A)starts the execution of transaction
B)breaks the transaction into number of sub transactions
C)coordinates the termination of the transaction
D)all of the mentioned

Question 22

In case of failure, a new transaction coordinator can be elected by ____________

A)bully algorithm
B)ring algorithm
C)both bully and ring algorithm
D)none of the mentioned

Question 23

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 mentioned

Question 24

According to the ring algorithm, links between processes are ____________

A)bidirectional
B)unidirectional
C)both bidirectional and unidirectional
D)none of the mentioned

Question 25

What are the different ways distributed may suffer?

A)failure of a link
B)failure of a site
C)loss of message
D)all of the mentioned