Data Structures and Algorithms in JavaUsing a unique multimedia format for learning the fundamentals of data structures and algorithms, this conceptually elegant and innovative text incorporates the object-oriented design paradigm with Java as the implementation language. The result is a learning experience that provides the fundamental intuition and analysis of each structure studied. A Web site complete with Java applications and applets accompanies the text. Includes CD-ROM with... The Microsoft Visual J++ programming environment. |
From inside the book
Results 1-3 of 85
Page ix
... chapters optional material that is somewhat mathematically more advanced . Such optional sections are indicated with a star ( * ) . Chapter Possible Options A. Java Primer skip if students all know Java 1. Design Principles have ...
... chapters optional material that is somewhat mathematically more advanced . Such optional sections are indicated with a star ( * ) . Chapter Possible Options A. Java Primer skip if students all know Java 1. Design Principles have ...
Page 112
... chapter belong to the folklore of computer science . They were first chronicled by Knuth in his seminal book on Fundamental Algorithms [ 88 ] . In this chapter , we have taken the approach of defining the fundamental data structures of ...
... chapter belong to the folklore of computer science . They were first chronicled by Knuth in his seminal book on Fundamental Algorithms [ 88 ] . In this chapter , we have taken the approach of defining the fundamental data structures of ...
Page 470
... chapter is dedicated to developing the knowledge for using these techniques effectively . The fundamental techniques covered in this chapter are amortization , divideand - conquer , dynamic programming , and the greedy method . These ...
... chapter is dedicated to developing the knowledge for using these techniques effectively . The fundamental techniques covered in this chapter are amortization , divideand - conquer , dynamic programming , and the greedy method . These ...
Common terms and phrases
abstract addition algorithm allows analysis applet applications array associated assume binary tree block called chapter child Code Fragment consider constant container data structure defined deletion denote describe determine dictionary directed discuss edges efficient element empty enumeration equal example executed expression external Figure function give given graph heap height illustrate implementation important Input insertion integer interface internal node iteration Java justification locator loop means memory method Note object operations Output path pattern perform position priority queue problem Proposition protected queue random range rank recursive reference remove represent requires root running search tree sequence shown simple single sorting space specific stack stored string Table takes throw traversal variable vertex vertices visited void