1. What are the characteristics of the closely related system? i) Even watch, generally shared memory ii) communication goes through this common memory iii) multiprocessors iv) different watches a) i) i) i) i), ii and ii c) ii and iii d) i, iii and iv View Answer 7. What will the transaction coordinator do in distributed systems? (a) begins the execution of the transaction b) interrupts the transaction in number of sub-transactions c) coordinates the closing of the transaction (d) the entire “View Answer 9.” In distributed systems, electoral algorithms assume that `a` is not assigned to each active process in the b system) to each active process in the system b) a priority number associated with a process c) process priority is not required (a) none of the display responses mentioned 2. What are the characteristics of the closely related system? i) Different clocks ii) Use Communications iii) Even shows iv) Distributed systems a) i) i) i) and iv c) i, ii and iii d) ii, iii and iv View Answer 4. What are the characteristics of a fully distributed approach? i) When responses are received by all processes, the process can enter its critical section (ii) When the process completes its critical section, the process sends response messages to all of its delayed requirements. iii) It requires a request, response and release by critical section input iv) A processor as a coordinator that processes all requests a) i) i) i) and ii c) ii and iii d) iii) and iv Display Response 5. What are the benefits of tokens (with rings) passing approach? i) A processor as a coordinator that processes all queries ii) No hunger if the ring is one-way iii) There are many messages that have gone through section typing, if few users in section iv) A processor as a coordinator that processes all queries v) 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. Which of the following drawbacks follows the single coordinator`s approach? a) Bottlenecks b) Slow Response c) Deadlock d) One requirement per second View Answer 12. What are the two complementary Deadlock prevention programs that use time stamps? a) The Waiting and Injury Scheme b) The Waiting Scheme n-Watch c) The Waiting Scheme (d) The Wait and Wait Pattern View Response 6.