Schaum's Outline of Data Structures with JavaMcGraw Hill Professional, 8 de des. 2000 - 369 pàgines • 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
Resultats 1 - 3 de 3.
Pàgina 1
... root is the object class . ( See Section 3.2 on page 55. ) This single structure might seem to render Java a simple language . However , that structure includes the Java 1.3 Class Libraries , which contain 2,130 classes with 23,901 ...
... root is the object class . ( See Section 3.2 on page 55. ) This single structure might seem to render Java a simple language . However , that structure includes the Java 1.3 Class Libraries , which contain 2,130 classes with 23,901 ...
Pàgina 14
... root tan ( double x ) Note that all these members are static . That means that they are invoked with the " Math . " prefix instead of using a Math object . EXAMPLE 1.10 Testing the Math Class public class Ex0110 { public static void ...
... root tan ( double x ) Note that all these members are static . That means that they are invoked with the " Math . " prefix instead of using a Math object . EXAMPLE 1.10 Testing the Math Class public class Ex0110 { public static void ...
Pàgina 15
... method by comparing its results with a locally defined square root method and also by squaring its output . public class Ex0112 { public static void main ( String [ ] args ) { for ( double x = 50.0 ; x <. CHAP . 1 ] 15 REVIEW OF JAVA.
... method by comparing its results with a locally defined square root method and also by squaring its output . public class Ex0112 { public static void main ( String [ ] args ) { for ( double x = 50.0 ; x <. CHAP . 1 ] 15 REVIEW OF JAVA.
Continguts
23 | |
Advanced Java | 53 |
Recursion | 73 |
Collections | 94 |
Stacks | 109 |
Chapter 7 | 123 |
Chapter 8 | 144 |
Chapter 9 | 166 |
Heaps and Priority Queues | 225 |
Sorting | 243 |
Tables | 275 |
Sets | 293 |
Graphs | 301 |
Appendix A Essential Mathematics | 333 |
Appendix B From C++ to Java | 353 |
References | 361 |
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 matrix args array ArrayQueue AVL tree binary search tree BinaryTree boolean public boolean Bubble Sort char Collection collection constructor defined digraph disk from peg edge elements EXAMPLE following method full binary tree graph hash table hashCode HashMap heap property Heap Sort implementation induction Insertion Sort int i=0 int index integer interface isomorphic it.next iterator Java java.util ListIterator loop Merge Sort node null Object object path Postcondition postorder traversal preorder traversal prime priority queue private static final private static int private static void Problem public boolean public public class public int public public static int public static void Quick Sort random recursive calls remove returns true root schaums.dswj Selection Sort sequence server sorting algorithms stack static double static final int static void main(String step System.out.print Theorem toString tree of height TreeSet vector vertex vertices Widget Write and test
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.