Download AKTU B-Tech 8th Sem 2016-17 Distributed System Question Paper

Download AKTU (Dr. A.P.J. Abdul Kalam Technical University (AKTU), formerly Uttar Pradesh Technical University (UPTU) B-Tech 8th Semester (Eight Semester) 2016-17 Distributed System Question Paper

PrintedPageszl RollN0.I I I I I I I I I I I ECS701
B. TECH.
THEORY EXAMINATION (SEM?VIII) 2016-17
DISTRIBUTED SYSTEM
T ime : 3 Hours Max. Marks : 100
Note .' Be precise in your answer. In case ofnumericalproblem assume data wherever not provided.
SECTION-A
1. Explain the following : (10><2=20)
a) List out the short comings of Lamport?s logical clock.
b) Why there is no Global clock in Distributed System? Give reason
c) Give the limitations of Distributed System.
d) What do you mean by Termination Detection?
e) Name Distributed Deadlock Detection Algorithms.
f) Differentiate between Process and Threats?
g) Explain the term Phantom Deadlock.
h) What is Digital Signature?
i) Differentiate between Fau1t& Failure?
j) Which layer provides a security handshake to initiate the TCP/IP connection?
SECTION-B
2. Attempt any ?ve of the following : (10><5=50)
a) What is Lamport?s Logical Clock? For Lamoport clock system prove that for any two
events ?a? & ?b? if a?> b, then C(a) < C(b), but Vice versa is not true.
b) Explain Bully Algorithm.
c) Define Distributed System with example.
d) Write short note on?
1. Atomic Commit in Distributed DBMS
ii. Communication Deadlock
e) Show that Byzantine Agreement cannot always be reached among four processors if two
processor are faulty.
f) Explain Ricart?Agrawala Algorithm for Mutual Exclusion.
g) Describe Memory Coherence.
h) Fault Tolerance can be achieved by Error Processing? Explain.
SECTION-C
Attempt any two of the following : (15X2=30)
3. What are the design issues of Distributed System? Also discuss challenges in Distributed
System.
4. Discuss the following?
a. ?An approach to Concurrency Control based on Time Stamping is inherently superior to an
approach based on Locking?. Give argument either in favor of or against the statement.
b. Explain why Time Stamping cannot lead to Deadlock and Looking can.
5. Discuss the following?
a. ARP
b. RARP
c. Deadlock Free Packet Switching