Course objective: to introduce students to fundamental concepts of distributed computing. Material: Basic principles and philosophy of Distributed Systems (DS). The CS of the internet (models, www, search engines). Basic CS tools and services. Contemporary and Asynchronous CS models. Basic CS algorithms: leader election algorithms, permeation algorithms, shortest path algorithms. Consent to CS and fault tolerance. Synchronizers. Reasonable time. Mutual exclusion in CS. Issues of rivalry and competitiveness in CS.