Q.
No UNIT4 BT Level Competence
Questions
Part A
1. Define the terms: rollback propagation. BTL 1 Remember
2 Describe local check pointing? BTL 2 Understand
3 What is meant by “outside world process (OWP).”? BTL 1 Remember
4 Point out the phases of min-process check pointing algorithms. BTL 4 Analyze
5 Define rollback recovery. BTL 1 Remember
Compare coordinated check pointing versus uncoordinated
6 BTL 2 Understand
check pointing.
List the categories of checkpoint-based rollback-recovery
7 BTL 5 Evaluate
techniques.
8 Give the use of piggybacking. BTL 2 Understand
9 Formulate the different types of messages. BTL 6 Create
10 Illustrate what is concurrency control? Give its use. BTL 3 Apply
11 Point out the phases of min-process check pointing algorithms BTL 4 Analyze
12 Define Z-dependency. BTL 1 Remember
13 Discuss the two types of log storage? BTL 2 Understand
14 What are the two kinds of checkpoints for checkpoint algorithm? BTL 1 Remember
Explain the two types of communication-induced check
15 BTL 4 Analyze
pointing?
16 State the notation and data structure for recovery algorithm. BTL 1 Remember
Relate between the agreement problem and the consensus
17 BTL 3 Apply
problem.
18 State the conditions for byzantine agreement problem. BTL 6 Create
19 Explain agreement. BTL 5 Evaluate
20 Illustrate authenticated vs. non-authenticated messages. BTL 3 Apply
PART - B
What is rollback? and explain the several types of messages for
1. BTL 1 Remember
rollback. (13)
2 Examine briefly about global states with examples. (13) BTL 4 Analyze
Describe the issues involved in a failure recovery with the help
3 BTL 2 Understand
of a distributed computation. (13)
Elaborate the various checkpoint-based rollback-recovery
4 BTL 6 Create
techniques.(13)
Describe the pessimistic logging , optimistic logging and casual BTL 4
5 Analyze
logging.(13)
i) What are min-process check pointing algorithms? Explain it
6 detail.(7) BTL 1 Remember
ii) Examine Deterministic and non-deterministic events. (6)
i) Summarize the koo–toueg coordinated check pointing
7 algorithm.(7) BTL 2 Understand
ii) Explain the rollback recovery algorithm. (6)
Demonstrate in detail about the juang–venkatesan algorithm for
8 BTL 3 Apply
asynchronous check pointing and recovery.(13)
Discuss in detail about some assumptions underlying the study of
9 BTL 1 Remember
agreement algorithms. (13)
What is byzantine agreement problem? Explain the two popular
10 BTL 2 Understand
flavours of the byzantine agreement problem.
Develop an overview of the results and lower bounds on solving
11 BTL 3 Apply
the consensus problem under different assumptions.
Explain agreement in (message-passing) synchronous systems
12 with failures.(13) BTL 5 Evaluate
Give byzantine agreement tree algorithm and illustrate with an
13 BTL 1 Remember
example. (13)
14 Analyze on phase-king algorithm for consensus.(13) BTL 4 Analyze