Given the following interface

public interface WordSet extends Iterable {

public void add(Word word); // Add word if not already added

public boolean contains(Word word); // Return true if word contained

public int size(); // Return current set size

public String toString(); // Print contained words
}

Implement the interface using

Hashing

Binary Search Tree

In the case of hashing, a rehash shall be performed when the number of inserted elements equals the number of buckets. For the binary search tree, the elements shall be sorted using the method compareTo. The names of the two implementations shall be HashWordSet and TreeWordSet. Note: In this task you are not allowed to use any predened classes from the Java library.

Posted Date: 3/14/2013 6:27:11 AM | Location : United States

Ask an Expert

Related Discussions:- Binary search tree, Assignment Help, Ask Question on Binary search tree, Get Answer, Expert's Help, Binary search tree Discussions

Write discussion on Binary search tree
Your posts are moderated

Write your message here..

Related Questions

Find minimal expression for sop. draw gate network, Q Consider the followin... Q Consider the following expression. Assume that complement inputs are available. F(A,B,C,D) = ∑m (1,2,6,9,10,14) + ∑d (4,7,8,11,12) a. Find minimal expression for SOP. Draw

Radius of curvature in differential calculas, find the radius of curvature ... find the radius of curvature at the point (3,3) at a point x3+xy2-6y2=0?

Enumerate about the decimal arithmetic unit, Enumerate about the Decimal Ar... Enumerate about the Decimal Arithmetic Unit The user of the computer input data in decimal numbers and receives output in the decimal form. But a CPU with ALU can perform arith

What is the significance timescale directive, What is the significance Time... What is the significance Timescale directive? Defines time units and simulation precision (smallest increment). Syntax 'timescale TimeUnit / PrecisionUnit TimeUnit =

Explain relative addressing scheme, Q. Explain Relative Addressing Scheme? ... Q. Explain Relative Addressing Scheme? In this addressing technique the register R is the program counter (PC) which contains the address of current instruction being executed.

Define nondeterministic tm, Define nondeterministic TM?  Arbitraril... Define nondeterministic TM?  Arbitrarily chooses move when more than one possibility exists Accepts if there is at least one computation that terminates in an acceptin

Explain about the prepurchase interaction activity, Explain about the Prepu... Explain about the Prepurchase Interaction activity. Prepurchase Interaction: This interaction for consumers comprises three activities: • Product or service search and di

Explain about workstations, Q. Explain about Workstations? The workstat... Q. Explain about Workstations? The workstations are used for engineering applications like CAD/CAM or other types of applications which need a moderate computing power and rela

What is SSTF, SSTF stands for ? Ans. Shortest-Seek-time-first scheduli... SSTF stands for ? Ans. Shortest-Seek-time-first scheduling.

Determine the ad hoc testing, Determine the Ad hoc testing - It is a ty... Determine the Ad hoc testing - It is a type of testing which is performed without the use of planning or/and documentation. - These tests are run only one time unless a defe