B-Trees

Table of contents:

Projects

17.20

Modify the Huffman program so that it can encode and decode actual ASCII text files. Encoding a typical large file should actually compress it. Use the text being encoded to find the character frequency and store the Huffman tree as the first object in the compressed file.

17.21

Create a class IntList which acts like an ArrayList, but uses raw ints instead of Integers. Modify the BTree and BTreeNode classes to use this class. How does this affect the amount of space used on disk for each node?


Part I: Object-Oriented Programming

Encapsulation

Polymorphism

Inheritance

Part II: Linear Structures

Stacks and Queues

Array-Based Structures

Linked Structures

Part III: Algorithms

Analysis of Algorithms

Searching and Sorting

Recursion

Part IV: Trees and Sets

Trees

Sets

Part V: Advanced Topics

Advanced Linear Structures

Strings

Advanced Trees

Graphs

Memory Management

Out to the Disk

Part VI: Appendices

A. Review of Java

B. Unified Modeling Language

C. Summation Formulae

D. Further Reading

Index



Data Structures and Algorithms in Java
Data Structures and Algorithms in Java
ISBN: 0131469142
EAN: 2147483647
Year: 2004
Pages: 216
Authors: Peter Drake

Similar book on Amazon

Flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net