IT
EN
FR
عربي
Informations
Formation professionnelle
Services pour les Entreprises
Projets de Formation
Recherche
Menu secondario
Chargé de Cours
Syllabus
Schéma conceptuel
Planification didactique
Charte des Examens
Agenda
Espace d'apprentissage
Vidéo leçons
Slides
Livres et Articles
Cédérom
Bibliographie
Links
Laboratoire
Exercises
Classes interactives passées
Classes Virtuelles Réalisées
Grille des Programmes
Tuteur
Area dell'Ingegneria
Algorithms and data structures
Slides
Leçon n. 1:
Introductions and Definitions
Massimo Poncino
Leçon n. 2:
Complexity Analysis
Massimo Poncino
Leçon n. 3:
Analysis of recursive programs: recurrences I
Massimo Poncino
Leçon n. 4:
Analysis of recursive programs: recurrences II
Massimo Poncino
Leçon n. 5:
Sorting
Massimo Poncino
Leçon n. 6:
Heapsort and Quicksort
Massimo Poncino
Leçon n. 7:
Sorting - linear time algorithms
Massimo Poncino
Leçon n. 8:
Dynamic sets and dictionaries
Massimo Poncino
Leçon n. 9:
Binary Search Trees
Massimo Poncino
Leçon n. 10:
Hash Tables I
Massimo Poncino
Leçon n. 11:
Hash Tables II
Massimo Poncino
Leçon n. 12:
Algorithmic paradigms: Dynamic programming I
Massimo Poncino
Leçon n. 13:
Dynamic programming II
Massimo Poncino
Leçon n. 14:
The greedy paradigm
Massimo Poncino
Leçon n. 15:
Search-based paradigms: backtracking
Massimo Poncino
Leçon n. 16:
Graphs I
Massimo Poncino
Leçon n. 17:
Graphs II
Massimo Poncino
Leçon n. 18:
Graphs visits
Massimo Poncino
Leçon n. 19:
Application of Depth-First-Search
Massimo Poncino
Leçon n. 20:
Minimum Spanning Trees I
Massimo Poncino
Leçon n. 21:
Minimum Spanning Trees II
Massimo Poncino
Leçon n. 22:
Shortest paths I
Massimo Poncino
Leçon n. 23:
Shortest paths II
Massimo Poncino
Leçon n. 24:
All-pairs shortest paths
Massimo Poncino
Leçon n. 25:
Intractable problems and NP completeness
Massimo Poncino