Q. In distributed file system, when a file’s physical storage location changes

View solution

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

View solution

Q. In distributed file system, a file is uniquely identified by

View solution

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

View solution

Q. In distributed file system, file name does not reveal the file’s

View solution

Q. Which one of the following is a distributed file system?

View solution

Q. In distributed systems, a logical clock is associated with

View solution

Q. If timestamps of two events are same, then the events are

View solution

Q. If a process is executing in its critical section

View solution

Q. A process can enter into its critical section

View solution

Q. For proper synchronization in distributed systems

View solution

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

View solution

Q. In distributed systems, transaction coordinator

View solution

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

View solution

Q. In distributed systems, election algorithms assumes that

View solution

Q. According to the ring algorithm, links between processes are

View solution

Q. What are the characteristics of tightly coupled system ?

i) Different clock
ii) Use communication links
iii) Same clock
iv) Distributed systems

View solution

Q. What are the characteristics of mutual exclusion using centralized approach ?

View solution

Q. What are the characteristics of fully distributed approach ?

i) When responses are received from all processes, then process can enter its Critical Section
ii) When process exits its critical section, the process sends reply messages to all its deferred requests.
iii) It requires request,reply and release per critical section entry
iv) One processor as coordinator which handles all requests

View solution

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

View solution