DC Quiz 2
DC Quiz 2
&
DEPARTMENT OF INFORMATION TECHNOLOGY
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. 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. 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. deadlock
b. system crash
c. aging
d. starvation
23. What is the solution to starvation?
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