| Entrambe le parti precedenti la revisioneRevisione precedenteProssima revisione | Revisione precedente |
| magistraleinformaticanetworking:ae:ae2010:start [10/01/2011 alle 23:20 (15 anni fa)] – [List of Lectures] Paolo Ferragina | magistraleinformaticanetworking:ae:ae2010:start [03/05/2012 alle 13:08 (13 anni fa)] (versione attuale) – [Exam] Paolo Ferragina |
|---|
| ====== News ====== | ====== News ====== |
| | |
| |
| ====== Goals ====== | ====== Goals ====== |
| |
| |
| 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. | 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. |
| | |
| | ====== Exam ====== |
| | |
| | |
| | |
| | ^ Dates ^ Room ^ |
| | | 01/02/2011 | {{:magistraleinformaticanetworking:ae:ae2010:ae110201.doc|Text}} | |
| | | 28/02/2011 | {{:magistraleinformaticanetworking:ae:ae2010:ae110228.doc|Text}} | |
| | | 09/06/2011 | {{:magistraleinformaticanetworking:ae:ae2010:ae110609.doc|Text}} | |
| | | 24/06/2011 | {{:magistraleinformaticanetworking:ae:ae2010:ae110624.doc|Text}} | |
| | | 20/07/2011 | {{:magistraleinformaticanetworking:ae:ae2010:ae110720.doc|Text}} | |
| | | 01/09/2011 | {{:magistraleinformaticanetworking:ae:ae2010:ae110901.doc|Text}} | |
| | | 28/09/2011 | {{:magistraleinformaticanetworking:ae:ae2010:ae110928.doc|Text}} | |
| ====== Books, Notes, etc. ====== | ====== Books, Notes, etc. ====== |
| |
| | 09/12/2010 | d-left hashing, cuckoo hashing, minimal ordered perfect hashing. | {{:magistraleinformaticanetworking:ae:ae2010:01_cuckooundergrad.pdf|note1}}, {{:magistraleinformaticanetworking:ae:ae2010:01_appoggiomg-minordhash.pdf|note2}}, {{:magistraleinformaticanetworking:ae:ae2010:01.hashing.ppt|slides}} | | | 09/12/2010 | d-left hashing, cuckoo hashing, minimal ordered perfect hashing. | {{:magistraleinformaticanetworking:ae:ae2010:01_cuckooundergrad.pdf|note1}}, {{:magistraleinformaticanetworking:ae:ae2010:01_appoggiomg-minordhash.pdf|note2}}, {{:magistraleinformaticanetworking:ae:ae2010:01.hashing.ppt|slides}} | |
| | 20/12/2010 | The Bloom Filter and its spectral variant. | {{:magistraleinformaticanetworking:ae:ae2010:02.bf.ppt|slides}}| | | 20/12/2010 | The Bloom Filter and its spectral variant. | {{:magistraleinformaticanetworking:ae:ae2010:02.bf.ppt|slides}}| |
| | 10/01/2011 | Data compression: notion of entropy, Huffman coding (and its optimality), Canonical Huffman codes. | | | | 10/01/2011 | Data compression: notion of entropy, Huffman coding (and its optimality), Canonical Huffman codes. | {{:magistraleinformaticanetworking:ae:ae2010:03_mg-compress.pdf|MG (up to page 41)}}| |
| | 13/01/2011 | Data compression: LZ77, LZ78 and gzip. | | | | 13/01/2011 | Data compression: LZ77, LZ78 and gzip. | MG pages 74-81 | |
| | | 17/01/2011 | Data compression: Burrows-Wheeler Transform, MTF, RLE and bzip. Skip lists: description, properties, proof for heigth and search time. | {{:magistraleinformaticanetworking:ae:ae2010:03.datacompression.pptx|slides}} and {{:magistraleinformaticanetworking:ae:ae2010:07_ericksonnotes-skiplists.pdf|notes}} | |
| |
