Distributed System Notes AKTU & Previous Year Question Paper

Unit-wise Frequently Asked Questions in AKTU Exams

Short Questions

Unit 1:

1. Distributed transaction use cases?
2. Fault vs. Failure?
3. Consistent vs. Transitless global state?
4. Vector clocks vs. Lamport clocks?
5. Resource vs. Communication deadlock (2 times repeated)?
6. Mutual exclusion algorithm metrics?
7. Global vs. Consistent global state (2 times repeated)?
8. Causal vs. Total Order?
9. Distributed system limitations.

Unit 2:

1. Agreement Protocol applications?
2. Coda file volume benefits?
3. Consistent vs. Strongly consistent checkpoints?
4. Forward vs. Backward recovery (2 times repeated)?
5. Timestamp ordering algorithms?
6. Flat vs. Nested transactions (2 times repeated)?
7. Token-based algorithm explanation?

Unit 3:

1. Byzantine agreement problem (2 times repeated)?
2. Transparency types in distributed systems?
3. Distributed computation termination challenges?

Unit 4:

1. Message ordering techniques?
2. Consistency challenges in replicated environments (2 times repeated)?
3. Checkpoints’ role in recovery?
4. Group communication system model?

Unit 5:

1. Byzantine fault challenges?
2. Agreement problem classification?
3. Recovery strategies in distributed databases?

Long Questions

Unit 1:

1. Lamport’s & Vector Clock (3 times repeated).
2. Distributed Systems: Applications, advantages, and limitations.
3. Models of Distributed Systems.
4. Designing Distributed Systems issues (2 times repeated).
5. Limitations of Distributed Systems.
6. Fundamental & Architectural models (2 times repeated).

Unit 2:

1. Edge-chasing algorithm.
2. Performance metrics. (2 times repeated).
3. Centralized deadlock detection.
4. Path-Pushing deadlock detection algorithm (2 times repeated).
5. Deadlock handling strategies. (3 times repeated).
6. Mutual Exclusion (4 times repeated).
7. Token-Based algorithm.

Unit 3:

1. Consensus Problem.
2. Byzantine Problem algorithm.
3. Atomic Commit.
4. Agreement Problem (2 times repeated).
5. Distributed Shared Memory & issues. (2 times repeated).
6. Distributed File Systems architecture. (2 times repeated).
7. Lamport’s Shortest Pass (SP) algorithm.

Unit 4:

1. Fault tolerance challenges (3 times repeated).
2. Commit Protocols.
3. Voting Protocols. (2 times repeated).
4. Checkpoints.
5. Failure Recovery.
6. Recovery (Forward & Backward).

Unit 5:

1. Distributed Transaction concurrency control methods (2 times repeated).
2. Flat and Nested Transactions.
3. Distributed Deadlock in Distributed Database Systems (2 times repeated).
4. Lock-Based Concurrency.
5. Atomic Commit in Distributed Transactions (2 times repeated).
6. Replicated Data.
7. Highly Available Services (2 times repeated).
8. Optimistic Concurrency Control.

Note:

• This list is based on common trends & previous year question papers.
• Always refer to previous year’s question papers and consult with your professors for the most accurate and up-to-date information.

To download this PDF and notes, please click on the button below