6CS5-11 Distributed System (EL-I)
B.Tech. VI-Sem. (Main) Examination July - 2023
CS, IT
Maximum Marks: 70 | Time: 3 Hours
Instructions to Candidates:
- Attempt all ten questions from Part A, five questions out of seven questions from Part B, and three
questions out of five questions from Part C.
- Schematic diagrams must be shown wherever necessary. Any data you feel is missing suitably be
assumed and stated clearly. Units of quantities used/calculated must be stated clearly.
- Use of following supporting material is permitted during examination. (Mentioned in form No. 205).
PART - A (10×2=20) (Answer should be given up to 25 words only)
All questions are compulsory.
1. What are the goals of a distributed system?
2. State the difference between distributed operating system and network operating system.
3. Explain working of RPC.
4. How distributed file system is different from centralized file system.
5. Explain concept of logical clocks.
6. How concurrency is handled in distributed system.
7. What is non-uniform memory access model?
8. Explain distributed mutual exclusion.
9. Explain concept of faults in distributed agreement.
10. How data is handled in Distributed databases.
PART - B (5×4=20) (Analytical/Problem solving questions)
Attempt any five questions.
1. Explain how micro kernels can be used to organize an operating system in a client-server fashion.
2. Explain transport level communication services for building distributed applications.
3. What is an object adapter?
4. Does using time stamping for concurrency control ensure serializability? Discuss.
5. Discuss connection-less communication between client and server using sockets.
6. How state of a distributed system is recorded? Explain by suitable diagram.
7. Explain distributed shared memory with the help of suitable diagram.
PART - C (3×10=30) (Descriptive/Analytical/Problem Solving/Design questions)
Attempt any three questions.
1. Consider two CORBA systems, each with their own naming service. Outline how the integration
may be performed.
2. a. Discuss side effects in Coda's RPC2 system.
b. Explain implementation issues and resolution of a Coda file identifier.
3. Explain following strategies used for deadlock handling in distributed system:
a. Deadlock prevention.
b. Deadlock avoidance.
c. Deadlock detection and recovery.
4. Explain Lamport's clock and vector clock with the help of suitable example.
5. With the help of suitable diagram, explain sender initiated and receiver initiated algorithms for
dynamic load sharing and balancing in distributed system.