CS4513 Practice Third Exam

  1. Give two reasons synchronizing clocks is difficult in a distributed system.

  2. Briefly describe how Critian's algorithm works.

  3. Describe what happens in the "bully" election algorithm when a server/leader goes down. In a practical system, what aspect of the bully algorithm may be difficult?

  4. What is the atomic nature in regard to transactions? Why is this more difficult in a distributed system than in a centralized system?

  5. How is XML different than HTML?

  6. What is the difference between a persistent connection and a parallel request? Describe system characteristics where you would want to use each.

  7. Then, why would you want to use strong cache consistency? Why would you want to use weak cache consistency?

  8. Describe one weak cache consistency heuristic. When might it fail?

  9. Where does the SSL layer reside in the network stack?

Return to the CS4513 Home Page