• the basic characteristics of distributed systems;
• architectures of distributed systems;
• problems related to the communication in distributed systems;
• methods and techniques to address such problems;
• different types of middleware;
• software patterns for distributed systems;
• an introduction to graph theory and graph algorithms.
  

The course focuses on generic concepts, techniques, methods, and open standards for distributed systems.
We do not (explicitly) discuss the implementation of distributed systems via a particular programming language or software platform.

Please answer the self-assessment questions available from the download section to check your knowledge.

• 2 in-class exams counting for 20 points each;
• 1 final exam counting for 60 points;
• A positive grade is awarded if at least 50% of all points (i.e. 50/100) are earned. The remaining grades are awarded in 10% steps (60%, 70%, 80%). Thus, a "1, excellent" is awarded if at least 80% (i.e. 80/100) of all points have been earned.
• Each student who participates in at least one of the 3 exams is graded.
• If a student fails the entire course (i.e. finishes with a negative grade), the student will be allowed a single repeat of the final exam, given the following conditions hold:
  • the student earned at least 15/40 points from the in-class exams;
  • and the student earned at least 15/60 points from the final exam.
• If one or both of the above conditions are missed, students will have to repeat the entire course (incl. all exams) in a subsequent semester.