https://github.com/marincervinschi/strutturedatiealgoritmi

"Data Structures and Algorithms" is a comprehensive course offered at the University of Modena and Reggio Emilia. Led by esteemed instructors, this course delves into fundamental topics such as activation records, recursion, algorithmic complexity, and various algorithms.
https://github.com/marincervinschi/strutturedatiealgoritmi

algorithms algorithms-and-data-structures arrays c data-structures heaps lists sorting-algorithms strings trees

Last synced: 5 days ago
JSON representation

"Data Structures and Algorithms" is a comprehensive course offered at the University of Modena and Reggio Emilia. Led by esteemed instructors, this course delves into fundamental topics such as activation records, recursion, algorithmic complexity, and various algorithms.

• Host: GitHub
• URL: https://github.com/marincervinschi/strutturedatiealgoritmi
• Owner: MarinCervinschi
• Created: 2023-06-28T14:38:20.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2024-12-02T21:48:28.000Z (22 days ago)
• Last Synced: 2024-12-02T22:32:38.062Z (22 days ago)
• Topics: algorithms, algorithms-and-data-structures, arrays, c, data-structures, heaps, lists, sorting-algorithms, strings, trees
• Language: C
• Homepage:
• Size: 26.2 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        



  



###

# 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.