Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

--- magistraleinformaticanetworking:ae:ae2023:start [27/11/2023 alle 10:14 (16 mesi fa)] – Paolo Ferragina
+++ magistraleinformaticanetworking:ae:ae2023:start [02/09/2024 alle 21:00 (6 mesi fa)] (versione attuale) – [Exam] Paolo Ferragina
@@ Linea 42: / Linea 42: @@
 ^ Dates ^ Room ^ Text ^ Notes ^
 | 06/11/2023, start at 14:00 | room E | Mid term: [[https://www.dropbox.com/scl/fi/iacfhv1ds8j737x83mvsn/AE231106.pdf?rlkey=g95k0r9hmfd527llxmob0s2qm&dl=0|text]], {{ :magistraleinformaticanetworking:ae:ae2023:ae231106-sol1.pdf |solution}}, {{ :magistraleinformaticanetworking:ae:ae2023:midterm2023.pdf |results}} |  |
-| 00/12/2023, start at 00:00 | room 00 | Final term: solution, text, results |  |
+| 12/12/2023, start at 09:30 | room C | Final term: {{ :magistraleinformaticanetworking:ae:ae2023:ae231212.pdf |text}}, {{ :magistraleinformaticanetworking:ae:ae2023:ae231212-sol.pdf |solution}}, {{ :magistraleinformaticanetworking:ae:ae2023:algorithmengineering-2024_finalterm.pdf |results}} |  |
-| 00/01/2024, start at 00:00 | room 00 | Exam: solution, text, results |  |
+| 15/01/2024, start at 9:00 | room C1 | Exam: {{ :magistraleinformaticanetworking:ae:ae2023:ae240115.pdf |text}}, {{ :magistraleinformaticanetworking:ae:ae2023:ae240115-sol.pdf |solution}}, {{ :magistraleinformaticanetworking:ae:ae2023:algorithmengineering-2024-jan24.pdf |results}} |  |
-| 00/02/2024, start at 00:00 | room 00 | Exam: solution, text, results |  |
+| 09/02/2024, start at 00:00 | room 00 | Exam: {{ :magistraleinformaticanetworking:ae:ae2023:ae240209.pdf |text}}, {{ :magistraleinformaticanetworking:ae:ae2023:ae240209-sol.pdf |solution}}, {{ :magistraleinformaticanetworking:ae:ae2023:ale240209-ris.pdf |results}} | Correction and view of the written exam on Wednesday, 14 February, hr: 17:30 (MS Teams). |
+| 27/05/2024, start at 11:00 | room C | {{ :magistraleinformaticanetworking:ae:ae2023:ae240527.pdf |text}} |  |
+| 21/06/2024, start at 11:00 | room C | {{ :magistraleinformaticanetworking:ae:ae2023:ae240621.pdf |text}} |  |
+| 11/07/2024, start at 11:00 | room C | {{ :magistraleinformaticanetworking:ae:ae2023:ae240711.pdf |text}} |  |
+| 04/09/2024, start at 09:00 | room C | text |  |
 ====== Background and Notes of the Course ======
@@ Linea 55: / Linea 60: @@
 ====== Lectures ======
-[[https://unipiit-my.sharepoint.com/:f:/g/personal/a009142_unipi_it/EgVMi4lPBexEpsf85wZkNt4BDSSq7hlUTozoGpK_0HTqOQ?e=ds9nHk|Video-lectures]] of last year are available at the link and they are linked just for reference, if you wish to re-check something you listened in class. This year, lectures are in presence and the program of the course could be different. \\
+[[https://unipiit-my.sharepoint.com/:f:/g/personal/a009142_unipi_it/EgVMi4lPBexEpsf85wZkNt4BDSSq7hlUTozoGpK_0HTqOQ?e=mVnadU|Video-lectures]] of last year are available at the link and they are linked just for reference, if you wish to re-check something you listened in class. This year, lectures are in presence and the program of the course could be different. \\
 The lectures below include also some **EXTRA** material, which is suggested to be read for students aiming to high rankings.
@@ Linea 94: / Linea 99: @@
 | 22/11/2023 | Succinctly encoding of binary trees, and labeled binary trees, with examples. |  |
 | 27/11/2023 | Data Compression. Static, semistatic, and dynamic models for frequency estimation. Huffman, with optimality (proof) and relation to Entropy. Canonical Huffman: construction, properties. Huffman decompression. | Chap. 12 of the book. No PPM. |
-| 27/11/2023 |  Arithmetic coding: properties, the converter tool. Compression, decompression, and entropy bounds. |  |
+| 27/11/2023 | Arithmetic coding: properties, the converter tool. Compression, decompression, and entropy bounds. |  |
-| 00/00/0000 | Dictionary-based compressors: properties and algorithmic structure. LZ77, LZSS, LZ78.  | Chap. 13 of the book. No LZW. {{ :magistraleinformaticanetworking:ae:ae2021:lect_lz77-78_no_lzw_.ppt |Slides}}. |
+| 28/11/2023 | Exercises on Huffman and Arithmetic coding, and on succinct binary trees. |  |
-| 00/00/0000 | Compressor bzip: MTF, RLE0, Wheeler-code, Burrows-Wheeler Transform. How to construct the BWT via qsort. How to invert the BWT. | Chap. 14 of the book |
+| 04/12/2023 | Dictionary-based compressors: properties and algorithmic structure. LZ77, LZSS, LZ78.  | Chap. 13 of the book. No LZW. {{ :magistraleinformaticanetworking:ae:ae2021:lect_lz77-78_no_lzw_.ppt |Slides}}. |
-| 00/00/0000 | Exercises |  |
+| 05/12/2023 | Compressor bzip: MTF, RLE0, Wheeler-code, Burrows-Wheeler Transform. How to construct the BWT via qsort. How to invert the BWT. | Chap. 14 of the book, and {{ :magistraleinformaticanetworking:ae:ae2023:lect_bwt.pptx |slides}}. |
+| 06/12/2023 | Exercises |  |
+| 11/12/2023 | Exercises |  |
+| 12/12/2023 | **FINAL TERM exam in room C, 9:30-11** | Please register in the ESAMI platform, on the exam date of January.|