====== Year 2023-2024 ======

[[http://pages.di.unipi.it/grossi/|Prof. Roberto Grossi]]
[[http://webhost.services.iit.cnr.it/staff/filippo.geraci/|Dr. Filippo Geraci]]


==== Announcements ====

  * **The course will start on Feb. 26, 2023.**

==== Schedule (work in progress) ====

  * Class hours: 
  * Office hours: remotely by appointment

==== Overview ====

The advanced nature of this course focuses on developing algorithmic design skills, exposing the students to complex problems that cannot be directly handled by standard libraries (being aware that several basic algorithms and data structures are already covered by the libraries of modern programming languages), thus requiring a significant effort in problem solving. These problems involve all basic data types, such as integers, strings, (geometric) points, trees and graphs as a starting point. The syllabus is structured to highlight the applicative situations in which the corresponding algorithms can be successfully employed, making references to software applications and libraries. The level of detail in each argument can change year-by-year, and will be decided according to requests coming from other courses in the curriculum and/or specific issues arising in, possibly novel, applicative scenarios. 


==== Exams ====

//Written exam:// weekly hands-on in classroom (attendance is highly suggested).


//Oral exam:// topics discussed in class, please read the references in the notes.


//Syllabus:// [[https://unimap.unipi.it/registri/printregistriNEW.php?re=10336855:::&ri=9172|programma d'esame]]


==== Topics ====

  * Please see the topics in "programma d'esame". Handouts are are available in the MS Teams channel.

== Activity in class ==

  * The screen snapshots shown during the classes are available in the MS Teams channel.

== Official forms for the course ==

  * Access to the [[https://esami.unipi.it/esami/|course evaluation form (questionario studenti)]] before taking examination.


==== Class schedule ====


^ Date ^ Topics ^ References and notes ^