Contacts
Community
Search
IT | EN | FR | عربي | GR
Uninettuno University Logo

Corso Vittorio Emanuele II, 39 - Roma 0669207671

Contacts
Community

Computer engineering (Academic Year 2021/2022) - Information and communication technologies engineering (reserved for the students of Helwan University, Cairo, Egypt)

Algorithms and data structures



Slides

Lesson n. 1: Introductions and Definitions Go to this slide Massimo Poncino
Lesson n. 2: Complexity Analysis Go to this slide Massimo Poncino
Lesson n. 3: Analysis of recursive programs: recurrences I Go to this slide Massimo Poncino
Lesson n. 4: Analysis of recursive programs: recurrences II Go to this slide Massimo Poncino
Lesson n. 5: Sorting Go to this slide Massimo Poncino
Lesson n. 6: Heapsort and Quicksort Go to this slide Massimo Poncino
Lesson n. 7: Sorting - linear time algorithms Go to this slide Massimo Poncino
Lesson n. 8: Dynamic sets and dictionaries Go to this slide Massimo Poncino
Lesson n. 9: Binary Search Trees Go to this slide Massimo Poncino
Lesson n. 10: Hash Tables I Go to this slide Massimo Poncino
Lesson n. 11: Hash Tables II Go to this slide Massimo Poncino
Lesson n. 12: Algorithmic paradigms: Dynamic programming I Go to this slide Massimo Poncino
Lesson n. 13: Dynamic programming II Go to this slide Massimo Poncino
Lesson n. 14: The greedy paradigm Go to this slide Massimo Poncino
Lesson n. 15: Search-based paradigms: backtracking Go to this slide Massimo Poncino
Lesson n. 16: Graphs I Go to this slide Massimo Poncino
Lesson n. 17: Graphs II Go to this slide Massimo Poncino
Lesson n. 18: Graphs visits Go to this slide Massimo Poncino
Lesson n. 19: Application of Depth-First-Search Go to this slide Massimo Poncino
Lesson n. 20: Minimum Spanning Trees I Go to this slide Massimo Poncino
Lesson n. 21: Minimum Spanning Trees II Go to this slide Massimo Poncino
Lesson n. 22: Shortest paths I Go to this slide Massimo Poncino
Lesson n. 23: Shortest paths II Go to this slide Massimo Poncino
Lesson n. 24: All-pairs shortest paths Go to this slide Massimo Poncino
Lesson n. 25: Intractable problems and NP completeness Go to this slide Massimo Poncino