9. Step by step to build the Huffman Code tree and list Huffman codes for all characters as the following alphabets and their frequencies: [A:5, B:12, C:33, D:19, E:40, F:41]. (10%)

3. (15%) Boolean function \( f(x, y, z, w) = -x \vee (x \wedge y \wedge z \wedge w) \vee (x \wedge y \wedge z \wedge -w) \). First, find the truth table of function \( f \). Second, simplify the expression of \( f \) to minimize the number of AND, OR, NOT operations. Third, draw out the combinatorial circuit corresponding to your simplified expression. Finally, transform and redraw your combinatorial circuit to contain NAND gates only.

9. Step by step to build the Huffman Code tree and list Huffman codes for all characters as the following alphabets and their frequencies: [A:5, B:12, C:33, D:19, E:40, F:41]. (10%)

相關申論題

相關試卷