• IT
• EN
• FR
• عربي
• # Engineering Area

No items selected

## Algorithms and data structures

Prof. Massimo Poncino
(Politecnico di Torino (Torino - Italy))
Language English
Course description
The purpose of this course is to introduce students to the topics of data structures and algorithm design along with their respective applications. The topics that will be covered are:
• Algorithms Analysis
• Sorting Algorithms
• Graphs
• Intractable problems
The use of data structures in programming languages and relevant aspects of data and file management will be illustrated by using a high level language.
Objectives
The primary goal of this course is to enhance the students’ knowledge and understanding of algorithms and data structures and the associated design and analysis techniques. This course aims at developing the students’ ability to design and implement data structures and algorithms, analyze them for correctness and efficiency, and choose the right data structure/algorithm for a particular job.
Program
Algorithms Analysis
Sorting Algorithms
 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