Course Details for A.Y. 2013/2014

The information on this page refer to the academic year 2013/2014. Therefore, several links are not available and data may be incomplete. To read the current information on the course, if it is still available, go to the university course catalogue . To read information relating other academic years, use the list at the bottom of this page.

A. Year:

2013/2014

Name:

Algoritmi e Strutture Dati / Algorithms and Data Structures

Type:

Module

Main course:

Algoritmi e Strutture Dati con Laboratorio / Algorithms and Data Structures with Lab

Basic information

Code:

F1I012

Sector:

INF/01

Credits:

: Laurea in Informatica 6 CFU (a)

Term:

1° semestre

Degree(s):

Laurea in Informatica 2° anno curriculum Generale Obbligatorio

Language:

Italian

Course Objectives

Il corso fornisce gli elementi fondamentali di teoria e progettazione degli algoritmi

Course Content

Algorithms and problems. Complexity analysis of an algorithm. Lower and upper bound.
Sorting algorithms: insertion-sort, selection-sort, merge-sort, quick-sort
Priority queues: binary heaps, binomial heaps, heap-sort.
The dictionary problem: searching, inserting, deleting. Hast tables and AVL trees.
Graphs: definitions, memory representations, DFS and BFS.
Elementary graph algorithms: shortest paths and minimum spanning trees.

Learning Outcomes (Dublin Descriptors)

On successful completion of this course, the student should

By the end of this module students will be able to: 1) understand the importance of designing efficient algorithms; 2) analyze the resources (space and time) needed by an algorithm; 3) known efficient algorithms for basic computational problems (sorting, searching, graph problems, etc.).
The aim is to make the student capable of abstracting models and formal algorithmic problems from real computational problems, and designing efficient algorithmic solutions.
Through the presentation and the comparison of different solutions to a given probelm, students will be guided to learn and to identify independently their most efficient solution.
The course will encourage the development of the following skills of the student: capability of formally presenting and modelling concrete problems, focusing on their main features and discarding the inessential ones.
The course aims to develop in undergraduate students competencies and abilities necessary in their future studies, especially with respect to advanced algorithmic courses.

Assessment Methods and Criteria

Chi ha acquisito la frequenza negli anni precedenti al 2007/08 dovrà sostenere l'esame del corso di Algoritmi e Strutture Dati da 6 CFU. Gli studenti immatricolati dall'A.A. 2007/08 dovranno sostenere l'esame unico di Algoritmi e Strutture Dati con Laboratorio da 12 CFU.

Textbooks

C. Demetrescu, I. Finocchi, G.F. Italiano, Algoritmi e Strutture Dati , Ed. McGraw-Hill.

Internet Resources

Homepage:

http://www.di.univaq.it/~proietti/didattica.html

Course page updates

This course page is available (with possible updates) also for the following academic years:

To read the current information on this course, if it is still available, go to the university course catalogue .

Course information last updated on: 20 marzo 2014, 13:05