Amoeba and the Cambridge are the examples of _______________ based on ______________.

A) DCE and processor pool model

B) Centralized Computing Environment and work station Server model

C) Distributed system model and Workstation model

D) Destributed System and Hybrid Model

ANSWER: A

In __________________ system there is a single systemwide primary memory (address space) that is
shared by all the processors.

A) Tightly coupled system

B) Loosely coupled system

C) Both Tightly coupled system and Loosely coupled system

D) None of these.

ANSWER: A

User should not need or be able to recognize whether a resource is remote or local is called as_____

A) Access Transparancy

B) resource transparency

C) migration transparency

D) concurrency transparency

ANSWER: A

The most important features commonly used to differentiate between network operating systems
and distributed operating systems are______

A) System image and autonomy capabilities.

B) System image, autonomy and fault tolerance capabilities.

C) System image only

D) autonomy capabilities only

ANSWER: B

if the Distributed system is to be designed to tolerate k fail-stop failures, _________replicas of the

resources are needed.

A) k+1

B) k-1

C) k*2

D) k+2
ANSWER: A

What is the use of, the Cell Directory Service (CDS), the Global Directory Service (GDS), and the
Global Directory Agent (GDA).

A) To allow resources such as servers, files, devices, and so on, to be uniquelynamed and accessed in
a location-transparent manner.

B) To dis-allow resources such as servers, files, devices, and so on, to be uniquelynamed and
accessed in a location-transparent manner.

C) To migrate DCE components smoothly.

D) To protect Systems from all kinds of failures.

ANSWER: A

What is the long-form of NIST with respect to the Distributed computing environment?

A) National Institute for Standards and Technology

B) Nationwide Institutes for Standards Technology

C) National Institute for Science and Technology

D) National Institute for Standards and Terminology

ANSWER: A

What is the primary goal of DCE?

A) A primary goal of DCE is vendor independence.

B) A primary goal of DCE is Hyderogenity independence.

C) A primary goal of DCE is Platform independence.

D) None of the above

ANSWER: A

Which Distributed Computing model is used if the user does not need any computing power but
once in a while he or she may need a very large amount of computing power for a short time.

A) Processor-Pool Model

B) Workstation-Server Model

C) Hybrid model

D) Workstation model.

ANSWER: A

What is the use of the Sequence number field in message structure with respect to Inter-Process
Communication?

A) For identifying lost messages

B) For identifying duplicate messages

C) Both "For identifying lost messages" and "For identifying duplicate messages"

D) It is just a place holder in the Message Header.

ANSWER: C

Matrix Algorithm works for

A) Unicast message passing only

B) multicast message passing only

C) Broad caste message passing only.

D) All of the mentioned.

ANSWER: D

With respect to nonblocking receive primitive, how the receiving process knows that the message
has arrived in the message buffer.

A) With the help of Polling.

B) With the help of Probe massage.

C) With the help of acknowledgement.

D) With the help of Message header

ANSWER: A

[Identify the communication mode in IPC .]Identify the Communication mode , in IPC

A) Synchronous mode of communication, with both send and receive primitives having blocking
mode

B) Asynchronous mode of communication, with both send and receive primitives having blocking
mode

C) Synchronous mode of communication, with both send and receive primitiveshaving Non-blocking
mode

D) Asynchronous mode of communication, with both send and receive primitives having Non
blocking mode.

ANSWER: A

Multicasting in IPC is ______________

A) an asynchronous communication mechanism.

B) an synchronous communication mechanism.

C) Hybrid

D) None of them

ANSWER: A
In one-to-many communication, the degree of reliability is normally expressed in the form of
_______

A) The O-reliable

B) The l-reliable

C) The m-out-of-n-reliable

D) All of the mentioned.

ANSWER: D

Reply-Caches are used for_____________.

A) Duplicate Request messages from Clients.

B) Duplicate Response messages from Servers.

C) Blocking request calls from clients.

D) Non Blocking Requests from Clients.

ANSWER: A

BSS Birman-Schiper-Stephenson algorithm is used for __________________

A) Causal ordering of the multicast messages.

B) Absolute ordering of the multicast messages.

C) Consistent ordering of the multicast messages.

D) Hybrid ordering of the multicast messages.

ANSWER: A

RPC is used for ________________.

A) Inter-Process Communication in distributed systems.

B) Detect Deadlocks in Distributed Systems.

C) Find out the Block hits in Distributed Shared Memory

D) Both Inter-Process Communication in distributed systems and Detect Deadlocks in Distributed

Systems.

ANSWER: A

Binding Agent usually has ____________________

A) Register primitive.

B) deregister primitive

C) lookup primitive

D) all the mentioned.

ANSWER: D
What do you mean by Syntactic transparency with respect to RPC?

A) It means that a remote procedure call should have exactly the same syntax as a local procedure
call.

B) It means that a remote procedure call should not have exactly the same syntax as a local
procedure call.

C) Both client and server are transparent from each other

D) None of the mentioned.

ANSWER: A

Remote procedure calls consume_________________ than Local procedure calls.

A) 100-1000 times more

B) 10-100 times more.

C) 100 times more

D) 50 - 100 times more

ANSWER: A

RPCRuntime handles _______________________

A) transmission of messages across the network between client and server machines.

B) Marshaling of the parameters.

C) Un-Marshaling of the parameters.

D) Both Marshaling and Un-marshaling of the request and response parameters.

ANSWER: A

What is the use of IDL with respect to RPC?

A) It is used to define the interface between a client and server.

B) It is used to make the client and server transparent from each other.

C) Its is used to generate the Client Stub and Server Stub.

D) Both " Its is used to generate the Client Stub and Server Stub." and "It is used to define the
interface between a client and server."

ANSWER: D

How exactly an Unsuccessful RPC reply message is identified?

A) If the Reply status field contains 0.

B) If the Reply status field contains any negative number.

C) If the Reply status field contains 1.

D) If the Reply status field contains 1 or any nonzero value.

ANSWER: D

With respect to RPC, what the above figure indicates?

A) Stateful file server

B) state less file Server.

C) Failure of a RPC call.

D) None of the mentioned.

ANSWER: A

The process by which a client becomes associated with a server so that calls can take place is known
as ________________.

A) binding

B) server locating

C) server naming

D) None

ANSWER: A

A computer clock usually consists of _________________

A) a quartz crystal

B) a counter register

C) constant register.

D) All the mentioned.

ANSWER: D

In the Bully algorithm, when the process having the priority number just below the failed
coordinator detects that the coordinator has failed, it immediately elects itself as the coordinator
and sending _______coordinator messages.

A) n-2

B) n/2

C) n-1

D) None.

ANSWER: A

For clocks based on a quartz crystal, the drift rate is approximately 10-6 (10 raised to 6) , giving a
difference of 1 second every _________________seconds, or ______________ days.

A) 1,000,000 seconds or 11.6 days

B) 1,000,00 seconds or 11.5 days

C) 10,000,000 seconds or 11.7 days

D) None.

ANSWER: A

Passive Time Server Centralized Algorithm. when the reply is received at the client's node, its clock is
readjusted to___________________.

A) T+(T1 - To)/2.

B) T+(T0 - T1)/2.

C) T+(T1 - To)/2+1.

D) T1+(T - To)/2.

ANSWER: A

Identify the correct statement with respect to Happened before relation.

A) If A and B are events in the same process and A occurs before B, then A -->B.

B) If A is the event of sending a message by one process and B is the event of thereceipt of the same
message by another process, then A -->B..

C) If A -->B and B-->C, then A-->C. That is, happened-before is a transitive relation.

D) All are correct

ANSWER: D

(dC/dT) < 1 represents __________________.

A) Its a representation of a Perfect Clock.

B) Its a representation of a Drift with slow Clock.

C) Its a representation of a Drift with fast Clock.

D) None.

ANSWER: B

Which of the following is not a CLOCK SYNCHRONIZATION ISSUE.

A) Two clocks can not be perfectly synchronized.

B) Un-Predictable Communication delays of clock message between two nodes.

C) Time must never run backward, because it causes repetition of certain operations, when fast clock
is set to slow down.

D) All the Machines sharing common shared memory.

ANSWER: D

In the worst case bully algorithm requires ________________ and in the best case it requires
________________.
A) O (n2) messages and n-2 messages

B) O (n2) messages and n-1 messages

C) O [No] messages and n-1 messages

D) O [No] messages and n-2 messages

ANSWER: A

in the ring algorithm, irrespective of which process detects the failure of the coordinator and
initiates an election, an election always requires ________________ messages

A) 2(n-1) messages.

B) 2n messages.

C) 2(n-2) messages.

D) only n messages.

ANSWER: A

In the mutual exclusion algorithm, _____ dictates that requests must be executed in the order they
are made.

A) Starvation

B) Tolerance

C) Fairness

D) Deadlock

ANSWER: C

What is the drawback of the distributed approach for implementing mutual exclusion?

A) It liable of n point of failure

B) Waiting time may large if too many processes in the system

C) Needs to detect failure of coordinator

D) Both "It liable of n point of failure" and "Waiting time may large if too many processes in the
system"

ANSWER: B

Lamport algorithm executes critical section requests in the _____ order of timestamps.

A) Increasing

B) Decreasing

C) random

D) none of these

ANSWER: A
Non-token based mutual exclusion algorithm logical clock are maintained and updated according to
______.

A) Maekawa’s algorithm

B) Ricart-agrawala

C) Lamport’s scheme

D) Generalized algorithm

ANSWER: C

Lamport’s algorithm requires messages to be delivered in the _____ order between every pair of
sites.

A) FIFO

B) critical section

C) LIFO

D) none of the above

ANSWER: A

The performance of the mutual exclusion algorithm is measured using _______ metrics

A) Number of messages necessary per CS invocation

B) Synchronization delay

C) Response time

D) All

ANSWER: D

The Richart agarwal algorithm requires _____________ message per critical section execution for n
number of sites.

A) 2n

B) 2(n – 1)

C) 2n + 1

D) n – 1

ANSWER: B

The Lamport’s algorithm requires _____________ message per critical section execution for N
number of sites.

A) 3(N-1)

B) 2(N-1)

C) (N-1)
D) 3N

ANSWER: A

In Maekawa’s algorithm, a site can grant permission to _________ site at a time.

A) Many site

B) Requesting site

C) Current site

D) Only one

ANSWER: D

Mitchell and Merritt's algorithm is a ____________ algorithm.

A) Edge-Chasing Distributed Deadlock Detection

B) Edge-Chasing Centralized Deadlock Detection

C) Path Pushing Distributed Deadlock Prevention

D) _Path Pushing Centralized Deadlock Avoidance_

ANSWER: A

The space complexity is the ____________registers and time complexity is ________time for n-
process bakery algorithm of shared memory mutual exclusion.

A) Upper bound of n, O(n2)

B) Upper bound of n, O[No]

C) Lower bound of n, O[No]

D) Lower bound of n, O(n2)

ANSWER: C

In wait for the graph (WFG), a directed edge from node P1 to node P2 indicates that:

A) P1 is blocked and is waiting for P2 to release some resource

B) P2 is blocked and is waiting for P1 to release some resource

C) P1 is blocked and is waiting for P2 to leave the system

D) P2 is blocked and is waiting for P1 to leave the system

ANSWER: A

A) Transmit State

B) Block state

C) Activate State
D) Detect State

ANSWER: A

Provide all the resources at once to a process is a _____________ stratergy.

A) Deadlock Prevention

B) Deadlock Avoidance

C) Deadlock Detection

D) None.

ANSWER: A

_________________ distributed deadlock detection algorithms uses _______________ to detect

deadlocks.

A) diffusion computation based , echo algorithms

B) Path pushing based, echo algorithms

C) Edge Chasing based, Non echo algorithms

D) Global State detection based, Non echo algorithms

ANSWER: A

In the _____________, a process can make a request for numerous resources simultaneously and
the request is satisfied if any one of the requested resource is granted.

A) OR model

B) AND model

C) AND-OR model

D) Single Resource model.

ANSWER: A

Maximum outdegree of a node in a WFG for the _____________model can be 1.

A) The Single resource model

B) the AND model

C) the OR model

D) none.

ANSWER: A

In the wait for graph, if there exists a directed cycle or knot:

A) then a deadlock does not exist

B) then a deadlock exists

C) then the system is in a safe state

D) either b or c

ANSWER: B

A deadlock detection algorithm must satisfy the following two conditions:Condition 1: Progress (No
false deadlocks): The algorithm should not report deadlockswhich do not exist.Condition 2: Safety
(No undetected deadlocks): The algorithm must detect all existingdeadlocks infinite both conditions
are true time.

A) Both conditions are true

B) Both conditions are false

C) Only condition 1 is true

D) Only condition 1 is true

ANSWER: B

A) (P): (i), Q: (ii), R: (iii), (S): (iv)

B) (P): (iv), Q: (iii), R: (ii), (S): (i)

C) (P): (iii), Q: (iv), R: (i), (S): (ii)

D) (P): (ii), Q: (iv), R: (i), (S): (iii)

ANSWER: B

Consider the following statements related to distributed deadlock detection algorithms:Statement 1:

In path-pushing algorithms, distributed deadlocks are detected by maintainingan explicit global
WFG. The basic idea is to build a global WFG for each site of thedistributed system.Statement 2: In
an edge-chasing algorithm, the presence of a cycle in a distributed graphstructure is be verified by
propagating special messages called probes, along the edges ofthe graph. These probe messages are
different than the request and reply messages.

A) Both statements are true

B) Both statements are false

C) Only statement 1 is true

D) Only statement 2 is true

ANSWER: D

Consider the following statements related to consistency models:(i) Strict consistency (SC): Only
Write operations issued by the same processor and to thesame memory location must be seen by
others in that order.(ii) PRAM memory: Only Write operations issued by the same processor are
seen by othersin the order they were issued, but Writes from different processors may be seen by
otherprocessors in different orders.(iii) Slow Memory: Any Read to a location (variable) is required to
return the value writtenby the most recent Write to that location (variable) as per a global time
reference.

A) All are True

B) All are False

C) Only (i) and (iii) are true

D) Only (ii) is true

ANSWER: D

Choose the correct consistency model that defines the following conditions:I. All Writes are
propagated to other processes, and all Writes done elsewhere are brought locally, at a sync
instruction.II. Accesses to sync variables are sequentially consistentIII. Access to sync variable is not
permitted unless all Writes elsewhere have completedIV. No data access is allowed until all previous
synchronization variable accesses have been performed

A) Weak consistency

B) Causal consistency

C) Processor consistency

D) Program consistency

ANSWER: A

Ho Ramamoorthy deadlock detection algorithm comes in the category of ________________.

A) Path Pushing

B) Edge-Chasing

C) Diffusion Computation

D) Global State detection

ANSWER: A

WHAT ARE THE CHARACTERISTICS OF THE 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

ANSWER: A

IN THE CASE OF____________ , CHANGES TO AN OPEN FILE ARE ONLY LOCALLY VISIBLE.

A) session semantics

B) immutable files

C) atomic transactions

D) None of the mentioned

ANSWER: A
What is an advantage with respect to the Bulk data transfer in the Distributed File System?

A) To obtain multiple number of blocks with a single seek.nObtain multiple number of blocks with a
single seeknObtain multiple number of blocks with a single seeknObtain multiple number of blocks
with a single seeknObtain multiple number of blocks with a single seeknObtain multiple number of
blocks with a single seek

B) Format, transfer large number of packets with a single context swith

C) Reduce the number of acknowledgements to be sent.

D) All of the mentioned.

ANSWER: D

Tuple Space is a repository that is used to store/retrieve objects, it works on the

___________________ principle.

A) Associative memory paradigm.

B) Collaborative memory paradigm

C) Random Access Memory paradigm

D) None.

ANSWER: A

Templates are _____________ used for ___________ of tuples from the tuple space.

A) tuples, retrieval

B) tuples, store

C) structures, store

D) tuples, create

ANSWER: A

__________________ primitive is used by any process who wants to store a tuple in the tuple space.

A) OUT

B) IN

C) RD

D) EVAL

ANSWER: A

_______________primitive is used by a process that wants to retrieve a tuple from tuple space.

A) IN

B) OUT

C) RD
D) EVAL

ANSWER: A

WHAT IS THE ADVANTAGE OF CACHING IN REMOTE FILE ACCESS?

A) Reduced network traffic by retaining recently accessed disk blocks

B) Faster network access

C) Copies of data creates backup automatically

D) None

ANSWER: A

WHAT ARE THE ADVANTAGES OF FILE REPLICATION ?

A) Improves availability &performance

B) Decreases performance

C) They are consistent

D) Improves speed

ANSWER: A

THE IMPLEMENTATION OF CACHING AND REPLICATION DOES NOT LEAD TO CONSISTENCY

PROBLEMS.

A) True

B) False

C) May be

D) Cant say

ANSWER: B

WHAT IS THE COHERENCY OF REPLICATED DATA?

A) All replicas are identical at all times

B) Replicas are perceived as identical only at some points in time

C) Users always read the most recent data in the replicas

D) All

ANSWER: D

WHICH ONE OF THE FOLLOWING HIDES THE LOCATION WHERE IN THE NETWORK THE FILE IS
STORED?

A) transparent distributed file system

B) hidden distributed file system

C) escaped distribution file system

D) spy distributed file system

ANSWER: A

IN DISTRIBUTED FILE SYSTEM, A FILE IS UNIQUELY IDENTIFIED BY _________________

A) the combination of host name and local name

B) host name

C) local name

D) None

ANSWER: A

IN DISTRIBUTED FILE SYSTEM, FILE NAME DOES NOT REVEAL THE FILE’S ____________

A) local name

B) physical storage location

C) both local name and physical storage location

D) none

ANSWER: B

WHICH ONE OF THE FOLLOWING IS A DISTRIBUTED FILE SYSTEM?

A) andrew file system

B) network file system

C) novel network

D) all of the mentioned

ANSWER: D

IN A DISTRIBUTED COMPUTING ENVIRONMENT, DISTRIBUTED SHARED MEMORY IS USED WHICH

IS_____________.

A) Logical combination of virtual memories on the nodes

B) Logical combination of physical memories on the nodes

C) Logical combination of the secondary memories on all the nodes

D) All

ANSWER: B

"CORRECT ORDER" MEANS THAT IF A WRITE OPERATION (W3) IS CAUSALLY RELATED TO ANOTHER
WRITE OPERATION (W2) AND A WRITE OPERATION (W2) IS CAUSALLY RELATED TO ANOTHER WRITE
OPERATION (W1), THEN THE ACCEPTABLE ORDER IS ________________.

A) w1, w2, w3

B) w3, w2, w1
C) w1, w3, w2

D) w3, w1, w2

ANSWER: A

HAVING DATA BELONGING TO TWO INDEPENDENT PROCESSES IN THE SAME PAGE IS

CALLED____________.

A) Buffering

B) Blocking

C) Message-passing

D) False sharing

ANSWER: D

_______REFERS TO THE BLOCK SIZE OF THE DSM SYSTEM, I.E. TO THE UNITS OF SHARING AND THE
UNIT OF DATA TRANSFER ACROSS THE NETWORK WHEN A NETWORK BLOCK FAULT OCCURS.

A) Granularity

B) Coherence

C) Abstraction

D) Synchronization

ANSWER: A

IN THE DISTRIBUTED SYSTEM, DATA IS DUPLICATED MAINLY FOR ____________________

A) security

B) reliability and performance

C) consistency

D) None of the mentioned

ANSWER: B

THE PROBLEM OF ___________ MAY OCCUR WHEN DATA ITEMS IN THE SAME DATA BLOCK ARE
BEING UPDATED BY MULTIPLE NODES AT THE SAME TIME.

A) thrashing

B) granularity

C) consistency

D) None

ANSWER: A

IN ________________ METHOD, THE SHARED-MEMORY SPACE IS STRUCTURED AS A COLLECTION OF

OBJECTS.
A) no structuring

B) structuring as a database

C) structuring by data type.

D) None

ANSWER: C

IN ________________ APPROACH, SHARED-MEMORY SPACE IS ORDERED AS AN ASSOCIATIVE

MEMORY CALLED A TUPLE SPACE.

A) no structuring

B) structuring as a database

C) structuring by data type.

D) None

ANSWER: B

THE ____________ MODEL IS THE STRONGEST FORM OF MEMORY COHERENCE, HAVING THE MOST
STRINGENT CONSISTENCY REQUIREMENT.

A) sequential consistency

B) causal consistency

C) strict consistency

D) None

ANSWER: C

A SHARED-MEMORY SYSTEM IS SAID TO SUPPORT THE __________ MODEL IF THE VALUE RETURNED
BY A READ OPERATION ON A MEMORY ADDRESS IS ALWAYS THE SAME AS THE VALUE WRITTEN BY
THE MOST RECENT WRITE OPERATION TO THAT ADDRESS.

A) causal consistency

B) strict consistency

C) sequential consistency

D) None

ANSWER: B
RPC is used for ________________.

A) Inter-Process Communication in distributed systems.

B) Detect Deadlocks in Distributed Systems.

C) Find out the Block hits in Distributed Shared Memory

D) Both Inter-Process Communication in distributed systems and Detect Deadlocks in Distributed

Systems.

ANSWER: A

Binding Agent usually has ____________________

A) Register primitive.

B) deregister primitive

C) lookup primitive

D) all the mentioned.

ANSWER: D

What do you mean by Syntactic transparency with respect to RPC?

A) It means that a remote procedure call should have exactly the same syntax as a local procedure
call.

B) It means that a remote procedure call should not have exactly the same syntax as a local
procedure call.

C) Both client and server are transparent from each other

D) None of the mentioned.

ANSWER: A

Remote procedure calls consume_________________ than Local procedure calls.

A) 100-1000 times more

B) 10-100 times more.

C) 100 times more

D) 50 - 100 times more

ANSWER: A

RPCRuntime handles _______________________

A) transmission of messages across the network between client and server machines.

B) Marshaling of the parameters.

C) Un-Marshaling of the parameters.

D) Both Marshaling and Un-marshaling of the request and response parameters.

ANSWER: A

What is the use of IDL with respect to RPC?

A) It is used to define the interface between a client and server.

B) It is used to make the client and server transparent from each other.

C) Its is used to generate the Client Stub and Server Stub.

D) Both " Its is used to generate the Client Stub and Server Stub." and "It is used to define the
interface between a client and server."

ANSWER: D

How exactly an Unsuccessful RPC reply message is identified?

A) If the Reply status field contains 0.

B) If the Reply status field contains any negative number.

C) If the Reply status field contains 1.

D) If the Reply status field contains 1 or any nonzero value.

ANSWER: D

With respect to RPC, what the above figure indicates?

A) Stateful file server

B) state less file Server.

C) Failure of a RPC call.

D) None of the mentioned.

ANSWER: A

The process by which a client becomes associated with a server so that calls can take place is known
as ________________.

A) binding

B) server locating

C) server naming

D) None

ANSWER: A
A computer clock usually consists of _________________

A) a quartz crystal

B) a counter register

C) constant register.

D) All the mentioned.

ANSWER: D

In the Bully algorithm, when the process having the priority number just below the failed
coordinator detects that the coordinator has failed, it immediately elects itself as the coordinator
and sending _______coordinator messages.

A) n-2

B) n/2

C) n-1

D) None.

ANSWER: A

For clocks based on a quartz crystal, the drift rate is approximately 10-6 (10 raised to 6) , giving a
difference of 1 second every _________________seconds, or ______________ days.

A) 1,000,000 seconds or 11.6 days

B) 1,000,00 seconds or 11.5 days

C) 10,000,000 seconds or 11.7 days

D) None.

ANSWER: A

Passive Time Server Centralized Algorithm. when the reply is received at the client's node, its clock is
readjusted to___________________.

A) T+(T1 - To)/2.

B) T+(T0 - T1)/2.

C) T+(T1 - To)/2+1.

D) T1+(T - To)/2.

ANSWER: A

Identify the correct statement with respect to Happened before relation.

A) If A and B are events in the same process and A occurs before B, then A -->B.

B) If A is the event of sending a message by one process and B is the event of thereceipt of the same
message by another process, then A -->B..

C) If A -->B and B-->C, then A-->C. That is, happened-before is a transitive relation.
D) All are correct

ANSWER: D

(dC/dT) < 1 represents __________________.

A) Its a representation of a Perfect Clock.

B) Its a representation of a Drift with slow Clock.

C) Its a representation of a Drift with fast Clock.

D) None.

ANSWER: B

Which of the following is not a CLOCK SYNCHRONIZATION ISSUE.

A) Two clocks can not be perfectly synchronized.

B) Un-Predictable Communication delays of clock message between two nodes.

C) Time must never run backward, because it causes repetition of certain operations, when fast clock
is set to slow down.

D) All the Machines sharing common shared memory.

ANSWER: D

In the worst case bully algorithm requires ________________ and in the best case it requires
________________.

A) O (n2) messages and n-2 messages

B) O (n2) messages and n-1 messages

C) O [No] messages and n-1 messages

D) O [No] messages and n-2 messages

ANSWER: A

in the ring algorithm, irrespective of which process detects the failure of the coordinator and
initiates an election, an election always requires ________________ messages

A) 2(n-1) messages.

B) 2n messages.

C) 2(n-2) messages.

D) only n messages.

ANSWER: A
In the mutual exclusion algorithm, _____ dictates that requests must be executed in the order they
are made.

A) Starvation

B) Tolerance

C) Fairness

D) Deadlock

ANSWER: C

What is the drawback of the distributed approach for implementing mutual exclusion?

A) It liable of n point of failure

B) Waiting time may large if too many processes in the system

C) Needs to detect failure of coordinator

D) Both "It liable of n point of failure" and "Waiting time may large if too many processes in the
system"

ANSWER: B

Lamport algorithm executes critical section requests in the _____ order of timestamps.

A) Increasing

B) Decreasing

C) random

D) none of these

ANSWER: A

Non-token based mutual exclusion algorithm logical clock are maintained and updated according to
______.

A) Maekawa’s algorithm

B) Ricart-agrawala

C) Lamport’s scheme

D) Generalized algorithm

ANSWER: C

Lamport’s algorithm requires messages to be delivered in the _____ order between every pair of
sites.

A) FIFO

B) critical section

C) LIFO
D) none of the above

ANSWER: A

The performance of the mutual exclusion algorithm is measured using _______ metrics

A) Number of messages necessary per CS invocation

B) Synchronization delay

C) Response time

D) All

ANSWER: D

The Richart agarwal algorithm requires _____________ message per critical section execution for n
number of sites.

A) 2n

B) 2(n – 1)

C) 2n + 1

D) n – 1

ANSWER: B

The Lamport’s algorithm requires _____________ message per critical section execution for N
number of sites.

A) 3(N-1)

B) 2(N-1)

C) (N-1)

D) 3N

ANSWER: A

In Maekawa’s algorithm, a site can grant permission to _________ site at a time.

A) Many site

B) Requesting site

C) Current site

D) Only one

ANSWER: D
Mitchell and Merritt's algorithm is a ____________ algorithm.

A) Edge-Chasing Distributed Deadlock Detection

B) Edge-Chasing Centralized Deadlock Detection

C) Path Pushing Distributed Deadlock Prevention

D) _Path Pushing Centralized Deadlock Avoidance_

ANSWER: A

The space complexity is the ____________registers and time complexity is ________time for n-
process bakery algorithm of shared memory mutual exclusion.

A) Upper bound of n, O(n2)

B) Upper bound of n, O[No]

C) Lower bound of n, O[No]

D) Lower bound of n, O(n2)

ANSWER: C

In wait for the graph (WFG), a directed edge from node P1 to node P2 indicates that:

A) P1 is blocked and is waiting for P2 to release some resource

B) P2 is blocked and is waiting for P1 to release some resource

C) P1 is blocked and is waiting for P2 to leave the system

D) P2 is blocked and is waiting for P1 to leave the system

ANSWER: A

A) Transmit State

B) Block state

C) Activate State

D) Detect State

ANSWER: A

Provide all the resources at once to a process is a _____________ stratergy.

A) Deadlock Prevention

B) Deadlock Avoidance

C) Deadlock Detection

D) None.

ANSWER: A
_________________ distributed deadlock detection algorithms uses _______________ to detect
deadlocks.

A) diffusion computation based , echo algorithms

B) Path pushing based, echo algorithms

C) Edge Chasing based, Non echo algorithms

D) Global State detection based, Non echo algorithms

ANSWER: A

In the _____________, a process can make a request for numerous resources simultaneously and
the request is satisfied if any one of the requested resource is granted.

A) OR model

B) AND model

C) AND-OR model

D) Single Resource model.

ANSWER: A

Maximum outdegree of a node in a WFG for the _____________model can be 1.

A) The Single resource model

B) the AND model

C) the OR model

D) none.

ANSWER: A

In the wait for graph, if there exists a directed cycle or knot:

A) then a deadlock does not exist

B) then a deadlock exists

C) then the system is in a safe state

D) either b or c

ANSWER: B

A deadlock detection algorithm must satisfy the following two conditions:Condition 1: Progress (No
false deadlocks): The algorithm should not report deadlockswhich do not exist.Condition 2: Safety
(No undetected deadlocks): The algorithm must detect all existingdeadlocks infinite both conditions
are true time.

A) Both conditions are true

B) Both conditions are false

C) Only condition 1 is true

D) Only condition 1 is true

ANSWER: B

A) (P): (i), Q: (ii), R: (iii), (S): (iv)

B) (P): (iv), Q: (iii), R: (ii), (S): (i)

C) (P): (iii), Q: (iv), R: (i), (S): (ii)

D) (P): (ii), Q: (iv), R: (i), (S): (iii)

ANSWER: B

Consider the following statements related to distributed deadlock detection algorithms:Statement 1:

In path-pushing algorithms, distributed deadlocks are detected by maintainingan explicit global
WFG. The basic idea is to build a global WFG for each site of thedistributed system.Statement 2: In
an edge-chasing algorithm, the presence of a cycle in a distributed graphstructure is be verified by
propagating special messages called probes, along the edges ofthe graph. These probe messages are
different than the request and reply messages.

A) Both statements are true

B) Both statements are false

C) Only statement 1 is true

D) Only statement 2 is true

ANSWER: D

Consider the following statements related to consistency models:(i) Strict consistency (SC): Only
Write operations issued by the same processor and to thesame memory location must be seen by
others in that order.(ii) PRAM memory: Only Write operations issued by the same processor are
seen by othersin the order they were issued, but Writes from different processors may be seen by
otherprocessors in different orders.(iii) Slow Memory: Any Read to a location (variable) is required to
return the value writtenby the most recent Write to that location (variable) as per a global time
reference.

A) All are True

B) All are False

C) Only (i) and (iii) are true

D) Only (ii) is true

ANSWER: D

Choose the correct consistency model that defines the following conditions:I. All Writes are
propagated to other processes, and all Writes done elsewhere are brought locally, at a sync
instruction.II. Accesses to sync variables are sequentially consistentIII. Access to sync variable is not
permitted unless all Writes elsewhere have completedIV. No data access is allowed until all previous
synchronization variable accesses have been performed
A) Weak consistency

B) Causal consistency

C) Processor consistency

D) Program consistency

ANSWER: A

Ho Ramamoorthy deadlock detection algorithm comes in the category of ________________.

A) Path Pushing

B) Edge-Chasing

C) Diffusion Computation

D) Global State detection

ANSWER: A
WHAT ARE THE CHARACTERISTICS OF THE 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

ANSWER: A

IN THE CASE OF____________ , CHANGES TO AN OPEN FILE ARE ONLY LOCALLY VISIBLE.

A) session semantics

B) immutable files

C) atomic transactions

D) None of the mentioned

ANSWER: A

What is an advantage with respect to the Bulk data transfer in the Distributed File System?

A) To obtain multiple number of blocks with a single seek.nObtain multiple number of blocks with a
single seeknObtain multiple number of blocks with a single seeknObtain multiple number of blocks
with a single seeknObtain multiple number of blocks with a single seeknObtain multiple number of
blocks with a single seek

B) Format, transfer large number of packets with a single context swith

C) Reduce the number of acknowledgements to be sent.

D) All of the mentioned.

ANSWER: D

Tuple Space is a repository that is used to store/retrieve objects, it works on the

___________________ principle.

A) Associative memory paradigm.

B) Collaborative memory paradigm

C) Random Access Memory paradigm

D) None.

ANSWER: A

Templates are _____________ used for ___________ of tuples from the tuple space.

A) tuples, retrieval

B) tuples, store

C) structures, store
D) tuples, create

ANSWER: A

__________________ primitive is used by any process who wants to store a tuple in the tuple space.

A) OUT

B) IN

C) RD

D) EVAL

ANSWER: A

_______________primitive is used by a process that wants to retrieve a tuple from tuple space.

A) IN

B) OUT

C) RD

D) EVAL

ANSWER: A

WHAT IS THE ADVANTAGE OF CACHING IN REMOTE FILE ACCESS?

A) Reduced network traffic by retaining recently accessed disk blocks

B) Faster network access

C) Copies of data creates backup automatically

D) None

ANSWER: A

WHAT ARE THE ADVANTAGES OF FILE REPLICATION ?

A) Improves availability &performance

B) Decreases performance

C) They are consistent

D) Improves speed

ANSWER: A

THE IMPLEMENTATION OF CACHING AND REPLICATION DOES NOT LEAD TO CONSISTENCY

PROBLEMS.

A) True

B) False

C) May be
D) Cant say

ANSWER: B

WHAT IS THE COHERENCY OF REPLICATED DATA?

A) All replicas are identical at all times

B) Replicas are perceived as identical only at some points in time

C) Users always read the most recent data in the replicas

D) All

ANSWER: D

WHICH ONE OF THE FOLLOWING HIDES THE LOCATION WHERE IN THE NETWORK THE FILE IS
STORED?

A) transparent distributed file system

B) hidden distributed file system

C) escaped distribution file system

D) spy distributed file system

ANSWER: A

IN DISTRIBUTED FILE SYSTEM, A FILE IS UNIQUELY IDENTIFIED BY _________________

A) the combination of host name and local name

B) host name

C) local name

D) None

ANSWER: A

IN DISTRIBUTED FILE SYSTEM, FILE NAME DOES NOT REVEAL THE FILE’S ____________

A) local name

B) physical storage location

C) both local name and physical storage location

D) none

ANSWER: B

WHICH ONE OF THE FOLLOWING IS A DISTRIBUTED FILE SYSTEM?

A) andrew file system

B) network file system

C) novel network
D) all of the mentioned

ANSWER: D
IN A DISTRIBUTED COMPUTING ENVIRONMENT, DISTRIBUTED SHARED MEMORY IS USED WHICH
IS_____________.

A) Logical combination of virtual memories on the nodes

B) Logical combination of physical memories on the nodes

C) Logical combination of the secondary memories on all the nodes

D) All

ANSWER: B

"CORRECT ORDER" MEANS THAT IF A WRITE OPERATION (W3) IS CAUSALLY RELATED TO ANOTHER
WRITE OPERATION (W2) AND A WRITE OPERATION (W2) IS CAUSALLY RELATED TO ANOTHER WRITE
OPERATION (W1), THEN THE ACCEPTABLE ORDER IS ________________.

A) w1, w2, w3

B) w3, w2, w1

C) w1, w3, w2

D) w3, w1, w2

ANSWER: A

HAVING DATA BELONGING TO TWO INDEPENDENT PROCESSES IN THE SAME PAGE IS

CALLED____________.

A) Buffering

B) Blocking

C) Message-passing

D) False sharing

ANSWER: D

_______REFERS TO THE BLOCK SIZE OF THE DSM SYSTEM, I.E. TO THE UNITS OF SHARING AND THE
UNIT OF DATA TRANSFER ACROSS THE NETWORK WHEN A NETWORK BLOCK FAULT OCCURS.

A) Granularity

B) Coherence

C) Abstraction

D) Synchronization

ANSWER: A

IN THE DISTRIBUTED SYSTEM, DATA IS DUPLICATED MAINLY FOR ____________________

A) security

B) reliability and performance

C) consistency
D) None of the mentioned

ANSWER: B

THE PROBLEM OF ___________ MAY OCCUR WHEN DATA ITEMS IN THE SAME DATA BLOCK ARE
BEING UPDATED BY MULTIPLE NODES AT THE SAME TIME.

A) thrashing

B) granularity

C) consistency

D) None

ANSWER: A

IN ________________ METHOD, THE SHARED-MEMORY SPACE IS STRUCTURED AS A COLLECTION OF

OBJECTS.

A) no structuring

B) structuring as a database

C) structuring by data type.

D) None

ANSWER: C

IN ________________ APPROACH, SHARED-MEMORY SPACE IS ORDERED AS AN ASSOCIATIVE

MEMORY CALLED A TUPLE SPACE.

A) no structuring

B) structuring as a database

C) structuring by data type.

D) None

ANSWER: B

THE ____________ MODEL IS THE STRONGEST FORM OF MEMORY COHERENCE, HAVING THE MOST
STRINGENT CONSISTENCY REQUIREMENT.

A) sequential consistency

B) causal consistency

C) strict consistency

D) None

ANSWER: C

A SHARED-MEMORY SYSTEM IS SAID TO SUPPORT THE __________ MODEL IF THE VALUE RETURNED
BY A READ OPERATION ON A MEMORY ADDRESS IS ALWAYS THE SAME AS THE VALUE WRITTEN BY
THE MOST RECENT WRITE OPERATION TO THAT ADDRESS.
A) causal consistency

B) strict consistency

C) sequential consistency

D) None

ANSWER: B
 Distributed System – MCQs
1. Winnt.exe shall be used for
a. 16-bit
b. 32-bit
c. 8-bit
d. None

2. KDC stands for

a. Key distributor company
b. Key distributor centre
c. Both
d. None

3. Active directory services is a storehouse of information about various type of ________.

a. Network function
b. Network object
c. Network protocols
d. None

4. DFC stands for

a. Distributed file system
b. Defragment file system
c. Both
d. None

5. Which events are represented as possible loss data or function.

a. Errors
b. Warning
c. Both
d. None

6. Which events are represent logged by applications or programs.

a. Application log
b. System log
c. Security log
d. None

7. IP sell stands for

a. Internet protocols security
b. Internet protocols section
c. Both
d. None

8. IP sell is a set of
a. Internet standards
b. Internet protocols
c. Collection of Internet protocols
d. None

9. RADIUS means
a. Remote authentication dial-in user service. b. Radius distribution services
c. Both d. None

1
10. RADIUS used for
a. Centralized management of user authentication
b. Authorized for remote access servers
c. Both
d. None

11. API stand for

a. Application programming interface
b. Application project interface
c. Both
d. None

12. NTFS is work on.

a. 16-bit
b. 32-bit
c. 64-bit
d. None

13. Network means-

a. Communication between two computer
b. Communication between two device
c. Both
d. None

14. Windows 2000 professional is worked on

a. 16 bit
b. 32 bit
c. 64 bit
d. None

15. CPU stand for

a. Central process unit
b. Central program unit
c. Both
d. None

16. DFS stand for

a. Distributed files systems
b. Distributed files software
c. Both
d. None

17. TCP stand for-

a. Transmission control protocols
b. Tran formation control protocols
c. Both
d. None

18. TCP stands for

a. Transmission control protocols
b. Tran formation control protocols
c. Both
d. None
2
19. CPU stand for…………… It is one of the parts of…………
Central process unit, PC

20. DFS stand for-

a. Distributed files systems
b. Distributed files software
c. Both
d. None

21. Example of network

a. Water pipelines
b. Communication of two or more than two computers
c. Both
d. None

22. Minimum hardware requirement of RADIUS.

a. CPU-Pentium II 133 MHZ
b. 64 MB Ram
c. 128 MB Ram
d. A and C both

23. Administrator is a person who administrates

a. Network resources
b. Groups 4 user accounts
c. Both
d. None

24. Within the network we can have a number of computers sharing resources maintained by independent
administrators, called as
a. User
b. Workgroup
c. Both
d. None

25. _____ is a record that consists of all the information that defines a user in windows 2000.
a. User account
b. Group account
c. Both
d. None

26. People who don’t have an actual on the computer. They can use
a. Any account which is present in computer
b. Guest account
c. Both
d. None

27. Which group have all rights in computer

a. Administrator
b. Power user
c. Both
d. None

3
28. Which member of the group has the backup right.
a. Administrator
b. Back up user
c. Both
d. None

29. Which group only replicate the data.

a. Replicator
b. Power user
c. Both
d. None

30. % tan % is used for

a. It is an identification internet temp folder
b. Identification of any file
c. Both
d. None

31. NTFS is work on.

a. 16-bit
b. 32-bit
c. 64-bit
d. None

32. System and application logs recognize.

a. Errors
b. Warning
c. Information
d. All

33. Which events are represented as possible loss data or function.

a. Errors
b. Warning
c. Both
d. None

34. Which events are represent logged by applications or programs.

a. Application log
b. System log
c. Security log
d. None

35. RPC stands for

a. Remote procedure call
b. Remote printer call
c. Both
d. None

36. EMF stands for

a. Enhanced meta file
b. Enhanced member function
c. Both
d. None
4
37. GDI stands for
a. Graphics device interface
b. Graphics device interaction
c. Both
d. None

38. Raw are

a. Ready to print
b. Read and write
c. Both
d. None

39. Printer properties are

a. General
b. Sharing
c. Port
d. Security

40. To install the modem configuration the following

a. Install the modem hardware
b. Install the modem software
c. Configure the installed modem
d. All of the above

41. Power options are used for

a. Reduce the power consumption
b. On and off the power option
c. Both
d. None

42. In regional options common task used for

a. Change your locale
b. Add an input locale and keyboard layout
c. Both
d. None

43. Device manager is an

a. Administrative tool
b. Management tool
c. Both
d. None

44. Virtual memory is used for

a. Temporary storage used by computer
b. Temporary storage used by Ram
c. Both
d. None

45. Registry size up to

a. 80% size of the page pool b. 70% size of the page pool
c. Both d. None

5
46. Windows 2000 provides how many types and disk storage.
a. 12 types
b. 2 type
c. 4 type
d. None

47. Windows 2000 disk storage type area.

Basic storage
b. Dynamic storage
c. Both
d. None

48. RAID-5 volume is a

a. Fault-tolerant volume
b. Not a fault-tolerant volume
c. Both
d. None

49. RAID-5 volume created only

a. Dynamic and simple volume
b. Dynamic volume
c. Both
d. None

50. To create a RAID-5 volume we need

a. 2 hard disk
b. 3 and more hard disk
c. Only 3 hard disk
d. None

51. To create a mirrored volume we need at least

a. 2 hard disk
b. 3 hard disk
c. 1 hard disk
d. None

52. Terminal services are used for

a. Remote access to server desktop
b. Remote access to printer
c. Both
d. None

53. BDC stands for

a. Backup domain controllers
b. Basic domain controllers
c. Both
d. None

54. Member server can act as

a. File server
b. Print server
c. Web server
d. All of the above
6
55. Member server can act as
a. Routing and remote access server
b. The application server, which includes
i. Component server
ii. Terminal server
iii. E-mail server
c. Both a and b
d. None

56. HCC stands for

a. Hardware compatibility list
b. Hardware component list
c. Both
d. None

57. ________ can be used to save the hard disk partition table to a floppy disk.
a. Window.exe
b. Windisk.exe
c. Both
d. None

58. LPD stands for

a. Line printer domain
b. Local printer domain
c. Both
d. None

59. IIS stands for

a. Internet information service
b. Internet interchange service
c. Both
d. None

60. MMC stand for

a. Microsoft management console
b. Manager management console
c. Both
d. None

61. GUI stands for

a. Graphical user interface
b. Graphical user interaction
c. Both
d. None

62. SIDS stand for

a. Security identifiers
b. Service identifiers
c. Both
d. None

7
63. Ram stands for
a. Read-only memory
b. Readable optional memory
c. Both
d. None

64. A domain trust relationship is characterized by whether it is

a. One-way
b. Two-way
c. Transitive
d. All of the above

65. MCIS stands for

a. Transport layer security protocols
b. Transport layer services protocols
c. Both
d. None

66. TLS stands for

a. Transport layer security protocols
b. Transport layer services protocols
c. Both
d. None

67. Default option to store active directory

a. C:\winnt\NTDS
b. C:\windows\NTDS
c. C:\winnt\system32\NTDS
d. None

68. Net bios is the name of ________.

a. Domain
b. System
c. Both
d. None

69. Location for the system folder.

a. C:\winnt\system
b. C:\winnt\system32\system
c. Both
d. None

70. In MMC have the option.

a. Console, windows, help
b. Console, windows, edit, help
c. Console, edit, windows, help
d. None

Discrete Mathematics MCQs with Answers