B.TechSemester 72022-23Distributed SystemsKCS077

Distributed Systems (KCS077) - AKTU Question Paper 2022-23

B.Tech · Semester 7 · Free PDF Download

This is the official AKTU Distributed Systems Previous Year Question Paper for B.Tech Semester 7, academic session 2022-23. 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:2022-23
University:AKTU / UPTU

Rate this paper

Questions Asked in 2022-23

Distributed Systems (KCS077) — complete question paper

Section AAttempt all questions in brief. 2x10 = 20
  • a
    Explain the concept of consistent global state and transitl ess global state
  • b
    Show the vector clocks are m ore suitable than Lamport’s log i c a l c l o c k f o r a distributed system
  • c
    Differentiate between resour ce and communication deadlock
  • d
    List various performance met rics for distributed mutual exclusion algorithm
  • e
    Give some applications of agreement protocols
  • f
    Discuss the benefits of groupi ng files into volumes in Coda
  • g
    Differentiate between consis tent and strongly consistent checkpoints
  • h
    Discuss forward and backward recovery in distributed systems. (i) List basic, multi version and conservative timestamp orderi ng algorithm in increasing order of transaction abort. (j) Differentiate between flat and nested transactions
Section BAttempt any three of the following: 10x3 = 30
  • a
    Discuss the major issue in d esigning a distributed system
  • b
    Classify the Deadlock detection algorithms. Describe the Pa th-Pushing deadlock detection algorithm
  • c
    Discuss the architecture of distributed file system
  • d
    Explain dynamic voting protoc ol. Also compare it with static voting protocol
  • e
    Discuss lock based concurrency control algorithms
Section CAttempt any one part of the following: 10x1 = 10
  • a
    Discuss the limitations of di stributed system. List some problem arises because of these limitations
  • b
    Explain fundamental and arch itectural model of distributed system
  • a
    Give the deadlock handling st rategies in distributed system. Also differentiate among centralized, distributed and hierarchical deadlock detection strategies in distributed system
  • b
    Discuss the concept of Mutual Exclusion? Describe the requi rements of mutual exclusion in distributed system. Is mutual exclusion problem mo re complex in distributed system than single computer system? Justify your answer
  • a
    Describe Byzantine agreement problem, and explain its solution. Show that Byzantine agreement cannot always be reached among four processors if two processors are faulty
  • b
    Give the design issues in di stributed shared memory. State the algorithm for implementation of distributed shared memory
  • a
    List various issues in a fault tolerant system. Also differ entiate between fault and failure
  • b
    Discuss the requirement of in serting checkpoints in message passing in distributed system. Show that whe n checkpoints are taken after every K messages sent, where K is greater than 1, the recovery system s uffers from domino effect. Assume that a proc ess take a checkpoint after se nding the K th message but doing nothing else
  • a
    Discuss Atomic commit in dis tributed transaction with suitable example
  • b
    Explain the followings (i) Transaction with replicated data (ii) Highly available services

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.

Syllabus & More PYQs

Paper solve karne se pehle unit-wise syllabus dekh lo