Scribd
Upload
134 views2 pages

CS3551 April May 25

This document is a question paper for the B.E/B.Tech degree examinations in April/May 2025 for the Computer Science and Engineering fifth semester, focusing on Distributed Computing. It includes various topics such as communication models, mutual exclusion algorithms, cloud computing, and failure types in distributed systems, with questions divided into three parts. The exam consists of multiple-choice questions, descriptive questions, and case studies, totaling 100 marks.

Uploaded by

phanisubrahmanyamnagidi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
134 views2 pages

CS3551 April May 25

This document is a question paper for the B.E/B.Tech degree examinations in April/May 2025 for the Computer Science and Engineering fifth semester, focusing on Distributed Computing. It includes various topics such as communication models, mutual exclusion algorithms, cloud computing, and failure types in distributed systems, with questions divided into three parts. The exam consists of multiple-choice questions, descriptive questions, and case studies, totaling 100 marks.

Uploaded by

phanisubrahmanyamnagidi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
Question Paper Code : 90929 B.E/B.Tech, DEGREE EXAMINATIONS, APRIL/MAY 2025. Fifth Semester Computer Science and Engineering CS 3551 — DISTRIBUTED COMPUTING (Common to : Computer Science and Design/Computer Science and Engineering (Artificial Intelligence and Machine Learning)/Computer Science and Engineering (Cyber Security)(Computer and Communication Engineering/Artificial Intelligence and Data Science/Information Technology) (Regulations 2021) ‘Time : Three hours Maximum : 100 marks Answer ALL questions. PART A — (10 x 2= 20 marks) Outline the communication models used in distributed systems. Compare message passing systems and shared memory system. Be 3, Define casual ordering and total ordering with reference to distributed systems. 4, What is logical clock in distributed system? 5, What are the requirements of mutual exclusion algorithms? 6. What is phantom deadlock? 7, What is domino effect in distributed system? Define Consistent global state and consistent global checkpoint. What is virtualization in cloud computing? 9. 10. Why load balancing is important in cloud computing? PART B— (6x 13 = 65 marks) 11. (@) What is distributed system and how it is_ different from network of systems? Explain various primitives for distributed communication. Or () Describe the major design issues and challenges in distributed systems, i's different kalyani’s » Explain the eae cl or mprementin techniau' i ds of takin, nat are the nee i in distributed system Ta amport’? snapshot recordin, ot in indy*! What is snapsh Tilustrate Cha © snapshots the system? r. coving mutual exclusion iq ki-Kasami algorithm for achieving jain the Suzuki-has Gaributed systems. Or ithm for the AND sn Chandy-Misra-Haas deadlock detection algori ) Explain Chandy-Mis a sou 4 uncoordinated check —_—pointing) 14. (@) Milustrate coordinated and clative advantages and) ; 3 = rollback-recovery techniques with their disadvantages. Or (b) Illustrate the algorithm for asynchronous check pointing and recovery and explain. 45. (@) Explain various cloud service models with their characteristics and advantages. Or (6) Explain the major driving factors and challenges of cloud computing PART C—(1x15=15 marks) | 16. (a) Identify the different types of failure in distributed systems. What are the three major failures which are to be ; e e addressed promptly for tht ed of the distributed systems from your point of cee - Berar sty three failures, Clearly explain, how the case oill Solution handle the failures, ‘ : a (b) ae yi Path-pushing and ed, ee ene ustributed systems and ns. : overcomes the limitationg Clearly explain how th Or Haentily the limitati for deadlock detecti ige-chasing algorit! Suggest a technique suggested techniq es eee er 10.

You might also like