Schaum's Outline of Data Structures with Java

Portada
McGraw Hill Professional, 8 de des. 2000 - 369 pàgines
1 Ressenya
Les ressenyes no es verifiquen, però Google comprova si hi ha contingut fals i el suprimeix quan l'identifica.

• Scores of problems and examples—which will be available on the Internet after publication—simplify and demonstrate central concepts and help users develop their expertise in handling data structures in Java
• Java is today’s fastest growing programming language, with broad popular appeal for its ease of use in creating websites and its functioning capability on any platform
• Topics cover all the material in the first- or second-year course required of all Computer Science majors
 

Què en diuen els usuaris - Escriviu una ressenya

No hem trobat cap ressenya als llocs habituals.

Continguts

Chapter
12
Review of Arrays
23
Advanced Java
53
Recursion
73
Collections
94
THE ArrayList CLASS
145
MULTIWAY SEARCH TREES
210
6
217
1
243
5
279
1
293
Graphs
301
Appendix A Essential Mathematics
333
Appendix B From C++ to Java
353
References
361
Copyright

Sorting
235

Altres edicions - Mostra-ho tot

Frases i termes més freqüents

Passatges populars

Pàgina 40 - It states that every even number greater than 2 is the sum of two primes in at least one way.
Pàgina 170 - The path length of a tree is the sum of the lengths of all paths from its root.
Pàgina 312 - A digraph is strongly connected if there is a path between every pair of vertices. A digraph is weakly connected if its embedded graph is connected.
Pàgina 304 - A complete graph is a simple graph in which every pair of vertices is connected by an edge.
Pàgina 170 - The depth of a node in a tree is the length of its root path.
Pàgina 218 - Define the balance number at any node to be the difference between the height of its left subtree and the height of its right subtree.
Pàgina 84 - The objective of the game is to move all the disks from peg A to peg C, one disk at a time, without violating the rule.
Pàgina 304 - The degree (or valence) of a vertex is the number of edges that are incident upon it.

Sobre l'autor (2000)

Jean R. Hubbard, Ph.D. (Richmond, VA) is Professor of Mathematics and Computer Science at the University of Richmond. He is the author of the popular Schaum's Outline Programming with C++ and Programming with Java.

Informació bibliogràfica