92
79.6k

150+ Distributed Computing System (DCS) Solved MCQs

These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Information Technology Engineering (IT) .

Take a Test
1.

A distributed system is defined as a collection of autonomous computers linked by a network with software designed to produce an integrated computing facility.

A. true
B. false
Answer» A. true
discuss
2.

A “glue” between client and server parts of application

A. middleware
B. firmware
C. package
D. system software
Answer» A. middleware
discuss
3.

The hardware of DS has two types

A. multiprocessor system,multicomputer system
B. multiprocessor system,unicomputer system
C. uniprocessor system,multicomputer system
D. uniprocessor system,unicomputer system
Answer» A. multiprocessor system,multicomputer system
discuss
4.

Process Fail - Stop in process omission faults

A. can be detected in synchronous system.
B. can be detected in asynchronous system.
C. can be detected in synchronous and asynchronous system.
D. can be detected in standalone system.
Answer» A. can be detected in synchronous system.
discuss
5.

Distributed pervasive system is also known as

A. ubiquitous computing
B. user interface design
C. graphical user interface
D. peer to peer system
Answer» A. ubiquitous computing
discuss
6.

Type of cluster computing is

A. load sharing cluster
B. load holding cluster
C. load replication cluster
D. load balancing cluster
Answer» D. load balancing cluster
discuss
7.

Type of grid computing is

A. collaborative grid
B. system grid
C. process grid
D. channel grid
Answer» A. collaborative grid
discuss
8.

Scaling transparency hides

A. system expansion
B. system collaboration
C. system failure
D. system security
Answer» A. system expansion
discuss
9.

Internet provides                for remote login.

A. telnet
B. http
C. ftp
D. rpc
Answer» A. telnet
discuss
10.

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. i,iv
Answer» B. i,ii, iii
discuss
11.

In RMI, the objects are passed by .

A. value
B. reference
C. value and reference
D. object
Answer» A. value
discuss
12.

What are the exceptions which have to be handled in a RMI client program?

A. malformedurlexception
B. notfoundexception
C. arithmeticexception
D. class•not•found•excepti on
Answer» A. malformedurlexception
discuss
13.

Transient communication done by layer

A. network
B. transport
C. physical
D. session
Answer» B. transport
discuss
14.

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. binding agent
Answer» A. server stub
discuss
15.

Machine that places the request to access the data is generally called as .

A. server machine
B. client machine
C. request machine
D. database server
Answer» B. client machine
discuss
16.

                                  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
Answer» D. remote procedure call
discuss
17.

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
Answer» A. client/server architecture
discuss
18.

                   is an object acting as a gateway for the client side.

A. skeleton
B. stub
C. remote
D. server
Answer» B. stub
discuss
19.

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. by sharing port number
Answer» A. by sharing the same address space
discuss
20.

Which of the following allocates/deallocates buffers

A. rrl
B. stub/skeleton layer
C. transport layer
D. networking layer
Answer» A. rrl
discuss
21.

OSI stands for

A. open system interconnection
B. operating system interface
C. optical serviceimplementation
D. open service internet
Answer» A. open system interconnection
discuss
22.

Which address is used to identify a process on a host by the transport layer?

A. physical address
B. logical address
C. port address
D. specific address
Answer» C. port address
discuss
23.

In all reliable multicast group communication              

A. n\ response expected from the receiver
B. response from any of the receiver required
C. response from \m\(1<m<n) of the \n\ receiver required
D. response needed from all the receivers
Answer» D. response needed from all the receivers
discuss
24.

If processes p and q both receive messages m and m', then p receives m before m' if and only if q receives m before m'.The order delivery is called

A. absolute ordering
B. consistent ordering
C. causal ordering
D. fifo ordering
Answer» B. consistent ordering
discuss
25.

What is close group in group communication?

A. only members can send messages to the group as a whole
B. processes that are not members (clients) can send message to the group.
C. the idea of groups is to support replicated servers
D. processes that are not members (clients) but close to the group can send message to the group.
Answer» A. only members can send messages to the group as a whole
discuss
26.

                   all related objects moved and left to a server upon the first RPC

A. call by value
B. call by move
C. call by visit
D. call by reference
Answer» B. call by move
discuss
27.

What is the feature of stateful server?

A. longer server recovery time
B. quick recovery after reboot
C. file operations must be idempotent
D. simple server design
Answer» A. longer server recovery time
discuss
28.

           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
Answer» D. mutual exclusion
discuss
29.

Absolute time synchronization can be achieved using

A. vector time stamping method
B. christian’s method
C. lamport’s method
D. ricart-agrawala algorithm
Answer» B. christian’s method
discuss
30.

Which mutual exclusion algorithm is useful when the membership of the group is unknown?

A. centralized
B. lamport’s.
C. token ring
D. decentralized algorithm
Answer» A. centralized
discuss
31.

Which event is concurrent with the vector clock (2, 8, 4)?

A. (3,9,5)
B. (3,8,4)
C. (1,7,3)
D. (4,8,2)
Answer» D. (4,8,2)
discuss
32.

A client gets a timestamp of 4:12:30.500 from a
time server. The elapsed time between the request
and response was 20 msec (0.020 sec).
The current
time on the client is 4:12:30.510. Using Cristian’s
algorithm, what is the time set to on the
client?

A. 1970-01-01 04:12:30
B. 1970-01-01 04:12:30
C. 1970-01-01 04:12:32
D. 1970-01-01 04:12:32
Answer» C. 1970-01-01 04:12:32
discuss
33.

NTP is                      layer protocol.

A. application
B. session
C. transport
D. physical
Answer» A. application
discuss
34.

Which of the following is an example of election algorithm.

A. berkley algorithm:
B. bully algorithm.
C. cristian’s algorithm
D. lamport’s
Answer» B. bully algorithm.
discuss
35.

For each critical section (CS) execution, Ricart-Agrawala algorithm requires
                        messages per CS execution and the Synchronization delay in the
algorithm is                          .

A. 3(n − 1), t
B. 2(n − 1), t
C. (n − 1), 2t
D. (n − 1), t
Answer» B. 2(n − 1), t
discuss
36.

For each critical section (CS) execution, maekawa’s algorithm requires
                        messages per CS execution and the Synchronization delay in the
algorithm is                          .

A. √n , t
B. 2√n , t
C. 3√n , t
D. 3√n , 2t
Answer» D. 3√n , 2t
discuss
37.

RAYMOND'S TREE BASED ALGORITHM is an        

A. non- token based algorithm.
B. token based algorithm.
C. centralized based algorithm
D. physical clock synchronization algorithm.
Answer» B. token based algorithm.
discuss
38.

Suzuki-Kasami's Broadcast Algorithm is an

A. non- token based algorithm.
B. token based algorithm.
C. centralized based algorithm
D. physical clock synchronization algorithm.
Answer» B. token based algorithm.
discuss
39.

Full form of NTP is:

A. network time protocol
B. new time protocol
C. new timestamp protocol
D. network timestamp protocol
Answer» A. network time protocol
discuss
40.

Which algorithm requires "1 to ∞" messages to enter and leave a critical region?

A. token ring algorithm
B. centralized algorithm
C. decentralized algorithm
D. distributed algorithm
Answer» A. token ring algorithm
discuss
41.

Pretransfering also known as

A. premigrating
B. precopying
C. prefiltering
D. postcopying
Answer» B. precopying
discuss
42.

change the state of thread from suspe

A. run()
B. yield()
C. destroy()
D. start()
Answer» D. start()
discuss
43.

Distributed syatem consists of set of resour

A. printer
B. processor
C. cd
D. processes
Answer» B. processor
discuss
44.

This is not feature of cooperative algorithm

A. complex
B. larger overhead
C. worst stability
D. better stability
Answer» C. worst stability
discuss
45.

How is access to resources of various machines is done?

A. remote logging using ssh or telnet
B. zone are configured for automatic access
C. ftp is not used
D. ftp is used
Answer» A. remote logging using ssh or telnet
discuss
46.

What are the characteristics of data migration?

A. transfer data by entire file or immediate portion required
B. transfer the computation rather than the data
C. execute an entire process or parts of it at different sites
D. execute an entire process or parts of it at same site
Answer» A. transfer data by entire file or immediate portion required
discuss
47.

What are the characteristics of computation migration?

A. transfer data by entire file or immediate portion required
B. transfer the computation rather than the data
C. execute an entire process or parts of it at different sites
D. execute an entire process or parts of it at same site
Answer» B. transfer the computation rather than the data
discuss
48.

What are the characteristics of process migr

A. transfer data by entire file or immediate portion required
B. transfer the computation rather than the data
C. execute an entire process or parts of it at different sites
D. execute an entire process or parts of it at same site
Answer» C. execute an entire process or parts of it at different sites
discuss
49.

When the process issues an I/O request

A. it is placed in an i/o queue
B. it is placed in a waiting queue
C. it is placed in the ready queue
D. it is placed in the job queue
Answer» A. it is placed in an i/o queue
discuss
50.

Absolute time ordering of all shared accesses matters in

A. sequential consistency
B. casual consistency
C. strict consistency
D. weak consistency
Answer» C. strict consistency
discuss

Done Studing? Take A Test.

Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.

Take a Test