(Appro
ved by AICTE, New Delhi; Affiliated to Anna University, Chennai)
Recognized by UGC, Accredited by NBA (IT)
365, KGiSL Campus, Thudiyalur Road, Saravanampatti, Coimbatore – 641035.
COURSE FILE Doc Ref:
KITE/IQAC/CW/13
QUESTION BANK
NAME SHIRLEY JOSEPHINE MARY R
COURSE HANDLING FACULTY DESIGNATION &
DEPARTMENT ASSISTANT PROFESSOR & IT
COURSE CODE – (AU & NBA) CS3551 & C303
COURSE TITLE DISTRIBUTED COMPUTING
REGULATIONS R2021
PROGRAM/SEC INFORMATION TECHNOLOGY
BRANCH OF CLASS HANDLED INFORMATION TECHNOLOGY
YEAR & SEM III & V
ACADEMIC YEAR 2023 - 2024
UNIT I
Part A (2 Marks)
1.Define distributed systems.
2.What is middleware?
3.Explain distributed execution/or run.
4.List middleware standards in distributed systems.
5. Develop hamming distance with example.
6. Illustrate coupling.
7. Describe parallelism/concurrency in distributed systems.
8. Compare centralized and distributed system.
9. State the various classes of multiprocessor/multicomputer operating systems.
10. Compare shared memory Vs distributed shared memory.
11. Compose different forms of load balancing.
12. List the issues arise in determining the performance of DS.
13. Analyze briefly on ubiquitous computing.
14. What is happened before or causal precedence?
15. Illustrate five reasons why to build distributed System.
16. Define granularity.
17. Discuss about peer-to-peer computing.
18. Measure some examples of problems requiring synchronization.
19. Classify the security challenges faced by the distributed systems.
20. What is distributed data mining?
PART B
(13 Marks)
1. Explain the characteristics of distributed systems and the features of distributed systems
2. Summarize the distributed computer system components
3. Explain the requirements of distributed systems
4. Write a brief note on the key algorithmic challenges in distributed computing.
5. Elaborate the functions need to address while designing a distributed computing system.
6. Discuss the primitives for distributed communication.
7. Examine various MIMD architectures in terms of coupling.
8. Explain about the synchronous versus asynchronous executions in a message-passing system.
9. Describe the capabilities and rules for implementation of logical clocks.
10. Point out in detail the recent trends in distributed Systems.
RELEaSE date: 15-05-2023 Ver: 1.0
(Appro
ved by AICTE, New Delhi; Affiliated to Anna University, Chennai)
Recognized by UGC, Accredited by NBA (IT)
365, KGiSL Campus, Thudiyalur Road, Saravanampatti, Coimbatore – 641035.
COURSE FILE Doc Ref:
KITE/IQAC/CW/13
11. Discuss about load balancing.
12. Describe Performance metrics in DS.
13. Summarize NTP for synchronizing system of physical clocks in distributed systems.
PART C
(15 Marks)
1. A user arrives at a railway station that she has never visited before, carrying a PDA that is
capable of wireless networking. Suggest how the user could be provided with information about
the local services and amenities at that station, without entering the station's name or
attributes. What technical challenges must be overcome? Discuss in detail.
2. Explain the practical applicability of the load-balancing approach as a scheduling scheme for the
following types of distributed systems:
a) A LAN-based distributed system,
b) A WAN-based distributed system
c) A distributed system based on the processor-pool model.
d) A distributed system based on the workstation-server model.
3. Design the requirements and aspects needed for reliable and fault- tolerant distributed
systems.
4. Show that all events on the surface of the past cone of an event are message send events.
Likewise, show that all events on the surface of the future cone of an event are message receive
events.
UNIT II Part A
(2 Marks)
1. What are the message ordering paradigms?
2. Compare closed group Vs open group algorithm.
3. State crown criterion theorem.
4. Explain message broadcast.
5. Define time stamp.
6. Discuss multiway rendezvous and binary rendezvous.
7. Design the roles and responsibilities of distributed systems.
8. What are the characteristics of multicast communication?
9. Differentiate multicasting Vs unicasting.
10. Identify the two popular orders for the delivery of messages in group communication.
11. Identify consistent snapshot.
12. Evaluate the criteria that must be met by a causal ordering protocol.
13. What are the necessary conditions to satisfy the consistent global state?
14. State the property for causal delivery of messages.
15. Sketch an interpretation in terms of a cut.
16. What is consistent cut?
17. Outline marker sending rule.
18. What is marker receiving rule?
19. What is complexity?
20. Show how to prove the correctness of the algorithm.
RELEaSE date: 15-05-2023 Ver: 1.0
(Appro
ved by AICTE, New Delhi; Affiliated to Anna University, Chennai)
Recognized by UGC, Accredited by NBA (IT)
365, KGiSL Campus, Thudiyalur Road, Saravanampatti, Coimbatore – 641035.
COURSE FILE Doc Ref:
KITE/IQAC/CW/13
Part B
(13 Marks)
1. Design FIFO and non-FIFO executions.
2. Discuss on causally ordered executions
3. Show with an equivalent timing diagrams of a synchronous execution on an asynchronous system
and asynchronous execution on a synchronous system.
4. Illustrate realizable with synchronous communication (RSC) execution.
5. Explain the hierarchy of execution classes.
6. Examine the crown test to determine the existence of cyclic dependencies among messages.
7. Explain the channel to simulate execution using asynchronous primitives on a synchronous system.
8. Analyse channels to simulate execution using synchronous primitives on an asynchronous system
9. Explain a simple algorithm defined by Bagrodia.
10. Explain chandy and lamport algorithm
11. Examine the two possible executions of the snapshot algorithm for money transfer.
12. Examine the necessary and sufficient conditions for causal ordering.
13. Analyze the centralized algorithm to implement total order and causal order of messages.
14. Discuss the distributed algorithm to implement total order and causal order of messages.
15. Describe any two issues in recording of a consistent global snapshot of a distributed system.
16. How to record a consistent global state of a distributed system with a banking example.
Part C
(16 Marks)
1. Create a simplified implementation of synchronous order. Develop the for the process Pi ,1 ≤ i≤ n.
2. Illustrate the asynchronous executions and of crowns.
(a) Crown of size 2.
(b) Another crown of size 2.
(c) Crown of size 3.
3. Consider a distributed system where every node has its physical clock and all physical clocks are
perfectly synchronized. Develop an algorithm to record global state assuming the communication
network is reliable.
4. What good is a distributed snapshot when the system was never in the state represented by the
distributed snapshot? Give an application of distributed snapshots.
UNIT III
Part A (2 Marks)
1. What are the three basic approaches for implementing distributed mutual exclusion?
2. Explain idle token.
3. Discuss the conditions for maekawa’s algorithm.
4. List the three types of messages for Deadlock handling.
5. What is deadlock?
6. Define the two design issues for suzuki–kasami’s.
7. How ricart–agrawala algorithm achieves mutual exclusion.
8. Explain maekawa’s algorithm achieves mutual exclusion.
9. Express in diagram the wait for graph (WFG).
10. What are the states in a process.?
RELEaSE date: 15-05-2023 Ver: 1.0
(Appro
ved by AICTE, New Delhi; Affiliated to Anna University, Chennai)
Recognized by UGC, Accredited by NBA (IT)
365, KGiSL Campus, Thudiyalur Road, Saravanampatti, Coimbatore – 641035.
COURSE FILE Doc Ref:
KITE/IQAC/CW/13
11. Explain the three strategies for handling deadlocks.
12. What is broadcast algorithm?
13. Give the conditions to satisfy deadlock detection algorithm.
14. What is deadlock resolution?
15. Develop the facts of global state detection-based deadlock detection?
16. Define the features of Mitchell and Merritt’s algorithm.
17. Apply how maekawa’s algorithm handles deadlocks?
18. Formulate the advantage of edge-chasing algorithms?
19. List the four classes of knapp’s classification of distributed deadlock detection algorithms.
20. Demonstrate the basic idea for Chandy–Misra–Haas algorithm.
Part B
(13 Marks)
1. List and Explain the following properties to satisfy a mutual exclusion algorithm.
2. What are the performance metrics of mutual exclusion algorithms?
3. Explain about the lamport distributed mutual exclusion algorithm.
4. Illustrate with a case study explain ricart–agrawala algorithm.
5. Analyze in detail about maekawa’s quorum-based mutual exclusion algorithm.
6. State the Example of a WFG.
7. Discuss the Issues in deadlock detection.
8. Examine suzuki–kasami’s broadcast algorithm.
9. What is deadlock? Explain the models of deadlocks.
10. Formulate the mitchell and merritt’s algorithm for the single- resource model.
11. Describe the distributed deadlock detection algorithms in detail.
12. Conclude in brief about knapp’s classification of distributed deadlock detection algorithms.
13. Briefly describe about the chandy–misra–haas algorithm for the AND model
14. Express with neat sketch and explain chandy–misra–haas
15. algorithm for the OR model.
16. Discuss on unrestricted model with necessary examples.
Part C
(16 Marks)
1. Show that in the ricart–agrawala algorithm the critical section is accessed in increasing order
of timestamp. Does the same hold in maekawa’s algorithm?
2. What is the purpose of a REPLY message in lamport’s algorithm? Note that it is not necessary
that a site must always return a REPLY message in response to a REQUEST message. State the
condition under which a site does not have to return REPLY message. Also, give the new
message complexity per critical section execution in this case.
3. Suppose all the processes in the system are assigned priorities which can be used to totally
order the processes. Modify chand yet al.’s algorithm for the AND model so that when a
process detects a deadlock, it also knows the lowest priority deadlocked process.
4. Consider the following simple approach to handle deadlocks in distributed systems by using
“time-outs”: a process that has waited for a specified period for a resource declares that it is
deadlocked and aborts to resolve the deadlock. Explain what are the shortcomings of using this
method?
RELEaSE date: 15-05-2023 Ver: 1.0
(Appro
ved by AICTE, New Delhi; Affiliated to Anna University, Chennai)
Recognized by UGC, Accredited by NBA (IT)
365, KGiSL Campus, Thudiyalur Road, Saravanampatti, Coimbatore – 641035.
COURSE FILE Doc Ref:
KITE/IQAC/CW/13
UNIT IV
Part A (2 Marks)
1. Define the terms: rollback propagation.
2. Describe local check pointing?
3. What is meant by “outside world process (OWP).”?
4. Point out the phases of min-process check pointing algorithms.
5. Define rollback recovery.
6. Compare coordinated check pointing versus uncoordinated check pointing.
7. List the categories of checkpoint-based rollback-recovery techniques.
8. Give the use of piggybacking.
9. Formulate the different types of messages.
10. Illustrate what is concurrency control? Give its use.
11. Point out the phases of min-process check pointing algorithms
12. Define Z-dependency.
13. Discuss the two types of log storage?
14. What are the two kinds of checkpoints for checkpoint algorithm?
15. Explain the two types of communication-induced check pointing?
16. State the notation and data structure for recovery algorithm.
17. Relate between the agreement problem and the consensus problem.
18. State the conditions for byzantine agreement problem.
19. Explain agreement.
20. Illustrate authenticated vs. non-authenticated messages.
Part B
(13 Marks)
1. What is rollback? and explain the several types of messages for rollback.
2. Examine briefly about global states with examples.
3. Describe the issues involved in a failure recovery with the help of a distributed computation.
4. Elaborate the various checkpoint-based rollback-recovery techniques.
5. Describe the pessimistic logging , optimistic logging and casual logging.
6. What are min-process check pointing algorithms? Explain it detail
7. Examine Deterministic and non-deterministic events.
8. Summarize the koo–toueg coordinated check pointing algorithm.
9. Explain the rollback recovery algorithm.
10. Demonstrate in detail about the juang–venkatesan algorithm for asynchronous check pointing
and recovery.
11. Discuss in detail about some assumptions underlying the study of agreement algorithms.
12. What is byzantine agreement problem? Explain the two popular flavours of the byzantine
agreement problem.
13. Develop an overview of the results and lower bounds on solving the consensus problem under
different assumptions.
14. Explain agreement in (message-passing) synchronous systems with failures.
15. Give byzantine agreement tree algorithm and illustrate with an example.
16. Analyze on phase-king algorithm for consensus.
RELEaSE date: 15-05-2023 Ver: 1.0
(Appro
ved by AICTE, New Delhi; Affiliated to Anna University, Chennai)
Recognized by UGC, Accredited by NBA (IT)
365, KGiSL Campus, Thudiyalur Road, Saravanampatti, Coimbatore – 641035.
COURSE FILE Doc Ref:
KITE/IQAC/CW/13
Part C
(16 Marks)
1. Design a system model of distributed system consisting of four processes and explain the
interactions with the outside world.(15)
2. Explain with examples of consistent and inconsistent states of a distributed system.(15)
3. Consider the following simple check pointing algorithm. A process takes a local checkpoint right
after sending a message. Create that the last checkpoint at all processes will always be
consistent. What are the trade-offs with this method?(15)
4. Give and analyse a rigorous proof of the impossibility of a min- process, non blocking check
pointing algorithm.(15)
UNIT V
Part A (2 Marks)
1. Define cloud computing
2. Point out different characteristics of cloud computing
3. List out the different type of Cloud Deployment Model:
4. Define Private Cloud
5. Define Public Cloud
6. Define Community Cloud
7. Define Hybrid Cloud.
8. Specify merits and demerits of Community Cloud
9. Compare the difference between private and public cloud
10. Mention the different characteristics of Hybrid Cloud
11. Analysis the nature of Multi-cloud
12. Give the important cloud service models
13. Define virtualization in cloud environment
14. Identify some of the Virtualizations in cloud environment
15. Point out the different types of Algorithms for Load Balancing
16. why cloud load balancing is important in cloud computing?
17. What are two types of Load balancing solutions ?
18. What are the Major Examples of Load Balancers ?
19. Compare Scalability and Elasticity.
20. Specify the different types of Replication.
21. Analysis the role of cloud monitoring.
22. Give example for cloud computing service.
23. Give example for cloud storage service.
24. Give example for cloud application runtimes and frameworks service.
RELEaSE date: 15-05-2023 Ver: 1.0
(Appro
ved by AICTE, New Delhi; Affiliated to Anna University, Chennai)
Recognized by UGC, Accredited by NBA (IT)
365, KGiSL Campus, Thudiyalur Road, Saravanampatti, Coimbatore – 641035.
COURSE FILE Doc Ref:
KITE/IQAC/CW/13
Part B
(13 Marks)
1. Analysis the different Characteristics of Cloud in detail
2. Illustrate the different types of Cloud Deployment Models
3. Explain in detail about the different types of Cloud Service Models
4. Briefly discusses about the Driving Factors and Challenges in Cloud computing
5. Briefly describe the different types of Virtualization in detail
6. Explain in detail about Load Balancing in cloud computing
7. Write a short notes about 1. Scalability and 2.Elasticity
8. Illustrate Replication in cloud computing
9. Describe in detail about cloud computing Monitoring
Part C
(16 Marks)
1. Illustrate free and paid Cloud compute Services and Platforms with examples.
2. Illustrate free and paid Cloud storage Services and Platforms with examples.
3. Illustrate free and paid Cloud application runtime and framework Services and Platforms
with examples.
Prepared By Verified & Approved By
Course Handling Faculty HoD
RELEaSE date: 15-05-2023 Ver: 1.0
