18/03/2025, 17:22 Cloud Computing and Distributed Systems - - Unit 6 - Week 3
(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)
swarnimburnwal3@gmail.com
NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Cloud Computing and Distributed Systems
(course)
Click to register
Week 3: Assignment 3
for Certification
exam
The due date for submitting this assignment has passed.
If already Due on 2025-02-12, 23:59 IST.
registered, click
to check your Assignment submitted on 2025-02-11, 21:08 IST
payment status
1) In a Classical Algorithm of Ring Election, what will be the message complexity for 1 point
N labelled processes.
(N-1) messages
Course
(2N-1) messages
outline
(3N-1) messages
About (4N-1) messages
NPTEL () No, the answer is incorrect.
Score: 0
How does an Accepted Answers:
NPTEL (3N-1) messages
online
course 2) True or False ? 1 point
work? ()
There is no leader election algorithm for anonymous rings, even if algorithm knows the ring size
Week 0 () (non-uniform) and synchronous model.
Week 1 () True
False
Week 2 ()
Yes, the answer is correct.
Score: 1
Week 3 () Accepted Answers:
True
Lecture 7:
Leader
https://onlinecourses.nptel.ac.in/noc25_cs12/unit?unit=31&assessment=122 1/4
18/03/2025, 17:22 Cloud Computing and Distributed Systems - - Unit 6 - Week 3
Election (Ring 3) True or False ? 1 point
LE & Bully LE
Algorithm) Zookeeper is a replicated service that holds the metadata of distributed applications.
(unit?
unit=31&lesso True
n=32)
False
Lecture 8:
Yes, the answer is correct.
Leader Score: 1
Election in
Accepted Answers:
Rings
True
(Classical
Distributed
Algorithms)
4) True or False ? 1 point
(unit?
unit=31&lesso “Leader Election problem represents a general class of non symmetry-breaking problems.”
n=33)
True
Lecture 9:
False
Design of
Zookeeper Yes, the answer is correct.
(unit? Score: 1
unit=31&lesso Accepted Answers:
n=34) False
Week 3:
5) ZooKeeper itself is intended to be replicated over a sets of hosts called : 1 point
Lecture Notes
(unit?
Chunks
unit=31&lesso
n=35) Ensemble
Subdomains
Quiz: Week 3:
Assignment 3 None of the mentioned
(assessment?
Yes, the answer is correct.
name=122) Score: 1
Feedback For Accepted Answers:
Week 3 (unit? Ensemble
unit=31&lesso
n=36) 6) Find the message and time complexity of below algorithm: 1 point
Week 3:
send value of own id to the left
Assignment 3
Solution (unit?
unit=31&lesso when receive an id j (from the right):
n=109)
if j > id then
Week 4 ()
forward j to the left (this processor has lost)
Week 5 ()
if j = id then
Week 6 ()
elect self (this processor has won)
Week 7 ()
if j < id then
Week 8 ()
do nothing
https://onlinecourses.nptel.ac.in/noc25_cs12/unit?unit=31&assessment=122 2/4
18/03/2025, 17:22 Cloud Computing and Distributed Systems - - Unit 6 - Week 3
Text 𝑂(𝑛2 ) Messages and 𝑂(𝑛) time
Transcripts ()
𝑂(𝑙𝑜𝑔𝑛) Messages and 𝑂(𝑙𝑜𝑔𝑛) time
Download
Videos () 𝑂(𝑛) Messages and 𝑂(𝑛2 ) time
Books () 𝑂(𝑛3 ) Messages and 𝑂(𝑛) time
Yes, the answer is correct.
Score: 1
Accepted Answers:
𝑂(𝑛2 ) Messages and 𝑂(𝑛) time
7) In the O(nlogn) messages leader election algorithm, the probe distance in phase k 1 point
is _______ and the Number of messages initiated by a processor in phase k is at most
______________including probes and replies in both directions.
2 𝑘−1 , 4 𝑘
2𝑘 , 4 ∗ 2 𝑘
𝑘, 2 𝑘
2 𝑘, 4 ∗ 2 𝑘
No, the answer is incorrect.
Score: 0
Accepted Answers:
2 𝑘, 4 ∗ 2 𝑘
8) Consider the following statements: 1 point
Statement 1: When two processes are competing with each other causing data corruption, it is
called deadlock
Statement 2: When two processes are waiting for each other directly or indirectly, it is called
race condition.
Only statement 1 is true
Only statement 2 is true
Both statements are true
Both statements are false
No, the answer is incorrect.
Score: 0
Accepted Answers:
Both statements are false
9) In an anonymous ring topology, which of the following is true regarding leader 1 point
election?
Leader election is always possible in both synchronous and asynchronous settings
Leader election is possible only if the number of nodes is known.
Leader election is impossible in an anonymous ring without additional mechanisms.
https://onlinecourses.nptel.ac.in/noc25_cs12/unit?unit=31&assessment=122 3/4
18/03/2025, 17:22 Cloud Computing and Distributed Systems - - Unit 6 - Week 3
The election can be performed using a random number assigned to each node.
Yes, the answer is correct.
Score: 1
Accepted Answers:
Leader election is impossible in an anonymous ring without additional mechanisms.
10) How does having unique node identifiers (non-uniform ring) affect the leader 1 point
election process?
It makes the election process more complex and inefficient.
It allows leader election to be completed in a finite number of steps using identifier-
based comparison.
It has no impact, as the algorithm would work the same way in uniform and non-uniform
rings.
It requires additional communication rounds to resolve conflicts among nodes
Yes, the answer is correct.
Score: 1
Accepted Answers:
It allows leader election to be completed in a finite number of steps using identifier-based
comparison.
https://onlinecourses.nptel.ac.in/noc25_cs12/unit?unit=31&assessment=122 4/4
