Data Structure complete overview in one post
May 10, 2021
Page Contents1 What is Data Structure?2 Data Type3 Array and Linked List3.1 Linked List4 Searching and Sorting5 Graph and Tree6 Stack and Queue What is
Unit 4. Failure Recovery in Distributed Systems
On this page, you will find all the most important and most asked previous year questions from unit 4 Failure Recovery in Distributed Systems .
It will help you in the preparation of your semester exam to score good marks. It will also save you from the backlogs.
Topic : Failure Recovery in Distributed Systems (Key Note and Questions)
Key Note:
Questions
- Q1). What do you mean by error? Explain forward recovery and backward recovery. Also write its advantage and disadvantage.
- Q2). Write the approaches for implementing backward-error recovery.
- Q3). Explain the problem which are caused by the rolling back of process.
- Q4). Write a short note on: 1. Method to obtain consistent set of checkpoints. 2. Domino effect.
- Q5). Define the liveliocks. What is the difference between a deadlock and livelock.
- Q6). What is livelock problem in message passing system? How the synchronous checkpointing methods avoid the livelock problem? Describe.
- Q7). Write short notes on: 1. Livelocks 2. Domino effects 3. Failure resilient processes 4. Consistent checkpoints.
- Q8). What is checkpoint in message passing system? Explain the recovery in message passing system using asynchronous checkpoint scheme.
- Q9). Define fault and failure. What are difference approaches to fault tolerance? Explain.
- Q10). What are commit protocols? Explain two phase commit protocol. How the protocol handles the site failure? Also explain its limitation.
- Q11). Describe the three-phase commit protocol . How three-phase commit protocol is different than two phase commit protocol?
- Q12). What is voting protocol? Explain static voting and dynamic voting protocols.
Recent Posts
B-tree, its properties and steps for insertion operation in B-tree
April 27, 2021
A B-tree is an extended version of m-way. There are some drawbacks with the m way tree is, in the worst case, it may behave
Compaction, Overflow and Underflow in Array
April 27, 2021
Page Contents1 Compaction2 Overflow3 Underflow Compaction Garbage collection is the process of collecting all unused nodes and returning them to available space. This process is