10 Oct BESemVIII (Rev-2016)

(CMPN)September/October 2020)
Distributed Computing CSC802
Your email address (cmpn-ravalpremkumar@atharvacoe.ac.in) will be recorded when you
submit this form. Not you? Switch account

* Required

Multiple Choice Questions

10 Oct BESemVIII (Rev-2016)(CMPN)September/October 2020) Distributed Computing CSC802

Every remote object has a remote interface that specifies which of its *

Methods can be invoked locally

Parameters can be used remotely

Methods can be invoked remotely

Parameters can be invoked locally

_____ is used to store the distributed objects permanently on to the data store *

Security Service

Naming Service

Messaging Service

Persistence Service

__________ enables the users and applications to access shared resources

without interfernce with each other *

Replication transparency

Concurrency transparency

Access transparency

Scaling transparency

A remote procedure call is _______ *

A single stream

Inter-process communication

A single thread

A single process

The local operating system on the server machine passes the incoming packets
to the ___________ *

Server stub

Client operating system

Client process

Client stub

Number of layers present in OSI Layered Architecture *

Seven

Five

Six

Four

__________ refers to degree of tolerance against component failure and errors *

Availability

Performance

Reliability

Integrity

RPC allows a computer program to cause a subroutine to execute in _________ *

Both its own address space and another address space

Another address space

Its own address space

Applications address space

The difference in the time value of two Clocks is called_______ *

Difference clock

Clock synchronization

Clock drift

Clock skew

In RPC, the return values are marshalled and the local OS is invoked by *

Server stub

Client stub

Application layer

Transport layer

The type of communication where a message that has been submitted for
transmission is stored by the communication system as long as it takes to deliver
it to the receiver *

Synchronous communication

Persistent communication

Asynchronous communication

Transient communication

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. *

Synchronization

Deadlock

Mutual exclusion

Starvation

_____________ is a physical clock synchronization Algorithm *

Lamport

Ring

vector

Cristian

In absolute ordering, the message identifiers are implemented by the method of

using *

Address

Sequence number

Rank

Global timestamps

Which among below is not a technique commonly used for scaling in Distributed
System *

Hiding Communication Latency

Hide Replication

Hide Performance

Hide Distribution

All communication in distributed systems is based on sending and receiving (low

level) messages because of *

The presence of heterogeneity

The presence of complexities

The absence of shared memory

The absence of synchronization

The process initiated by a method invocation, which may result in further

invocations on methods in other objects is called *

A creation

An invitation

A reaction

An action

The Mekawa mutual exclusion algorithm requires _______ messages per Critical
Section invocation *

3N

2N

2 √N

3 √N

What is UTC? *

Unique Centralized Time

Universal Centralized Time

Unique Coordinated Time

Universal Coordinated Time

__________ is a process that prevents multiple threads or processes from

accessing shared resources at the same time *

Deadlock

Mutual Exclusion

Critical section

Message passing

__________ is computing form where heterogeneity is key advantage. *

Cluster & grid computing

Grid computing

Cluster computing

High performance computing

In case of failure, a new transaction coordinator can be elected by ___________. *

Bully’s Algorithm

Cristian Algorithm

Lamport Algorithm

Berkeley Algorithm

    ______________________is not a level of transparency in distributed Systems *

access Transparenccy

Hetrogeneity transparency

Replication transparency

Location Transparency

_______________Algorithm works based on timestamp *

Berkeley

ring

Lamport

Cristian

___________defined a relation called happens-before *

Cristian

Lamport

Berkeley

Vector

Back Submit Page 2 of 2

Never submit passwords through Google Forms.

This form was created inside of Atharva College of Engineering. Report Abuse

 Forms