AVL Tree with explanation
February 24, 2021
Page Contents1 There are 4 types of rotation to maintain AVL tree property1.1 1). Left Rotation1.2 2). Right Rotation1.3 3). Left-Right Rotation2 4). Right-Left Rotation
Unit 3. Agreement Protocol
On this page, you will find all the most important and most asked previous year questions from unit 3 Agreement Protocols of the Distributed System subject.
It will help you in the preparation of your semester exam to score good marks. It will also save you from the backlogs.
Topic : Agreement Protocol Introduction (Key Note and Questions)
Key Note:
Questions
- Q1). What do you mean by agreement protocol? Write the classification of agreement problem.
- Q2). Explain Byzantine agreement problem.
- Q3). Explain Consensus problem.
- Q4). Explain Interactive consistency problem.
- Q5). Write various aspects for recognizing the agreement protocol.
- Q6). How you can find the solution using number of faulty processor?
- Q7). Show that a Byzantine agreement cannot be reached among three processors, where one processor is faulty.
- Q8). What are agreement protocols? Explain Byzantine agreement problem, the consensus problem and interactive consistency problem. Describe Lamport-Shostak-Pease algorithm.
- Q9). Show that Byzantine agreement cannot always be reached among four processor if two processor are faulty.
- Q10). Classify the agreement problem. Explain the application of agreement algorithm.
Topic : Distributed Resource Management (Key Note and Questions)
Key Note:
Questions
- Q1). Write and explain various issue that must be addressed in design and implementation of distributed file system.
- Q2). Describe the mechanism for building distributed file system . Explain data access actions in distributed file system.
- Q3). Explain the architecture and data access in distributed file system.
- Q4). Explain the follwing in context of distributed system. 1. Mounting 2. Caching 3. Hints 4. Bulk data transfer
- Q5). What is distributed shared memory? Explain its architecture with the help of diagram.
- Q6). Discuss the architecture of distributed shared memory and its advantage.
- Q7). Write the design and implementation issue of distributed shared memory.
- Q8). Describe memory coherence. Briefly explain the write-invalidate and write-update protocol.
- Q9). Explain the migration algorithm.
- Q10). Explain the read replication algorithm for implementing distributed shared memory.
- Q11). Explain the full replication algorithm for implementing distributed shared memory.
- Q12). Write the central issue and algorithm for implementing distributed shared memory.
- Q13). Explain central-server algorithm for implementing DSM.
Recent Posts
Radix sort algorithm explanation with example
February 21, 2021
Page Contents1 How does radix sort work?2 Radix Sort Algorithm3 Radix Sort Complexity3.1 Radix sort time complexity3.2 Radix sort space complexity 4 Radix Sort Program
Quick Sort Algorithm with explanation
February 20, 2021
Page Contents1 How does quick sort algorithm works?2 Algorithm of quick sort2.1 Quick Sort Pivot Algorithm2.2 Quick Sort Algorithm3 Time complexity of Quick Sort4 Pseudo