Download AKTU B-Tech 7th Sem 2018-2019 NCS 701 Distributed Systems Question Paper

Firstranker's choice

www.FirstRanker.com

Paper Id: 110713

--- Content provided by‌ FirstRanker.com ---

Roll No.

Time: 3 Hours

B.TECH (SEM VII) THEORY EXAMINATION 2018-19

DISTRIBUTED SYSTEMS

Total Marks: 100

--- Content provided by FirstRanker.com ---

Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20
   1. What are the web Challenges involved in distributed system.
   2. Explain system model.
   3. What is distributed Deadlock?

   --- Content provided by‌ FirstRanker.com ---

   4. What do you mean by commit protocol
   5. State time stamp ordering.
   6. Explain the concept of shared memory
   7. Define fault and failure in distributed system
   8. Explain token based algorithm

   --- Content provided by‍ FirstRanker.com ---

   9. What do you mean by agreement protocol?
   10. Explain the effect of replicated data in transactions.

SECTION B

2. Attempt any three of the following: 10 x 3 = 30
   1. State the Classification of distributed mutual exclusion. What is requirement of mutual exclusion theorem?

   --- Content provided by⁠ FirstRanker.com ---

   2. What do you understand by Byzantine agreement problem?
   3. Give the Design issues in Distributed Shared Memory state the Algorithm for Implementation of Distributed Shared Memory.
   4. Explain the limitations of Distributed system with example.
   5. Define forward and backward recovery. Also list the advantages and disadvantages of both.

--- Content provided by‍ FirstRanker.com ---

SECTION C

3. Attempt any one part of the following: 10 x 1 = 10
   1. What is token based algorithm and non-token based algorithm in Distributed system? Explain with example.
   2. What are Distributed Systems? What are significant advantages and applications of Distributed Systems?
4. Attempt any one part of the following: 10 x 1 = 10
   1. What are Lamport logical clocks? List the important conditions to be satisfied by Lamport logical clocks. Discuss the limitations of Lamport logical clocks.

   --- Content provided by⁠ FirstRanker.com ---

   2. Explain the mechanism of building distributed file systems also explain the Design issues in Distributed Shared Memory.
5. Attempt any one part of the following: 10 x 1 = 10
   1. How distributed mutual exclusion is different of mutual exclusion in single computer system? How the performance of mutual exclusion algorithm is measured?
   2. Discuss the following in terms of distributed system
      1. sequential consistency
      2. highly available services

      --- Content provided by⁠ FirstRanker.com ---

6. Attempt any one part of the following: 10 x 1 = 10
   1. Explain typical architecture of distributed file system. State the Algorithm for Implementation of Distributed Shared Memory.
   2. What is Byzantine agreement problem? Provide the Solution to Byzantine Agreement problem.

--- Content provided by​ FirstRanker.com ---

7. Attempt any one part of the following: 10 x 1 = 10
   1. What are the different validation conditions for optimistic concurrency control? How it effects the transactions in distributed system.
   2. Explain distributed transactions. Discuss the functionality of Flat and nested distributed transactions with example.