Distributed Computing MCQ

Question 801 : RPC works between two processes. These processes must be ___________.

  1. Only on the same computer
  2. Only on different computers connected with a network
  3. on the same computer and also on different computers connected with a network
  4. on none of the computers

Question 802 : Load sharing algorithms employ the load estimation policy to measure load of a node. In sender initiated policy,

  1. Lightly loaded nodes search for heavily loaded nodes
  2. Heavily loaded nodes search for heavily loaded nodes
  3. Heavily loaded nodes search for lighlty loaded nodes
  4. Lightly loaded nodes search for lighlty loaded nodes

Question 803 : Select NON-token-based algorithm from the options below.

  1. Suzuki–Kasami’s Broadcast Algorithm
  2. Singhal’s Heuristic Algorithm
  3. Raymond’s Tree-Based Algorithm
  4. Ricart–Agrawala Algorithm

Question 804 : Message passing system allows processes to __________

  1. communicate with one another without resorting to shared dat
  2. communicate with one another by resorting to shared data
  3. share data
  4. name the recipient or sender of the message

Question 805 : In Singhal's algorithm, the information structure at site consists of ___ sets

  1. request and inform
  2. request and reply
  3. inform and priority
  4. reply and priority

Question 806 : RMI stands for?

  1. Remote Mail Invocation
  2. Remote Message Invocation
  3. Remaining Method Invocation
  4. Remote Method Invocation

Question 807 : The middleware cannot deliver a message due to a

  1. Transmission interrupt
  2. Message failure
  3. Invalid Recipt
  4. Missing Field

Question 808 : Consider the following set of processes, the length of the CPU burst time given in milliseconds. P1 - 6, p2 - 8, p3 -7, p4 - 3. Assuming the above process being scheduled with the SJF scheduling algorithm.

  1. The waiting time for process P1 is 3ms
  2. The waiting time for process P1 is 0ms
  3. The waiting time for process P1 is 16ms
  4. The waiting time for process P1 is 9ms

Question 809 : __________ is a process that prevents multiple threads or processes from accessing shared resources at the same time

  1. Critical section
  2. Deadlock
  3. Message passing
  4. Mutual Exclusion

Question 810 : _________ transparency hides failure and recovery of a resources.

  1. Location transparency
  2. Access transparency
  3. Failure transparency
  4. Migration transparency

Question 811 : Many applications tolerate some amount of inconsistency and accept that the replicas eventually become consistent over a period of time. For example, DNS and web caches server. Which consistency model is useful in this scenario?

  1. Data-centric consistency model
  2. Client-centric consistency model
  3. Server Centric consistency
  4. Database-centric Consistency

Question 812 : TCP is reliable _______ protocol which supports reliable point to point communication in distributed system.

  1. network
  2. transport
  3. communication
  4. system

Question 813 : Hide where a resource is located which type of transparency is this?

  1. Location
  2. Migration
  3. Relocation
  4. Access

Question 814 : Which of the following process can be affected by other processes during execution in the system?

  1. init process
  2. child process
  3. parent process
  4. cooperating process

Question 815 : A type of the fault which occurs, vanishes, reappears; but follows no real pattern

  1. Transient Fault
  2. Intermittent Fault
  3. Permanent Fault
  4. Temporary fault

Question 816 : In weak consistency-------

  1. one operation on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
  2. Two operations on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
  3. All operations on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.
  4. No operation on a synchronization variable is allowed to be performed until all previous writes have been completed everywhere.

Question 817 : In RPC , while a server is processing the call, the client is blocked

  1. Unless the client sends an asynchronous request to the server
  2. Unless the call processing is complete
  3. For the complete duration of the connection
  4. Unless the server is disconnected

Question 818 : GNS allows you to locate services via an _________ wherever the service is located, whether on the local system or on a remote node.

  1. user name
  2. arbitrary name
  3. system name
  4. address name

Question 819 : Fault tolerance in distributed systems is the method used for ___________.

  1. Heterogeneity
  2. Security
  3. Flexibility
  4. Reliability

Question 820 : The ------accesses to synchronization variables associated with a data store are sequentially consistent

  1. Weak Consistency
  2. Casual consistency
  3. FIFO consistency
  4. Optimal consistency

Question 821 : A typical _________ program creates some remote objects, makes references to these objects accessible, and waits for clients to invoke methods on these objects.

  1. Server
  2. Client
  3. Thread
  4. Concurrent

Question 822 : When potential causality exists between different messages is preserved in_______.

  1. Unoredered multicast
  2. FIFO ordered multicast
  3. Casually ordered multicast
  4. Totally ordered multicasts

Question 823 : When a user refers to a particular file?

  1. system MFD is searched
  2. his own UFD is not searched
  3. both MFD and UFD are searched
  4. every directory is searched

Question 824 : In consistent ordering when recieving the message each member calculate its proposed sequence number by using the function____________

  1. max(Fmax, Pmax) + I + i/N
  2. min(Fmax, Pmax) + I + i/N
  3. min(Fmin, Pmax) + I + i/N
  4. max(Fmin, Pmin) + I + i/N

Question 825 : Message passing provides a mechanism to allow processes to communicate and to synchronize their actions ________

  1. By sharing the same address space
  2. without sharing the same address space
  3. by sharing the same Process Identifier
  4. by sharing the same process number

Question 826 : Communication channels may suffer through

  1. protocol
  2. transport
  3. arbitrary failures
  4. reliable communication

Question 827 : In X.500, hierarchical organization of entries which are distributed across one or more servers is

  1. Directory System Agents (DSA)
  2. Relative Distinguished Name (RDN)
  3. HTTPS
  4. HTTP

Question 828 : Which of the following disadvantages follows the single coordinator approach?

  1. Bottleneck
  2. Slow response
  3. Deadlock
  4. One request per second

Question 829 : In a nutshell, what Birrell and Nelson suggested was allowing programs to call procedures located on other machines related to

  1. RPC
  2. IPC

Question 830 : The time in which the remote updating is reflected locally is called as _________.

  1. Concurrency
  2. Consistency
  3. Availability
  4. Isolation

Question 831 : _______________ in NFS involves the parsing of a path name into separate directory entries – or components.

  1. Path parse
  2. Path name parse
  3. Path name translation
  4. Path name parsing

Question 832 : The section of a program that need exclusive access to shared resources is referred to as

  1. Cordinator
  2. Critical Section
  3. Time Server
  4. Mutual Area

Question 833 : In _______ assignment of job is done at run

  1. Dynamic load balancing algorithm
  2. Static load balancing algorithm
  3. Symmetric load balancing algorithm
  4. Asymmetric load balancing algorithm

Question 834 : Satefull Service in DFS is i)It maintains what files are opened by a client; connection identifiers; server caches ii)Memory must be reclaimed when client closes file or when client dies iii)The server can maintain information on behalf of the client, but it's not required.

  1. Only i
  2. Only ii
  3. i and ii only
  4. i,ii,and iii

Question 835 : If Task size is known,then the mapping is called

  1. Static Mapping
  2. Dynamic Mapping
  3. Array Mapping
  4. Processor Mapping

Question 836 : _________ class contains an implementation of a proxy.

  1. client
  2. server
  3. RMI
  4. object

Question 837 : In global google system Ranking algorithm is called

  1. SyatemRank
  2. LinkRank
  3. PageRank
  4. IPRank

Question 838 : A process can be ___________

  1. single threaded
  2. tripalthreaded
  3. single threaded and multithreaded
  4. doublethreaded

Question 839 : which of the service offered by middleware is used to provide security to the various shared resources provided by the stystem?

  1. Persistance service
  2. Querying service
  3. Naming service
  4. Security service

Question 840 : Every remote object has a remote interface that specifies which of its

  1. Methods can be invoked remotely
  2. Parameters can be used remotely
  3. Methods can be invoked locally
  4. Parameters can be invoked locally

Question 841 : Data replication, where the same data is stored

  1. on single storage device
  2. on multiple storage devices
  3. on storage area network
  4. on distributed environment

Question 842 : In ________________________ each node periodically sends a message to the time server.

  1. Passive Time Server Centralized Algorithm
  2. Active Time Server Centralized Algorithm
  3. Global Averaging Distributed Algorithms
  4. Localized Averaging Distributed Algorithms

Question 843 : _____ transparency hides that a resource may move to the another location.

  1. Access transparency
  2. Migration transparency
  3. Replication transparency
  4. Failure transparency

Question 844 : ____ change the state of thread from suspen

  1. run()
  2. yield()
  3. destroy()
  4. start()

Question 845 : Multithreading is also called as ____________

  1. Concurrency
  2. Simultaneity
  3. Crosscurrent
  4. Recurrent

Question 846 : The NFS servers

  1. are stateless
  2. save the current state of the request
  3. maybe stateless
  4. statefull

Question 847 : In which type of communication, messages are stored as long as sender and receiver are executing?

  1. Persistent
  2. Transient
  3. RMI based Communication
  4. RPC based Communication

Question 848 : The ring election algorithm works by:

  1. Having all nodes in a ring of processors send a message to a coordinator who will elect the leader.
  2. Sending a token around a set of nodes. Whoever has the token is the coordinator.
  3. Sending a message around all available nodes and choosing the first one on the resultant list.
  4. Building a list of all live nodes and choosing the largest numbered node in the list.

Question 849 : Raymond’s Tree-Based Algorithm exchanges only ---------- messages under light load .

  1. O(Nlog2 N)
  2. O(log N)
  3. O(NlogN)
  4. O(logN)

Question 850 : Replication model in which no master replica or slave replica is_________.

  1. Master-Slave
  2. Client -Server
  3. Peer-to-peer
  4. Permanent