FirstRanker Logo

FirstRanker.com - FirstRanker's Choice is a hub of Question Papers & Study Materials for B-Tech, B.E, M-Tech, MCA, M.Sc, MBBS, BDS, MBA, B.Sc, Degree, B.Sc Nursing, B-Pharmacy, D-Pharmacy, MD, Medical, Dental, Engineering students. All services of FirstRanker.com are FREE

📱

Get the MBBS Question Bank Android App

Access previous years' papers, solved question papers, notes, and more on the go!

Install From Play Store

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

This post was last modified on 29 January 2020

AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University


B. TECH.

THEORY EXAMINATION (SEM–VIII) 2016-17

DISTRIBUTED SYSTEM

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

Time: 3 Hours

Max. Marks : 100

Note: Be precise in your answer. In case of numerical problem assume data wherever not provided.

SECTION-A

1. Explain the following : (10×2=20)

  1. a) List out the short comings of Lamport's logical clock.
  2. --- Content provided by FirstRanker.com ---

  3. b) Why there is no Global clock in Distributed System? Give reason
  4. c) Give the limitations of Distributed System.
  5. d) What do you mean by Termination Detection?
  6. e) Name Distributed Deadlock Detection Algorithms.
  7. f) Differentiate between Process and Threats?
  8. --- Content provided by⁠ FirstRanker.com ---

  9. g) Explain the term Phantom Deadlock.
  10. h) What is Digital Signature?
  11. i) Differentiate between Fault & Failure?
  12. j) Which layer provides a security handshake to initiate the TCP/IP connection?

SECTION-B

2. Attempt any five of the following : (10×5=50)

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

  1. a) What is Lamport's Logical Clock? For Lamport clock system prove that for any two events 'a' & 'b' if a-> b, then C(a)
  2. b) Explain Bully Algorithm.
  3. c) Define Distributed System with example.
  4. d) Write short note on-
    1. i. Atomic Commit in Distributed DBMS
    2. ii. Communication Deadlock
  5. --- Content provided by⁠ FirstRanker.com ---

  6. e) Show that Byzantine Agreement cannot always be reached among four processors if two processor are faulty.
  7. f) Explain Ricart-Agrawala Algorithm for Mutual Exclusion.
  8. g) Describe Memory Coherence.
  9. h) Fault Tolerance can by Error Processing? Explain.
  10. --- Content provided by FirstRanker.com ---

SECTION-C

Attempt any two of the following : (15×2=30)

  1. 3. What are the design issues of Distributed System? Also discuss challenges in Distributed System.
  2. 4. Discuss the following-
    1. 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.
    2. b. Explain why Time Stamping cannot lead to Deadlock and Locking can.
  3. --- Content provided by⁠ FirstRanker.com ---

  4. 5. Discuss the following-
    1. a. ARP
    2. b. RARP
    3. c. Deadlock Free Packet Switching

Visit FirstRanker.com for more.

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



This download link is referred from the post: AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University

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