# Ingénierie Informatique (Academic Year 2018/2019) - Ingegneria Informatica

## Matériel supplémentaire

 Leçon n.1: Introductions and Definitions n. 1.1 - Free Ebook on Algorithms   (A.Y. 2009/2010) Leçon n.2: Complexity Analysis Leçon n.3: Analysis of recursive programs: recurrences I Leçon n.4: Analysis of recursive programs: recurrences II Leçon n.5: Sorting Leçon n.6: Heapsort and Quicksort Leçon n.7: Sorting - linear time algorithms Leçon n.8: Dynamic sets and dictionaries Leçon n.9: Binary Search Trees Leçon n.10: Hash Tables I Leçon n.11: Hash Tables II Leçon n.12: Algorithmic paradigms: Dynamic programming I Leçon n.13: Dynamic programming II Leçon n.14: The greedy paradigm Leçon n.15: Search-based paradigms: backtracking Leçon n.16: Graphs I Leçon n.17: Graphs II Leçon n.18: Graphs visits Leçon n.19: Application of Depth-First-Search Leçon n.20: Minimum Spanning Trees I Leçon n.21: Minimum Spanning Trees II Leçon n.22: Shortest paths I Leçon n.23: Shortest paths II Leçon n.24: All-pairs shortest paths Leçon n.25: Intractable problems and NP completeness

### Siège de l'Université

Corso Vittorio Emanuele II, 39
00186 Roma - ITALIA
C.F.: 97394340588
P.IVA: 13937651001

### Certified mail

info@pec.uninettunouniversity.net

### Secrétariat des Etudiants

tel: +39 06 692076.70
tel: +39 06 692076.71
e-mail: info@uninettunouniversity.net

### Vidéoconférence

Library 1st floor: 90.147.90.157
Meeting Room 5th floor: 90.147.90.158

### Avez-vous besoin d’informations plus détaillées?

Donnez-nous vos données