Cloud Computing and Distributed Systems NPTEL Week 3 Solutions NPTEL 2023

This set of MCQ(multiple choice questions) focuses on the Cloud Computing and Distributed Systems NPTEL Week 3 Solutions NPTEL 2023.

Cloud computing is the on-demand delivery of computations, storage, applications, and other IT resources through a cloud services platform over the internet with pay-as-you-go business model. Today’s Cloud computing systems are built using fundamental principles and models of distributed systems. This course provides an in-depth understanding of distributed computing “concepts”, distributed algorithms, and the techniques, that underlie today’s cloud computing technologies. The cloud computing and distributed systems concepts and models covered in course includes: virtualization, cloud storage: key-value/NoSQL stores, cloud networking,fault-tolerance cloud using PAXOS, peer-to-peer systems, classical distributed algorithms such as leader election, time, ordering in distributed systems, distributed mutual exclusion, distributed algorithms for failures and recovery approaches, emerging areas of big data and many more. And while discussing the concepts and techniques, we will also look at aspects of industry systems such as Apache Spark, Google’s Chubby, Apache Zookeeper, HBase, MapReduce, Apache Cassandra, Google’s B4, Microsoft’s Swan and many others. Upon completing this course, students will have intimate knowledge about the internals of cloud computing and how the distributed systems concepts work inside clouds.

Course layout

Answers COMING SOON! Kindly Wait!

Week 1: Assignment answers
Week 2: Assignment answers
Week 3: Assignment answers
Week 4: Assignment answers
Week 5: Assignment answers
Week 6: Assignment answers
Week 7: Assignment answers
Week 8: Assignment answers
Week 9: Assignment answers
Week 10: Assignment answers
Week 11: Assignment answers
Week 12: Assignment answers

NOTE: You can check your answer immediately by clicking show answer button. Cloud Computing and Distributed Systems NPTEL Week 3 Solutions NPTEL 2023 Assignment Solution” contains 10 questions.

Now, start attempting the quiz.

Cloud Computing and Distributed Systems NPTEL Week 2 Solutions

Q1. In a Classical Algorithm of Ring Election, what will be the message complexity for N labelled processes.

a)  (N-1) messages  
b) (2N-1) messages  
c) (3N-1) messages  
d) (4N-1) messages

Answer: a

Q2. Consider the following statements related to  Software-defined networking (SDN) tec
True or False ?
There is no leader election algorithm for anonymous rings, even if algorithm knows the ring size (non-uniform) and synchronous model.

a) True 
b) False

Answer: a

Q3. True or False ?
Zookeeper is a replicated service that holds the metadata of distributed applications.

 a) True  
b) False 

Answer: a

Cloud Computing and Distributed Systems Week 3 Assignment Solutions

Q4. True or False ?
“Leader Election problem represents a general class of non symmetry-breaking problems.”

a) True
b) False

Answer: b

Q5. ZooKeeper itself is intended to be replicated over a sets of hosts called :

 a) Chunks  
b) Ensemble  
c) Subdomains  
d) None of the mentioned

Answer: b

Q6. Find the message and time complexity of below algorithm:
send value of own id to the left
when receive an id j (from the right):
if j > id then
forward j to the left (this processor has lost)
if j = id then
elect self (this processor has won)
if j < id then
do nothing

a) O(n2)(2) Messages and O(n)() time
b) O(logn)() Messages and O(logn) time
c) O(n)() Messages and O(n2)(2) time
d) O(n3)(3) Messages and O(n)() time

Answer: c

Cloud Computing and Distributed Systems Week 3 Assignment Solutions

Q7. In the O(nlogn) messages leader election algorithm, the probe distance in phase k is _______ and the Number of messages initiated by a processor in phase k is at most ______________including probes and replies in both directions.

2k−1,4k
2�−1,4�2k,4∗2k
2�,4∗2�k,2k�,2
�2k,4∗2k

Answer: d

Q8. Consider the following statements:
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.

a) Only statement 1 is true  
b) Only statement 2 is true  
c) Both statements are true  
d) Both statements are false

Answer: d

<< Previous- Cloud Computing and Distributed Systems Week 2 Assignment Solutions

>> Next- Cloud Computing and Distributed Systems Week 4 Assignment Solutions


DISCLAIMER: Use these answers only for the reference purpose. Quizermania doesn't claim these answers to be 100% correct. So, make sure you submit your assignments on the basis of your knowledge.

For discussion about any question, join the below comment section. And get the solution of your query. Also, try to share your thoughts about the topics covered in this particular quiz.

Checkout for more NPTEL Courses: Click Here!

Leave a Comment

Your email address will not be published. Required fields are marked *