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

  1. Home

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

1. i

2. ii and iii

3. i, ii and iii

4. i, ii and iv

Posted Date:-2022-03-30 08:09:05

More MCQS Questions and answers

  1. If timestamps of two events are same, then the events are _______
  2. In case of failure, a new transaction coordinator can be elected by _______
  3. In distributed systems, what will the transaction coordinator do?
  4. In the token passing approach of distributed systems, processes are organized in a ring structure ________
  5. In which OSI layer encryption and decryption happens?
  6. ______ of the distributed file system are dispersed among various machines of distributed system.
  7. _______ is not possible in distributed file system.
  8. A process can enter into its critical section _______
  9. According to the ring algorithm, links between processes are ________
  10. For proper synchronization in distributed systems ______
  11. Header are ______ when data packet moves from upper to the lower layers?
  12. How is are collisions avoided in network?
  13. How many layers does the Internet model ISO consist of?
  14. If a process is executing in its critical section ______
  15. In a distributed file system, _______ is mapping between logical and physical objects.
  16. In a distributed file system, a file is uniquely identified by ______
  17. In a distributed file system, when a file’s physical storage location changes _______
  18. In distributed file system, file name does not reveal the file’s _____
  19. In distributed systems, a logical clock is associated with ______
  20. In distributed systems, election algorithms assumes that _______
  21. The file once created can not be changed is called _____
  22. There is no need to establish and terminate a connection through open and close operation in _______
  23. What are design issues in distributed system structure?
  24. What are routing strategies which is not used in distributed systems?
  25. What are sites in network topology compared?
  26. 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
  27. What are the characteristics of atomicity?
  28. 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
  29. What are the characteristics of mutual exclusion using centralized approach?
  30. What are the characteristics of Naming and Name resolution?
  31. What are the characteristics of tightly coupled system? i) Different clock ii) Use communication links iii) Same clock iv) Distributed systems
  32. What are the characteristics of tightly coupled system? i) Same clock, usually shared memory ii) Communication is via this shared memory iii) Multiprocessors iv) Different clock
  33. What are the connection strategies not used in distributed systems?
  34. What are the different ways distributed may suffer?
  35. What are the disadvantages of majority protocol?
  36. What are the important steps followed when recovery from failure happens?
  37. What are the parts of a global unique identifier?
  38. What are the parts of network structure?
  39. What is a common problem found in distributed system?
  40. What is a valid network topology?
  41. What things are the transaction coordinator is responsible for?
  42. Which are the two complementary deadlock-prevention schemes using timestamps?
  43. Which design features of a communication network are important?
  44. Which layer is responsible for The process-to-process delivery?
  45. Which layer is the layer closest to the transmission medium?
  46. Which layer lies between the transport layer and data link layer?
  47. Which of the following advantages follows the single coordinator approach?
  48. Which of the following disadvantages follows the single coordinator approach?
  49. Which one of the following hides the location where in the network the file is stored?
  50. Which one of the following is a distributed file system?
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!