Schaum's Outline of Data Structures with Java• 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
| 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 |
Altres edicions - Mostra-ho tot
Schaum's Outline of Theory and Problems of Data Structures with Java John Rast Hubbard Previsualització no disponible - 2001 |
Frases i termes més freqüents
abstract adjacency algorithm applies args array binary search binary tree BinaryTree called capacity Collection complete component computed contains defined definition digraph disk double edge elements empty equal EXAMPLE expression false field function given graph hash heap height implementation Insertion int i=0 integer interface isomorphic iterator Java length loop means method Move node Note null Object object operator path prime private static Problem Project Proof public boolean public class public int public Object public static void public void queue Radix Sort random recursive reference remove requires root sequence server shown shows Sort stack static int static void main(String step stored String structure subtree System.out.print Theorem traversal true Vector vertex vertices visited
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.
Informació bibliogràfica
| Títol | Schaum's Outline of Data Structures with Java Schaum's outline series |
| Autor | John Hubbard |
| Editor | McGraw Hill Professional, 2000 |
| ISBN | 0071378707, 9780071378703 |
| Nre. de pàgines | 369 pàgines |
| Exporta citacions | BiBTeX EndNote RefMan |