This set of MCQ(multiple choice questions) focuses on the Advanced Distributed System NPTEL Week 5 Solutions.
This course is on Advanced Distributed Systems. It will start with epidemic and gossip based algorithms and then move on to peer-to-peer networks. The core focus in this part will be on distributed hash tables (DHTs). Then, the course will focus on theoretical aspects such as vector clocks, distributed leader election, the FLP result, and the CAP theorem. The last part of the course will focus on practical technologies such as the Paxos and RAFT consensus protocols, commit protocols, Bitcoin and blockchains, distributed file systems, and distributed programming languages.
Course Layout
Answers COMING SOON! Kindly Wait!
- Week 1: Assignment Solution
- Week 2: Assignment Solution
- Week 3: Assignment Solution
- Week 4: Assignment Solution
- Week 5: Assignment Solution
- Week 6: Assignment Solution
- Week 7: Assignment Solution
- Week 8: Assignment Solution
- Week 9: Assignment Solution
- Week 10: Assignment Solution
- Week 11: Assignment Solution
- Week 12: Assignment Solution
NOTE: You can check your answer immediately by clicking show answer button. Moreover, this set of “Advanced Distributed Sytem NPTEL Week 5 Solutions” contains 10 questions.
Now, start attempting the quiz.
Advanced Distributed System NPTEL Week 5 Solutions
Q1. In the GHS algorithm, the number of fragments ____________ gradually.
a) increases
b) decreases
c) remains constant
d) None of these
Answer: b)
Q2. Assume that F1 and F2 are two fragments in the GHS algorithm and level(F1) = level(F2). What is the level of a new fragment if F1 is combining with F2?
a) level(F1)
b) level(F1) – 1
c) level(F1) + 1
d) level(F2) + 2
Answer: c)
Q3. Match the following statuses for an edge in the GHS algorithm with their corresponding definitions/interpretations.
a) A-I, B-II, C-III
b) A-II, B-I, C-III
c) A-III, B-II, C-I
d) A-III, B-I, C-II
Answer: d)
Q4. In the GHS Algorithm, any fragment F at a level L has at least _________ number of nodes.
a) L
b) 2L
c) 2L
d) L2
Answer: c)
Q5. In the GHS Algorithm, there are ________ fragment name or level changes.
a) O(N)
b) O(log(N))
c) O(N*log(N))
d) O(N2)
Answer: c)
Q6. Which of the following statements is/are true about the Chandy-Lamport algorithm? Choose the most appropriate answer.
a) Every process takes a local snapshot.
b) The algorithm generates a consistent snapshot.
c) The process does not process any message while taking a snapshot.
d) All of these.
Answer: d)
Q7. Consider the following statements about the Chandy-Lamport algorithm.
S1: The algorithm terminates in finite time.
S2: If a message (p → q) is sent after a local snapshot, then it can be a part of the receiver’s (q) snapshot.
a) S1 is true; S2 is false.
b) S1 is false; S2 is true.
c) Both S1 and S2 are true.
d) Both S1 and S2 are false.
Answer: a)
Q8. The Chandy-Lamport algorithm follows the __________ model.
a) centralized
b) master-slave
c) distributed
d) None of these
Answer: c)
Q9. Consider the following statements regarding a partially correct consensus protocol:
S1: None of the accessible configurations have a value that is either 0 or 1.
S2: No accessible configuration has more than one decision value.
a) S1 is true; S2 is false.
b) S1 is false; S2 is true.
c) Both S1 and S2 are true.
d) Both S1 and S2 are false.
Answer: b)
Q10. What does the FLP result propose?
a) Impossibility of distributed consensus with one faulty process.
b) Impossibility of distributed consensus with multiple faulty processes.
c) Possibility of distributed consensus with one faulty process.
d) Possibility of distributed consensus with multiple faulty processes.
Answer: a)
>> Prev- Advance Distributed System Week 4 Assignment Solutions
>> Next- Advance Distributed System Week 6 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