Distributed Computing - Quiz 3 - BITS WILP - Mtec Software Systems - 2017

Distributed Computing - Quiz 3

BITS WILP - Mtec Software Systems - 2017 

1. Which of the following is not a part of Job Management System of a cluster?
Select one:
job scheduler
user server
resource manager
recovery manager

Ans: recovery manager

2. Which of the following is not a semantic index?
Select one:
database key
document name
index given by a hash mechanism
keyword

Ans: index given by a hash mechanism

3. In the Byzantine agreement problem
Select one:
there can be more than one source process
there is no source process
only one process is the source process
all processes are source processes


Ans: only one process is the source process

4. Which of the following is not a feature of P2P networks?
Select one:
self replicating
distributed control
self organizing
anonymity

Ans: self replicating

5. If the total number of faulty processes present in a synchronous system is k, then the recursive formulation of the Byzantine agreement

tree algorithm runs for
Select one:
k + 2 rounds
k + 1 rounds
k rounds
2k rounds

Ans: k + 1 rounds

6. For a Chord ring having n nodes, the local space requirement at each node is
Select one:
O(n2)
O(log n)
O(n)
O(1)

Ans: O(log n)

7. The Byzantine agreement tree algorithm is initiated by
Select one:
a single lieutenant
all commanders
a single commander
all lieutenants

Ans: a single commander

8. In scalable lookup for Chord, the routing table of each node is termed as
Select one:
finger table
search table
lookup table
hash table

Ans: finger table

9. For a list L, the operation head(L) gives
Select one:
the first member of list L
the list L after deleting the last member of L
the list L after deleting the first member of L
the last member of list L

Ans: the first member of list L

10. In context of cluster computing, SSI stands for
Select one:
Single System Image
System Service Interdependence
Synchronous System Infrastructure
Secure System Interaction

Ans: Single System Image

11. In the iterative formulation of the Byzantine agreement tree algorithm for n processes,  each node at level h - 1 of the tree data

structure at a non-initiator has
Select one:
n child nodes
n + h - 1 child nodes
n - h child nodes
n - (h + 1) child nodes

Ans: n - (h + 1) child nodes

12. In the Byzantine agreement problem
Select one:
50% of the processes must agree on a value
50% of the non-faulty processes must agree on a value
all processes must agree on a value
all non-faulty processes must agree on a value

Ans: all non-faulty processes must agree on a value

13. Authenticated messages help
Select one:
in detection of message loss
in detection of forgery
in detection of process failure
in detection of channel failure
Previous pageNext page
Skip Quiz navigation

Ans: in detection of forgery

14. The agreement variable in any agreement algorithm
Select one:
should be multivalued
should be boolean
should be an integer
may be boolean or multivalued

Ans: may be boolean or multivalued

15. Gnutella uses
Select one:
remote indexing
distributed indexing
local indexing
centralized indexing


Ans: local indexing

16. Which type of failure occurs temporarily?
Select one:
permanent failure
transient failure
total failure
unplanned failure

Ans: transient failure

17. In the interactive consistency problem
Select one:
all faulty processes must agree on an array of values
all non-faulty processes must agree on an array of values
all non-faulty processes must agree on a single value
all faulty processes must agree on a single value

Ans: all faulty processes must agree on an array of values

18. Unstructured overlays use
Select one:
centralized indexing
distributed indexing
local indexing
random indexing

Ans: local indexing

19. In a P2P network, the rapid joining and departure of nodes is termed as
Select one:
power law property
churn
scale free property
small world phenomemon

Ans: churn

20. Availability is calculated as
Select one:
MTTF / MTTR
MTTR / (MTTF + MTTR)
MTTF / (MTTF + MTTR)
MTTR / MTTF

Ans: MTTF / (MTTF + MTTR)

21. Expanding ring strategy is a refinement of
Select one:
random walk
flooding
guided search
blind search

Ans: flooding

22. The total number of message types used by Gnutella is
Select one:
5
3
4
6

Ans: 4

23. In the recursive formulation of the Byzantine agreement tree algorithm, the number of parameters present in each oral message is
Select one:
3
5
4
2

Ans: 4

24. In a synchronous system, if there are 19 processes, then the Byzantine agreement problem is solvable if there are
Select one:
at most 6 faulty processes
8 faulty processes
at least 6 faulty processes
7 faulty processes

Ans: at most 6 faulty processes

25. In the consensus problem
Select one:
each process has an initial value
only one process has an initial value
at most 50% of the processes have initial values
at most two processes have initial values

Ans: each process has an initial value