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

Download AKTU (Dr. A.P.J. Abdul Kalam Technical University (AKTU), formerly Uttar Pradesh Technical University (UPTU) B-Tech 7th Semester (Seventh Semester) 2018-2019 NCS 701 Distributed Systems Question Paper

"\
Printed Pa e512 SubCode:I\\,5701
Paperldzl 110713 1 11011110.! 1 L] I T j 1 I 1 |
B.TECH
(SEM VII) THEORY EXAMINATION 2018-19
DISTRIBUTED SYSTEMS
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections If require any missing data; then choose suitably,
SECTION A
]. Attempt all questions in brief. 2 x 10 = 20
What are the web C hallenges involved in distributed system
Explain system model.
What is distributed Deadlock?
What do you mean by commit protocol
State time stamp ordering.
Explain the conccpi of shared memory
De?ne fault and failure in distributed system .
Explain token based algonthm , I > -
What do you mean by agreement protocol? ' )1 '
Explain the effect 01' replicated data in nangactions,
*?r'rm re." 9-95-71?
SEC'I'RQV? :B I ? , 1
2. Attempt any three of the. following; - 19 x 31%: 30
a State the Classi?cation c1?-d1str1buted mutual exclusion What 13 reqi?remem of
mutual exclusion theaters?
What do _\ ou understand by By zantine agreement problem?
Give the Des1ga 71? uEs 1n Distributed Shared Memory state ?(he Algonthm for
Implementat1911 ofD1st11bmed Shared Memory.
Explain the 1111'1?itations of D1str1buted system with exmnpte
De?ne forward and backward recovery Also list the advantages and
disadvantages of both. ,
os=-
0 9
SECTION C 1
3. Attempt any one part of the following: I 10 x l = 10
(a) What is token based algorithm mid non-token based algorithm 111 D1stributed
svstem? Explam with example
(b) What are Dismbuted Systeme? What an: sigmhcant admmages and
applications of Disn1hmed Systems?
4. Attempt any one part 01111.2 following: 10 x 1 = 10
(a) What are Lamport logical clocks? List the important conditions to be satis?ed
by Lampurt logical clocks. Discuss the limitations of Lamport logical clocks.
(b) Explain the mechanism of building distributed ?le systems also explain the Design
issues 1n Distributed Shared Memory.
IWage

5. Attempt any one part of the following: 10 x 1 = 10
(a) How distributed mutual exclusion is different of mutual exclusion in single
computer system? How the performance of mutual exclusion algorithm is
measured?
(1)) Discuss the following in terms of distributed system
(i) sequential consistency (ii) highly available services
6. Attempt any one part of the following: 10 x l = 10
(a) Explain typical architecture of distributed ?le system. State the Algorithm for
Implementation of Distributed Shared Memory
(b) What is Byzantine agreement problem? Provide the Solution to Byzantine Agreement
problem .
7. Attempt any one part of the following: 10 I 1 = 10
(a) What are the different validation conditions for optimistic concurrency control?
How it effects the transactions in distributed system.
(b) Explain distributed transactions. Discuss the functionality of Flat and nested
distributed transactions \x ith example.
ZlPage