Scribd Logo
Upload

Welcome to Scribd!

  • 60 views

    Cse Am 2021 Cs 8603 Distributed Systems 755643105 x10324 (Cs8603) Distributed Systems

    Uploaded by

    Muthu
    This document is the question paper for the Computer Science and Engineering course Distributed Systems. It contains 3 parts with a total of 16 questions. Part A contains 10 short answer questions worth 2 marks each. Part B contains 5 long answer questions worth 13 marks each. Part C contains 1 long answer question worth 15 marks. The questions cover topics related to distributed systems including parallel and distributed system models, challenges, message ordering, deadlocks, mutual exclusion, agreement algorithms, failure recovery, peer-to-peer networks, and distributed shared memory.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Cse Am 2021 Cs 8603 Distributed Systems 755643105 x10324 (Cs8603) Distributed Systems

    Uploaded by

    Muthu
    60 views2 pages
    This document is the question paper for the Computer Science and Engineering course Distributed Systems. It contains 3 parts with a total of 16 questions. Part A contains 10 short answer questions worth 2 marks each. Part B contains 5 long answer questions worth 13 marks each. Part C contains 1 long answer question worth 15 marks. The questions cover topics related to distributed systems including parallel and distributed system models, challenges, message ordering, deadlocks, mutual exclusion, agreement algorithms, failure recovery, peer-to-peer networks, and distributed shared memory.

    Original Title

    Cse Am 2021 Cs 8603 Distributed Systems 755643105 x10324(Cs8603) Distributed Systems

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document is the question paper for the Computer Science and Engineering course Distributed Systems. It contains 3 parts with a total of 16 questions. Part A contains 10 short answer questions worth 2 marks each. Part B contains 5 long answer questions worth 13 marks each. Part C contains 1 long answer question worth 15 marks. The questions cover topics related to distributed systems including parallel and distributed system models, challenges, message ordering, deadlocks, mutual exclusion, agreement algorithms, failure recovery, peer-to-peer networks, and distributed shared memory.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    60 views2 pages

    Cse Am 2021 Cs 8603 Distributed Systems 755643105 x10324 (Cs8603) Distributed Systems

    Uploaded by

    Muthu
    This document is the question paper for the Computer Science and Engineering course Distributed Systems. It contains 3 parts with a total of 16 questions. Part A contains 10 short answer questions worth 2 marks each. Part B contains 5 long answer questions worth 13 marks each. Part C contains 1 long answer question worth 15 marks. The questions cover topics related to distributed systems including parallel and distributed system models, challenges, message ordering, deadlocks, mutual exclusion, agreement algorithms, failure recovery, peer-to-peer networks, and distributed shared memory.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    *X10324*

    Reg. No. :

    Question Paper Code : X10324

    B.E./B.Tech. Degree ExaminationS, APRIL/MAY 2021


    Sixth Semester
    Computer Science and Engineering
    cs8603 – distributed systems
    (Regulations 2017)

    Time : Three Hours Maximum : 100 Marks

    Answer all questions

    Part – A (10×2=20 Marks)


    1. Why do we need a distributed system ?
    2. List out the distributed system challenges.
    3. Name the various message ordering paradigms used in distributed systems.
    4. Define causal order execution.
    5. What are the different models of deadlocks ?
    6. What is the purpose of the wait-for-graph (WFG) ? Give an example for WFG.
    7. What do you mean by local checkpoints ?
    8. What is the drawback of a checkpoint based rollback recovery approach ?
    9. List out the characteristics of P2P systems.
    10. What is the difference between shared memory and distributed memory ?

    Part – B (5×13=65 Marks)

    11. a) i) How do you classify a parallel system and brief them ? (8)
    ii) Compare Synchronous versus asynchronous execution. (5)
    (OR)
    b) What are the functions must be addressed while designing and building a
    distributed system ? Explain.
    X10324 *X10324*
    12. a) Illustrate the necessary and sufficient conditions for causal ordering.
    (OR)
    b) Discuss in detail about Snapshot algorithms for FIFO channels.

    13. a) Discuss in detail the requirements that mutual exclusion algorithms should
    satisfy and discuss what metric we use to measure the performance of mutual
    exclusion algorithms.
    (OR)
    b) List out the four classes of distributed deadlock detection algorithms and
    explain any two of them.

    14. a) What are the key assumptions underlying while designing agreement
    algorithms and brief them ?
    (OR)
    b) Describe the issues involved in a failure recovery with the help of a distributed
    computation.

    15. a) What do you understand about Content-Addressable Networks (CAN) ?


    Explain how it is useful in P2P networks.
    (OR)
    b) Describe in detail about Distributed Shared Memory (DSM) and its application.

    Part – C (1×15=15 Marks)

    16. a) What are the significant factors affecting the interacting processes in a
    distributed systems ? how the interaction model deals with the difficulty of
    setting time limits in a distributed system ? Explain.
    (OR)
    b) External synchronization ensures internal synchronization. But the vice
    versa does not stand true. Justify. Explain Lamport’s algorithm in brief.

    __________________

    You might also like