SRM University 2007 B.Tech Computer Science and Engineering BANK for DISTRIBUTED COMPUTING - Question Paper

40. What are the factor which influences page size selection?
41. What are the advantages of using page size as block size?
42. What are the commonly used approaches for structuring the shared memory space?
43. What will be the status of the system after thrashing?
44. List the methods to solve the thrashing issue

PART B
1. Explain the architecture of Distributed shared memory.
2. Explain thrashing in detail.
3. Explain granularity in detail.
4. Discuss the structure of shared memory space
5. Discuss Berkley algorithm with an example.
6. Discuss any 2 mutual exclusion algorithms in detail
7. Explain how logical clocks are implemented.
8. Discuss the election algorithms in detail
9. Explain about the atomic transaction model.
10. Explain about the implementation of atomic transaction.
11. What are the algorithms available to control concurrency and discuss
12. Explain about distributed deadlock detection.
13. Explain about centralized deadlock detection.
14. Write a short notes on a. Wound-Wait b. Wait-die
15. Explain the usage of threads.
16. Explain how the thread packages are implemented.
17. discuss the implementation problems of processor allocation algorithms
18. Explain any 2 processor allocation algorithms.






UNIT-IV
PART A
1.What is a fileserver?
2. elaborate the 2 distinct components of a distributed file system?
3.What are the types of file server?
4.What are the attributes of a file?
5. What is an immutable file?
6. elaborate the techniques available for protection in distributed system?
7.What are the advantages and disadvantages of upload/download model?
8.Differentiate upload/download and remote access model?
9.What is a hierarchical file system?
10. elaborate the approaches to file and directory naming in a distributed system?
11. discuss the 2 forms of transparency?
12.What are the 2 levels of naming?
13. What is a symbolic link?
elaborate the methods available for data sharing in ds?
14. What is an immutable file?
15.What does a stateless server mean?
16. elaborate advantages of state full server?
17. List the different ways of doing caching in client memory?
18.What are the algorithms available to achieve cache consistency?
19. What are the different ways in which replication can be done?
20. What is primary key replication?
21. What is voting?
22. What does AFS architecture consists of?
23. What is a volume?
24. Give the structure of a fid?
25. What are the design principles of distributed file system?
26. What is WORM?
27. What are the properties of optical disks?
28. What is vice and Venus?
PART B
1. Explain in detail about file service interface?
2. Explain in detail about directory service interface?
3. What are the ways of dealing with shared files in distributed system?
4. Explain the implementation of caching in DFS?
5. Explain the implementation of replication in DFS?
6. Discuss the different aspects of AFS?
7. Illustrate the patterns in DFS?
8. Explain the implementation of distributed file system structure?


UNIT V

PART A


1. What is Distributed Databases?
2. What is Distributed data Independence?
3. What is Distributed Transaction Atomicity?
4. List various kinds of Distributed databases.
5. What is Client-Server Systems?
6. What is Collaborating Server Systems?
7. What is Middleware Systems?
8. What is meant by Fragmentation? List various kinds of Fragmentation.
9. What is meant by Replication? What is its motivation?.
10. What solution can we adopt to solve the naming problem?
11. What is Synchronous Replication? List various techniques used.
12. What is Asynchronous Replication? List various techniques used.
13. Differentiate Primary site & Peer-to-Peer replication.
14. What are 2 steps involved in Implementing Asynchronous Replication?
15. How the Capture step is implemented?
16. How the Apply step is implemented?
17. What is meant by Data Warehouse?
18. What is meant by Sub Transaction?
19. How Lock Management is done Distributed DBMS?
20. Write a short note on Three-Phase Commit protocol.
21. What is meant by Coordinator for Transaction?
22. Why Recovery in a Distributed DBMS is more complicated?
23. What is meant by Phantom deadlock?
24. What data is stored in changed Data Table (CDT)?
25. What is Primary Site Replication?
26. What is Peer-to-Peer Replication?
27. What is voting?
28. Why we need Gate way Protocol? provide a few examples.
29. Why we need Commit Protocol?
30. What is Distributed Recovery?








PART B
1. Explain various distributed DBMS Architecture in detail.
2. Explain various ways of storing data in a distributed DBMS.
3. Explain the implementation of Primary site Asynchronous Replication.
4. Discuss Distributed Concurrency control in detail.
5. Discuss different Distributed Detection Algorithms.
6. How the distributed system is recovered form failure>
7. What are the steps taken during normal execution to avoid failure in distributed systems?
8. Explain 3 Phase Commit protocol in detail.
9. What are the 3 basic observation made by Two-Phase commit protocol in detail.
10. Explain several refinements suggested by the observations made by Two-Phase commit protocol

Earning:   Approval pending.