IT
EN
FR
عربي
Information
Course Catalogue
Services for businesses
Training Projects
Search
Menu secondario
Appointed teaching professor
Syllabus
Concept map
Didactic plan
Exam Guide
Agenda
Learning Environment
Videolessons
Slides
Books and Articles
CD-ROM
Bibliography
Siteography
Laboratory
Exercises
Past interactive classes
Done Virtual Classrooms
Programme Schedule
Tutor
Engineering Area
Algorithms and data structures
Slides
Lesson n. 1:
Introductions and Definitions
Massimo Poncino
Lesson n. 2:
Complexity Analysis
Massimo Poncino
Lesson n. 3:
Analysis of recursive programs: recurrences I
Massimo Poncino
Lesson n. 4:
Analysis of recursive programs: recurrences II
Massimo Poncino
Lesson n. 5:
Sorting
Massimo Poncino
Lesson n. 6:
Heapsort and Quicksort
Massimo Poncino
Lesson n. 7:
Sorting - linear time algorithms
Massimo Poncino
Lesson n. 8:
Dynamic sets and dictionaries
Massimo Poncino
Lesson n. 9:
Binary Search Trees
Massimo Poncino
Lesson n. 10:
Hash Tables I
Massimo Poncino
Lesson n. 11:
Hash Tables II
Massimo Poncino
Lesson n. 12:
Algorithmic paradigms: Dynamic programming I
Massimo Poncino
Lesson n. 13:
Dynamic programming II
Massimo Poncino
Lesson n. 14:
The greedy paradigm
Massimo Poncino
Lesson n. 15:
Search-based paradigms: backtracking
Massimo Poncino
Lesson n. 16:
Graphs I
Massimo Poncino
Lesson n. 17:
Graphs II
Massimo Poncino
Lesson n. 18:
Graphs visits
Massimo Poncino
Lesson n. 19:
Application of Depth-First-Search
Massimo Poncino
Lesson n. 20:
Minimum Spanning Trees I
Massimo Poncino
Lesson n. 21:
Minimum Spanning Trees II
Massimo Poncino
Lesson n. 22:
Shortest paths I
Massimo Poncino
Lesson n. 23:
Shortest paths II
Massimo Poncino
Lesson n. 24:
All-pairs shortest paths
Massimo Poncino
Lesson n. 25:
Intractable problems and NP completeness
Massimo Poncino