Multiple choice questions and answers
Hope the answers(bold) are correct. If any of the answer is wrong, please comment. I will check and update.
1. Which is part of operating system
Hope the answers(bold) are correct. If any of the answer is wrong, please comment. I will check and update.
1. Which is part of operating system
a. Loader
b. Device drivers
c. Control card interpreter
d. All of the above
2. In agreement problem the following system model have been studied
a. Processors can directly communicate with other processors by message
passing
b. Receiver knows the identity of the sender
c. a and b
d. None of the above
3. If a -> b (a and b are events) then
a. There is no effect of a on b
b. Event a casually effect event
b
c. b will effect a
d. None of the above
4. In which algorithm a spanning tree is used to reduce number of
messages exchanged per critical section execution
a. Raymond’s tree based
algorithm
b. Maekawa’s algorithm
c. Ricart – Agrawala algorithm
d. None of the above
5. The goal of DFS is
a. Network transparency
b. High availability
c. a and b
d. None of the above
6. Agreed value is initialized by an arbitrary processor and all non
faulty processors have to agree on that value is known as
a. Byzantine agreement problem
b. Consensus problem
c. Diffusion computation based algorithms
d. Edge chasing algorithm
7. Diffusing computations based algorithms makes use of echo algorithms
to detect deadlocks.
a. True
b. False
8. a -> b, if a and b are events in the same process and
a. a occurred after b
b. a and b occurred at the same time
c. a occurred before b
d. None of the above
9. Synchronization delay in Maekawa’s algorithm
a. 3 message propagation delays
b. 2 message propagation delays
c. 1 message propagation delays
d. None of the above
10. Types of messages used by Ricart – Agrawala algorithm
a. Request
b. Reply
c. a and b
d. None of the above
11. In Ricart – Agrawala,
a. Mutual exclusion is guaranteed
b. Mutual exclusion is not there
c. Deadlock free
d. a and b
e. a and c
12. In a file caching, a copy of data stored at remote file server is
brought to the client’s machine when referenced by the client
a. True
b. False
13. Which OS are used for small machines like PDA’s
a. Distributed
b. Embedded
c. Multiuser
d. None of the above
14. The casual ordering of message was first proposed by Fidge and
Mattern
a. True
b. False
15. Agreement algorithm’s application
a. Atomic commit in DDBS
b. Fault tolerant clock synchronization
c. a and b
d. None of the above
16. In mutual exclusion algorithms
a. At any instant, only one
process can execute the critical section
b. At any instant, many processes can execute the critical section
c. a and b
d. None of the above.
17. Performance in Ricart – agrawala
a. Number of network messages; 2*(N-1)
b. Synchronization delays; One message propagation delay
c. a and b
d. None of the above
18. Distributed systems is a type of architecture driven OS
a. True
b. False
19. Distributed mutual exclusion uses the following approaches
a. Token based approach
b. Non token based approach
c. a and b
d. None of the above
20. Authenticated messages is also known as oral messages.
a. True
b. False
21. Every processor broadcasts its initial value to all other
processors. Initial values may be different for different processors
a. Byzantine agreement problem
b. Consensus problem
c. Diffusion computation based algorithms
d. Edge chasing algorithm
22. The first quorum based mutual exclusion algorithm was
a. Maekawa’s algorithm
b. Ricart-agrawala algorithm
c. a and b
d. None of the above
23. ___________ are dedicated to storing files and performing storage
and retrieval operations.
a. Client servers
b. File servers
c. Cache servers
d. None of the above
24. A ____________ is a graphical representation of a global state in
the history of a distributed computation.
a. Consistent Cut
b. Cut
c. Termination detection
d. None of the above
25. In soft real time system the job should be completed before its
deadline
a. True
b. False
No comments:
Post a Comment