Knowledge of classical algorithms and data structures. Ability to analize and design application-specific algorithms and data structures.
Course Prerequisites
Knowledge of computer and networks hardware/software architecture. Knowledge of a programming language.
Teaching Methods
Frontal, face-to-face lectures
Assessment Methods
Learning outcome will be verified through a written test. The candidate shall have to answer 4 open questions and to develop the execution trace of a given algorithm
Texts
Canning J., Alan Broder, Robert Lafore Data Structures and Algorithms in Python Pearson Ed.
Lecture notes and online references provided by the instructor.
Contents
- Fundamentals Basic Programming Model Data Abstraction Bags, Queues and Stacks Analysis of Algorithms
