Scribd
Upload
13 views31 pages

DC Quiz 2

Uploaded by

Nandhini Sakthivel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
13 views31 pages

DC Quiz 2

Uploaded by

Nandhini Sakthivel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 31

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

&
DEPARTMENT OF INFORMATION TECHNOLOGY

CS3551 – DISTRIBUTED COMPUTING


III yr / V sem - CSE

QUIZ-II
Date :
Subject Handled : S.Nandhini AP/CSE
1.In _______________, deadlock detection computation is diffused through the WFG of the system. These algorithms make use of
echo algorithms to detect deadlocks

A. Path-pushing algorithms
B. Edge-chasing algorithms
C. Diffusing computation-based algorithms
D. Global state detection-based algorithms
2.In Chandy–Misra–Haas’s distributed deadlock detection algorithm for the OR model two types of messages are used in a diffusion
computation:

A. request(i, j, k) and reply(i, j, k)


B. query(i, j, k) and reply(i, j, k)
C. response(i, j, k) and request(i, j, k)
D. response (i, j, k) and reply(i, j, k)
3. The Ricart & Agrawala distributed mutual exclusion algorithm is

a. More efficient and more fault tolerant than a


centralized algorithm
b. Less efficient and less fault tolerant than a
centralized algorithm
c. Less efficient but more fault tolerant than a
centralized algorithm.
d. More efficient but less fault tolerant than a
centralized algorithm
4. Event a has a Lamport timestamp of
of 8. What can we tell about events a and b?

a. Events a and b are causally related.


b. Events a and b are concurrent
c. If events a and b are causally related, then
event a happened before event b .
d. Event a happened before event b .
5.The Lamport’s algorithm requires _____________REQUEST messages,
_____________REPLY messages, and ____________RELEASE messages

A. N -1, N-2, N-2


B. N -1, N-1, N-1
C. N -1, N-2, N-1
D. N -1, N-1, N-2
6. The Ricart–Agrawala algorithm assumes
that the communication channels are

A. Non – FIFO
B. CO
C. FIFO
D. Asynchronous
7. Which mutual exclusion algorithm is useful when the membership of the group is unknown?

a.Centralized
b. Lamport’s.
c.Token Ring
d.All the above
8. In the token passing approach of distributed systems, processes are organized in a ring structure

A. Logically
B. Physically
C. Both Logically & Physically
D. None of the above
9. In distributed systems, a logical clock is
associated with

a.Each instruction
b.Each process
c.Each register
d.None
10. A process can enter into its critical section

a.Any time
b. When it receives a reply message from its
parent process
c. When it receives a reply message from all
other processes of the system
d.All the above
11. 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
12. Full form of NTP is:

a. network time protocol


b. new time protocol
c. new timestamp protocol
d. network timestamp protocol
13. If a process is executing in its critical section ____________

a. any other process can also execute in its


critical section
b. no other process can execute in its critical
section
c. one more process can execute in its critical
section
d. none of the mentioned
14. For proper synchronization in distributed systems ____________

a. prevention from the deadlock is must


b. prevention from the starvation is must
c. prevention from the deadlock & starvation is
must
d. none of the mentioned
15. A deadlock can be broken by
a. abort one or more processes to break the
circular wait
b. abort all the process in the system
c. preempt all resources from all processes
d. none of the mentioned
16. The two ways of aborting processes
and eliminating deadlocks are
a. Abort all deadlocked processes
b. Abort all processes
c. Abort one process at a time until the
deadlock cycle is eliminated
d. All of the mentioned
17. _______________is a snapshot of the state
of the process at a given instance and the event
of recording the state of a process

a. Local Checkpoint
b. Global Checkpoint
c. Consistent Checkpoint
d. Inconsistent Checkpoint
18. Messages sent, not yet received before
recovery line

a. In-transit message
b. Lost messages
c. Orphan messages
d. Delayed messages
19. Cost factors for process termination
include
a. Number of resources the deadlock process is
not holding
b. CPU utilization at the time of deadlock
c. Amount of time a deadlocked process has
thus far consumed during its execution
d. All of the mentioned
20. If we preempt a resource from a process, the
process cannot continue with its normal
execution and it must be

a. aborted
b. rolled back
c. terminated
d. queued
21. To _______ to a safe state, the system needs to
keep more information about the states of processes.

a. abort the process


b. roll back the process
c. queue the process
d. none of the mentioned
22. If the resources are always preempted from
the same process __________ can occur.

a. deadlock
b. system crash
c. aging
d. starvation
23. What is the solution to starvation?

a. the number of rollbacks must be included in


the cost factor
b. the number of resources must be included in
resource preemption
c. resource preemption be done instead
d. all of the
24.Global Wait-for graph is used for
________________ in Distributed database
a. Handling concurrency control
b. Handling failures
c. Handling deadlock
d. None of the above
25. The real use of the Two-phase commit protocol
is ______________

a. Deadlock will not occur


b. Concurrency control can be avoided
c. Atomicity, i.e, all-or-nothing commits at all
sites
d. None of the above
26. _____ are used to identify deadlocks in
a distributed system.

a. wait-for-graphs
b. linear graphs
c. undirected graphs
d. none.
27. In non-blocking checkpoint coordination protocol ________________ is used in which markers play the role of the
checkpoint request messages.

a. Maekawa Algorithm
b. Suzuki–Kasami’s broadcast algorithm
c. Ricart–Agrawala algorithm
d. Chandy and Lamport Algorithm
28. Koo–Toueg algorithm is an
a. Coordinated Checkpointing Algorithm
b. Uncoordinated checkpointing Algorithm
c. Pessimist logging Algorithm
d. Optimist logging Algorithm
29. _____________________system maintains checkpoints and communication structures that prevent the domino
effect or achieve some even stronger properties

a. index based checkpointing


b. Model based Checkpointing
c. Recovery based checkpointing
d. Roll back based checkpointing
30.In In Suzuki–Kasami’s broadcast algorithm how to distinguishing an outdated REQUEST
message from a current REQUEST message

a. A REQUEST message of site Sj has the form


REQUEST(j+1, n)
b. A REQUEST message of site Sj has the form
REQUEST(j, n+1)
c. A REQUEST message of site Sj has the form
REQUEST(j, n)
d. A REQUEST message of site Sj has the form
REQUEST(j+1, n+1)

You might also like