Ateneo - UPO

Introduction to the concepts of algorithm, algorithmic complexity;
Overview of the most popular data structures and analysis of the complexity of related
Abstract Data Types (ADT);
Examples of using such ADT;
Analysis of the implementation of the various ADTs in Python.

Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser. Data Structures and Algorithms in Python. Wiley

Provide students with the basic concepts related to data structures focusing on the main ones and their usein pratice with specific attention to the coplexity aspects

Basic methodologies of programming and of Phyton language

Lectures and practical exercises

Written test

• Data structure concept and Algorithm Analysis
• Array-based sequences (refering to list, tuples and matrix in in Python)
• Stacks and Queues
• Linked Lists
• Recursive functions
• Trees and Tree Traversal Algorithms
• Dictionaries and Hash Maps
• Sorting Algorithms
• Graphs

The student must become familiar with the main data structures, understand how to use them and evaluate their computational complexity.