Which statements are correct about the scalable system? Select all that apply.

What is the correct explanation of hiding the occurrence and recovery from failures in a distributed system?

What are the correct strategies for the applications in the distributed system? Select all that apply.

In the lecture, we have discussed the sequential consistency can be violated if not all processes see the same interleaving of write operations. Which of the following options accurately follow the sequential consistency? Select all that apply.

We have learned that the Berkely algorithm is an internal clock synchronization algorithm. Which statements give correct explanations for the Berkeley algorithm? Select all that apply.

A client’s clock reads 3:30:00. The server’s clock reads 3:20:00 when they synchronize using the Berkeley algorithm. Assume message delays are negligible. What is the time at the client after synchronization?

We have discussed the rules that are applied in Entry Consistency. Which descriptions correctly explain the characteristics of the Entry Consistency? Select all that apply.

We have discussed scenarios where write-write conflict when discussing Eventual Consistency. Which of the following options explains the scenario that may be vulnerable to write-write conflicts?

We have discussed different usage of the notations of client-centric consistency in the lecture. Which definitions correctly identify the notation we use for the client-centric consistency? Select all that apply.

In the lecture, we have discussed that sequential consistency can be violated if not all processes see the same interleaving of write operations. Which of the following options violate the sequential consistency? Select all that apply.