Binary Heap, Heap-sort, Counting-sort, Chained Hash Table, Open Hash Table, RB-Tree (no delete), Dynamic Programming, Huffman Code, Shortest Path Algorithms for Graph (Belman-Ford, Dijkstra, Floyd-Warshall).

Students will use the exercise platform Coding Contest to take a practical exam. Alternatively, students can apply for a project. Send an email to professor Simone Faro (faro at dmi dot unict dot it) to request credentials. Without such an account, students cannot take the exam. Due to the pandemic emergency, learning assessments and exams may also or exclusively be carried out on line, should the conditions require it.