.NODE

Vocabulary

B-tree

Data structure used to represent a very large set.

 

binary format

Format of files stored as data rather than text.

 

buffered

Of an input or output stream, waiting until it has a large chunk of data before actually sending it.

 

compressed

Of a file, stored in a format that uses fewer bits. Compressing or uncompressing a file takes time but saves space on disk or transmission time over a network.

 

external sorting

Sorting performed using files, for use when the data set is too large to fit in memory.

 

fixed-length encoding

Any encoding, such as ASCII, in which each character is represented by the same number of bits.

 

flush

Force a buffered stream to send data.

 

full

Of a B-tree node, having the largest allowable number of elements (one more than twice as many as in a minimal node).

 

Huffman encoding

Encoding in which more frequent characters are represented by shorter bit sequences.

 

LempelZiv encoding

Encoding in which each code may represent a long string of characters.

 

merge

Join two minimal B-tree nodes, plus an element pulled down from the parent, into a full node.

 

minimal

Of a B-tree node, having the smallest allowable number of elements.

 

run

Sorted sequence of elements used in external sorting.

 

serialization

Process of storing a directed graph of objects in memory in a linear file on disk.

 

size

Of a B-tree node, one more than the number of elements in the node.

 

split

Divide a full B-tree node into two minimal nodes and one extra element, which is moved up into the parent.

 


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

show all menu





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