B.TechSemester 72023-24Distributed Computing SystemKAI079
View PDFDownload

Distributed Computing System (KAI079) - AKTU Question Paper 2023-24

B.Tech · Semester 7 · Free PDF Download

This is the official AKTU Distributed Computing System Previous Year Question Paper for B.Tech Semester 7, academic session 2023-24. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.

Course:B.Tech
Semester:Semester 7
Session:2023-24
University:AKTU / UPTU

Rate this paper

Questions Asked in 2023-24

Distributed Computing System (KAI079) — complete question paper · 100 marks · 3 Hours

Section AAttempt all q u e s t i o n s i n b r i e f .
  • a
    Discuss the challenges involved in detecting the termination o f distributed computations
  • b
    Explore various techniques used for achieving message ordering in distributed systems
  • c
    Explain the differences between resource and communication dea dlocks in a distributed system
  • d
    Discuss the significance of ensur ing mutual exclusion in distributed systems. 2
  • e
    Elaborate on the challenges posed by Byzantine faults in distributed systems. 2
  • f
    Provide a detailed classification of agreement problems. 2
  • g
    Analyze the strategies involved in recovery within distributed database systems. 2
  • h
    What role do checkpoints play in the recovery process? 2 i. Define the system model for group communication in distributed databases. 2 j. Discuss the challenges associated with maintaining consistency in a replicated environment
Section BAttempt any three o f t h e f o l l o w i n g :
  • a
    Explain Lamport's logical clocks and vector clocks, highligh ting their use in addressing the challenges of clock synchronization in distribut ed systems. Provide practical examples to illustrate their applications
  • b
    Discuss the role of edge-chasing algorithms in distributed d eadlock detection. How do these algorithms contribute to identifying and resolving deadlocks in a distributed environment?
  • c
    Discuss the consensus problem in the context of distributed systems. What are the key requirements for achieving consensus, and how do consensus algorithms address failures and uncertainties in a distributed environment?
  • d
    Evaluate the challenges asso ciated with achieving fault tole rance in real-world distributed systems. How can these challenges be addressed to e nhance overall system reliability?
  • e
    Explore the concept of distributed deadlocks in a distribute d database system. How do they differ from traditional deadlocks, and what strateg ies can be employed to detect and resolve distributed deadlocks?
Section CAttempt any one p a r t o f t h e f o l l o w i n g :
  • a
    Provide specific examples of distributed systems in real-wor ld applications, detailing how they enhance performance and reliability. Discuss challenges faced by these systems
  • b
    Compare and contrast different architectural models used in distributed systems. Discuss scenarios where each model is most suitable
  • a
    Describe the key performance metrics used to evaluate distri buted mutual exclusion algorithms. Discuss why these metrics are important i n assessing the efficiency and effectiveness of such algorithms
  • b
    Compare and contrast centralized deadlock detection with dis tributed deadlock detection. Highlight the advantages and challenges associated w ith each approach
  • a
    Describe the major approaches and algorithms used to solve t he Byzantine agreement problem. What are the key characteristics of effective solutions in the presence of Byzantine faults?
  • b
    Explain the significance of atomic commit in distributed dat abase systems. How does it ensure consistency and reliability, and what challenges does it address in
  • a
    distributed environment?
  • a
    Provide an in-depth explanation of commit protocols in the c ontext of fault tolerance. Compare and contrast d ifferent commit protocols, hig hlighting their strengths, weaknesses, and use cases in distributed systems
  • b
    Discuss the concept of voting protocols in fault-tolerant systems. How do voting protocols contribute to decision-making in the presence of fail ures? Provide examples of scenarios where voting protocols are particularly useful
  • a
    Conduct a comprehensive comparison of different methods for concurrency control. Highlight scenarios where each method is most suitable , and the trade- offs involved in choosing one over the others
  • b
    Define and differentiate between flat and nested distributed transactions. Discuss the challenges and advantages of implementing nested transactio ns in a distributed database environment

Question text is extracted from the official AKTU question paper PDF above. Hindi translations are omitted — every question is printed in English in the original paper. Last verified: 2026-08-23.

More B.Tech Semester 7 (2023-24) Papers

Other subjects from same semester and session

Machine Learning2023-24Power Plant Engineering2023-24Soil Water Conservation Engineering2023-24Operations Research2023-24Text Analytics And Natural Langugae Processing2023-24Vision For Humane Society2023-24Renewable Energy Resources2023-24Architecting Smart Iot Devices2023-24
View all B.Tech Semester 7 2023-24 papers →

Syllabus & More PYQs

Paper solve karne se pehle unit-wise syllabus dekh lo

AKTU 4th Year PYQs — All Branches