Semester: 8 Sem Subject: DOS Quiz Bank

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
3. Network operating system runs on
a) server
b) every system in the network
c) both a & b
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
9. The capability of a system to adapt the increased service load is called
a) scalability
b) tolerance
c) capacity
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
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
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
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
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
36. The file once created can not be changed is called ________
a) immutable file
b) mutex file
c) mutable file
37. ______ of the distributed file system are dispersed among various machines of
distributed system.
a) Clients
b) Servers
c) Storage devices
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
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
41. Which one of the following is a distributed file system?
a) andrew file system
b) network file system
c) novel network
42. The capability of a system to adapt the increased service load is called ___________
a) scalability
b) tolerance
c) capacity
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
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

Online Re-Sessional 1 Examination
Semester : 8th Sem Subject: DOS
Sr. Question Options Correct Answer

No.
1. Network operating system (A) every system in the (B) server
runs on ___________ network
(B) server
(C) both server and every
system in the network
(D) none of the mentioned
2. The transparency that enables (A) Performance (D) Replication
multiple instances of transparency transparency
resources to be used, is called (B) Scaling transparency
____________ (C) Concurrency
transparency
(D) Replication transparency
3. In distributed system, each (A) local memory (C) both local
processor has its own (B) clock memory and clock
___________ (C) both local memory and
clock
4. If one site fails in distributed (A) the remaining sites can (A) the remaining
system then ___________ continue operating (B) all the sites can continue
sites will stop working operating
(C) directly connected sites
will stop working (D) none
of the mentioned
5. Transparency that enables (A)Replication transparency (A)Replication
multiple instances of (B)Scaling transparency transparency
resources to be used, is called (C)Concurrency transparency
(D)Performance transparency
6. A paradigm of multiple (A)Distributed computing (A)Distributed
autonomous computers, (B)Cloud computing computing
having a private memory, (C)Centralized computing
communicating through a (D)Parallel computing
computer network, is known
as
7. Type of architecture that is (A)Two-tier architecture (C)n-tier
considered responsible for (B)Three-tier architecture architecture
success of (C)n-tier architecture
(D)Peer-to-Peer architecture
8. A global system of (A)Ethernet (B)Intranet (C)Internet
interconnected computer (C)Internet (D)Ultra-net
networks is known as
9. All the resources are tightly (A) Cloud computing (D) Centralized
coupled in the computing (B) Parallel computing computing
paradigm of __________ (C) Distributed computing
(D) Centralized computing
10. Which amongst the following (A) Resource sharing (C) Reliability
is not an advantage of (B) Incremental growth
Distributed systems? (C) Reliability
(D) None of the above
11. Which of the following will (A) tightly-coupled software (A) tightly-coupled
be true distributed system ? on loosely-coupled hardware software on loosely-
(B) loosely-coupled software coupled hardware
on tightly-coupled hardware
(C) tightly-coupled software
on tightly-coupled hardware
(D) loosely-coupled software
on loosely-coupled hardware
12. Distributed systems should ? (A) high security (B) have better
(B) have better resource resource sharing
sharing
(C) better system utilization
(D) low system overhead
13. Distributed OS works on the (A) File Foundation (C) Single system
________ principle. (B) Multi system image image
(C) Single system image
D) Networking image
14. Distributed systems have (A) high security (B) better resource
__________ (B) better resource sharing sharing
(C) better system utilization
(D) low system overhead
15. In distributed file system, (A) file name need to be (B) file name need
when a file’s physical storage changed not to be changed
location changes (B) file name need not to be
________________ changed
(C) file’s host name need to
be changed
(D) file’s local name need to
be changed
16. In distributed systems, a (A) each instruction (B) each process
logical clock is associated (B) each process
with ______________ (C) each register
17. If timestamps of two events (A) concurrent (A) concurrent
are same, then the events are (B) non-concurrent
____________ (C) monotonic
(D) non-monotonic
18. If a process is executing in its (A) any other process can (B) no other process
critical section also execute in its critical can execute in its
____________ section critical section
(B) no other process can
execute in its critical section
(C) one more process can
execute in its critical section
19. A process can enter into its (A) anytime (C) when it receives
critical section (B) when it receives a reply a reply message
____________ message from its parent from all other
process processes in the
(C) when it receives a reply system
message from all other
processes in the system
20. For proper synchronization in (A) prevention from the (C) prevention from
distributed systems deadlock is must the deadlock &
____________ (B) prevention from the starvation is must
starvation is must
(C) prevention from the
deadlock & starvation is must
21. In the token passing approach (A) logically (A) logically
of distributed systems, (B) physically
processes are organized in a (C) both logically and
ring structure ____________ physically
22. In distributed systems, what (A) starts the execution of (D) all of the
will the transaction transaction mentioned
coordinator do? (B) breaks the transaction
into number of sub
transactions
(C) coordinates the
termination of the transaction
(D) all of the mentioned
23. In case of failure, a new (A) bully algorithm (C) both bully and
transaction coordinator can be (B) ring algorithm ring algorithm
elected by ____________ (C) both bully and ring
algorithm
24. In distributed systems, (A) a unique priority number (A) a unique
election algorithms assumes is associated with each active priority number is
that ____________ process in system associated with
(B) there is no priority each active process
number associated with any in system
process
(C) priority of the processes
is not required
25. According to the ring (A) bidirectional (B) unidirectional
algorithm, links between (B) unidirectional
processes are ____________ (C) both bidirectional and
unidirectional
26. Which of the following (A) mutual exclusion (D) all of the
condition is required for a (B) a process may hold mentioned
deadlock to be possible? allocated resources while
awaiting assignment of other
resources
(C) no resource can be
forcibly removed from a
process holding it
27. Which one of the following is (A) banker’s algorithm (A) banker’s
the deadlock avoidance (B) round-robin algorithm algorithm
algorithm? (C) elevator algorithm
(D) karn’s algorithm
28. A problem encountered in (A) deadlock (B) starvation
multitasking when a process (B) starvation
is perpetually denied (C) inversion
necessary resources is called (D) aging
____________
29. To avoid deadlock (A) there must be a fixed (A) there must be a
____________ number of resources to fixed number of
allocate resources to allocate
(B) resource allocation must
be done only once
(C) all deadlocked processes
must be aborted
(D) inversion technique can
be used
30. To enforce (A) Mutual Exclusion (A) Mutual
………………….. two (B) Synchronization Exclusion
functions are provided enter- (C) Deadlock
critical and exit-critical, (D) Starvation
where each function takes as
an argument the name of the
resource that is the subject of
competition.
31. In ………………. only one (A) Mutual Exclusion (B) Synchronization
process at a time is allowed (B) Synchronization
into its critical section, among (C) Deadlock
all processes that have critical (D) Starvation
sections for the same
resource.
32. Which algorithms are used to (A) Centralized (D) All of the
handle mutual exclusion in (B) Distributed mentioned
distributed systems? (C) Token ring
(D) All of the mentioned
33. ........................ cannot be a) Mutual Exclusion c) Preemption
done arbitrary and especially b) Hold and Wait
when data resources are c) Preemption
involved, must be supported d) Circular Wait
by a rollback recovery
mechanism.
34. What are the different ways (A) Failure of a link (D) All of the
distributed may suffer? (B) Failure of a site mentioned
(C) Loss of message
35. Invoking periodically to test a) Prevention c) Detection
for deadlock is one of the b) Avoidance
way for deadlock c) Detection
.................... d) Deletion
36. ………………. is a closed (A) Mutual Exclusion (D) Circular Wait
chain of processes exists, (B) Hold and Wait
such that each process holds (C) Preemption
at least one resource needed (D) Circular Wait
by the next process in the
chain.
37. In order to ……………….. (A) Prevent (B) Avoid
the deadlock do not grant an (B) Avoid
incremental resource request (C) Detect
to a process if this allocation (D) Delete
might lead to deadlock.
38. The Coda distributed file (A) Tokens for file locking. (A) Tokens for file
system does not support: (B) Disconnected clients. locking.
(C) Replicated servers.
(D) Session semantics.
39. The ring election algorithm (A) Having all nodes in a ring (D) Building a list
works by: of processors send a message of all live nodes and
to a coordinator who will choosing the largest
elect the leader. numbered node in
(B) Sending a token around a the list.
set of nodes. Whoever has the
token is the coordinator.
(C) Sending a message
around all available nodes
and choosing the first one on
the resultant list.
(D) Building a list of all live
nodes and choosing the
largest numbered node in the
list.
40. Which event is concurrent (A) (3, 9, 5) (B) (3, 8, 4) (C) (D) (4, 8, 2)
with the vector clock (2, 8, (1, 7, 3) (D) (4, 8, 2)
4)?
41. The Ricart & Agrawala (A) More efficient and more (D) Less efficient
distributed mutual exclusion fault tolerant than a and less fault
algorithm is: centralized algorithm. tolerant than a
(B) More efficient but less centralized
fault tolerant than a
centralized algorithm.
(C) Less efficient but more
centralized algorithm.
(D) Less efficient and less
centralized
42. Event a has a Lamport (A) Events a and b are (D) If events a and
timestamp of 4.Event b has a causally related. b are causally
Lamport timestamp of (B) Events a and b are related, then event a
8.What can we tell about concurrent. happened before
events a and b ? (C) Event a happened before event b.
event b.
(D) If events a and b are
causally related, then event a
happened before event b.
43. Which event is concurrent (A) (3, 5, 7) (B) (1, 3, 5) (C) (D) (1, 4, 7)
with the vectortimestamp (2, (1, 4, 6) (D) (1, 4, 7)
4, 6) ?
44. A bully election algorithm: (A) picks the first process to (D) picks the
respond to an election process with the
request. largest ID.
(B) relies on majority vote to
pick the winning process.
(C) assigns the role of
coordinator to the processs
holding the token at the time
of election
(D) picks the process with the
largest ID.
(C) Loss of message
46. Which mutual exclusion (A) Centralized. (A) Centralized.
algorithm works when the (B) Ricart-Agrawala.
membership of the group is (C) Lamport.
unknown? (D) Token Ring.
47. Which set of events is (A) (3, 1, 5, 7), (3, 2, 6, 7), (2, (B) (2, 1, 3, 4), (2,
concurrent (all events are 1, 6, 8) 2, 3, 3), (3, 3, 2, 5)
concurrent with each other)? (B) (2, 1, 3, 4), (2, 2, 3, 3), (3,
3, 2, 5)
(C) (1, 2, 3, 4), (2, 3, 4, 5), (3,
4, 5, 6)
(D) (1, 5, 6, 7), (1, 4, 5, 7), (1,
3, 2, 2)
48. Election message is always (A) Lower numbers (C) Higher numbers
sent to the process with (B) Waiting processes
_______ (C) Higher numbers
(D) Requesting Lower
number of resources
49. Which are the two (A) The wait-die & wound- (A) The wait-die &
complementary deadlock- wait scheme wound-wait scheme
prevention schemes using (B) The wait-n-watch scheme
time stamps ? (C) The wound-wait scheme
(D) The wait-wound &
wound-wait scheme
50. In distributed systems, (A) a unique priority number (A) a unique
election algorithms assumes is associated with each active priority number is
that __________________ process in system associated with
(B) there is no priority each active process
number associated with any in system
process
(C) priority of the processes
is not required
Online Re-Sessional 2 Examination
Semester : 8th Sem Subject: DOS
Sr. Question Options Correct Answer

No.
1. The file once created can not (A) immutable file (A) immutable file
be changed is called (B) mutex file
___________ (C) mutable file
2. ______ of the distributed file (A) Clients (D) All of the
system are dispersed among (B) Servers mentioned
various machines of (C) Storage devices
distributed system. (D) All of the mentioned
3. _______ is not possible in (A) File replication (B) Migration
distributed file system. (B) Migration
(C) Client interface
(D) Remote access
4. Which one of the following (A) transparent distributed (A) transparent
hides the location where in file system distributed file
the network the file is stored? (B) hidden distributed file system
system
(C) escaped distribution file
system
(D) spy distributed file
system
5. In a distributed file system, (A) file name need to be (B) file name need
when a file’s physical storage changed not to be changed
location changes ________ (B) file name need not to be
changed
(C) file’s host name need to
be changed
(D) file’s local name need to
be changed
6. In a distributed file system, (A) client interfacing (B) naming
_______ is mapping between (B) naming
logical and physical objects. (C) migration
(D) heterogeneity
7. In a distributed file system, a (A) host name (C) the combination
file is uniquely identified by (B) local name of host name and
_________ (C) the combination of host local name
name and local name
8. There is no need to establish (A) stateless file service (A) stateless file
and terminate a connection (B) stateful file service service
through open and close (C) both stateless and stateful
operation in ___________ file service
9. In distributed file system, file (A) local name (B) physical storage
name does not reveal the (B) physical storage location location
file’s ___________ (C) both local name and
physical storage location
10. Which one of the following is (A) andrew file system (D) all of the
a distributed file system? (B) network file system mentioned
(C) novel network
11. What are not the (A) login transparency and (C) No Multiplicity
characteristics of a DFS? access transparency of users
(B) Files need not contain
information about their
physical location
(C) No Multiplicity of users
(D) No Multiplicity if files
12. What are characteristic of a (A) Fault tolerance (D) Upgradation
DFS? (B) Scalability
(C) Heterogeneity of the
system
(D) Upgradation
(C) Loss of message
14. What are design issues in (A) Scalability (D) All of the
distributed system structure? (B) Fault-tolerance mentioned
(C) Clustering
15. What are the important steps (A) Post repairing integration (A) Post repairing
followed when recovery from with main system should integration with
failure happens? happen smoothly and main system should
gracefully happen smoothly
(B) Upon link failure both and gracefully
parties at end must not be
notified
(C) Fault recovery system
must me adjusted
(D) Failures are logged
systematically
16. __________ marks the end of (A) COMMIT (A) COMMIT
a successful implicit or TRANSACTION TRANSACTION
explicit transaction. (B) ROLLBACK
TRANSACTION
(C) COMMIT WORK
17. ____________ rolls back a (A ROLLBACK (B) ROLLBACK
user-specified transaction to (B) ROLLBACK WORK WORK
the beginning of the (C) SAVE TRANSACTION
transaction. (D) COMMIT
18. _________ permissions (A) ROLLBACK WORK (A) ROLLBACK
default to any valid user. (B) ROLLBACK WORK
(C) COMMIT
(D) None of the mentioned
19. Processes on the remote (A) host ID (B) host name and
systems are identified by (B) host name and identifier identifier
(C) identifier
(D) process ID
20. In distributed systems, link (A) polling (B) handshaking
and site failure is detected by (B) handshaking
(C) token passing
21. RPC connectors and message (A)Message retrieving (B)Message passing
queues are mechanisms for (B)Message passing
(C)Message delivering
(D)Message Syncing
22. Parallel computing is also (A)Parallel computation (B)Parallel
known as (B)Parallel processing processing
(C)Parallel distribution
(D)Parallel development
23. In distributed systems, a (A) each instruction (B) each process
logical clock is associated (B) each process
with ______________ (C) each register
24. For proper synchronization in (A) prevention from the (C) prevention from
distributed systems deadlock is must the deadlock &
____________ (B) prevention from the starvation is must
starvation is must
(C) prevention from the
deadlock & starvation is must
25. What are characteristics of (A) Its users, servers and (A) Its users,
distributed file system ? storage devices are dispersed servers and storage
(B) Service activity is not devices are
carried out across the network dispersed
(C) They have single
centralized data repository
(D) There are multiple
dependent storage devices
26. What are not the (A) login transparency and (A) login
characteristics of a DFS ? access transparency transparency and
(B) Files need not contain access transparency
information about their
physical location
(C) No Multiplicity of users
(D) No Multiplicity if files
27. What are the advantages of (A) Improves availability (A) Improves
file replication ? &performance availability
(B) Decreases performance &performance
(C) They are consistent
(D) Improves speed
28. The implementation of (A) TRUE (B) FALSE
caching and replication (B) FALSE
DOES NOT lead to (C) May be
consistency problems. (D) Can't say
29. What is coherency of (A) All replicas are identical (D) All of the
replicated data ? at all times mentioned
(B) Replicas are perceived as
identical only at some points
in time
(C) Users always read the
most recent data in the
replicas
30. ______ of the distributed file (A) Clients(B) Servers(C) (D) All of the
system are dispersed among Storage devices(D) All of the mentioned
various machines of mentioned
distributed system.
31. _______ is not possible in (A) File replication (B) Migration
distributed file system (B) Migration
(C) Client interface
(D) Remote access
32. In distributed file system, a (A) host name (C) the combination
file is uniquely identified by (B) local name of host name and
_________________ (C) the combination of host local name
name and local name
33. In distributed file system, file (A) local name (B) physical storage
name does not reveal the (B) physical storage location location
file’s ____________ (C) both local name and
physical storage location
34. Which one of the following is (A) andrew file system (D) all of the
a distributed file system? (B) network file system mentioned
(C) novel network
35. What is the advantage of (A) Reduced network traffic (A) Reduced
caching in remote file access by retaining recently accessed network traffic by
? disk blocks retaining recently
(B) Faster network access accessed disk
(C) Copies of data creates blocks
backup automatically
36. The file once created cannot (A) Immutable file (A) Immutable file
be changed is called (B) Mutex file
(C) Mutable file
37. What are the characteristics (A) Suitable for applications (B) The users of
of transaction semantics ? that are concerned about this model are
coherence of data interested in the
(B) The users of this model atomicity property
are interested in the atomicity for their transaction
property for their transaction
(C) Easy to implement in a
single processor system
(D) Write-back enhances
access performance
38. In the case of____________ , (A) session semantics (A) session
changes to an open file are (B) immutable files semantics
only locally visible. (C) atomic transactions
39. The meaning of INVALID (A) Memory is incorrect; no (C) This cache
state means____ other cache holds the block. block does not
(B) Memory is up-to-date; the contain valid data
block may be in other caches
(C) This cache block does not
contain valid data
40. The Coda distributed file (A) Tokens for file locking. (A) Tokens for file
system does not support: (B) Disconnected clients. locking.
(C) Replicated servers.
(D) Session semantics.
41. IP multicast uses (A) Unreliable multicast. (A) Unreliable
(B) Reliable multicast. multicast.
(C) Atomic multicast.
(D) User-selectable
reliability.
42. False sharing in a distributed (A) Unrelated data is shared (A) Unrelated data
shared memory system arises between multiple systems but is shared between
because resides on the same memory multiple systems
page. but resides on the
(B) One distribute memory same memory page.
page is mapped onto two or
more systems at the same
time.
(C) Two or more distributed
memory pages are mapped
onto the same system.
(D) Bad message ordering
makes it appear that data is
shared when, in reality, it is
not.
43. A distributed directory in a (A) Ensures cache coherence (D) Distributes the
distributed shared memory in a sequentially coherent load of looking up
system memory system. page owners.
(B) Allows concurrent
queries and updates to a
memory page.
(C) Is necessary for systems
that employ caching.
(D) Distributes the load of
looking up page owners.
44. The ring election algorithm (A) Having all nodes in a ring (D) Building a list
works by of processors send a message of all live nodes and
to a coordinator who will choosing the largest
elect the leader. first one on the
(B) Sending a token around a resultant list.
set of nodes. Whoever has the
token is the coordinator.
(C) Sending a message
around all available nodes
and choosing the first one on
the resultant list.
(D) Building a list of all live
nodes and choosing the
largest first one on the
resultant list.
45. Which offers the most fault- (A) Atomic multicast. (A) Atomic
tolerant message delivery? (B) Totally ordered reliable multicast.
multicast.
(C) Causally ordered reliable
multicast.
(D) Hardware multicast.
46. False sharing in a DSM (A) an unwanted page being (B) unrelated data
system refers to cached on another system being resident on
(B) unrelated data being the same page.
resident on the same page.
(C) invalid data in the
directory, leading the system
to falsely believe the page is
shared.
(D) two versions of the same
page being present on one
system
47. _________ is a DSM system (A) RPC (C) Munin
that is fundamentally based (B) IPC
on software objects, but (C) Munin
which can place each object (D) None of the mentioned
on a separate page so the
hardware MMU can be used
for detecting accesses to
shard objects
48. The straight-forward model (A) Random consistency (C) Sequential
used for the memory (B) Remote node consistency
consistency is called (C) Sequential consistency
_____________ (D) None of the mentioned
49. Implementation of the (A) Strict consistency (A) Strict
________ model for a DSM (B) Causal consistency consistency
system is practically (C) Sequential consistency
impossible. (D) None of the mentioned
50. Remote Procedure Calls are (A) For communication (C) For
used ____________ between two processes communication
remotely different from each between two
other on the same system processes on
(B) For communication separate systems
between two processes on the
same system
(C) For communication
between two processes on
separate systems
Sample Question for Distributed Opearting system
Sr. Question Option 1 Option 2 Option 3 Option 4 Answer
No.
if the same source code can be
Execution Execution
compiled and executed properly on any Protocol level Binary level
1 level None level
computer in the distributed system compatibility compatibility
compatibility compatibility
called
_______Occurs when a server crashes or
2 Omission Timing Crash Response Crash
any other hardware related
______may be occur due to deadlocks,
Secondary Communicati
timeouts, protection violation, wrong Process Process
3 System failure storage on medium
input from user or consistency failure failure
failure failure
violation.
______Occurs when a server does not
4 Omission Timing Crash Response Omission
receive incoming requests from
______usually caused by the failure of Secondary Communicati Communicati
Process
5 switching nodes or links of System failure storage on medium on medium
failure
communicating system failure failure failure
Secondary Communicati Secondary
_____caused by parity error, head crash, Process
6 System failure storage on medium storage
or dust particles on medium failure
failure failure failure
_____Occurs when a server fails to
7 Omission Timing Crash Response Timing
respond with in a particular
_____Occurs when a server sends any
8 Omission Timing Arbitrary Response Arbitrary
arbitrary message.
_____Occurs when a server sends
9 Omission Timing Crash Response Response
incorrect message in response to
A ______ occurs when a set of processes
are waiting for the lock of some
10 livelock failure crash
resources held by other processes in the
same set. deadlock deadlock
A _______is an anomalous physical
11 fault Recovery Backup None fault
condition.
A cut is graphical representation of
12 _______ in history of distributed logical state global state graph Local state global state
computation
A distributed operating system appears
to its user as centralised operating
13 independent similar Dependent none independent
system for single machine, but it run on
multiple ________ computer
A situation in which a single failure can

cause an infinite number of
14 Deadlock Domino effect Livelock none Livelock
rollbacks,preventing the system from
making progress.
A state in which a process has finished
Locally Partially Globally Locally
its computation and will not restart any Terminating
15 terminated terminated terminated terminated
action unless it receives a message is state
state state state state
called as
A technique in which unique token is Non-token Quorum Token based Token based
16 None
shared among the sites is called based based approach approach
A workstation with its own local disk is
Both diskfull
17 usually called a workstation and diskless diskfull None diskfull
and diskless
________system
A workstation without a local disk is Both diskfull
18 diskless diskfull None diskless
called a workstation. and diskless
Ability of a system to continue
Fault Fault
19 functioning in the event of a partial Omission Timing Recovery
Tolerance Tolerance
failure
Advantage of protocol level Single different different
Time sharing
20 compatibility is that individual operating operating None operating
system
computers can run____ systems systems systems
After a site leaves the CS, it is the time
Message Synchronizati Time Response Synchronizati
21 required and before the next site enters
complexity on delay complexity time on delay
the CS
22 amount of time. Failure Failure Failure failure Failure
Approaches based on shared variable
are not applicable to distributed system Message Message
23 Time Semaphore Variable
& approach based on ____________ must passing passing
be used
As the load is increased response time is

increased in all _________algorithm mutual mutual
24 Scheduling Deadlock None
because contention for access to CS exclusion exclusion
increase
At any instant, only one process can Safety Safety
25 Livelock Fairness starvation
execute the critical section Property Property
be restored by reversing all the changes
26
called
Chandy-Lamport Global State Recording
27 logical state global state Physical state Local state global state
Protocol is used to capture consistent
client or fails to send messages in
28 Failure Failure Failure failure Failure
response to clients request.
Computer can request services from
Enhanced Resource Modular Resource
29 another computer by sending request to Reliability
Performance Sharing expandability Sharing
it over communication network called
Concurrent access of processes to a

Mutual Mutual
30 shared resource or data is executed in Deadlock Live lock None
Exclusion Exclusion
mutually exclusive manner
Coordinator sends a COMMIT-REQUEST

31 message to every cohort commit Stop Abort Start commit
requestingthem to________.
Distributed system generally grows
32 Service Knowledge time None time
with
Due to the unavailability of a global
global state of Local state of global state of
memory, a global clock and the state of the
the the the
33 unpredictability of message delays, it is distributed none
distributed distributed distributed
practically impossible for a computer to system
system system system
collect up-to-date information about the
Each event in process Pi ~ vector clock

34 n/2 n+1 n n-1 n
Ci ( integer vector of length ___)
Each process gets a fair chance to
execute the CS. Fairness property
Safety Liveness
35 generally means the CS execution Livelock Fairness Fairness
Property Property
requests are executed in the order of
their arrival
Each site S i keeps an array of integers
Suzuki-
RN i [1..N ], where RN i [j ] is the largest lamport
36 Ricart Kasami Raymond
sequence number received so far from algorithm
Broadcast
Sj
If data is brought to the location of

Computationa Distributed Data Data
37 computation that needs access to it, by Both A & B
l Migration Scheduling Migration Migration
the distributed operating system called
If the nature of the errors and damages

caused by the fault can be completely
Backward Forward Forward
38 and accurately accessed, then it is System crash failure
recovery recovery recovery
possible to remove those errors in the
process’s state or system’s state called
If the nature of the errors and damages

caused by the fault cannot be
completely and accurately accessed, Backward Forward Backward
39 System crash failure
then it is not possible to remove those recovery recovery recovery
errors in the process’s state or system’s
state
In a distributed system, ____________or a

40 local kernel cannot be used to Variable Lock semaphores None semaphores
implement mutual exclusion.
In distributed operating system each
computer may have the same or
41 User Programmer System None User
different operating system, but not
visible to the ___
Both Local Both Local
In distributed system each processor
42 Clock Memory and Local memory None Memory and
has its own
clock clock
In distributed system there exist no
43 global clock Physical clock Local clock Logical clock global clock
system wide common clock called
In Lamport system of logical clock if a →
44 b then C(a) < C(b) but C(a) < C(b) does b → a Both a & b a→b None a→b
not necessarily imply
In naming issue of distributed OS
45 Service File Objects user Objects
Names are used to refer
In Raymond algorithm two site that
Critical Critical
46 Consecutively execute the ______ can be Process Program Deadlock
section section
located at any position
In Raymond tree the average distance
47 between requesting site and the site T+1 2T+E 2T T(log N) T(log N)
holding token is
In Token based algorithm a site can also
Requesting Ideal token Ideal token
48 be in state where a site holding the Running state None
state state state
token is executing outside CS
In two phase commit protocol one of

the cooperating process act as Participating
49 Cohorts coordinator None Cohorts
coordinator other processes are process
referred to as _________
In Update-in-Place, every update or

write operation to an object updates the
50 Record File Log data Log
object and create a __________in the stable
storage
In_______, all processors execute the

Execution
same binary instruction set, even Protocol level Binary level Binary level
51 level None
though the processors may differ in compatibility compatibility compatibility
compatibility
performance and in input-output.
Lamport clock system can not
Synchronisati
52 distinguish between advancement of Local event Global event None Local event
on
due to
Logical extension of computation data thread process system process
53
migration is migration migration migration migration migration
Message passing is the sole means for mutual mutual
54 Livelock Deadlock semaphores
implementing distributed________. exclusion exclusion
Minicomputer model is a simple time-sharing Multicompute Distributed time-sharing
55 None
extension of the centralized system r system system system
Non token based algorithm use ________
to order request for CS and to resolve
56 timestamps Token Message None timestamps
conflict between simultaneous request
for CS
On receiving the request: if the
transaction execution is successful, the
57 Stable Final REDO shadow REDO
cohortwrites UNDO and ____ log on
stable storage.
58 problem occurs Failure Failure Failure failure Failure
Process synchronization is difficult in
59 distributed systems due to the lack of Local clock Local memory global clock Time global clock
shared memory and a _______
Processes can simultaneously wait for
several resources and cannot proceed
60 lock control acesss none lock
until it acquired all the ______ of those
resources
Record all modifications in sufficient operation- operation-
Forward state-based
61 detail so that a previous state of the based None based
recovery recovery
process can recovery recovery
The process that involves restoring an Fault Mutual Failure Failure
62 Deadlock
erroneous state to an error-free state. tolerance exclusion recovery recovery
The algorithm in which each site Suzuki-

Singhal’s lamport Singhal’s
63 maintains information on other sites, Kasami Ricart
Heuristic algorithm Heuristic
guess the sites likely to have the token. Broadcast
The algorithm in which sites are Suzuki-
lamport
64 logically arranged as a directed tree Ricart Kasami Raymond Raymond
algorithm
called Broadcast
The casual ordering of message should
65 not confused with casual ordering of the Events Resource Process message Events
client’s message.
operation-
The complete state of a process is saved Forward state-based state-based
66 based None
at various checkpoints recovery recovery recovery
recovery
The computers communicate with each
67 other by exchanging _________over a Process Memory Message Token Message
communication network.
The lack of common memory and

68 system wide _______ is an inherent Process Resource common clock None common clock
problem in distributed systems.
The Makewas Algorithm require

69 2(N-1) N 3(N-1) 2N N
_________ messages per CS execution
The methods devised to make local and Process

Resource Resource
70 remote resources available to users in Compatibility synchronizati Security
Management Management
an effective and transparent manner on
The number of messages required per Message Synchronizati Time Response Message
71
CS execution by a site is. complexity on delay complexity time complexity
The overhead to restore a process or
72 system state to a prior state can be quite Low Moderate high None high
_____
The problem of mutual exclusion arise
in distributed system whenever several
73 several site Single site Process several site
concurrent access to shared resource by Process
_________is involved
The process of deciding what privileges
Authenticatio
74 an entity has and providing only these Authorization Security None of above Authorization
n
privileges.
The processes cannot record their local
75 states at precisely the same instant vector Local clock common clock process common clock
unless they have access to a
The rate at which the system executes Message Synchronizati System Response System
76
requests for the Critical section complexity on delay throughput time throughput
The Raymond Algorithm requires

______(light load) messege per CS
77 2(N-1) N Log N 2N Log N
execution because a request for token
must travel along the edge of tree
The resource owned and controlled by

78 Remote Public Local None Local
the computer said to be
The resource owned and controlled by

79 the other computer and those can only Remote Private Local None Remote
be access through network is said to be
The response time for for Makewas’s

80 2T T+1 3T-E 2T+E 2T+E
algorithm is
The Ricart algorithm is an optimisation
lamport Maekawa’s Lamport
81 of ___________that dispenses with RELESE Ricart Raymond
algorithm algorithm algorithm
message by merging them with reply
The roll back recovery algorithm has
82 Two Three One Four Two
_______phases
The shared resource to be accessed by
83 several site multiple site single site None single site
--at _______time
The synchronization delay for lamport
84 T+1 2T+E 2T T T
algorithm is
The system of vector clock was
85 independently proposed by Fidge & Lamport Storm Mattern Yemini Mattern
______
The time interval a request waits for its
Message Synchronizati Time Response Response
86 CS execution to be over after its request
complexity on delay complexity time time
messages have been sent out
There is no up-to-date state of the
Logical Virtual shared shared
87 entire system to any individual process Local memory
memory memory memory memory
as there's no
To avoid disruption due to failure and
88 to improve availability system are Faulty Ambiguous Fault tolerant Concurrent Fault tolerant
designed to be ____________
To combine the advantage of the
workstation-server and processors-pool Workstation Processor Workstation
89 Hybrid Model Hybrid Model
models, a _______ may be used to build a Server Model Pool Model Model
distributed computing system
Two or more sites should not endlessly
Safety Liveness Liveness
90 wait for messages which will never Livelock Fairness
Property Property Property
arrive called
Two or more successive rounds of
messages are exchanged among the Non-token Quorum Non-token
91 Token based None
sites todetermine which site will enter based based based
the CS next
When computation migrates to another Computationa Distributed Data Computationa
92 Both A & B
location is called l Migration Scheduling Migration l Migration
When past event influence and this
Casually Casually
93 influence among the casually related Local event Remote event None
related event related event
event is referred to as
When process dies it is important that

the resources allocated to that process permanently Temporarily Loss for Permanently
94 None
are recouped otherwise they will be Loss Loss interval Loss
___________
When the roll back of one process cause
95 one or more other process to roll back Livelock Deadlock Domino effect Failure Domino effect
called
In a distributed file system, a file is
96 host name local name both none BOTH
uniquely identified by .....
file name file name file host name file local name file name
97 need to be need not be need not be need not be need not be
In a distributed file system, when a file's
changed changed changed changed changed
physical storage location changes .....
physical physical
98 In distributed file system, file name local name storage both none storage
does not reveal the file's ..... location location
In a distributed file system, ..... is
client
99 mapping between logical and physical naming migration hetrogeneity naming
interface
objects.
Which one of the following hides the transparent hidden escape spy transparent
100 location where in the network the file is distributed distributed distributed distributed distributed
stored? file system file system file system file system file system
There is no need to establish and
stateless file stateful file stateless file
101 terminate a connection through open both none
service service service
and close operation in .....
_________ is not possible in distributed file client
102 migration remote access migration
file system. replication interface
The file once created can not be immutable immutable
103 mutex file mutable file none
changed is called ..... file file
..... of the distributed file system are
client STORAGE ALL THE ALL THE
104 dispersed among various machines of SERVER
interface DEVICE ABOVE ABOVE
distributed system.
Which one of the following is a ALL THE ALL THE
105 ANDREW NETWORK NOVEL
distributed file system? ABOVE ABOVE
c) indexed
106 What are the different ways file sequential b) direct sequential d) all of the d) all of the
accesses take place? access access access mentioned mentioned
What are the different ways mounting a) boot b) auto c) explicit d) all of the d) all of the
107
of the file system? mounting mounting mounting mentioned mentioned
a) Reduced a) Reduced
network network
c) Copies of
traffic by b) Faster traffic by
What is the advantage of caching in data creates d) None of the
108 retaining network retaining
remote file access backup mentioned
recently access recently
automatically
accessed disk accessed disk
blocks blocks
prevention prevention prevention none of the prevention
from the from the from the mentioned from the
109 deadlock is starvation is deadlock & deadlock &
For proper synchronization in must must starvation is starvation is
distributed systems must must
In the token passing approach of
110 distributed systems, processes are
organized in a ring structure logically physical both none logically
breaks the coordinates
transaction the
111 starts the into number termination of
n distributed systems, transaction execution of of sub the all of the all of the
coordinator transaction transactions transaction mentioned mentioned
112 In case of failure, a new transaction

coordinator can be elected by bully ring both none both
a unique a unique
priority there is no priority
number is priority number is
113
associated number associated
with each associated priority of the with each
In distributed systems, election active process with any processes is none of the active process
algorithms assumes that in system process not required mentioned in system
114 According to the ring algorithm, links

between processes are bidirectional unidirectional both none unidirectional
One processor All of the All of the
as It requires mentioned mentioned
coordinator request,reply
115
which and release The method is
What are the characteristics of mutual handles all per critical free from
exclusion using centralized approach ? requests section entry starvation
Distributed Operating System
(MCQ’s)
---------------------------------------------------------------------------------------------------------
No Question Option Answer

1. Number of CPU registers in a system depends on a) Operating system
____________. b) Computer B
Architecture
c) Computer
Organization
d) None of the above
2. Distributed OS works on the ________ principle. a) File Foundation
b) Single system image B
c) Multi system image
d) Networking image
3. Super computers typically employ _______. A) Real time Operating
system B
b) Multiprocessors OS
c) desktop OS
4. Distributed systems have ? a) high security
b) better resource B
sharing
c) better system
utilization
d) low system overhead
5. Which amongst the following is not an advantage of a) Reliability
Distributed systems? b) Incremental growth A
c) Resource sharing
DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

6. Multiprogramming systems: a)
Are easier to develop C
than single
programming systems
b)
Execute each job faster
c)
Execute more jobs in
the same time period
d)
Are used only one large
mainframe computers
7. In distributed system each processor has its own a) local memory
b)clock C
c) both local memory
and clock
d) none of the
mentioned
8. If one site fails in distributed system a) the remaining sites
can continue operating A
b) all the sites will stop
working
c) directly connected
sites will stop working
d) none of the
mentioned
10. Network operating system runs on a) server
b) every system in the A
network
c) both server and
every system in the
network

d) none of the
mentioned
11. Which technique is based on compile-time program a) cache coherence
transformation for accessing remote data in a distributed- scheme B
memory parallel system. b) computation
migration
c) remote procedure
call
d) message passing
12. Logical extension of computation migration is ___________ a) process migration
b) system migration A
c) thread migration
d) data migration
13. Processes on the remote systems are identified by a) host ID
___________ b) host name and B
identifier
c) identifier
d) process ID
14. Which routing technique is used in a distributed system? a) fixed routing
b) virtual routing D
c) dynamic routing
d) all of the mentione
15. In distributed systems, link and site failure is detected by a) polling B
___________ b) handshaking
c) token passing
d) none of the
mentioned
16. The capability of a system to adapt the increased service a) scalability
load is called ___________ b) tolerance A
c) capacity
d) none of the
mentioned

17. Internet provides _______ for remote login. a) telnet
b) http A
c) ftp
d) rpc
18. What is not true about distributed system ? a) It is a collection of
processor B
b) All processors are
synchronized
c) They do not share
memory
d) None of the
mentioned
19. What are characteristics of processor in distributed system ? a) They vary in size and
function A
b) They are same in size
and function
c) They are
manufactured with
single purpose
d) They are real-time
devices
20. What are characteristics of distributed file system ? a) Its users, servers and
storage devices are
dispersed A
b) Service activity is not
carried out across the
network
c) They have single
centralized data
repository
d) There are multiple
dependent storage

devices
21. What is not a major reason for building distributed systems ? a) Resource sharing
b) Computation D
speedup
c) Reliability
d) Simplicity
22. What are types of distributed operating system ? a) Network Operating
system A
b) Zone based
Operating system
c) Level based
Operating system
23. What are characteristic of Network Operating Systems ? a) Users are aware of
multiplicity of A
machines
b) They are transparent
c) They are simple to
use
24. How are access to resources of various machines is done ? a) Remote logging using
ssh or telnet A
b) Zone are configured
for automatic access
c) FTP is not used
25. What are characteristics of Distributed Operating system ? a) Users are aware of
multiplicity of B
machines
b) Access is done like
local resources
c) Users are aware of

multiplicity of
machines
d) They have multiple
zones to access files
26. What are characteristics of data migration ? a) transfer data by
entire file or immediate A
portion required
b) transfer the
computation rather
than the data
c) execute an entire
process or parts of it at
different sites
d) none of the
mentioned
27. What are characteristics of computation migration ? a) transfer data by
entire file or immediate B
portion required
b) transfer the
computation rather
than the data
different sites
d)none of the
mentioned
28. What are characteristics of process migration ? a) transfer data by
entire file or immediate C
portion required
b) transfer the
computation rather
than the data

different sites
d) none of the
mentioned
30. What are parts of network structure ? a) Workstation
b) Gateway D
c) Laptop
31. What are valid network topology ? a) Multiaccess bus
b) Ring D
c) Star
32. What are sites in network topology compared ? a) Basic cost
b) Communication cost D
c) Reliability
33. Which design features of a communication network are a) Naming and name
important ? resolution D
b) Routing strategies
c) Connection
strategies
34. What are characteristics of Naming and Name resolution ? a)
name systems in the
network B
b) address messages
with the process-id
c) virtual circuit
d) message switching
35. What are routing strategies which is not used in distributed a) Fixed routing
systems ? b) Token routing C

c) Virtual circuit
d) Dynamic routing
36. What are connection strategies not used in distributed a) Circuit switching
systems ? b) Message switching C
c) Token switching
d) Packet switching
37. How is are collisions avoided in network ? a) Carrier sense with
multiple access (CSMA); D
collision detection (CD)
b) Carrier sense
multiple access with
collision avoidance
c) Message slots
38. What is common problem found in distributed system ? a) Process
Synchronization C
b) Communication
synchronization
c) Deadlock problem
d) Power failure
39. How many layers does Internet model ISO consists of ? a) Three
b) Five C
c) Seven
d) Eight
40. What are different ways distributed may suffer ? a) Failure of a link
b) Failure of a site D
c) Loss of message
41. What are design issues in distributed system structure ? a) Scaleability
b) Fault-tolerance D
c) Clustering

43. In distributed file system, when a file’s physical storage a) file name need to be
location changes changed B
b) file name need not
to be changed
c) file’s host name need
to be changed
d) file’s local name
need to be changed
44. n distributed file system, _______ is mapping between logical a) client interfacing
and physical objects. b) naming B
c) migration
d) hetrogeneity
45. In distributed file system, a file is uniquely identified by a) host name
b) local name C
c) the combination of
host name and local
name
d) none of the
mentioned
46. There is no need to establish and terminate a connection a) stateless file service
through open and close operation in b) stateful file service A
c) both stateless and
stateful file service
d) none of the
mentioned
47. In distributed file system, file name does not reveal the file’s a) local name
b) physical storage B
location
c) both local name and
physical storage
location
d) none of the

mentioned
48. Which one of the following is a distributed file system? a) andrew file system
b) network file system D
c) novel network
49. In distributed systems, a logical clock is associated with a) each instruction
b) each process B
c) each register
d) none of the
mentioned
50. If timestamps of two events are same, then the events are a) concurrent
b) non-concurrent A
c) monotonic
d) non-monotonic
51. If a process is executing in its critical section a) any other process
can also execute in its B
critical section
b) no other process can
execute in its critical
section
c) one more process
can execute in its
critical section
d) none of the
mentioned
52. A process can enter into its critical section a) anytime
b) when it recieves a C
reply message from its
parent process
c) when it recieves a
reply message from all
other processes in the

system
d) none of the
mentioned
53. ______ is a unique tag, usually a number identifies the file a) File identifier
within the file system. b) File name A
c) File type
d) None of the
mentioned
54. In distributed system, each processor has its own a) local memory
___________ b) clock C
c) both local memory
and clock
d) none of the
mentioned
55. If one site fails in distributed system then ___________ a) the remaining sites
can continue operating A
b) all the sites will stop
working
c) directly connected
sites will stop working
d) none of the
mentioned
56. Network operating system runs on ___________ a) server
b) every system in the A
network
c) both server and
every system in the
network
d) none of the
mentioned
57. Which technique is based on compile-time program a) cache coherence
transformation for accessing remote data in a distributed- scheme B

memory parallel system? b) computation
migration
c) remote procedure
call
d) message passing
58. Logical extension of computation migration is ___________ a) process migration
b) system migration A
c) thread migration
d) data migration
59. Processes on the remote systems are identified by a) host ID
___________ b) host name and B
identifier
c) identifier
d) process ID
60. In distributed systems, link and site failure is detected by a) polling
___________ b) handshaking B
c) token passing
d) none of the
mentioned
61. The capability of a system to adapt the increased service load a) scalability
is called ___________ b) tolerance A
c) capacity
d) none of the
mentioned
62. What is not true about a distributed system? a) It is a collection of
processor B
synchronized
memory
d) None of the
mentioned

63. What are the characteristics of processor in distributed a) They vary in size and
system? function A
and function
c) They are
manufactured with
single purpose
devices
64. What are the characteristics of a distributed file system? a) Its users, servers and
storage devices are A
dispersed
network
c) They have single
centralized data
repository
dependent storage
devices
65. What is not a major reason for building distributed systems? a) Resource sharing
b) Computation D
speedup
c) Reliability
d) Simplicity
66. What are the types of distributed operating system? a) Network Operating
system A
b) Zone based
Operating system
c) Level based
Operating system

67. What are characteristic of Network Operating Systems? a) Users are aware of
multiplicity of A
machines
use
68. How is access to resources of various machines is done? a) Remote logging using
ssh or telnet A
c) FTP is not used
69. What are the characteristics of Distributed Operating a) Users are aware of
system? multiplicity of B
machines
local resources
multiplicity of
machines
70. What are the characteristics of data migration? a) transfer data by
portion required
b) transfer the
computation rather
than the data

different sites
d) none of the
mentioned
71. What are the characteristics of computation migration? a) transfer data by
portion required
b) transfer the
computation rather
than the data
different sites
d) none of the
mentioned
72. What are the characteristics of process migration? a) transfer data by
entire file or immediate C
portion required
b) transfer the
computation rather
than the data
different sites
d) none of the
mentioned
73. What are the different ways in which clients and servers are a) Servers may not run
dispersed across machines? on dedicated machines B
b) Servers and clients
can be on same
machines
c) Distribution cannot
be interposed between

a OS and the file
system
d) OS cannot be
distributed with the file
system a part of that
distribution
74. What are not the characteristics of a DFS? a) login transparency
and access C
transparency
b) Files need not
contain information
about their physical
location
c) No Multiplicity of
users
d) No Multiplicity if
files
75. What are characteristic of a DFS? a) Fault tolerance
b) Scalability D
c) Heterogeneity of the
system
d) Upgradation
76. What are the different ways file accesses take place? a) sequential access
b) direct access D
c) indexed sequential
access
77. Which is not a major component of a file system? a) Directory service
b) Authorization service C
c) Shadow service
d) System service
78. What are the different ways mounting of the file system? a) boot mounting

b) auto mounting D
c) explicit mounting
79. What is the advantage of caching in remote file access? a) Reduced network
traffic by retaining A
recently accessed disk
blocks
b) Faster network
access
c) Copies of data
creates backup
automatically
d) None of the
mentioned
80. What is networked virtual memory? a) Caching
b) Segmentation A
c) RAM disk
d) None of the
mentioned
81. What are the examples of state information? a) opened files and
their clients D
b) file descriptors and
file handles
c) current file position
pointers
82. . Which is not an example of state information? a) Mounting
information B
b) Description of HDD
space
c) Session keys
d) Lock status

83. 1. What is a stateless file server? a) It keeps tracks of
states of different B
objects
b) It maintains
internally no state
information at all
c) It maintains some
information in them
d) None of the
mentioned
84. What are the characteristics of the stateless server? a) Easier to implement
b) They are not fault- A
tolerant upon client or
server failures
c) They store all
information file server
d) They are redundant
to keep data safe
85. Implementation of a stateless file server must not follow? a) Idempotency
requirement B
b) Encryption of keys
c) File locking
mechanism
d) Cache consistency
86. What are the advantages of file replication? a) Improves availability
& performance A
b) Decreases
performance
c) They are consistent
d) Improves speed
87. What are characteristic of NFS protocol? a) Search for file within
directory D

b) Read a set of
directory entries
c) Manipulate links and
directories
88. What is the coherency of replicated data? a) All replicas are
identical at all times D
b) Replicas are
perceived as identical
only at some points in
time
c) Users always read
the most recent data in
the replicas
89. What are the three popular semantic modes? a) Unix, Coherent &
Session semantics B
b) Unix, Transaction &
Session semantics
c) Coherent,
Transaction & Session
semantics
d) Session, Coherent
semantics
90. What are the characteristics of Unix semantics? a) Easy to implement in
a single processor D
system
b) Data cached on a per
process basis using
write through case
control
c) Write-back enhances

access performance
91. What are the characteristics of transaction semantics? a) Suitable for
applications that are B
concerned about
coherence of data
b) The users of this
model are interested in
the atomicity property
for their transaction
c) Easy to implement in
a single processor
system
d) Write-back enhances
access performance
92. What are non characteristics of session semantics? a) Each client obtains a
working copy from the D
server
b) When file is closed,
the modified file is
copied to the file server
c) The burden of
coordinating file
sharing is ignored by
the system
d) Easy to implement in
a single processor
system
93. The file once created can not be changed is called a) immutable file
___________ b) mutex file A
c) mutable file
d) none of the

mentioned
94. ______ of the distributed file system are dispersed among a) Clients
various machines of distributed system. b) Servers D
c) Storage devices
95. _______ is not possible in distributed file system. a) File replication
b) Migration B
c) Client interface
d) Remote access
96. Which one of the following hides the location where in the a) transparent
network the file is stored? distributed file system A
b) hidden distributed
file system
c) escaped distribution
file system
d) spy distributed file
system
97. In a distributed file system, when a file’s physical storage a) file name need to be
location changes ___________ changed B
b) file name need not
to be changed
c) file’s host name need
to be changed
d) file’s local name
need to be changed
98. In a distributed file system, _______ is mapping between a) client interfacing
logical and physical objects. b) naming B
c) migration
d) heterogeneity
100 Which one of the following is a distributed file system? a) andrew file system
b) network file system D
c) novel network

______________ b) each process B
c) each register
d) none of the
mentioned
____________ b) non-concurrent A
c) monotonic
d) non-monotonic
103. If a process is executing in its critical section ____________ a) any other process
critical section
section
c) one more process
can execute in its
critical section
d) none of the
mentioned
104. A process can enter into its critical section ____________ a) anytime
b) when it receives a C
parent process
c) when it receives a
system
d) none of the
mentioned
105. For proper synchronization in distributed systems a) prevention from the

____________ deadlock is must C
b) prevention from the
starvation is must
c) prevention from the
deadlock & starvation
is must
d) none of the
mentioned
106. In the token passing approach of distributed systems, a) logically
processes are organized in a ring structure ____________ b) physically A
c) both logically and
physically
d) none of the
mentioned
107. In distributed systems, what will the transaction coordinator a) starts the execution
do? of transaction D
b) breaks the
transaction into
number of sub
transactions
c) coordinates the
termination of the
transaction
108. In case of failure, a new transaction coordinator can be a) bully algorithm
elected by ____________ b) ring algorithm C
c) both bully and ring
algorithm
d) none of the
mentioned
109. In distributed systems, election algorithms assumes that a) a unique priority
____________ number is associated A

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
110. According to the ring algorithm, links between processes are a) bidirectional
____________ b) unidirectional B
c) both bidirectional
and unidirectional
d) none of the
mentioned
Deadlock in Dos(unit-3)
111. What is a reusable resource? a) that can be used by
one process at a time A
and is not depleted by
that use
b) that can be used by
more than one process
at a time
c) that can be shared
between various
threads
d) none of the
mentioned
112. Which of the following condition is required for a deadlock to a) mutual exclusion
be possible? b) a process may hold D
allocated resources

while awaiting
assignment of other
resources
c) no resource can be
forcibly removed from
a process holding it
113. A system is in the safe state if ____________ a) the system can
allocate resources to A
each process in some
order and still avoid a
deadlock
b) there exist a safe
sequence
c) all of the mentioned
d) none of the
mentioned
114. The circular wait condition can be prevented by a) defining a linear
____________ ordering of resource A
types
b) using thread
c) using pipes
115. Which one of the following is the deadlock avoidance a) banker’s algorithm
algorithm? b) round-robin A
algorithm
c) elevator algorithm
d) karn’s algorithm
116. What is the drawback of banker’s algorithm? a) in advance processes
rarely know how much D
resource they will need
b) the number of

processes changes as
time progresses
c) resource once
available can disappear
117. For an effective operating system, when to check for a) every time a
deadlock? resource request is C
made
b) at fixed time
intervals
c) every time a
resource request is
made at fixed time
intervals
d) none of the
mentioned
118. A problem encountered in multitasking when a process is a) deadlock
perpetually denied necessary resources is called b) starvation B
____________ c) inversion
d) aging
119. Which one of the following is a visual ( mathematical ) way a) resource allocation
to determine the deadlock occurrence? graph A
b) starvation graph
c) inversion graph
d) none of the
mentioned
120. To avoid deadlock ____________ a) there must be a fixed
number of resources to A
allocate
b) resource allocation
must be done only once
c) all deadlocked

processes must be
aborted
d) inversion technique
can be used
121. The number of resources requested by a process a) must always be less
____________ than the total number C
of resources available
in the system
b) must always be
equal to the total
number of resources
available in the system
c) must not exceed the
total number of
resources available in
the system
d) must exceed the
total number of
resources available in
the system
122. The request and release of resources are ___________ a) command line
statements C
b) interrupts
c) system calls
d) special programs
123. What are Multithreaded programs? a) lesser prone to
deadlocks B
b) more prone to
deadlocks
c) not at all prone to
deadlocks
d) none of the

mentioned
124. For a deadlock to arise, which of the following conditions a) Mutual exclusion
must hold simultaneously? b) No preemption D
c) Hold and wait
125. For Mutual exclusion to prevail in the system ____________ a) at least one resource
must be held in a non A
sharable mode
b) the processor must
be a uniprocessor
rather than a
multiprocessor
c) there must be at
least one resource in a
sharable mode
126. For a Hold and wait condition to prevail ____________ a) A process must be
not be holding a B
resource, but waiting
for one to be freed, and
then request to acquire
it
b) A process must be
holding at least one
resource and waiting to
acquire additional
resources that are
being held by other
processes
c) A process must hold
at least one resource
and not be waiting to

acquire additional
resources
d) None of the
mentioned
127. Deadlock prevention is a set of methods ____________ a) to ensure that at
least one of the A
necessary conditions
cannot hold
b) to ensure that all of
the necessary
conditions do not hold
c) to decide if the
requested resources for
a process have to be
given or not
d) to recover from a
deadlock
128. For non sharable resources like a printer, mutual exclusion a) must exist
____________ b) must not exist A
c) may exist
d) none of the
mentioned
129. For sharable resources, mutual exclusion ____________ a) is required
b) is not required B
c) may be or may not
be required
d) none of the
mentioned
130. To ensure that the hold and wait condition never occurs in a) whenever a resource
the system, it must be ensured that ____________ is requested by a D
process, it is not
holding any other

resources
b) each process must
request and be
allocated all its
resources before it
begins its execution
c) a process can request
resources only when it
has none
131. The disadvantage of a process being allocated all its a) Low CPU utilization
resources before beginning its execution is ____________ b) Low resource B
utilization
c) Very high resource
utilization
d) None of the
mentioned
132. The disadvantage of a process being allocated all its a) Low CPU utilization
resources before beginning its execution is ____________ b) Low resource B
utilization
c) Very high resource
utilization
d) None of the
mentioned
133. To ensure no preemption, if a process is holding some a) then the process
resources and requests another resource that cannot be waits for the resources D
immediately allocated to it ____________ be allocated to it
b) the process keeps
sending requests until
the resource is
allocated to it
c) the process resumes

execution without the
resource being
allocated to it
d) then all resources
currently being held are
preempted
134. One way to ensure that the circular wait condition never a) impose a total
holds is to ____________ ordering of all resource A
types and to determine
whether one precedes
another in the ordering
b) to never let a
process acquire
resources that are held
by other processes
c) to let a process wait
for only one resource at
a time
135. Each request requires that the system consider the a) resources currently
_____________ to decide whether the current request can be available A
satisfied or must wait to avoid a future possible deadlock. b) processes that have
previously been in the
system
c) resources currently
allocated to each
process
d) future requests and
releases of each
process
136. Given a priori information about the ________ number of a) minimum
resources of each type that maybe requested for each b) average C

process, it is possible to construct an algorithm that ensures c) maximum
that the system will never enter a deadlock state. d) approximate
137. A deadlock avoidance algorithm dynamically examines the a) resource allocation

__________ to ensure that a circular wait condition can state A
never exist. b) system storage state
c) operating system
d) resources
138. A state is safe, if ____________ a) the system does not
crash due to deadlock B
occurrence
b) the system can
allocate resources to
each process in some
order and still avoid a
deadlock
c) the state keeps the
system protected and
safe
139. A system is in a safe state only if there exists a a) safe allocation
____________ b) safe resource C
c) safe sequence
140. All unsafe states are ____________ a) deadlocks
b) not deadlocks B
c) fatal
d) none of the
mentioned
141. The sequence <P1, P3, P4, P2, P0> leads the system to a) an unsafe state
____________ b) a safe state B
c) a protected state

d) a deadlock
142. The wait-for graph is a deadlock detection algorithm that is a) all resources have a
applicable when ____________ single instance A
b) all resources have
multiple instances
c) all resources have a
single 7 multiple
instances
143. An edge from process Pi to Pj in a wait for graph indicates a) Pi is waiting for Pj to
that ____________ release a resource that A
Pi needs
b) Pj is waiting for Pi to
release a resource that
Pj needs
c) Pi is waiting for Pj to
leave the system
d) Pj is waiting for Pi to
leave the system
144. If the wait for graph contains a cycle ____________ a) then a deadlock does
not exist B
b) then a deadlock
exists
c) then the system is in
a safe state
d) either deadlock
exists or system is in a
safe state
145. If deadlocks occur frequently, the detection algorithm must a) rarely
be invoked ________ b) frequently B
c) rarely & frequently
d) none of the

mentioned
146. What is the disadvantage of invoking the detection algorithm a) overhead of the
for every request? detection algorithm C
due to consumption of
memory
b) excessive time
consumed in the
request to be allocated
memory
c) considerable
overhead in
computation time
147. A deadlock eventually cripples system throughput and will a) increase
cause the CPU utilization to ______ b) drop B
c) stay still
d) none of the
mentioned
148. Every time a request for allocation cannot be granted a) the set of processes
immediately, the detection algorithm is invoked. This will that have been A
help identify ____________ deadlocked
b) the set of processes
in the deadlock queue
c) the specific process
that caused the
deadlock
149. A system has 3 processes sharing 4 resources. If each process a) can never occur
needs a maximum of 2 units then, deadlock ____________ b) may occur A
c) has to occur
d) none of the
mentioned

150. A deadlock can be broken by ____________ a) abort one or more
processes to break the A
circular wait
b) abort all the process
in the system
c) preempt all
resources from all
processes
d) none of the
mentioned
151. A deadlock can be broken by ____________ a) abort one or more
processes to break the A
circular wait
b) abort all the process
in the system
c) preempt all
resources from all
processes
d) none of the
mentioned
152. The two ways of aborting processes and eliminating a) Abort all deadlocked
deadlocks are ____________ processes C
b) Abort all processes
c) Abort one process at
a time until the
deadlock cycle is
eliminated
153. Those processes should be aborted on occurrence of a a) is more time
deadlock, the termination of which? consuming B
b) incurs minimum cost
c) safety is not

hampered
154. The process to be aborted is chosen on the basis of the a) priority of the
following factors? process D
b) process is interactive
or batch
c) how long the process
has computed
155. Cost factors for process termination include ____________ a) Number of resources
the deadlock process is C
not holding
b) CPU utilization at the
time of deadlock
c) Amount of time a
deadlocked process has
thus far consumed
during its execution
156. If we preempt a resource from a process, the process cannot a) aborted
continue with its normal execution and it must be b) rolled back B
____________ c) terminated
d) queued
157. To _______ to a safe state, the system needs to keep more a) abort the process
information about the states of processes. b) roll back the process B
c) queue the process
d) none of the
mentioned
158. If the resources are always preempted from the same a) deadlock
process __________ can occur. b) system crash D
c) aging
d) starvation

159. What is the solution to starvation? a) the number of
rollbacks must be A
included in the cost
factor
b) the number of
resources must be
included in resource
preemption
c) resource preemption
be done instead
160. Header are ______ when data packet moves from upper to a) Modified
the lower layers ? b) Removed C
c) Added
161. Which layer lies between transport layer and data link layer ? a) Physical
b) Network B
c) Application
d) Session
162. What are different ways distributed may suffer ? a) Failure of a link
b) Failure of a site D
c) Loss of message
163. What are design issues in distributed system structure ? a) Scaleability
b) Fault-tolerance D
c) Clustering
164. What are not the characteristics of a DFS ? a)login transparency
and access C
transparency
b) Files need not
contain information

about their physical
location
c) No Multiplicity of
users
d) No Multiplicity if
files
165. What are characteristic of a DFS ? a) Fault tolerance
b) Scaleability D
c) Heterogeneity of the
system
d) Upgradation
166. What are the different ways file accesses take place ? a) sequential access
b) direct access D
c) indexed sequential
access
167. What are characteristic of NFS protocol ? a) Search for file
withing directory D
b) Read a set of
directory entries
c) Manipulate links and
directories
168. What is coherency of replicated data ? a) All replicas are
identical at all times
b) Replicas are D
perceived as identical
only at some points in
time
c) Users always read
the most recent data in
the replicas

169. What are the three popular semantic modes ? a) Unix, Coherent &
Session semantics B
b) Unix, Transaction &
Session semantics
c) Coherent,
Transaction & Session
semantics
d) Session, Coherent
semantics
170. What are non characteristics of session semantics ? a)Each client obtains a
working copy from the
server D
b) When file is closed,
the modified file is
copied to the file server
c) The burden of
coordinating file
sharing is ignored by
the system
d) Easy to implement in
a single processor
system
171. Which module gives control of the CPU to the process a) dispatcher
selected by the short-term scheduler? b) interrupt A
c) scheduler
d) none of the
mentioned
172. The processes that are residing in main memory and are a) job queue
ready and waiting to execute are kept on a list called b) ready queue B
_____________ c) execution queue
d) process queue

173. The interval from the time of submission of a process to the a) waiting time
time of completion is termed as ____________ b) turnaround time B
c) response time
d) throughput
174. Which scheduling algorithm allocates the CPU first to the a) first-come, first-
process that requests the CPU first? served scheduling A
b) shortest job
scheduling
c) priority scheduling
d) none of the
mentioned
175. In priority scheduling algorithm ____________ a) CPU is allocated to
the process with A
highest priority
b) CPU is allocated to
the process with lowest
priority
c) Equal priority
processes can not be
scheduled
d) None of the
mentioned
176. In priority scheduling algorithm, when a process arrives at a) all process
the ready queue, its priority is compared with the priority of b) currently running B
____________ process
c) parent process
d) init process
177. Which algorithm is defined in Time quantum? a) shortest job
scheduling algorithm B
b) round robin
scheduling algorithm
c) priority scheduling

algorithm
d) multilevel queue
scheduling algorithm
178. In multilevel feedback scheduling algorithm ____________ a) a process can move
to a different classified A
ready queue
b) classification of
ready queue is
permanent
c) processes are not
classified into groups
d) none of the
mentioned
179. Which one of the following can not be scheduled by the a) kernel level thread
kernel? b) user level thread B
c) process
d) none of the
mentioned
180. CPU scheduling is the basis of ___________ a) multiprocessor
systems B
b) multiprogramming
operating systems
c) larger memory sized
systems
d) none of the
mentioned
181. With multiprogramming ______ is used productively. a) time
b) space A
c) money
182. What are the two steps of a process execution? a) I/O & OS Burst
b) CPU & I/O Burst B

c) Memory & I/O Burst
d) OS & Memory Burst
183. An I/O bound program will typically have ____________ a) a few very short CPU
bursts C
b) many very short I/O
bursts
c) many very short CPU
bursts
d) a few very short I/O
bursts
184. A process is selected from the ______ queue by the ________ a) blocked, short term
scheduler, to be executed. b) wait, long term C
c) ready, short term
d) ready, long term
185. The switching of the CPU from one process or thread to a) process switch
another is called ____________ b) task switch D
c) context switch
186. Scheduling is done so as to ____________ a) increase CPU .
utilization A
b) decrease CPU
utilization
c) keep the CPU more
idle
d) none of the
mentioned
187. Scheduling is done so as to ____________ a) increase the
throughput A
b) decrease the
throughput
c) increase the duration
of a specific amount of

work
d) none of the
mentioned
188. What is Turnaround time? a) the total waiting
time for a process to D
finish execution
b) the total time spent
in the ready queue
c) the total time spent
in the running queue
d) the total time from
the completion till the
submission of a process
189. Scheduling is done so as to ____________ a) increase the
turnaround time B
b) decrease the
turnaround time
c) keep the turnaround
time same
d) there is no relation
between scheduling
and turnaround time
190. What is Waiting time? a) the total time in the
blocked and waiting B
queues
b) the total time spent
in the ready queue
c) the total time spent
in the running queue
d) the total time from
the completion till the
submission of a process

191. Scheduling is done so as to ____________ a) increase the waiting
time C
b) keep the waiting
time the same
c) decrease the waiting
time
d) none of the
mentioned
192. What is Response time? a) the total time taken
from the submission B
time till the completion
time
b) the total time taken
from the submission
time till the first
response is produced
c) the total time taken
from submission time
till the response is
output
d) none of the
mentioned
193. What are the types of distributed operating system? a) Network Operating
system A
b) Zone based
Operating system
C) Level based
Operating system
194. What are the characteristics of a distributed file system? a) Its users, servers and
storage devices are A
dispersed

network
c) They have single
centralized data
repository
dependent storage
devices
195. What are characteristic of Network Operating Systems? a) Users are aware of
multiplicity of
machines A
use
d)All of the mentioned
196. What is not a major reason for building distributed systems? a) Resource sharing
b) Computation D
speedup
c) Reliability
d) Simplicity
197. What are the characteristics of computation migration? a) transfer data by
portion required
b) transfer the
computation rather
than the data
different sites
d) none of the
mentioned

198. What are the characteristics of Distributed Operating a) Users are aware of
system? multiplicity of B
machines
local resources
multiplicity of
machines
199. What is not true about a distributed system? a) It is a collection of
processor
synchronized
memory
d) None of the
mentioned
200. How is access to resources of various machines is done? a) Remote logging using
ssh or telnet A
c) FTP is not used
201. What are the characteristics of processor in distributed a) They vary in size and
system? function A
and function
c) They are
manufactured with
single purpose

devices
202. What are the characteristics of process migration? a) transfer data by
entire file or immediate
portion required C
b) transfer the
computation rather
than the data
different sites
d) none of the
mentioned
203. What are the characteristics of data migration? a) transfer data by
portion required
b) transfer the
computation rather
than the data
different sites
d)none of the
mentioned
204. What are the characteristics of atomicity? a) All operations
associated are
executed to completion A
or none are performed
b) One processor as
coordinator which
handles all requests
c) When responses are
received from all

processes, then the
process can enter its
Critical Section
d) Use communication
links
205. What things are the transaction coordinator is responsible a) Starting the
for? execution of the
transaction D
b) Breaking transaction
into a number of
subtransactions
c) Coordinating the
termination of the
transaction
206. Which of the following advantages follows the single a) Simple
coordinator approach? implementation
b) Simple deadlock D
handling
c) bottleneck
207. Which of the following advantages follows the single a) Simple
coordinator approach? implementation
b) Simple deadlock D
handling
c) bottleneck
208. Which of the following disadvantages follows the single a) Bottleneck
coordinator approach? b) Slow response A
c) Deadlock
d) One request per
second

209. What are the disadvantages of majority protocol? a) Complicated
implementation A
b) Deadlock cannot
occur easily
c) Bottleneck
210. What are the parts of a global unique identifier? a) Local unique
timestamp A
b) Remote timestamp
c) Clock number
211. Which are the two complementary deadlock-prevention a) The wait-die &
schemes using timestamps? wound-wait scheme
b) The wait-n-watch A
scheme
c) The wound-wait
scheme
d) The wait-wound &
wound-wait scheme
______________ b) each process B
c) each register
d) none of the
mentioned
____________ b) non-concurrent A
c) monotonic
d) non-monotonic
214. If a process is executing in its critical section ____________ a) any other process
critical section

section
c) one more process
can execute in its
critical section
d) none of the
mentioned
215. A process can enter into its critical section ____________ a) anytime
b) when it receives a C
parent process
c) when it receives a
system
d) none of the
mentioned
216. For proper synchronization in distributed systems a) prevention from the
____________ deadlock is must
b) prevention from the C
starvation is must
c) prevention from the
deadlock & starvation
is must
d) none of the
mentioned
217. In the token passing approach of distributed systems, a) logically
processes are organized in a ring structure ____________ b) physically A
c) both logically and
physically
d) none of the
mentioned

218. In distributed systems, what will the transaction coordinator a) starts the execution
do? of transaction D
b) breaks the
transaction into
number of sub
transactions
c) coordinates the
termination of the
transaction
219. In case of failure, a new transaction coordinator can be a) bully algorithm
elected by ____________ b) ring algorithm
c) both bully and ring C
algorithm
d) none of the
mentioned
220. In distributed systems, election algorithms assumes that a) a unique priority
____________ number is associated
with each active A
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
221. According to the ring algorithm, links between processes are a) bidirectional
____________ b) unidirectional B
c) both bidirectional
and unidirectional

d) none of the
mentioned
222. What type of fault remains in the system for some period a) Permanent
and then disappears? b) Transient B
c) Intermittent
223. Which of the following approaches are used to achieve a) Fault prevention
reliable systems? b) Fault removal D
c) Fault tolerance
224. A system maintaining its integrity while accepting a a) Full Fault Tolerance
temporary halt in its operation is said to be in a state of b) Graceful
Degradation D
c) Fail Soft
d) Fail Safe
225. A system maintaining its integrity while accepting a a) Full Fault Tolerance
temporary halt in its operation is said to be in a state of b) Graceful D
Degradation
c) Fail Soft
d) Fail Safe
226. Which of the following Error Detection checks is not a part of a) Hardware checks
Application detection? b) Timing checks A
c) Reversal checks
d) Coding checks
227. Exception handling is a type of a) forward error
recovery mechanism A
b) backward error
recovery mechanism
c) All of the mentioned
d) None of the
mentioned
228. Non-occurrence of improper alteration of information is a) Available

known as Dependability
b) Confidential D
Dependability
c) Maintainable
Dependability
d) Integral
Dependability
229. In N-version programming which is the independent a) greater than 1
generation of N, the value of N is b) less than 1 C
c) greater than 2
d) less than 2
230. In Log-based fault tolerance, logs of undetermined events are a) True
saved and replayed on failure. b) False A
231. All fault-tolerant techniques rely on a) Integrity

b) Dependability C
c) Redundancy
d) None of the
mentioned
232. It is imperative for a communicating processes to reach a) Static
consistent recovery points to avoid the _________ effect, b) Dynamic C
with backward error recovery mechanism. c) Domino
d) Whirlpool
233. In a distributed computing environment, distributed shared a) Logical combination
memory is used which is_____________ of virtual memories on B
the nodes
b) Logical combination
of physical memories
on the nodes
c) Logical combination
of the secondary
memories on all the

nodes
d) All of the above
234. _________ is a DSM system that is fundamentally based on a) RPC
software objects, but which can place each object on a b) IPC C
separate page so the hardware MMU can be used for c) Munin
detecting accesses to shard objects. d) None of the
mentioned
235. What is NUMA? a) NON Universal
Mapping Access B
b) NON Uniform
Memory Access
c) NON Uniform
Mapping Access
d) Network Uniform
Memory Access
236. DSM stands for______________ (A) Direct shared
memory
(B) Direct system C
memory
(C) Distributed shared
memory
(D) Distributed system
memory
237. Having data belonging to two independent processes in the (A) Buffering
same page is called____________. (B) Blocking D
(C) Message-passing
(D) False sharing
238. ________ returns the data item referenced by address and A) Read, Write
__________ sets the contents referenced by address to the (B) Write, Read A
value of data. (C) Write, Write
(D) Read, Read

239. In distributed system, read _________ the data item a) sets, returns
referenced by address, and write __________ the contents b) returns, sets B
referenced by address to the value of data. C) returns, returns
d) None of the
mentioned
240. The main problem is to solve the memory coherence a) thrashing
problem that deals with the ________________ of a piece of b) granularity C
shared data lying in the main memories of two or more (C) consistency
nodes. d) None of the
mentioned
241. In the distributed system, data is duplicated mainly for a) security
____________________ b) reliability and B
performance
C) consistency
d) None of the
mentioned
242. _______________ consistency is the most popular and a) Sequential
important consistency model. b) Casual A
C) Entry
d) Strict
243 The straight-forward model used for the memory consistency a) Random consistency
is called _____________ b) Remote node
C) Sequential C
consistency
d) None of the
mentioned
244. The problem of ___________ may occur when data items in a) thrashing
the same data block are being updated by multiple nodes at b) granularity
the same time. consistency
d) None of mentioned
245. ______________ occurs when two different processes access a) Consistency
two unrelated variables that reside in the same data block b) Paging overhead C

C) False sharing
d) None of the
mentioned
246. In ________________ approach, the shared-memory space is a) no structuring
simply a linear array of words. b) structuring as a A
database
c) structuring by data
type
d) None of the
mentioned
247. In ________________ method, the shared-memory space is a) no structuring
structured as a collection of objects. b) structuring as a C
database
C) structuring by data
type.
d) None of the
mentioned
248. In ________________ approach, Shared-memory space is a) no structuring
ordered as an associative memory called a tuple space. b) structuring as a
database B
c) structuring by data
type.
d) None of the
mentioned
249. Any read to a memory location x returns the value stored by a) Sequential
the most recent write operation to x is _____________- Consistency B
b) Strict Consistency
c) Causal Consistency
d) PRAM Consistency
250. The ____________ model is the strongest form of memory a) sequential
coherence, having the most stringent consistency consistency C
requirement. b) causal consistency

c) strict consistency
d) none of the
mentioned

Que.
Questions
No.
Show the characteristic of a DFS.

a) Fault tolerance
1. b) Scalability
c) Heterogeneity of the system
d) Up gradation
Answer:- d
Show which is not a major component of a file system.

a) Directory service
2. b) Authorization service
c) Shadow service
d) System service
Answer:-c
Show the different ways mounting of the file system.
a) boot mounting
3. b) auto mounting
c) explicit mounting
Answer:-d
Show the advantage of caching in remote file access.

a) Reduced network traffic by retaining recently accessed disk blocks
4. b) Faster network access
c) Copies of data creates backup automatically
d) None of the mentioned
Answer:-a
Show what a distributed file system should provide.
a) Network Transparency
5. b) High availability
c) Both
d) None of above.
Answer:-c
Show what is used to help in combining files/directories in different systems and
form a single file system structure.
a) Catching
6. b) Mounting
c) Both
d) None of above
Answer:-b
Show what is used to reduce the response time in bringing data from remote
7. machines.
a) Catching
b) Mounting
c) Both
d) None of above
Answer:-a
Show another name of Modify caching.
a) Hints
8. b) Bulk
c) Mounting
d) Catching
Answer:-a
Show a definition for: “Node at which collection of files mounted”.
a) Mounted
9. b) Internal node
c) Mount point
d) None of above
Answer:-c
Show which one is design issue of Distributed File System.
a) Availability
10. b) Scalability
c) Semantics
d) All of them.
Answer:-d
Show which one is the writing policy.
a) Write-through policy
11. b) Delayed writing policy
c) Both
d) None of above
Answer:-c
Show which protocol can be used to update all replicas.
a) Two-phase commit protocol
12. b) Server initiated protocol
c) Client initiated policy
d) None of above
Answer:-a
Show which one is not the advantage of DSM.
a) Data sharing
b) Passing data structure containing pointers is easier
13. c) Moving entire object to user takes advantage of locality difference
d) Serial access to common bus for shared physical memory like in
multiprocessor system.
Answer:-d
Show which is not a coherence protocol.
a) The full replication algorithm
14. b) Write invalidate protocol
c) Write update protocol
d) All of above
Answer:-a
Show which one is a load distribution algorithm.
15. a) Static
b) Dynamic
c) Adaptive
d) All of above
Answer:-d
Show a load distribution algorithm in which decisions are hard-coded into an
algorithm with a priori knowledge of system.
a) Static
16. b) Dynamic
c) Adaptive
d) None of above
Answer:-a
Show a load distribution algorithm which uses system state information such as task
queue length, processor utilization.
a) Static
17. b) Dynamic
c) Adaptive
d) None of above
Answer:-b
Show a load distribution algorithm that adapts the approach based on system state.
a) Static
18. b) Dynamic
c) Adaptive
d) None of above
Answer:-b
Show a load distribution algorithm in which it may stop collecting state information
at high loads.
a) Static
19. b) Dynamic
c) Adaptive
d) None of above
Answer:-c
Show what does a Load balancing technique do.
a) Adjust the load
20. b) Equalize the load
c) Randomize the load
d) None of above
Answer:-b
Show what does a Load sharing technique do.
a) balance
21. b) Reduce burden of an overloaded node
c) Randomize
d) None of above
Answer:-b
Show an algorithm in which task transfer from overloaded nodes to ones that are
likely to become idle/lightly loaded.
a) Preemptive task transfer
22. b) Non-preemptive task transfer
c) Load discharge task transfer
d) Anticipatory task transfer
Answer:-d
Show which one is not a task transfer category.
d) None of above
Answer:-c
Show a task transfer technique in which partially executed task is transferred.
d) None of above
Answer:-a
Show which one is a component of distributed scheduling algorithms.
a) Transfer policy
25. b) Selection policy
c) Location policy
d) All of above.
Answer:-d
Show which one is not a component of distributed scheduling algorithms.
a) Information policy
26. b) Randomization policy
c) Location policy
d) Selection policy
Answer:-b
Show which one is a load distributing algorithm.
a) Sender Initiated
27. b) Receiver initiated
c) Symmetric
d) All of above
Answer:-d
What a system is called when it cannot meet its promises.
a) Crashed system
28. b) Faulty system
c) Damage system
d) Failed system
Answer:-d
Which one is not a type of fault?
a) Transient
29. b) Intermittent
c) Permanent
d) None of above
Answer:-d
Which one is a type of failure?
a) Crash
30. b) Omission
c) Timing
d) All of above
Answer:-d
Which one is not a type of failure masking by redundancy?
31.
a) Place redundancy
b) Information redundancy
c) Time Redundancy
d) Physical Redundancy
Answer:-a
What are the important steps followed when recovery from failure happens?
a) Post repairing integration with main system should happen smoothly and
gracefully
32. b) Upon link failure both parties at end must not be notified
c) Fault recovery system must me adjusted
d) Failures are logged systematically
Answer:-a
What are different ways in which distributed system may suffer?
a) Link failure
33. b) Site failure
c) Loss of message
d) All of above
Answer:-d
What are the things transaction coordinator is responsible for?
a) Starting the execution of the transaction
34. b) Breaking transaction into no of sub transaction
c) Coordinating the termination of the transaction
d) All of above
Answer:-d
What is the disadvantage of majority protocol?
a) Complicated implementation
35. b) Deadlock cannot occur easily
c) Bottleneck
d) All of above
Answer:-a
What detects link and site failure in distributed system?
a) Polling
36. b) Handshaking
c) Token passing
d) None of above
Answer:-b
Which one is not an error recovery technique?
a) Backward
37. b) Downward
c) Forward
d) None of above
Answer:-b
Which one is a technique of recovering from system failure?
a) Amnesia
38. b) Pause
c) Halting
d) All of above
Answer:-d
Which one is a type of failure?
39. a) Communication failure
b) Secondary storage failure
c) Process failure
d) All of above
Answer:-d
What is an anomalous physical condition in a system called?
a) Failure
40. b) Error
c) Damage
d) Fault
Answer:-d

Semester: 8 Sem Subject: DOS Quiz Bank

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Semester: 8 Sem Subject: DOS Quiz Bank

Uploaded by

Copyright:

Available Formats

Semester : 8thSem Subject : DOS

1. In distributed system each processor has its own

Prepared By –Ms. Reena Thakur

Semester : 8th Sem Subject: DOS

Sr. Question Options Correct Answer

Semester : 8th Sem Subject: DOS

Sr. Question Options Correct Answer

A situation in which a single failure can

As the load is increased response time is

Concurrent access of processes to a

Coordinator sends a COMMIT-REQUEST

Each event in process Pi ~ vector clock

If data is brought to the location of

If the nature of the errors and damages

If the nature of the errors and damages

In a distributed system, ____________or a

In two phase commit protocol one of

In Update-in-Place, every update or

In_______, all processors execute the

The algorithm in which each site Suzuki-

The lack of common memory and

The Makewas Algorithm require

The methods devised to make local and Process

The Raymond Algorithm requires

The resource owned and controlled by

The resource owned and controlled by

The response time for for Makewas’s

When process dies it is important that

112 In case of failure, a new transaction

114 According to the ring algorithm, links

No Question Option Answer

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

DEVELOPED & CREATED BY UJWAL AND ABHIJEET |

137. A deadlock avoidance algorithm dynamically examines the a) resource allocation