Data Structures and Algorithms

Authors: Maurizio Vincini, Federico Bolelli

Course Overview:

• Activation Records:

  • Function activation records, stack memory, visibility and lifetime rules for variables and functions, global and static variables. Dynamic memory allocation.

• Modular Program Organization

• Recursion:

  • Recursive algorithms, recursive functions

• Backtracking Algorithms

• Complexity:

  • Algorithmic complexity, asymptotic behavior, evaluating program complexity

• Greedy Algorithms

• Searching and Sorting Algorithms

• Abstract Data Types:

  • Lists, heaps. Binary trees: insertion, search, deletion

• List and Tree Storage

This README.md provides an overview of the course "Data Structures and Algorithms" by Maurizio Vincini and Federico Bolelli, who teach at the University of Modena and Reggio Emilia (UniMoRe). It covers fundamental concepts such as activation records, recursion, complexity analysis, and various algorithms including backtracking, greedy, searching, and sorting. Additionally, it explores abstract data types such as lists, binary trees, along with their storage mechanisms.