2. Professors
  3. Teaching

INTRODUZIONE AGLI ALGORITMI E ALLE STRUTTURE DATI

Roberto DE PRISCO INTRODUZIONE AGLI ALGORITMI E ALLE STRUTTURE DATI

0512100042
DIPARTIMENTO DI INFORMATICA
COMPUTER SCIENCE
2014/2015



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


PAOLO D'ARCO T Curriculum
Objectives
THE GOAL OF THIS COURSE IS THAT OF GIVING TO THE STUDENT BASIC
KNOWLEDGE TO STUDY AND DESIGN EFFICIENT ALGORITHMS, WITH EMPHASIS
ON THE FUNDAMENTAL 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 HAS THE GOAL OF EVALUATING
THE SKILLS OF THE STUDENT WITH RESPECT TO THE APPLICATION OF
THE ACQUIRED KNOWLEDGE TO THE DESIGN OF EFFICIENT SOLUTIONS FOR
CLASSES OF ALGORITHMIC PROBLEMS.
IN THE ORAL EXAM THE STUDENT HAS TO SHOW KNOWLEDGE OF ALL THE
TOPICS STUDIED IN THE COURSE.
Texts
P. CRESCENZI, G. GAMBOSI, R. GROSSI, G. ROSSI. STRUTTURE DI DATI E ALGORITMI, SECONDA EDIZIONE, ADDISON-WESLEY PEARSON,
J.A. STORER, AN INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS, SPRINGER SCIENCE + BUSINESS MEDIA, LLC, 2002
  BETA VERSION Data source ESSE3 [Ultima Sincronizzazione: 2016-09-30]