If you choose to make the table size prime, you should treat that as an invariant and make it prime with each resize as well. I say "if you choose to make the table size prime" because there are...

1) You know the size of the table and you can keep track of the load factor by modifying a counter when you add or remove a chain. This is pretty efficient.

2) Separate chaining is much more...

>Is there a better way?
Yes, design the class hierarchy such that you don't need to know the dynamic type of the object. Perhaps some form of strategy pattern would clean up that selection code.

>to be able to see the importance of "front"..
If enqueue places an item at the rear of the array, then front is only important in the inverse operation: dequeue. I fail to see how your teacher...

>why is it not needed? hehehe
You're just screwing with me, aren't you?

It's possible, but not needed.

>but its a requirement for me hehehe..
You're required to use front in the enqueue method? Maybe you should describe exactly what your assignment is so that I don't have to play 20 questions with...

>public static double max(double[]x)
This signature suggests that you're supposed to pass an array of doubles to the function and the function returns the largest of them. Your code doesn't do that...

>im not really good at programming thats why...
Then you're probably not quite ready for a circular queue implementation. In that case, enqueue doesn't need to use front at all.

>umm how do i implement the "front" to the public boolean enqueue (int x) ??
If I told you, that would defeat the purpose of my exercises, wouldn't it?

It's impossible to help you unless you post your code.

>what does the "front" do?
A queue allows you to work with both "ends" of the data structure. You enqueue (add items) onto the rear and dequeue (remove items) from the front. This gives you the...

>For starters, I'll state that I'm not exactly sure what the 'height' of a b-tree represents.
The height of a binary search tree is the number of nodes in the longest path to a leaf.

>Do you have...

>Does anybody know how to make a parser???
Yes.

The message is pretty clear about what's wrong. You say that insertNumber returns an integer value, but you fail to return a value with a return statement:

return 0; // Or some other number

"For Dummies" books are dumbed down so much that it's virtually impossible to properly learn a technical subject like programming from them. What's worse is that the authors themselves tend to need...

>public void itemStateChanged(ItemEvent ie)
Either that's a typo and ie should be e, or you need to change any use of e to ie.

Can you post the code as well?

>can yo give me some example of virus because i like to learn more about.
1) This request has nothing to do with the topic of the thread.
2) The chances of someone giving you the code for a virus...

Vectors are evil, look up the ArrayList if you want an array that grows as needed.

>Okay i really thought servercrash had written winxp in java
:rolleyes:

>I've even heard you can't do it in c/c++ either...But don't know if that's true or not.
It's true, some routines have to...

>Is there a "neater" way to code the following?

System.out.println ( "All the values in the array are: " );
for ( T x: array1 )
System.out.println ( x );

Change T to whatever the type of...

>Well how come you couldn't consider that an answer?
Because your explanation was so convoluted I didn't understand it, but it didn't smell right. ;)

>In that case, you would be instantiating a class to get to the static
Huh? No, not at all. The following is legal:

class Outer {
static class Nested {}
}

class Test {
Outer.Nested obj...

>Would both abstract and static be correct answers?
No, abstract is the correct answer. static only means that a nested class doesn't designate an inner class.

>Everyone misunderstood his question.
No, apparently only paradox misunderstood. Everyone else seemed to get the joke.

Lazy people who want hand outs deserve what they get.

>actually I don't believe they are...
The mad literalists answered the only question that was posed:

Since it's clearly a homework assignment, nobody with half a brain would just give away the...

Recursion is recursive and loops just repeat.

(int)Math.pow ( 2, b ); // Cast the result of pow to int

Math.pow(2, b) (http://java.sun.com/j2se/1.5.0/docs/api/)

>is ArrayList better than Vec
It depends on your needs. If you need a synchronized list and it has to be compatible with Java 1.1 then Vector is an option. Otherwise, ArrayList should be preferred,...

>Can you be more spesific with the term "linking to text file"

<a href="source.txt">Click here for some Javascript source</a>

You realize that the only thing in common with Java and Javascript is the word Java, right? What's wrong with just linking to a text file? At least that way you can fit more programs on a single page...

>I'd have changed it to m except that might be seen as slightly pickish
x is the better choice anyway, or my personal favorite identifier for "a chunk of memory that holds something": shtoobie. My...

>The greatest arrogance is thinking your ideas are better than those of the majority
Yes, and I'm an arrogant, willful, stubborn person. However, this reeks of the idea that the majority is always...

It looks fine, though what happens if you have a one or two node tree here?

return isBST(r,r.left.key, r.right.key);

It would be better to come up with some sentinel min and max value to pass...

>couldn't help tinker and use some more features of the Tiger
I also notice you didn't like my intuitive and obvious name for the HashMap, h. :cheesy:

>learn proper OO techniques
That I can understand.

>proper Java class naming
Sun recommends a style for Java, but that doesn't mean it has to be used. I disagree with several of their...

>static int countChars( String str, char searchChar )
This only returns the count for a single character. So to find the most common character, not only would you be forced to call countChars for...