Data Structures & Other Objects Using JavaThe Phases of Software Development Specification, Design, Implementation Running Time Analysis Testing and Debugging Abstract Data Types and Java Classes Classes and Their Members Using a Class Packages Parameters, Equals Methods, and Clones Collection Classes A Review of Java Arrays An ADT for a Bag of Integers Programming Project: The Sequence ADT Applets for Interactive Testing Linked Lists Fundamentals of Linked Lists Methods for Manipulating Nodes Manipulating an Entire Linked List The Bag ADT with a Linked List Programming Project: The Sequence ADT with a Linked List Arrays vs. Linked Lists vs. Doubly Linked Lists Java Objects and Iterators Java's Object Type A Bag of Objects JCL Collections and Nodes of Objects Iterators Stacks Introduction to Stacks Stack Applications Implementations of the Stack ADT More Complex Stack Applications Queues Introduction to Queues Queue Applications Implementations of the Queue ADT Priority Queues Recursive Thinking Recursive Methods Studies of Recursion: Fractals and Mazes Reasoning about Recursion Trees Introduction to Trees Tree Representations A Class for Binary Tree Nodes Tree Traversals Binary Search Trees Tree Projects Heaps B-Trees Trees, Logs, and Time Analysis Searching Serial Search and Binary Search Open-Address Hashing Using Java's Hashtable Class Chained Hashing Time Analysis of Hashing Sorting Quadratic Sorting Algorithms Recursive Sorting Algorithms An O(N LOG N) Algorithm Using a Heap Software Reuse with Extended Classes Extended Classes Simulation of an Ecosystem Using Extended Classes for ADTs Graphs Graph Definitions Graph Implementations Graph Traversals Path Algorithms Appendices Java's Primitive Types and Arithmetic Overflow Java Input Throwing and Catching Java Exceptions Java's Vector and Hashtable A Class for Nodes in a Linked List A Class for a Bag of Objects Further Big-O Notation Javadoc. |
From inside the book
Results 1-3 of 30
Page 538
... hash function as a method called hash . If an element has a key value of i , then we will try to store that element at location data [ hash ( i ) ] . Using the hash function to compute the correct array index is called hashing the key ...
... hash function as a method called hash . If an element has a key value of i , then we will try to store that element at location data [ hash ( i ) ] . Using the hash function to compute the correct array index is called hashing the key ...
Page 550
... hash table : Let's go through this part of the hash table . The records at indexes 402 and 403 were placed in their correct spots with no collisions . For example , the hash value for land- spar is 402 and that spot was free when ...
... hash table : Let's go through this part of the hash table . The records at indexes 402 and 403 were placed in their correct spots with no collisions . For example , the hash value for land- spar is 402 and that spot was free when ...
Page 552
Michael Main. Choosing a Hash Function to Reduce Collisions We have used a simple hash function that hashes a given key to the array index : Math.abs ( key.hashCode ( ) ) % data.length This kind of hash function depends on the remainder ...
Michael Main. Choosing a Hash Function to Reduce Collisions We have used a simple hash function that hashes a given key to the array index : Math.abs ( key.hashCode ( ) ) % data.length This kind of hash function depends on the remainder ...
Contents
Chapter | 1 |
Abstract Data Types and Java Classes | 35 |
Chapter 3 | 79 |
Copyright | |
34 other sections not shown
Other editions - View all
Common terms and phrases
Accessor method activated addAll addend algorithm applet arithmetic overflow array ArrayBag B-tree bag's binary search tree binary tree BTNode Celsius clone method collection class complete binary tree components computation constructor contains copy countOccurrences create current element cursor data type double number EasyReader edu.colorado.collections example expression Figure graph hash hash table head reference heap heapsort IllegalArgumentException implements Cloneable Indicates insufficient memory initial capacity input instance variables IntArrayBag integer IntLinkedBag IntNode Java Javadoc linked list Location loop manyItems manyNodes mergesort method returns node null reference number of elements OutOfMemoryError Indicates insufficient package Parameters 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 specified stack statement stored String subtree super.clone target Throttle Throws vertex vertices write zero