1.
In distributed system, each processor has its own ___________a) local memoryb)
clockc) both local memory and clockd) none of the mentioned
Answer: cClarification: None.
2. If one site fails in distributed system then ___________a) the remaining sites
can continue operatingb) all the sites will stop workingc) directly connected sites
will stop workingd) none of the mentioned
Answer: aClarification: None.
3. Network operating system runs on ___________a) serverb) every system in the
networkc) both server and every system in the networkd) none of the mentioned
Answer: aClarification: None.
4. Which technique is based on compile-time program transformation for accessing
remote data in a distributed-memory parallel system?a) cache coherence schemeb)
computation migrationc) remote procedure calld) message passing
Answer: bClarification: None.
5. Logical extension of computation migration is ___________a) process migrationb)
system migrationc) thread migrationd) data migration
Answer: aClarification: None.
6. Processes on the remote systems are identified by ___________a) host IDb) host
name and identifierc) identifierd) process ID
Answer: bClarification: None.
7. Which routing technique is used in a distributed system?a) fixed routingb)
virtual routingc) dynamic routingd) all of the mentioned
Answer: dClarification: None.
8. In distributed systems, link and site failure is detected by ___________a)
pollingb) handshakingc) token passingd) none of the mentioned
Answer: bClarification: None.
9. The capability of a system to adapt the increased service load is called
___________a) scalabilityb) tolerancec) capacityd) none of the mentioned
Answer: aClarification: None.
10. Internet provides _______ for remote login.a) telnetb) httpc) ftpd) rpc
Answer: aClarification: None.
1. What is not true about a distributed system?a) It is a collection of processorb)
All processors are synchronizedc) They do not share memoryd) None of the mentioned
Answer: b
2. What are the characteristics of processor in distributed system?a) They vary in
size and functionb) They are same in size and functionc) They are manufactured with
single purposed) They are real-time devices
Answer: a
3. What are the characteristics of a distributed file system?a) Its users, servers
and storage devices are dispersedb) Service activity is not carried out across the
networkc) They have single centralized data repositoryd) There are multiple
dependent storage devices
Answer: a
4. What is not a major reason for building distributed systems?a) Resource sharing
b) Computation speedupc) Reliabilityd) Simplicity
Answer: d
5. What are the types of distributed operating system?a) Network Operating systemb)
Zone based Operating systemc) Level based Operating systemd) All of the mentioned
Answer: aClarification: None.
6. What are characteristic of Network Operating Systems?a) Users are aware of
multiplicity of machinesb) They are transparentc) They are simple to used) All of
the mentioned
Answer: a
7. How is access to resources of various machines is done?a) Remote logging using
ssh or telnetb) Zone are configured for automatic accessc) FTP is not usedd) All of
the mentioned
Answer: aClarification: None.
8. What are the characteristics of Distributed Operating system?a) Users are aware
of multiplicity of machinesb) Access is done like local resourcesc) Users are aware
of multiplicity of machinesd) They have multiple zones to access files
Answer: bClarification: None.
9. What are the characteristics of data migration?a) transfer data by entire file
or immediate portion requiredb) transfer the computation rather than the datac)
execute an entire process or parts of it at different sitesd) none of the mentioned
Answer: aClarification: None.
10. What are the characteristics of computation migration?a) transfer data by
entire file or immediate portion requiredb) transfer the computation rather than
the datac) execute an entire process or parts of it at different sitesd) none of
the mentioned
Answer: bClarification: None.
11. What are the characteristics of process migration?a) transfer data by entire
file or immediate portion requiredb) transfer the computation rather than the data
c) execute an entire process or parts of it at different sitesd) none of the
mentioned
Answer: cClarification: None.
Distributed System MCQ Part-1
1.Resources and clients transparency that allows movement
within a system is called ____________________
(A) Mobility transparency
(B) Concurrency transparency
(C) Replication transparency
(D) Performance transparency
2.A distributed system :-
a. is defined as a collection of autonomous computers linked by a
network with software designed to produce an integrated
computing facility
b. is defined as a collection of autonomous computers not linked
by a network with software designed to produce an integrated
computing facility
c. is defined as a collection of autonomous computers(limited to
100) linked by a network with software
d.none of the above
3.Which amongst the following is not an advantage of Distributed
systems?
(A) Resource sharing
(B) Incremental growth
(C) Reliability
(D) None of the above
4.If one site fails in distributed system, ___________
(A) the remaining sites can continue operating
(B) all the sites will stop working
(C) directly connected sites will stop working
(D) none of the mentioned
5.The capability of a system to adapt the increased service load is
called _________
(A) capacity
(B) tolerance
(C) scalability
(D) none of the mentioned
6.What are characteristic of Network Operating Systems ?
(A) Users are aware of multiplicity of machines
(B) They are transparent
(C) They are simple to use
(D) All of the mentioned
7.What is the characteristics of atomicity ?
(A) Use communication links
(B) One processor as coordinator which handles all requests
(C) When responses are received from all processes, then process
can enter its Critical Section
(D) All operations associated are executed to completion or none
are performed
8.Network operating system runs on ___________
(A) every system in the network
(B) server
(C) both server and every system in the network
(D) none of the mentioned
9.The transparency that enables multiple instances of resources
to be used, is called ____________
(A) Performance transparency
(B) Scaling transparency
(C) Concurrency transparency
(D) Replication transparency
10.A set of highly integrated machines that run the same process
in parallel is known to be ___________
(A) Space based
(B) Loosely coupled
(C) Tightly coupled
(D) Peer-to-Peer
11.Which of the following will be true distributed system ?
(A) tightly-coupled software on loosely-coupled hardware
(B) loosely-coupled software 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 resource sharing
(C) better system utilization
(D) low system overhead
13.Scalability basically refers to the size of the network that is to
be used and it consists for various sizes. Thus this may create
some problems in the network. To solve the scalability problem,
which are basically three techniques for scaling?
I. Hiding communication latencies
II. Distribution
III. Replication
(A) I, III (B) II, III
(C) I, II (D) I, II, III
14.Distributed OS works on the ________ principle.
(A) File Foundation
(B) Multi system image
(C) Single system image
(D) Networking image
15.Distributed systems do not have __________
(A) high security
(B) better resource sharing
(C) scalability
(D) tightly coupled software
16.What is not true about distributed system ?
(A) It is a collection of processor
(B) All processors are synchronized
(C) They do not share memory
(D) None of the mentioned
17.What are characteristics of Distributed Operating system ?
(A) Access is done like local resources
(B) Users are aware of multiplicity of machines
(C) none of above
(D) They have multiple zones to access files
18.In distributed file system, when a file’s physical storage
location changes ________________
(A) file name need to be changed
(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
19.All the resources are tightly coupled in the computing
paradigm of __________
(A) Cloud computing
(B) Parallel computing
(C) Distributed computing
(D) Centralized computing
20.The transparency that enables accessing local and remote
resources using identical operations is called ____________
(A) Access transparency
(B) Concurrency transparency
(C) Performance transparency
(D) Scaling transparency
21.Individual wires from machine to machine, with many different
wiring patterns in use is an example of _________
(A) Switched
(B) Bus
(C) Both
(D) None of the mentioned
22.There are four requirements in the design of a distributed
system. Choose the correct combination from the list below.
(A) Network performance, Quality of Service (QoS), Caching and
replication, Dependability issues
(B) Network dependency, Quantity of Service (QoS), Cookies and
replication, Dependability issues.
(C) Network integrity, Quality of Software (QoS), Caching and
alteration, Dependability issues
(D) Network Accessibility, Quality of hardware (QoH), Caching and
replication, Dependability issues.
23.Concurrency is one of the intrinsic characteristics of distributed
systems. Here, Parallel executions occurs because __________
(A) Many users simultaneously invoke commands or interact with
(the same) application programs.
(B) Many server processes run concurrently, each corresponding
to a single request from a client process.
(C) A and B Both
(D) None of these
24."Consider the two statements.
(A) A network operating system, the users access remote
resources in the same manner as local resource.
(B) In a distributed operating system, the user can access remote
resources either by logging into the appropriate remote machine
or transferring data from the remote machine to their own
machine. Which of the statement is true?
(A) A true, B false
(B) B true, A false
(C) Both A and B false
(D) Both A and B true
25. Location transparency allows for which of the
following?
(A) Users to treat the data as if it is at one location
(B) Programmers to treat the data as if it is at one location
(C) Managers to treat the data as if it is at one location
(D) All of the above.
26. What are the Advantages of Distributed
Systems over Independent PCs?
(A) Data sharing
(B) Resource Sharing
(C) Communication
(D) All of the above
27.The characteristics of a distributed system are :
(A) Resource sharing, heterogeneity, openness, security
(B) Scalability, fault handling
(C) Concurrency, transparency
(D) ALL are acceptable answers
28.Which are the characteristics of a decentralized algorithms:
I. No machine has complete information about the system state.
II. Machines make decisions based only on local information.
III. Failure of one machine does not damage the algorithm.
IV. There is no implicit assumption that a global clock exist
(A) I, II, IV (B) II, III, IV
(C) I, II, III, IV (D) I, II, III
29.What is not a major reason for building distributed systems ?
(A) Resource sharing
(B) Computation speedup
(C) Reliability
(D) Simplicity
30.What are design issues in distributed system structure ?
(A) Scalability
(B) Fault-tolerance
(C) Flexibility
(D) All of the mentioned
Distributed System MCQ Part-2
1.Which layer is the layer closest to the transmission
medium ?
(A) Physical
(B) Data link
(C) Network
(D) Transport
2.In a distributed system, information is exchanged
through _______
(A) Memory sharing
(B) information not exchanged
(C) Message passing
(D) None of the mentioned
3.RPC (remote procedure call) is initiated by the
__________
(A) server
(B) client
(C) both (a) and (b)
(D) neither (a) nor (b)
4.In a peer-to-peer architecture, peers can serve as
__________
(A) Clients
(B) Servers
(C) Middle-system
(D) Both A and B
5.The ___________ layer, which provides the
interface that client and server application objects
use to interact with each other.
(A) Increasing
(B) Count
(C) Bit
(D) Stub/skeleton
6.Desirable features of a good message passing
system are _______
I. Simplicity II. Uniform Semantics
III. Efficiency IV. Correctness
(A) I,II
(B) II, III
(C) I, IV
(D) I,II, III, IV
7.Remote Procedure Calls are used :
(A) for communication between two processes remotely different from
each other on the same system
(B) for communication between two processes on the same system
(C) for communication between two processes on separate systems
(D) None of these
8.The stub :
(A) transmits the message to the server where the server side stub
receives the message and invokes procedure on the server side
(B) packs the parameters into a form transmittable over the network
(C) locates the port on the server
(D) all of the mentioned
9.In Message-Passing Systems ,A message-passing
facility provides at least two operations:
(A) send(message) and delete(message)
(B) delete(message) and receive (message)
(C) send(message) and receive(message)
(D) write(message) and delete(message)
10.A process that is based on IPC mechanism which
executes on different systems and can communicate
with other processes using message based
communication, is called ________.
(A) Local Procedure Call
(B) Inter Process Communication
(C) Remote Procedure Call
(D) Remote Machine Invocation
11.The local operating system on the server machine
passes the incoming packets to the _________
(A) server stub
(B) client stub
(C) client operating system
(D) none of the above
12.Machine that places the request to access the
data is generally called as __________.
(A) Server Machine
(B) Client Machine
(C) Request Machine
(D) None of the above
13.An RPC (remote procedure call) is initiated by the
________
(A) server
(B) client
(C) both (a) and (b)
(D) none of the mentioned
14.The applications of the Client and Server Model
are ___________
(A) World Wide Web
(B) Network Printing
(C) Email
(D) All of the mentioned
15.________________ provides programmers a
familiar programming model by extending the local
procedure call to a distributed environment.
(A) Distributed environment
(B) Permanent procedure call
(C) Process and file
(D) Remote procedure call
16.An architecture where clients first communicate
the server for data then format and display it to the
users, is known as ___________
(A) Client/Server architecture
(B) Three-tier architecture
(C) Two-tier architecture
(D) Peer-to-Peer architecture
17.What are the advantages of client-server model?
(A) Efficiency
(B) Simplicity
(C) Two system calls send and receive
(D) All of the above
18.The single most important difference between a
distributed system and a uniprocessor system is the
________
(A) Interprocess communication
(B) Remote procedure call
(C) Both
(D) None of the mentioned
19._________ is an object acting as a gateway for the
client side.
(A) skeleton
(B) stub
(C) remote
(D) server
20.Message passing provides a mechanism to allow
processes to communicate and to synchronize their
actions ________
(A) By sharing the same address space
(B) without sharing the same address space
(C) by sharing the same process number and Process Identifier
(D) None of the above
21.Which are two fundamental models of
interprocess communication: I. Shared memory II.
Message passing. III. Independent IV. Cooperating
(A) I and II
(B) II and III
(C) III and IV
(D) I and IV
22.The TCP/IP reference model has 4 layers. Choose
the correct layers.
(A) Host-to-network layer; network or IP (Internet Protocol) layer; transport
or TCP (Transmission Control Protocol) layer; application layer
(B) Host-to-host layer; network or IP (Intranet Protocol) layer; transport or
TCP (Transmission Control Protocol) layer; application layer
(C) Network-to-network layer; network or IP (Internet Protocol) layer;
transport or TCP (Transmission Control Protocol) layer; application layer
(D) Network-to-host layer; FTP (File Transfer Protocol) layer; transport or
TCP (Transmission Control Protocol) layer; application layer
23.Which layer is responsible for The process-to-
process delivery ?
(A) Network
(B) Transport
(C) Application
(D) Physical
24.In remote procedure call, the client program must
be bound with a small library procedure called
__________
(A) Server stub
(B) Marshalling
(C) Local Procedure Call
(D) Client hub
25.Internet provides _______ for remote login.
(A) telnet
(B) http
(C) ftp
(D) RPC
26.The header usually consists of the following
elements in IPC
I. Sequence number II. Structural information
III. Address IV. File mode(Read/ Write
(A) I,III, IV
(B) I,II, III
(C) I, II, IV
(D) none of the mentioned
27.RPC provides a(an) _____ on the client side, a
separate one for each remote procedure.
(A) stub
(B) identifier
(C) name
(D) process identifier
28.RPC connectors and message queues are
mechanisms for ______
(A) Message retrieving
(B) Message passing
(C) Message delivering
(D) Message Sync-ing
29.A global system of interconnected computer
networks is known as ________
(A) Ethernet
(B) Intranet
(C) Internet
(D) Ultra-net
Distributed System MCQ Part-3
1. What is common problem found in distributed system ?
(A) Process Synchronization
(B) Communication synchronization
(C) Deadlock problem
(D) Power failure
2.If timestamps of two events are same, then the events
are ___________________
(A) concurrent
(B) non-concurrent
(C) monotonic
(D) non-monotonic
3.If a process is executing in its critical section,
____________________
(A) any other process can also execute in its 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
4.A process can enter into its critical section
__________________
(A) anytime
(B) when it receives a reply message from its parent process
(C) when it receives a reply message from all other processes in the system
(D) none of the mentioned
5.For proper synchronization in distributed systems
____________
(A) prevention from the deadlock is must
(B) prevention from the starvation is must
(C) prevention from the deadlock & starvation is must
(D) none of the mentioned
C
6.In the token passing approach of distributed systems,
processes are organized in a ring structure
_______________
(A) logically
(B) physically
(C) both logically and physically
(D) none of the mentioned
7.In case of failure, a new transaction coordinator can be
elected by ____________
(A) Cristian's Algorithm
(B) Bully algorithm
(C) Both bully and Cristian's algorithm
(D) None of the mentioned
8.In distributed systems, election algorithms assumes
that __________________
(A) a unique priority number is associated with each active process in system
(B) there is no priority number associated with any process
(C) priority of the processes is not required
(D) none of the mentioned
9.According to the ring algorithm, links between
processes are ______________________
(A) Bidirectional
(B) Unidirectional
(C) Both bidirectional and unidirectional
(D) None of the mentioned
B
10.What are the characteristics of mutual exclusion using
centralized approach ?
(A) One processor as coordinator which handles all requests
(B) It requires request,reply and release per critical section entry
(C) The method is free from starvation
(D) All of the mentioned
11.What are 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
12.What are the advantages of token(with rings) passing
approach ?
I. One processor as coordinator which handles all
requests
II. No starvation if the ring is unidirectional
III. There are many messages passed per section entered
if few users want to get in section
IV. One processor as coordinator which handles all
requests
V. Only one message/entry if everyone wants to get in
(A) I, II and V
(B) I, II and IV
(C) II, III and IV
(D) II, IV and V
B
13.Single coordinator approach has the following
advantages :
(A) Simple implementation
(B) Simple deadlock handling
(C) Bottleneck
(D) All of the mentioned
14.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
15.If an old process wants a resource held by a young
process, the old one will wait happens in _________
(A) Wait-die
(B) Wound-wait
(C) Both
(D) None of the mentioned
16.If an old process wants a resource held by a young
process, the old one will preempt the young process
wounded and killed, restarts and wait happens in
___________
(A) Wait-die
(B) Wound-wait
(C) Both
(D) None of the mentioned
17.In wound-wait If a young process wants a resource
held by an old process, the young process will _____
(A) Killed
(B) Wait
(C) Preempt
(D) Restarts and wait
B
18.Election message is always sent to the process with
_______
(A) Lower numbers
(B) Waiting processes
(C) Higher numbers
(D) Requesting Lower number of resources
19.Which algorithms are used to handle mutual exclusion
in distributed systems?
(A) Centralized
(B) Distributed
(C) Token ring
(D) All of the mentioned
20.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
21.What is UTC ?
(A) Universal Centralized Time
(B) Unique Coordinated Time
(C) Universal Coordinated Time
(D) Unique Centralized Time
22.In Cristian algorithm the time sever is ________
(A) Passive
(B) Active
(C) Some internal passive some interval active
(D) None of the mentioned
A
23.What are the problems of clock synchronization in
distributed operating systems ? I. Processses make
decision based only on local information II. The relevent
information is scattered among multiple machines III. A
single point of failure in the system should be avoided IV.
No common clock or other precise global time source
exists
(A) II, III and IV
(B) I, II and IV
(C) I, III and IV
(D) I, II, III, IV
24.A ____________is a quartz crystal that oscillates at a
well-defined frequency.
(A) Counter register
(B) Quartz crystal
(C) Constant register
(D) None of the mentioned
25.The ______________ is used to store a constant value
that is decided based on the frequency of oscillation of
the quartz crystal.
(A) Counter register
(B) Quartz crystal
(C) Constant register
(D) None of the mentioned
26.The ____________ is used to keep track of the
oscillations of the quartz crystal.
(A) Counter register
(B) Quartz crystal
(C) Constant register
(D) None of the mentioned
A
27.An external time source that is often used as a
reference for synchronizing computer clocks with real
time is the ______________
(A) Universal Centralized Time
(B) Unique Coordinated Time
(C) Unique Centralized Time
(D) Universal Coordinated Time
28.Two clocks are said to be synchronized at a particular
instance of time if the difference in time values of the two
clocks is less than some specified constant. The
difference in time values of two clocks is called
___________.
(A) Clock Frequency
(B) Clock drift
(C) Clock skew
(D) Clock Ticks
29.The computer clock differs from the real time clock is
known as ___________
(A) Quartz crystal
(B) Clock drift
(C) Clock skew
(D) None of the mentioned
30.In ________________________ each node periodically
sends a message to the time server.
(A) Passive Time Server Centralized Algorithm
(B) Active Time Server Centralized Algorithm
(C) Global Averaging Distributed Algorithms
(D) Localized Averaging Distributed Algorithms
31.Cristian’s Algorithm is ______________
(A) Passive Time Server Algorithm
(B) Active Time Server Algorithm
(C) both (a) and (b)
(D) None of the mentioned
A
32.Berkeley Algorithm is ____________
(A) Passive Time Server Algorithm
(B) Active Time Server Algorithm
(C) both (a) and (b)
(D) None of the mentioned
33.The difference between logical and physical clocks ?
(A) Logical clocks measure the time of day and Physical clocks are used to mark
relationships among events in a distributed system.
(B) Both are the same
(C) Physical clocks measure the time of day and Logical clocks are used to mark
relationships among events in a distributed system.
(D) None of the mentioned
34.__________ is a process that prevents multiple threads
or processes from accessing shared resources at the
same time.
(A) Critical section
(B) Deadlock
(C) Message passing
(D) Mutual Exclusion
35.In which algorithm, One process is elected as the
coordinator.
(A) Distributed mutual exclusion algorithm
(B) Centralized mutual exclusion algorithm
(C) Token ring algorithm
(D) None of the mentioned
36.When resources have multiple instances ________ is
used for deadlock Avoidance.
(A) Bankers algorithm
(B) Resource Allocation Graph
(C) Semaphores
(D) All of these
A
37.The Bankers algorithm is used ____________
(A) to prevent deadlock
(B) to rectify deadlock
(C) to detect deadlock
(D) to solve deadlock
