Xeraph@NCHOVY

이번엔 전반적으로 그렇게 어렵지는 않으리라 봅니다.
허프만 코딩을 내가 해볼까 하다가 보니까 황원근이 있네 ㅋㅋ
(이게 더 재밌을 것 같은데)

그러면 저는 지난 번에 못 푼 문제들을 주로 공략해보도록 하죠.

; unordered list representation -> 8con
2.59. define union-set using unordered list
2.60. define set operation (allow duplicate)

; ordered list representation -> 8con
2.61. define adjoin-set using ordered list
2.62. define union-set using ordered list

; binary tree representation -> ikjoon01
2.63. test tree->list1 and tree->list2
2.64. implement balanced tree using partial-tree
2.65. define union-set and intersection-set using balanced tree (growth factor = theta n)

; information retrieval -> ikjoon01
2.66. define lookup using binary tree

; huffman coding -> stania
2.67. test decode
2.68. define encode
2.69. define successive-merge (tricky)
2.70. word encode
2.71. how many bits required?
2.72. growth factor

; data directed programming -> cicero
2.73. deriv revisited
2.74. (removed)

; message passing (oop style) -> cicero
2.75. define make-from-mag-ang using message passing
2.76. data directed or message passing?