Unige 11X001 – Introduction à la programmation des algorithmes

1 – Introduction. (slides – 42 slides / video – 81min37s)

2.1 – Types. (slides – 47 slides / video – 76min4s)

2.2 – Expressions. (slides – 53 slides / video – 72min18s)

2.3a – Fonctions et Branchements. (slides – 45 slides / video – 66min39s)

2.3b – Fonctions Récursives. (slides – 45 slides / video – 61min26s)

2.4a – Fonctions d'Ordres Supérieurs. (slides – 53 slides / video – 66min12s)

2.4b – Types Paramétriques et Opérations Collectives. (slides – 46 slides / video – 69min45s)

2.5 – Exemples. (slides – 45 slides / video – 58min3s)

2.6 – Fonctions pré-existantes. (slides – 42 slides / video – 60min45s)

3.1 – Variables et Mutabilité. (slides – 50 slides / video – 59min5s)

3.2 – Boucles. (slides – 46 slides / video – 62min58s)

3.3 – Types de données mutables. (slides – 50 slides / video – 63min17s)

3.4 – Listes, Piles et Arbres. (slides – 43 slides / video – 60min12s)

4 – Récapitulation. (slides – 70 slides / video – 83min0s)