University:
Alabama State University
Course:
CSC 380 | Algorithms
Academic year:

2024
Views:

393

Pages:

6
Author:

Mikael K. N.

Name : Mikael Kevintan Naibaho NIM : 210402039 1. Metode Huffman: MIKAEL KEVINTAN NAIBAHO = 23 char M→1 I→3 K→2 A→4 E→2 L→1 (Space) → 2 V→1 N→3 T→1 B→1 H→1 O→1 Huffman tree: A = 00 I = 110 N = 111 (space)= 010 O = 0110 K = 1100 E = 1101 B = 01110 H = 01111 V = 11100 T = 11101 M = 11110 L = 11111 MIKAEL KEVINTAN NAIBAHO = 00 110 111 010 0110 1100 1101 01110 01111 11100 11101 11110 11111 2. Methode Shannon Fano MIKAEL KEVINTAN NAIBAHO = char A: 4/23 = 0.17 I: 3/23 = 0.13 N: 3/23 = 0.13 K: 2/23 = 0.08 E: 2/23 = 0.08 (space): 2/23= 0.08 M: 1/23 = 0.04 L: 1/23 = 0.04 V: 1/23 = 0.04 T: 1/23 = 0.04 B: 1/23 = 0.04 H: 1/23 = 0.04 O: 1/23 = 0.04 3. Methode Limpel-Ziv-Welsch Dictionary: A: 1 I: 2 N: 3 K: 4 E: 5 (space): 6 M: 7 L: 8 V: 9 T: 10 B: 11 H: 12 O: 13 Input String: MIKAEL KEVINTAN NAIBAHO | Current Sequence | Next Character | Output Code | New Sequence Added to Dictionary | |-------------------|-----------------|-------------|----------------------------------| |M |I |7 | 14: MI | |I |K |2 | 15: IK | |K |A |4 | 16: KA | |A |E |1 | 17: AE | |E |L |5 | 18: EL | |L | (space) |8 | 19: L (space) | | (space) |K |6 | 20: (space)K | |K |E |4 | 21: KE | |E |V |5 | 22: EV | |V |I |9 | 23: VI | |I |N |2 | 24: IN | |N |T |3 | 25: NT | |T |A | 10 | 26: TA | |A |N |1 | 27: AN | |N | (space) |3 | 28: N (space) | | (space) |N |6 | 29: (space)N | |N |A |3 | 30: NA | |A |I |1 | 31: AI | |I |B |2 | 32: IB | |B |A | 11 | 33: BA | |A |H |1 | 34: AH | |H |O | 12 | 35: HO | Compressed Output Codes: 7 2 4 1 5 8 6 4 5 9 2 3 10 1 3 6 3 6 4 5 11 1 12

Compressing Data Assignment

Related Documents

Details Report

Helpful?

Description

Related Documents

Struggling with your assignment and deadlines?

Free up your schedule!

Take 5 seconds to unlock