Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| courses:cs211:winter2018:journals:cantrella:chapter_4 [2018/03/06 04:47] – [Section 4.7] cantrella | courses:cs211:winter2018:journals:cantrella:chapter_4 [2018/03/12 15:52] (current) – [Section 4.8] cantrella | ||
|---|---|---|---|
| Line 26: | Line 26: | ||
| I give this section a 6 on the readability scale and a 7 on the interesting scale. | I give this section a 6 on the readability scale and a 7 on the interesting scale. | ||
| + | ===== Section 4.8 ===== | ||
| + | Section 4.8 covered the theory and implementation of data compression using Huffman Codes. The idea behind this is that when data is sent across networks, it needs to be in its most compressed form so that the transmission is efficient. Huffman codes achieve this by efficiently compressing each letter based on its frequency. The algorithm finds the two least frequency letters and merges them together into a new letter. The algorithm operates in O(// | ||
| + | |||
| + | I give this section a 7 on the interesting scale and a 6 for readability. | ||
