Answer Posted / a.jyotsna

The Iterator is not implemented as an
indexed loop, at least not in Sun Java. The collection
always has a
getter armed with the iterator's next value. Much of the
collection's
internal implementation is done via the iterator. But the
pieces of
ArrayList that are optimized for speed, skip bounds
checking and use int
array offsets to do their work.
I would like to know what is the difference between these 2.
>
> ArrayList list = new ArrayList
>
> for(int i=0; i<list.size(); i++){
> //do stuff
> }
>
> Iterator i = list.iterator();
>
> while(i.hasNext(){
> do stuff
> }

What do you mean by exception handling in Java?

1364

---

Explain about fail safe iterators in java?

1078

---

What is the program development process?

1031

---

What do you know about the garbate collector?

1080

---

When is the finalize() called? What is the purpose of finalization?

1141

---

what is meant wrapper classes?

1292

---

What is the purpose of using java.lang.class class?

1056

---

Explain about sets?

1082

---

What is nested top-level class?

1089

---

How many arguments can be passed to main ()?

1041

---

What are the Main functions of Java?

1129

---

What is e java?

1164

---

What is boolean in java?

1025

---

How do you check if a number is a perfect square?

1030

---

Give example to differentiate between call by value and call by reference.

1108

---