DidaWiki

Questa pagina è in sola lettura. Puoi visualizzare il sorgente, ma non puoi modificarlo. Contatta l'amministratore se pensi che ci sia un errore.
====== Algorithm Engineering ======

**Teachers**: [[http://www.di.unipi.it/~ferragin/|Paolo Ferragina]] 
                                                    

**CFU:** 9.

**Language:** English.

**Degree:** This course is offered to the students of the Master degree in Informatics for Digital Health, University of Pisa.

\\
====== Goals ====== 

In this course we will study, design and analyze advanced algorithms and data structures for the efficient processing of big data, being in the form of integers, strings, (geometric) points, trees and graphs. These algorithmic tools will be designed and analyzed in the RAM and the 2-level memory models in order to take into account the architectural features and the memory hierarchy of modern PCs, and evaluate the use of some computational resources like time, space, communication, I/O, energy, etc. Some of these solutions will be discussed at an experimental level, with some hands-on activity in Python.


====== Background====== 

If you wish to refresh your mind on Algorithms and Data Structures, I suggest you to follow the [[http://videolectures.net/mit6046jf05_introduction_algorithms/|Video Lectures]] by Erik Demaine and Charles Leiserson, specifically Lectures 1-5, 7 and 10. There it is missing the part on basic graph problems (representation, DFS, BFS, topological sort) which you may browse in any book, such as  [[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11866|Introduction to Algorithms]] by Cormen-Leiserson-Rivest-Stein, third edition.




====== Current year ======
  * [[.ad4da2024:|Academic Year 2024-2025]]


====== Previous years ======
  *