Java Reference
In-Depth Information
chapter
12
utilities
I
n this chapter we discuss two utility applications of data structures: data
compression and cross-referencing. Data compression is an important tech-
nique in computer science. It can be used to reduce the size of files stored on
disk (in effect increasing the capacity of the disk) and also to increase the
effective rate of transmission by modems (by transmitting less data). Virtually
all newer modems perform some type of compression. Cross-referencing is a
scanning and sorting technique that is done, for example, to make an index for
a book.
In this chapter, we show
An implementation of a file-compression algorithm called
Huffman's
algorithm
n
An implementation of a cross-referencing program that lists, in sorted
order, all identifiers in a program and gives the line numbers on which
they occur
n
Search WWH ::
Custom Search