Dcs Mcqs
Dcs Mcqs
Dcs Mcqs
Q1. According to the ring algorithm, links between processes are _____________.
A) Bidirectional
B) Unidirectional
C) both bidirectional and unidirectional
D) None of the mentioned
Answer B
Q2. 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
Answer A
Q3. In case of failure, a new transaction coordinator can be elected by ____________.
A) bully algorithm
B) ring algorithm
C) both bully and ring algorithm
D) None of the mentioned
Answer C
Q4 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
Answer A
Q5 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
Answer C
Q6 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
Answer B
Q7 Remote Procedure Calls are used ____________.
for communication between two processes remotely different from each other on the same
A)
system
B) for communication between two processes on the same system
C) for communication between two processes on separate systems
D) none of the mentioned
Answer C
Q8 RPC provides a(an) _____ on the client side, a separate one for each remote procedure.
A) Stub
B) Identifier
C) Name
D) process identifier
Answer A
Q9 What is stub?
transmits the message to the server where the server side stub receives the message and
A)
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
Answer D
Q10 What is the full form of RMI?
A) Remote Memory Installation
B) Remote Memory Invocation
C) Remote Method Installation
D) Remote Method Invocation
Answer D
Q11 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
Answer C
Q12 The remote method invocation __________.
A) allows a process to invoke memory on a remote object
B) allows a thread to invoke a method on a remote object
C) allows a thread to invoke memory on a remote object
D) allows a process to invoke a method on a remote object
Answer B
Q13 With persistent communication a message that has been submitted for transmission is stored by
the communication middleware as long as it takes to deliver it to the receiver
A) TRUE
B) FALSE
Answer A
Q14 With Synchronous communication the sender is blocked until its request is known to be accepted.
A) TRUE
B) FALSE
Answer A
Q15 With Asynchronous communication the sender is blocked until its request is known to be accepted
A) TRUE
B) FALSE
Answer B
Q16 Copy sharing in interprocess communication is also known as _____________.
A) Shared-data approach
B) Message-passing approach
C) Original Sharing
D) All of the above
Answer B
Q17 What are the characteristics of interprocess communication?
A) Reliability
B) Ordering
C) Both A and B
D) none of the mentioned
Answer C
Q18 Electronic mail system is an example of _______________.
A) Transient Communication
B) Persistent Communication
C) Ordering
D) Message Destinations
Answer B
Q19 This characteristic enables delivery of same message to the members of a set of processes.
A) Reliability
B) Ordering
C) Asynchronous Communication
D) Message Destinations
Answer D
Q20 Which socket primitive for TCP/IP Blocks caller until a connection request arrives?
A) Listen
B) Receive
C) Accept
D) Bind
Answer C
Q21 Which socket primitive for TCP/IP Actively attempts to establish a connection?
A) Connect
B) Socket
C) Listen
D) Receive
Answer A
Q22 Original data types are organized into a binary format in which data representation?
A) Java’s object serialization
B) CDR
C) XML
D) All of the above
Answer B
Q23 Which of the following is NOT the type of overlay networks?
A) Multicast
B) Resilience
C) Distributed hash tables
D) Consistent
Answer D
Q24 Which overlay network offers tailored routing protocols?
A) Disruption-tolerant
B) Content Distribution
C) Distributed hash tables
D) Wireless ad-hoc
Answer D
Q25 Which overlay network works on obtainability or accessibility of internet paths?
A) Disruption-tolerant
B) Content Distribution
C) Resilience
D) Multicast
Answer C
Q26 Which of the following is NOT the feature of MPI?
A) Reliability
B) Correctness
C) Security
D) Parallelism
Answer D
Q27 Piggybacking is one of the optimizations assumed for ______________ feature of MPI.
A) Reliability
B) Efficiency
C) Security
D) Uniform Semantics
Answer B
Q28 Atomicity, Ordered delivery and Survivability are the issues related to _____________.
A) Reliability
B) Correctness
C) Security
D) Flexibility
Answer B
Q29 Can Remote Procedure used as an IPC mechanism to communicate between different processes?
A) YES
B) NO
Answer A
Q30 Categories of Request-Reply protocols are:
A) Request/Reply/Acknowledge-Reply
B) Request
C) Both A and B
D) None of the mentioned
Answer C
Q31 Which of the following is NOT an element of program for executing RPC mechanism?
A) RPC Runtime
B) Server stub
C) Server
D) Database
Answer D
Q32 Stubs cab be generated ___________-.
A) Manually
B) Automatically
C) Both A and B
D) None of the mentioned
Answer
Q33 e-mail protocols, Web access protocols, file-transfer protocols are implemented at _____________
layer.
A) Presentation layer
B) Application layer
C) Transport layer
D) Session layer
Answer B
Q34 A ____________ is a communication end point to which an application can write data that are to
be sent out over the underlying network, and from which incoming data can be read.
A) Message Passing Interface
B) Socket
C) Message-Oriented Middleware
D) None of the mentioned
Answer B
Q35 _____________ is designed for parallel applications and is tailored to transient communication.
A) Message Passing Interface
B) socket
C) Message-Oriented Middleware
D) None of the mentioned
Answer A
Q36 Which of the following desceibes the MPI messaging operation MPI_ssend.
A) Send a message and wait until copied to local or remote buffer
B) Send a message and wait for reply
C) Send a message and wait until transmission starts
D) None of the mentioned
Answer C
Q37 In MPI, which of the following operations is used to append outgoing message to a local send
buffer?
A) MPI_isend
B) MPI_bsend
C) MPI_ssend
D) MPI_send
Answer B
Q38 MPI_sendrecv is the strongest form of synchronous communication.
A) TRUE
B) FALSE
Answer A
Q39 _______________ provide extensive support for persistent asynchronous communication.
A) socket
B) Message-queuing systems
C) Message Passing Interface
D) None of the mentioned
Answer B
Q40 Clock synchronization is to keep the clocks precise (internal synchronization) or accurate (external
synchronization).
A) TRUE
B) FALSE
Answer A
Q41 The goal of the Berkeley algorithm is to achieve synchronization by getting all processes to set
their clocks to the average of all the clocks in the system.
A) TRUE
B) FALSE
Answer A
Q42 The Berkeley algorithm is ____________ clock synchronization algorithm.
A) external
B) internal
C) Both A and B
D) None of the mentioned
Answer B
Q43 __________________ algorithm forces a resequencing of timestamps to ensure that the relation
“→” (happens-before relation) is properly preserved throughout a system of processes.
A) Berkeley
B) Lamport
C) Both A and B
D) None of the mentioned
Answer B
Q44 In distributed systems, a logical clock is associated with ______________
A) each instruction
B) each process
C) each register
D) None of the mentioned
Answer B
Q45 Distributed mutual exclusion algorithms can be classified into token-based solutions and
permission-based approach
A) TRUE
B) FALSE
Answer A
Q46 Ricart and Agrawala, token-ring algorithm are used for _____________.
A) deadlock prevention
B) mutual exclusion
C) clock synchronization
D) None of the mentioned
Answer B
UNIT III - REPLICATION AND FAULT TOLERANCE