# NPTEL Cloud Computing and Distributed Systems Assignment 3 Answers 2022

Are you looking for the Answers to NPTEL Cloud Computing and Distributed Systems Assignment 3? This article will help you with the answer to the National Programme on Technology Enhanced Learning (NPTEL) Course “NPTEL Cloud Computing and Distributed Systems Assignment 3

## What is Cloud Computing and Distributed Systems?

Over the years program several testing techniques have developed and tools have become available. Also, testing has been acknowledged as the primary technique for ensuring software reliability. The course would provide a brief introduction to test process and techniques available for black box and white box test case design. Integration, system and regression testing would also be discussed. A few of the test tools would be discussed and the participants would be encouraged to use.

## CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of the average of best 8 assignments out of the total 12 assignments given in the course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF THE AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

Below you can find the answers for the NPTEL Cloud Computing and Distributed Systems Assignment 3

## NPTEL Cloud Computing and Distributed Systems Assignment 3 Answers:-

Q1. Consider the following statement?

“Leader Election problem is for each processor to decide that either it is the leader or non-leader, subject to the constraint that exactly one processor decides to be the leader.”

Q2. Choose the correct items for X, Y, and Z.

There is no X algorithm for Y rings, even if algorithm knows the ring size (non-uniform) and Z model.

Q3. Match the following two list:

Q4. Find the message complexity of below algorithm:

???? Next Week Answers: Assignment 04 ????

Q5. Consider the following statements:

Statement 1: In the Hirschberg and Sinclair (HS) algorithm, at each phase the number of (phase) winners is cut approximately in half.

Statement 2: In the Hirschberg and Sinclair (HS) algorithm, the number of messages initiated by a processor in phase k is at most 2k (probes and replies in both directions)

Q6. Consider the following statements:

Statement 1: ZooKeeper is a highly reliable distributed coordination kernel, which can be used for distributed locking, configuration management, leadership election, work queues.

Statement 2: ZooKeeper is a central store of key-value using which distributed systems can coordinate. Since it needs to be able to handle the load, Zookeeper itself runs on many machines.

Q7. Ephermal node gets deleted if the session in which the node was created has disconnected. Though it is tied to client’s session but it is visible to the other users.

Note:- We are going to post answers for all weeks you can join us on telegram for regular updates and if there are any changes in answers then will update on our telegram channel only.

Q8. Match the following two list related to Zookeeper architecture: