TWO STEP COMPRESSION USING HUFFMAN & DYNAMIC REPLACE WORDS ALGORITHM ON HTML & TEXT FILE

Mo'a, Edward Christoforus (2008) TWO STEP COMPRESSION USING HUFFMAN & DYNAMIC REPLACE WORDS ALGORITHM ON HTML & TEXT FILE. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 03.02.0054 Edward Christoforus Mo'a COVER.pdf Download (724kB) | Preview
	Text (BAB I) 03.02.0054 Edward Christoforus Mo'a BAB I.pdf Restricted to Registered users only Download (108kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 03.02.0054 Edward Christoforus Mo'a BAB II.pdf Restricted to Repository staff only Download (480kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 03.02.0054 Edward Christoforus Mo'a BAB III.pdf Restricted to Repository staff only Download (114kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 03.02.0054 Edward Christoforus Mo'a BAB IV.pdf Restricted to Repository staff only Download (156kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 03.02.0054 Edward Christoforus Mo'a BAB V.pdf Restricted to Repository staff only Download (391kB)
	Text (BAB VI) 03.02.0054 Edward Christoforus Mo'a BAB VI.pdf Restricted to Registered users only Download (109kB)
Preview	Text (DAFTAR PUSTAKA) 03.02.0054 Edward Christoforus Mo'a DAFTAR PUSTAKA.pdf Download (125kB) | Preview
Preview	Text (LAMPIRAN) 03.02.0054 Edward Christoforus Mo'a LAMPIRAN.pdf Download (202kB) | Preview

Abstract

Nowadays a computer can handle a lot of different work, starting from data processing, digital features processing, multimedia, games, etc. The ability of the computer should be certainly balanced by a proper storage medium.Anyway, whatever the size of the storage of a medium, it will at last be full. Then what is the solution? COMPRESSION is one of the solutions! Because by making compression on the file wich is going to be saved in the storage media , it is hoped to save disk space on the storage media. In this Final Project, the application is done in HTML and text file using Huffman Algorithm and Dynamic Replace Words Algorithm. The Data Structure tree is used in this application. Huffman Algorthm is suitable for this project because there is a frequency count of appearing data and the coding of data becomes smaller than it was before. While Tree is used to form dictionary file. The Replace character in this Project is found through a dynamic searching method and frequency count of appearing character. It is hoped through this method its compression scope is larger and the result of the compression is more efficient as well.

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 005 Computer programming, programs & data
Divisions:	Faculty of Computer Science
Depositing User:	Mr Ign. Setya Dwiana
Date Deposited:	27 Jan 2016 02:18
Last Modified:	27 Jan 2016 02:18
URI:	http://repository.unika.ac.id/id/eprint/7442

Actions (login required)

View Item