Advanced Linear Structures

Table of contents:

This chapter covers some advanced techniques for using linear structures. Section 12.1 introduces bit vectors, an extension of the idea of direct addressing from Section 11.4. Bit vectors are used in an application to help us choose a game to play. Section 12.2 discusses techniques for representing sparse arrays, where almost all of the elements have the same value. Section 12.3 introduces the idea of representing a multidimensional array using a single one-dimensional array. That section concludes with a new implementation of Tic Tac Toe using the ideas from this chapter. Section 12.4 covers some advanced algorithms for searching and sorting.

Bit Vectors

Part I: Object-Oriented Programming




Part II: Linear Structures

Stacks and Queues

Array-Based Structures

Linked Structures

Part III: Algorithms

Analysis of Algorithms

Searching and Sorting


Part IV: Trees and Sets



Part V: Advanced Topics

Advanced Linear Structures


Advanced Trees


Memory Management

Out to the Disk

Part VI: Appendices

A. Review of Java

B. Unified Modeling Language

C. Summation Formulae

D. Further Reading


Data Structures and Algorithms in Java
Data Structures and Algorithms in Java
ISBN: 0131469142
EAN: 2147483647
Year: 2004
Pages: 216
Authors: Peter Drake © 2008-2020.
If you may any questions please contact us: