2. Professors
  3. DE BONIS Annalisa
  4. Teaching

INTRODUZIONE AGLI ALGORITMI E ALLE STRUTTURE DATI

Annalisa DE BONIS INTRODUZIONE AGLI ALGORITMI E ALLE STRUTTURE DATI

0512100042
DIPARTIMENTO DI INFORMATICA
COMPUTER SCIENCE
2015/2016



OBBLIGATORIO
YEAR OF COURSE 1
YEAR OF DIDACTIC SYSTEM 2015
SECONDO SEMESTRE
CFUHOURSACTIVITY
648LESSONS
324EXERCISES


ANNALISA DE BONIS T Curriculum
Objectives
THE GOAL OF THIS COURSE IS TO GIVE STUDENTS THE BASIC
KNOWLEDGE TO STUDY AND DESIGN EFFICIENT ALGORITHMS, WITH EMPHASIS ON THE FUNDAMENTALS DATA STRUCTURES.
Prerequisites
NONE (THIS COURSE IS FOR FIRST-YEAR COMPUTER SCIENCE STUDENTS).
Contents
1. INTRODUCTION TO ALGORITHMS, PSEUDOCODE
2. ANALYSIS MEASURES (TIME AND SPACE)
3. ASYMPTOTICAL ANALYSIS
4. BASIC DATA STRUCTURES
5. DATA STRUCTURES EXPLORATION
6. ITERATIVE AND RECURSIVE ALGORITHMS
7. BINARY TREES AND OPERATIONS ON BINARY TREES
8. HASHING
9. PRIORITY QUEUES AND THEIR IMPLEMENTATION WITH HEAPS
10. ALGORITHM DESIGN TECHNIQUES: DIVIDE-AND-CONQUER
Teaching Methods
CLASS LECTURES WITH PRACTICAL EXAMPLES AND CASE STUDIES.
Verification of learning
WRITTEN AND ORAL EXAMS. THE WRITTEN EXAM AIMS AT EVALUATING THE SKILLS OF THE STUDENTS TO APPLY
THE ACQUIRED KNOWLEDGE TO THE SOLUTION OF SPECIFIC ALGORITHMIC PROBLEMS.
IN THE ORAL EXAM THE STUDENTS HAVE TO SHOW KNOWLEDGE OF ALL THE TOPICS STUDIED IN THE COURSE.

RISPETTO ALL'INTERO PROGRAMMA.
Texts
P. CRESCENZI, G. GAMBOSI, R. GROSSI, G. ROSSI. STRUTTURE DI DATI E ALGORITMI, SECOND EDITION, ADDISON-WESLEY PEARSON, 2012.
J.A. STORER, AN INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS, SPRINGER SCIENCE + BUSINESS MEDIA, LLC, 2002.
T. H. CORMEN, C. E. LEISERSON, R. L. RIVEST, C. STEIN. INTRODUZIONE AGLI ALGORITMI E STRUTTURE DATI, SECONDA EDIZIONE, MCGRAW-HILL EDUCATION, 2005.
More Information
NONE
  BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2016-09-30]