Semester : 8thSem Subject : DOS

Quiz Bank

1. In distributed system each processor has its own

a) local memory
b) clock
c) both local memory and clock
d) none of the mentioned
2. If one site fails in distributed system
a) the remaining sites can continue operating
b) all the sites will stop working
c) directly connected sites will stop working
d) none of the mentioned
3. Network operating system runs on
a) server
b) every system in the network
c) both a & b
d) none of the mentioned
4. Which technique is based on compile-time program transformation for accessing
remote data in a distributed-memory parallel system.
a) cache coherence scheme
b) computation migration
c) remote procedure call
d) message passing
5. Logical extension of computation migration is
a) process migration
b) system migration
c) thread migration
d) data migration
6. Processes on the remote systems are identified by
a) host ID
b) host name and identifier
c) identifier
d) process ID
7. Which routing technique is used in distributed system?
 a) fixed routing
b) virtual routing
c) dynamic routing
d) all of the mentioned
8. In distributed systems, link and site failure is detected by
a) polling
b) handshaking
c) token passing
d) none of the mentioned
9. The capability of a system to adapt the increased service load is called
a) scalability
b) tolerance
c) capacity
d) none of the mentioned
10. Internet provides _______ for remote login.
a) telnet
b) http
c) ftp
d) RPC.
11. Transparency that enables multiple instances of resources to be used, is called
a)Replication transparency
b)Scaling transparency
c)Concurrency transparency
d)Performance transparency
12. A paradigm of multiple autonomous computers, having a private memory,
communicating through a computer network, is known as
a)Distributed computing
b)Cloud computing
c)Centralized computing
d)Parallel computing
13. Type of architecture that is considered responsible for success of
a)Two-tier architecture
b)Three-tier architecture
c)n-tier architecture
d)Peer-to-Peer architecture
14. A global system of interconnected computer networks is known as
a)Ethernet
b)Intranet
c)Internet
d)Ultra-net
15. RPC connectors and message queues are mechanisms for
a)Message retrieving
b)Message passing
c)Message delivering
 d)Message Sync-ing
16. Parallel computing is also known as
a)Parallel computation
b)Parallel processing
c)Parallel distribution
d)Parallel development
17. To enforce ………………….. two functions are provided enter-critical and exit-critical,
where each function takes as an argument the name of the resource that is the subject of
competition.
a) Mutual Exclusion
b) Synchronization
c) Deadlock
d) Starvation
18. In ………………. only one process at a time is allowed into its critical section, among all
processes that have critical sections for the same resource.
a) Mutual Exclusion
b) Synchronization
c) Deadlock
d) Starvation
19. In distributed systems, a logical clock is associated with ______________
a) each instruction
b) each process
c) each register
d) none of the mentioned
20. What is common problem found in distributed system ?
a) Process Synchronization
b) Communication synchronization
c) Deadlock problem
d) Power failure
21. If timestamps of two events are same, then the events are ___________________
a) concurrent
b) non-concurrent
c) monotonic
d) non-monotonic
22. For proper synchronization in distributed systems ____________
a) prevention from the deadlock is must
b) prevention from the starvation is must
c) prevention from the deadlock & starvation is must
d) none of the mentioned
23. In the token passing approach of distributed systems, processes are organized in a ring
structure _______________
a) logically
b) physically
c) both logically and physically
d) none of the mentioned
24. In distributed systems, election algorithms assumes that __________________
 a) a unique priority number is associated with each active process in system
b) there is no priority number associated with any process
c) priority of the processes is not required
d) none of the mentioned
25. 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
a) I
b) I and III
c) III and IV
d) I and II
26. Which are the two complementary deadlock-prevention schemes using time stamps ?
a) The wait-die & wound-wait scheme
b) The wait-n-watch scheme
c) The wound-wait scheme
d) The wait-wound & wound-wait scheme
27. Election message is always sent to the process with _______
a) Lower numbers
b) Waiting processes
c) Higher numbers
d) Requesting Lower number of resources
28. Which algorithms are used to handle mutual exclusion in distributed systems?
a) Centralized
b) Distributed
c) Token ring
d) All of the mentioned
29. Which algorithms are used for selecting a process to act as coordinator or sequencer?
I. Centralized algorithm II. Election algorithm III. Ring algorithm IV. Chandy-Misra-
Haas algorithm
a) II and IV
b) II, III, IV
c) II and III
d) II
30. What are characteristics of distributed file system ?
a) Its users, servers and storage devices are dispersed
b) Service activity is not carried out across the network
c) They have single centralized data repository
d) There are multiple dependent storage devices
31. What are not the characteristics of a DFS ?
a) login transparency and access transparency
b) Files need not contain information about their physical location
c) No Multiplicity of users
d) No Multiplicity if files
32. What are not the characteristics of a DFS ?
(a) login transparency and access transparency
(b) Files need not contain information about their physical location
(c) No Multiplicity of users
 d) No Multiplicity if files
33. What are the advantages of file replication ?
a) Improves availability &performance
b) Decreases performance
c) They are consistent
d) Improves speed
34. The implementation of caching and replication DOES NOT lead to consistency
problems.
a) TRUE
b) FALSE
c) May be
d) Can't say
35. What is coherency of replicated data ?
a) All replicas are identical at all times
b) Replicas are perceived as identical only at some points in time
c) Users always read the most recent data in the replicas
d) All of the mentioned
36. The file once created can not be changed is called ________
a) immutable file
b) mutex file
c) mutable file
d) none of the mentioned
37. ______ of the distributed file system are dispersed among various machines of
distributed system.
a) Clients
b) Servers
c) Storage devices
d) All of the mentioned
38. _______ is not possible in distributed file system
a) File replication
b) Migration
c) Client interface
d) Remote access
39. In distributed file system, a file is uniquely identified by _________________
a) host name
b) local name
c) the combination of host name and local name
d) none of the mentioned
40. In distributed file system, file name does not reveal the file’s ____________
a) local name
b) physical storage location
c) both local name and physical storage location
d) none of the mentioned
41. Which one of the following is a distributed file system?
a) andrew file system
b) network file system
c) novel network
d) all of the mentioned
42. The capability of a system to adapt the increased service load is called ___________
a) scalability
 b) tolerance
c) capacity
d) none of the mentioned
43. Which technique is based on compile-time program transformation for accessing
remote data in a distributed-memory parallel system?
a) cache coherence scheme
b) computation migration
c) remote procedure call
d) message passing
44. Logical extension of computation migration is ___________
a) process migration
b) system migration
c) thread migration
d) data migration
45. In .................... messages are not send directly from sender to receiver but rather are
sent to a shared data structure consisting queues that can temporarily hold messages.
a) direct addressing
b) indirect addressing
c) one-to-one-addressing
d) one-to-many addressing
46. Invoking periodically to test for deadlock is one of the way for deadlock ....................
a) Prevention
b) Avoidance
c) Detection
d) Deletion
47. .......... is the ability of a system to continue functioning in the event of partial system
failure.
a) fault avoidance
b) fault tolerance
c) fault detection
d)fault recovery
48. ........................ cannot be done arbitrary and especially when data resources are
involved, must be supported by a rollback recovery mechanism.
a) Mutual Exclusion
b) Hold and Wait
c) Preemption
d) Circular Wait
49. What are the different ways distributed may suffer?
a) Failure of a link
b) Failure of a site
c) Loss of message
d) All of the mentioned
50. What are the important steps followed when recovery from failure happens?
a) Post repairing integration with main system should happen smoothly and
 gracefully
b) Upon link failure both parties at end must not be notified
c) Fault recovery system must me adjusted
d) Failures are logged systematically
51. Having data belonging to two independent processes in the same page is
called____________.
(A) Buffering
(B) Blocking
(C) Message-passing
(D) False sharing

Prepared By –Ms. Reena Thakur