Menu secondario

Ingegneria informatica (Ακαδημαϊκό έτος 2018/2019) - Ingegneria Informatica (ad esaurimento)

Algorithms and data structures

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

Please login

Please login

Menu secondario

Ingegneria informatica (Ακαδημαϊκό έτος 2018/2019) - Ingegneria Informatica (ad esaurimento)

Algorithms and data structures

Μαγνητοσκοπημένο μάθημα