1-50 distributed

Question 1 :Which of the following is an example of election algorithm.

• Berkley Algorithm:
• Bully Algorithm.
• Cristian’s Algorithm
• LAMPORT’S

Question 2 :In case of failure, a new transaction coordinator can be elected by _____

• Cristian's Algorithm
• Bully algorithm
• Both bully and Cristian's algorithm
• Lamport Algorithm

Question 3 :In the client - server system having memory with disk , the file can be stored in _____________location .

• On any machine in network
• Sever's main memory
• On cloud
• On Storage area network

Question 5 :The directory can be viewed as a _________ that translates file names into their directory entries.

• symbol table
• partition
• swap space
• cache

Question 6 :Middleware communication protocols support -

• High-level communication services
• Multi-level Communication Services
• Remote Procedure Call
• Interprocess communication

Question 7 :Machine that places the request to access the data is generally called as __________.

• Server Machine
• Client Machine
• Request Machine
• Database server

Question 8 :Cristian’s Algorithm is _____

• Passive Time Server Algorithm
• Active Time Server Algorithm
• both (a) and (b)
• None of the mentioned

Question 9 :Which of the following properties hold true for quorums in a cotorie

• Intersection property and Union property
• Intersection property and Minimality property
• Minimality property and Union property
• Intersection property and Monotonicity property

Question 10 :Characteristics of threads are ______.

• Parallelism, blocking system calls
• No parallelism, blocking system calls
• Parallelism, non blocking system calls
• No parallelism, non blocking system calls

Question 11 :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

• I
• I and III
• III and IV
• I and II