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

Des de l'interior del llibre

QuŔ en diuen els usuaris - Escriviu una ressenya

No hem trobat cap ressenya als llocs habituals.

Continguts

Review of Arrays
23
Advanced Java
53
Recursion
73
Collections
94
Stacks
109
Queues
123
Lists
144
Trees
166
Heaps and Priority Queues
225
6
231
Sorting
243
Tables
275
Chapter 15
293
Graphs
301
Appendix A Essential Mathematics
333
Appendix B From C++ to Java
353

Binary Trees
181
Search Trees
210
References
361
Copyright

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