Differenze

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

--- magistraleinformaticanetworking:ae:ae2019:start [28/11/2019 alle 07:46 (6 anni fa)] – [BACKUP of the LAST YEAR (kept here only as an example)] Paolo Ferragina
+++ magistraleinformaticanetworking:ae:ae2019:start [26/04/2021 alle 10:37 (4 anni fa)] (versione attuale) – [Books, Notes, etc.] Paolo Ferragina
@@ Linea 40: / Linea 40: @@
 ^ Dates ^ Room ^ Text ^ Notes ^
 | 19/11/19, 11:00-13:00 | (First Midterm) | {{ :magistraleinformaticanetworking:ae:ae2019:ae191119.doc |text}}, {{ :magistraleinformaticanetworking:ae:ae2019:soluzione_ae_nov_2019_.pdf |solution}}, {{ :magistraleinformaticanetworking:ae:ae2019:algorithmengineering-1920-compitino1.pdf |results}}. | Students that got a rank >= 16 can participate to the second midterm exam. |
-| 17/12/19, 11:00-13:00 | room on exam's site\\ (Second MidTerm) | text, solution, results. | Students that got a rank >= 16 can participate to the second midterm exam.\\ Score “30 e lode” is assigned only to the students who got in both exams the score 30. The score is lost if the student participates to one of the next exams (just sitting is enough !). The score can be registered in any of the following exam dates (even in the summer), but PLEASE do not write your name in the ESAMI platform if you want to register your exam score, just show yourself in one of those dates. |
+| 17/12/19, 11:00-13:00 | room on exam's site\\ (Second MidTerm) | {{ :magistraleinformaticanetworking:ae:ae2019:ae191217.doc |text}}, {{ :magistraleinformaticanetworking:ae:ae2019:soluzione_ae_dic_2019_.pdf |solution}}, {{ :magistraleinformaticanetworking:ae:ae2019:risultati_ae_secondo_compitino_19-20.pdf |results}}. | Writeups can be examined **Thursday 9th January at 9:00** in my office.\\ Score “30 e lode” is assigned only to the students who got score 32 (as ceiling of the average + 2), and no vote smaller than 29. The score is lost if the student participates to one of the next exams (just sitting is enough !). The score can be registered in any of the following **exam dates** (even in the summer), but PLEASE do not write your name in the ESAMI platform if you want to register your exam score, just show yourself in one of those dates. |
-| 10/01/20, 09:00-13:00 | room on exam's site | text, solution, results. | The score is lost if the student participates to one of the next exams (just sitting is enough !). The score can be registered in any of the following exam dates (even in the summer), but PLEASE do not write your name in the ESAMI platform if you want to register your exam score, just show yourself in one of those dates. |
+| 10/01/20, 09:00-13:00 | room on exam's site | {{ :magistraleinformaticanetworking:ae:ae2019:ae200110.doc |text}}, {{ :magistraleinformaticanetworking:ae:ae2019:risoluzione_ale_10-01-2020.pdf |solution}}. | The score is lost if the student participates to one of the next exams (just sitting is enough !). The score can be registered in any of the following exam dates (even in the summer), but PLEASE do not write your name in the ESAMI platform if you want to register your exam score, just show yourself in one of those dates. |
-| 07/02/20, 09:00-13:00 | room on exam's site | text, solution, results. | The score is lost if the student participates to one of the next exams (just sitting is enough !). The score can be registered in any of the following exam dates (even in the summer), but PLEASE do not write your name in the ESAMI platform if you want to register your exam score, just show yourself in one of those dates. |
+| 07/02/20, 15:00-17:00 | room on exam's site | {{ :magistraleinformaticanetworking:ae:ae2019:ae200207.doc |text}}, {{ :magistraleinformaticanetworking:ae:ae2019:soluzione_ae_07-2-2020.pdf |solution}}. | The score is lost if the student participates to one of the next exams (just sitting is enough !). The score can be registered in any of the following exam dates (even in the summer), but PLEASE do not write your name in the ESAMI platform if you want to register your exam score, just show yourself in one of those dates. |
+| 12/06/20, 9:00- | virtual room on Teams | {{ :magistraleinformaticanetworking:ae:ae2019:ae200612.pdf |pre-test}} to be admitted to the oral. | The score is lost if the student participates to one of the next exams (just sitting is enough !). The score can be registered in any of the following exam dates (even in the summer), but PLEASE do not write your name in the ESAMI platform if you want to register your exam score, just show yourself in one of those dates. |
+| 10/07/20, 9:00- | virtual room on Teams | pre-test to be admitted to the oral. | The score is lost if the student participates to one of the next exams (just sitting is enough !). The score can be registered in any of the following exam dates (even in the summer), but PLEASE do not write your name in the ESAMI platform if you want to register your exam score, just show yourself in one of those dates. |
 ====== Background======
@@ Linea 52: / Linea 53: @@
 ====== Books, Notes, etc. ======
-We'll use the //old-fashioned// blackboard and few slides. Most of the content of the course will be covered by some notes I wrote in these years; for some topics parts of papers/books will be used. You can download the latest version of these notes from [[https://www.dropbox.com/s/dqttqigvuf4ydkd/main.pdf?dl=0 | this link]].
+We'll use the //old-fashioned// blackboard and few slides. Most of the content of the course will be covered by some notes I wrote in these years; for some topics parts of papers/books will be used.
@@ Linea 84: / Linea 85: @@
 | 06/11/2019 | Exercises | |
 | 11/11/2019 | Prefix search: definition of the problem, solution based on arrays, Front-coding, two-level indexing. Locality Preserving front coding and its use with arrays. | Chap. 9 of the notes: 9.1, 9.3. |
-| 12/11/2019 | Recap: BFS and DFS visits, Minimum Spanning Tree problem: Kruskal and Prim algorithms and analysis. Dejkstra algorithm for shortest path tree | CLR cap.23 {{ :magistraleinformaticanetworking:ae:ae2019:aelec10_copy.pptx|MST }}{{ :magistraleinformaticanetworking:ae:ae2019:ae_lec11.pptx|SPT }} |
+| 12/11/2019 | Recap: BFS and DFS visits, Minimum Spanning Tree problem: Kruskal and Prim algorithms and analysis. Dijkstra algorithm for shortest path tree | CLR cap.23 {{ :magistraleinformaticanetworking:ae:ae2019:aelec10_copy.pptx|MST }}{{ :magistraleinformaticanetworking:ae:ae2019:ae_lec11.pptx|SPT }} |
 | 13/11/2019 | Algorithms for external and semi-external computation of MST, Sybein algorithm. | Sect 11.5 of the {{:magistraleinformaticanetworking:ae:ae2014:mst-mehlhorn.pdf|Mehlhorn-Sander's book}}|
 | 18/11/2019 | Cancellata per allerta meteo | |
@@ Linea 93: / Linea 94: @@
 | 26/11/2019 | Exercises on Substring search, prefix search, and LCP computation | |
 | 27/11/2019 | Correction of the MidTerm exam.\\ Prefix-free codes, notion of entropy, optimal codes. Integer coding: the problem and some considerations. The codes Gamma and Delta, space/time performance and consideration on optimal distributions. | Chap. 11 of the notes |
-| 02/12/2019 |  | |
+| 02/12/2019 | The codes Rice, PForDelta. Coders: (s,c)-codes, variable-byte, Interpolative. Elias-Fano. With examples. |  |
-| 03/12/2019 |  | |
+| 03/12/2019 | Huffman, with optimality (proof). Canonical Huffman: construction, properties, decompression algorithm. | Chap. 12 of the notes (no sect 12.1.2). |
-| 04/12/2019 |  | |
+| 04/12/2019 | Arithmetic coding: properties, algorithm and proofs. Dictionary-based compressors: properties and algorithmic structure. LZ77, LZSS and LZ8.  | Chap. 12 sect 12.2. No PPM and Range coding. No LZW. Chap 13, no from par 13.3 and following ones.\\ |
 | 09/12/2019 | Canceled | |
 | 10/12/2019 | Canceled | |
-| 11/12/2019 | | |
+| 11/12/2019 | Exercises | |
-| 12/12/2019 | Extra lecture, L1 | |
+| 16/12/2019 | Exercises | |
-| 16/12/2019 | | |
+| 17/12/2019 | Second MidTerm exam | |
-| 17/12/2019 | Second MidTerm exam, room E | |
 | 18/12/2019 | Canceled | |
 \\
 \\
-====== BACKUP of the LAST YEAR (kept here only as an example) ======
-^ Date ^ Lecture ^ Biblio ^ Slides ^
-| | The codes Rice, PForDelta. Coders: (s,c)-codes, variable-byte, Interpolative. Elias-Fano. With examples. |  |
-| | Huffman, with optimality (proof). Canonical Huffman: construction, properties, decompression algorithm. | Chap. 12 of the notes (no sect 12.1.2). |
-| | Arithmetic coding: properties, algorithm and proofs. Dictionary-based compressors: properties and algorithmic structure. LZ77, LZSS and LZ8.  | Chap. 12 sect 12.2. No PPM and Range coding. Chap 13, no from par 13.3 and following ones.\\ |
-| | LZ compression via Suffix Tree. | Chap 10 at sect 10.4.2. |
-| | The Burrows-Wheeler transform and bzip | Chap 14 |