## Data Structures & Other Objects Using JavaThis book takes a gentle approach to the data structures course in Java. It offers an early, self-contained review of object-oriented programming and Java to give students a firm grasp of key concepts, and allows those experienced in other languages to adjust easily. The book also offers a flexibility which allows professors such options as emphasizing object-oriented programming, covering recursion and sorting early or accelerating the pace of the course. This title meets the needs of professors searching for a book to balance the introduction of object-oriented programming and data structures with Java. |

### From inside the book

Results 1-3 of 79

Page 398

Each time you do (a) or (b), that is called a

be reached in n

and n is at least 4, then the following sequence of

99 ...

Each time you do (a) or (b), that is called a

**step**in the game, and the goal mustbe reached in n

**steps**or fewer. For example, if i ni ti al is 99, i nc rement is 53,and n is at least 4, then the following sequence of

**steps**will reach the goal of 9 1 :99 ...

Page 502

Looking through the pseudocode,

have a private method for

another private method for

...

Looking through the pseudocode,

**Steps**2a and 2b are fairly easy. You alreadyhave a private method for

**Step**2a (f i rstGE on page 500), and you can writeanother private method for

**Step**2b. The more interesting work occurs in**Step**2c,...

Page 698

Loop in

the graph for (allowedSize = 1; allowedSize <= n; allowedSize++) { // At this point,

allowedVertices contains allowedSize - 1 vertices, // which are the allowedSize ...

Loop in

**Step**3 of the shortest distance algorithm: // n is the number of vertices inthe graph for (allowedSize = 1; allowedSize <= n; allowedSize++) { // At this point,

allowedVertices contains allowedSize - 1 vertices, // which are the allowedSize ...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Chapter | 1 |

The Phases of Software Development | 2 |

Abstract Data Types and Java Classes | 35 |

Copyright | |

27 other sections not shown

### Other editions - View all

### Common terms and phrases

Accessor method activated addAl addend algorithm applet arithmetic overflow array ArrayBag B-tree bag's binary search tree binary tree BTNode Celsius clone method collection class components computation constructor copy countOccurrences create current element cursor data type data[i declaration evaluate example Figure hash hash table head reference heap heapsort implements Cloneable Indicates insufficient memory information hiding initial capacity input instance variables IntArrayBag integer IntLinkedBag IntNode iterator Java's Javadoc linked list loop manyItems manyNodes mergesort method returns node null reference number of elements number of operations OutOfMemoryError Indicates insufficient package Parameters parentheses position Postcondition Precondition priority queue private instance variables pseudocode public boolean public class public int public Object public static void public void quicksort recursive call remove return value returns true root Self-Test Exercises sequence shown simulation specification stack step stored string subtree super.clone Suppose target technique Throttle Throws write zero