Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| courses:cs211:winter2018:journals:patelk:chapter4 [2018/03/10 17:15] – [4.8 Huffman Codes and Data COmpression] patelk | courses:cs211:winter2018:journals:patelk:chapter4 [2018/03/10 20:29] (current) – [4.8 Huffman Codes and Data COmpression] patelk | ||
|---|---|---|---|
| Line 345: | Line 345: | ||
| Readability: | Readability: | ||
| - | ===== 4.8 Huffman Codes and Data COmpression | + | ===== 4.8 Huffman Codes and Data Compression |
| * Greedy rule to shrink the size of the problem instance so that an equivalent smaller problem can then be solved by recursion | * Greedy rule to shrink the size of the problem instance so that an equivalent smaller problem can then be solved by recursion | ||
| Line 437: | Line 437: | ||
| * This will pay off in the long run: called adaptive compression schemes | * This will pay off in the long run: called adaptive compression schemes | ||
| + | ==== Personal Thoughts ==== | ||
| + | |||
| + | While arguably one of the more interesting topics of this textbook, this section was long and very dense. There was a lot of information that was hard to digest all at once. Our discussion in class was helpful, but not long enough to help make this section very clear. I will most likely need to review this chapter section again. | ||
| + | Readability: | ||
