## Data Structures and Other Objects Using JavaThis text uses a five-step method for working with data types, to ensure students have a thorough knowledge of the subject and understand the data type abstractly. It also aims to teach students how to use the data type, design and implement it, and analyze the implementation. |

### From inside the book

Results 1-3 of 75

Page 284

... the elements from this collection. boolean contains (Object o)

this collection contains the specified element. boolean containsAll (Collection c)

collection.

... the elements from this collection. boolean contains (Object o)

**Returns true**ifthis collection contains the specified element. boolean containsAll (Collection c)

**Returns true**if this collection contains all of the elements in the specifiedcollection.

Page 356

The BooleanSource class has one instance variable, probability, which stores the

probability that an activation of query will

query method first uses the Math . random method to generate a random number

...

The BooleanSource class has one instance variable, probability, which stores the

probability that an activation of query will

**return true**. The implementation of thequery method first uses the Math . random method to generate a random number

...

Page 415

The two methods in Figure 8.7 are: • inqui re: This method asks the user a yes/no

question; it

answers 'N' or ' n ' . • deadend : This method determines whether the direction in ...

The two methods in Figure 8.7 are: • inqui re: This method asks the user a yes/no

question; it

**returns true**if the user answers 'Y'or 'y' and returns false if the useranswers 'N' or ' n ' . • deadend : This method determines whether the direction in ...

### What people are saying - Write a review

User Review - Flag as inappropriate

trtgfhh

### Contents

Chapter | 2 |

LEARNING OBJECTIVES | 14 |

Chapter Summary and Solutions | 38 |

Copyright | |

25 other sections not shown

### Other editions - View all

### Common terms and phrases

Accessor method activated addAll algorithm applet arithmetic overflow array B-tree binary search tree binary tree BTNode Celsius clone method collection class computation constructor contains copy create current element cursor data type digits double numbers empty example expression extended class Figure graph hash table head reference heap heapsort Indicates insufficient memory information hiding initial capacity input IntArrayBag integer IntNode iterator Java Javadoc linked list Location loop manyItems mergesort method returns node null reference number of elements number of operations package parameter position Postcondition pre-order traversal Precondition priority queue private instance variables pseudocode public boolean public class public int public Object public static void public void quicksort recursive call reference variable remove return value returns true root Self-Test Exercises sequence shown simulation specified stack statement step stored string subtree Suppose target Throttle Throws TreeMap vertex vertices write zero