Distributed Computing System Set 5
On This Page
This set of Distributed Computing System DCS Multiple Choice Questions & Answers (MCQs) focuses on Distributed Computing System Set 5
Q1 | Which one of the following hides the location where in the network the file is stored?
- transparent distributed file system
- hidden distributed file system
- escaped distribution file system
- spy distributed file system
Q2 | In a distributed file system, when a file’s physical storage location changes ___________
- file name need to be changed
- file name need not to be changed
- file’s host name need to be changed
- file’s local name need to be changed
Q3 | In a distributed file system, _______ is mapping between logical and physical objects.
- client interfacing
- naming
- migration
- heterogeneity
Q4 | In a distributed file system, a file is uniquely identified by ___________
- host name
- local name
- the combination of host name and local name
- none of the mentioned
Q5 | There is no need to establish and terminate a connection through open and close operation in ___________
- stateless file service
- stateful file service
- both stateless and stateful file service
- none of the mentioned
Q6 | In distributed file system, file name does not reveal the file’s ___________
- local name
- physical storage location
- both local name and physical storage location
- none of the mentioned
Q7 | Which one of the following is a distributed file system?
- andrew file system
- network file system
- novel network
- all of the mentioned
Q8 | What are the characteristics of mutual exclusion using centralized approach?
- one processor as coordinator which handles all requests
- it requires request,reply and release per critical section entry
- the method is free from starvation
- all of the mentioned
Q9 | What are the advantages of token(with rings) passing approach?i) One processor as coordinator which handles all requestsii) No starvation if the ring is unidirectionaliii) There are many messages passed per section entered if few users want to get in sectioniv) One processor as coordinator which handles all requestsv) Only one message/entry if everyone wants to get in
- i
- ii and iii
- i, ii and iii
- i, ii and iv
Q10 | What are the characteristics of atomicity?
- all operations associated are executed to completion or none are performed
- one processor as coordinator which handles all requests
- when responses are received from all processes, then the process can enter its critical section
- use communication links
Q11 | What things are the transaction coordinator is responsible for?
- starting the execution of the transaction
- breaking transaction into a number of subtransactions
- coordinating the termination of the transaction
- all of the mentioned
Q12 | Which of the following advantages follows the single coordinator approach?
- simple implementation
- simple deadlock handling
- bottleneck
- all of the mentioned
Q13 | Which of the following disadvantages follows the single coordinator approach?
- bottleneck
- slow response
- deadlock
- one request per second
Q14 | What are the parts of a global unique identifier?
- local unique timestamp
- remote timestamp
- clock number
- all of the mentioned
Q15 | In distributed systems, a logical clock is associated with ______________
- each instruction
- each process
- each register
- none of the mentioned
Q16 | If timestamps of two events are same, then the events are ____________
- concurrent
- non-concurrent
- monotonic
- non-monotonic
Q17 | If a process is executing in its critical section ____________
- any other process can also execute in its critical section
- no other process can execute in its critical section
- one more process can execute in its critical section
- none of the mentioned
Q18 | A process can enter into its critical section ____________
- anytime
- when it receives a reply message from its parent process
- when it receives a reply message from all other processes in the system
- none of the mentioned
Q19 | For proper synchronization in distributed systems ____________
- prevention from the deadlock is must
- prevention from the starvation is must
- prevention from the deadlock & starvation is must
- none of the mentioned
Q20 | In the token passing approach of distributed systems, processes are organized in a ring structure ____________
- logically
- physically
- both logically and physically
- none of the mentioned
Q21 | In distributed systems, what will the transaction coordinator do?
- starts the execution of transaction
- breaks the transaction into number of sub transactions
- coordinates the termination of the transaction
- all of the mentioned
Q22 | In case of failure, a new transaction coordinator can be elected by ____________
- bully algorithm
- ring algorithm
- both bully and ring algorithm
- none of the mentioned
Q23 | In distributed systems, election algorithms assumes that ____________
- a unique priority number is associated with each active process in system
- there is no priority number associated with any process
- priority of the processes is not required
- none of the mentioned
Q24 | According to the ring algorithm, links between processes are ____________
- bidirectional
- unidirectional
- both bidirectional and unidirectional
- none of the mentioned
Q25 | What are the different ways distributed may suffer?
- failure of a link
- failure of a site
- loss of message
- all of the mentioned