Академический Документы
Профессиональный Документы
Культура Документы
DISTRIBUTED SYSTEMS
UNIT-1
PART-A
PART-B
PART-A
1. Express in diagram the file attributes record structure? ?[CO2,K2]
2. What are the advantages in using name caches in file systems?[CO2.K1]
3. Explain the working of Andrew file system?[CO2,K5]
4. What do you mean by cache consistency?[CO2,K1]
5. Give the different forms of transparency in file services. ?[CO2,K2]
6. What data must the NFS client module hold on behalf of each user-level process?[CO2,K1]
7. Develop How does AFS deal with the risk that callback messages may be lost? ?[CO2,K6]
8. Define naming and locality facility?[CO2,K1]
9. Apply how will you make use of name space and DNS? ?[CO2,K3]
10. Formulate how caching helps a name service’s availability? [CO2,K6]
11. Explain on LDAP? [CO2,K5]
12. Demonstrate the use of name cache? [CO2,K3]
13. List four types of eventthat the kernel notifies to the user-level scheduler. [CO2,K 3]
14. Compare monolithic kernel and Micor kernel. [CO2,K3]
15. What are the modules in File system? [CO2,K1]
16. List out the requirements of Distributed File system. [CO2,K3]
17. What is DNS? [CO2,K1]
18. What is attribute based naming service? [CO2,K1]
19. Why the name management is separated from other services?justify. [CO2,K2]
20. Demonstrate the use of name cache. [CO2,K3]
PART-B
1. Analyze in detail about distributed file system, its characteristics and requirements. [CO2,K4]
2. Examine about the function of file Service Architecture with neat diagram[CO2,K2]
3. Formulate the design and implementation of name services and Domain Name services. [CO2,K 6]
4. Explain about operating system architecture. [CO2,K2]
5. Write a short note on Threads. [CO2,K2]
6. Describe about Communication and invocation. [CO2,K2]
7. Describe the architecture and server operation of NFS in detail. [CO2,K2]
8. Analyze in detail about Global name services. [CO2,K4]
9. How to customize and combine name space? Explain. [CO2,K2]
10.Summarize in detail about naming in file systems. [CO2,K4]
UNIT-3
PART-A
1. What are the main tasks of routing overlay? [CO3,K1]
2. Classify the Characteristics of Peer to Peer System?[CO3,K4]
3. Discuss how IP and Overlay routing for Peer- to-Peer applications differ from each other?[CO3,K2]
4. Classify the functional and non-functional requirements of peer to peer middle ware Systems.?[CO3,K4]
5. Illustrate what is the use of routing overlay? [CO3,K3]
6. Define pastry.[CO3,K1]
7. Definethe terms: clock screw and clock drift rate. [CO3,K1]
8. Describe How will you synchronize physical clock? [CO3,K2]
9. What is meant by “Happened Before relationship”? [CO3,K1]
10. Point out thereasonwhycomputer clock synchronization is necessary. [CO3,K4]
11. Define distributed mutual exclusion. [CO3,K1]
12. Differentiate physical clock and logical clock. [CO3,K2]
13. Howwillyou assess a consensus problem ? [CO3,K5]
14. Distinguish between IP and overlay routing for perer to peer applications. [CO3,K3]
15. What is peer to peer system? [CO3,K1]
16. List out features of NTP. [CO3,K3]
17. What is global state predicate? [CO3,K1]
18. List the criteria to evaluate the performance of algorithm for mutual exclusion. [CO3,K3]
19. Define election algorithm. [CO3,K1]
20. Write 2 different types of multicast. [CO3,K2]
PART-B
1. Give the functional and non-functional requirements of peer-to –peer middleware. [CO3,K1]
2. What is meant by Napster legacy? Explain. [CO3,K1]
3. Explain about file system access model and its sharing semantics. [CO3,K5]
4. Explain on Peer to Peer middleware systems. [CO3,K5]
5. Illustrate with a case study explain about the application of distributed algorithm routing
overlays.(Tapestry) [CO3,K3]
i) Describe in detail about cristian’s and Berkley algorithm for synchronizing clocks.(8)
ii) Examine Briefly about global states. (8) [CO3,K1]
6. Distinguish and examine the process of active and passive replication model.(13) [CO3,K4]
7. Summarize on i) Rickart and Agarwala’s Algorithm(8) ii) Maekawa’s Voting Algorithm(8) [CO3,K2]
8. i) What is the goal of an election algorithm? Explain any two election algorithml.(8)
ii) Examine how mutual exclusion is handled in distributed system.(8) [CO3,K1]
9. i) Summarize the internal and external synchronization of Physical clocks.(8)
ii) Give the Chandy and Lamports snapshot algorithm for determining the global states of distributed
systems. (8) [CO3,K2]
UNIT-4
DISTRIBUTED TRANSACTIONS
PART-A
1. What is transaction? [CO4,K1]
2. Give the use of nested transaction. [CO4,K2]
3. Formulate the ACID properties. [CO4,K6]
4. Illustrate what is concurrency control? Give its use. [CO4,K3]
5. Showhow will you make use of nested transaction? Point out its rules? [CO4,K4]
6. Mention some motivation for replication. [CO4,K1]
7. Discuss what are the advantages and drawbacks of multi version timestamp ordering in comparison with
ordinary timestamp ordering? [CO4,K2]
8. Define consistent cut. [CO4,K1]
9. Explain the rules to abort the nested transaction. [CO4,K3]
10. Formulate the techniques used to synchronize clock? [CO4,K6]
11. What read lock and writelock? [CO4,K1]
12. List avantages of Nested transactions. [CO4,K3]
13. Define dirty read and premature writes. [CO4,K1]
14. What is deadlock? [CO4,K1]
15. List the drawbacks of locking. [CO4,K3]
16. What are the phases of Transaction? [CO4,K1]
17. Differentiate Flat and Distributed Transactions. [CO4,K3]
18. What are the operations for two-phase commit protocol. [CO4,K2]
19. Write down the steps for Edge chasing algorithm. [CO4,K1]
20. What is recovery manager? List its role. [CO4,K1]
PART-B
1. Discuss in detail about one phase and two phase atomic commit protocol (flat and hierarchical).
[CO4,K2]
2. Examine replication in detail. [CO4,K1]
3. Examine Briefly about optimistic concurrency control. [CO4,K2]
4. Discuss about Time stamp ordering. [CO4,K2]
5. Describe the methods for increasing concurrency in locking schemes. [CO4,K2]
6. Illustrate the importance of nested transaction with an example. [CO4,K3]
7. Describe with case study, explain the concept of distributed dead locks. [CO4,K2]
8. Design Flat transaction and nested transaction with example. [CO4,K6]
9. Explain the recovery of two phase commit protocol. [CO4,K2]
10. Write a note on Fault tolerance services. [CO4,K2]
UNIT-5
SECURITY TECHNIQUES
PART-A
Part-B
1. Discuss about important techniques and mechanisms for securing distributed systems and
applications.[CO5,K2]
2. Explain Cryptographic algorithm with suitable example.[CO5,K2]
3. Compare symmetric and Asymmetric algorithm.[CO5,K3]
4. Describe the role of digital signature in Security.[CO5,K3]
5. How to compare the performance of the encryption and secure hash algorithms.[CO5,K3]
6. Elucidate system architecture of Kerberos.[CO5,K5]
7. Summarize in detail about Securing Electronic transactions with secure sockets.[CO5,K2]
8. Point out in detail Design and Implementation issues of DSM.[CO5,K4]
9. Write a note on Write invalidation and Invalidation protocol.[CO5,K2]
10. Analyze in detail about the services provided by CORBA.[CO5, K4]