Algorithmic Design

Learning Goals

students are expected to be able to evaluate the asymptotic complexity of a known algorithm; design an efficient algorithm for simple problems; have a picture of the most efficient algorithms in pattern matching
and graph “analysis”; read a scientific paper about algorithms, understand, and properly present it by using the opportune terminology.

Program in pills

Definition of algorithm, and asymptotic analysis. Basic data structure. Sorting algorithms. Matrix multiplication. Basic graphs algorithms, transitive closure, connectedness, shortest path algorithms, routing problems. Pattern matching problem. Basic string algorithms.

Area

Computer Science and Intensive Computing

Curriculum Foundations
TAF Type

B

Curriculum Industry
TAF Type

Curriculum Health
TAF Type

C

Curriculum Economy
TAF Type

SSD

INF/01

ECTS

6

Semester

2

Lecturers

Giulia Bernardini
Link (esse3)
Back to Courses