Algorithms and Data Structures - Teoria (2007/2008)

Course Not running, not visible

Course code
4S00013
Name of lecturer
Alessandra Di Pierro
Number of ECTS credits allocated
8
Academic sector
INF/01 - INFORMATICS
Language of instruction
Italian
Location
VERONA
Period
1° Q, 2° Q

To show the organization of the course that includes this module, follow this link * Course organization

Lesson timetable

1° Q
Day Time Type Place Note
Monday 10:30 AM - 12:30 PM lesson Lecture Hall A  
Tuesday 10:30 AM - 12:30 PM lesson Lecture Hall E  
2° Q
Day Time Type Place Note
Monday 10:30 AM - 12:30 PM lesson Lecture Hall B  
Tuesday 10:30 AM - 12:30 PM lesson Lecture Hall C  

Learning outcomes

In this course students will learn how to use a computer for solving real life problems via the design of suitable algorithms. Possible solutions are compared in terms of their efficiency. To this purpose the course includes the study of the mathematical methods for the analysis and the evaluation of the various algorithms. Abstract mathematical stuctures are used to represent the concrete data of a given problem; they play a fundamental role in the encoding of the concrete setting in the virtual world of computers.

Syllabus

-Computational problems: indecidability, tractability, computational model and computational complexity.

-Arrays and lists: binary search, recursion, linked lists.

-Exact string matching algorithms.

-Trees: recursive algorithms on binary trees, insertion and deletion, breadth-first visit and tree representations.

-Dictionaries: binary search trees, AVL trees.

-Algorithms for the construction of Suffix Trees.

-Graphs: problems on graphs, graph representations, shortest paths.

-Stacks and queues: implementation, breadth-first and depth-first search.

-Priority queues: heaps, implementation, building and sorting a heap.

-NP-completeness: Polynomial time, NP-completeness and reducibility, NP-complete problems, Cook-Levin theorem.

Reference books
Author Title Publisher Year ISBN Note
Crescenzi, P. - Gambosi, G. - Grossi, R. Strutture di Dati e Algoritmi Pearson Education Italia 2006 8871922735

Assessment methods and criteria

Written test divided in two parts: Teoria and Laboratorio. The duration of the test is 3 hours: 2 hours for the theory part and 1 hour for the practical part. Candidates must score at least 18/30 for each part of the test. The overall final score is calculated as the weighted sum of the two individual scores with weights 4/5 for the theory part and 1/5 for the practical part.

Teaching aids

Documents

Studying