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 are generic methods?

920

---

Explain the differences between abstraction and encapsulation?

1006

---

Is java developer a good career?

971

---

Is 9 a prime number?

843

---

What is the equal sign?

1043

---

What is a container in a gui?

937

---

What is static class

1058

---

What is api data?

953

---

How is final different from finally and finalize?

871

---

What is nested class?

952

---

Can substring create new object?

1067

---

What are java methods?

1048

---

What is native method in java?

1022

---

What type of variable is error flag?

1026

---

Differentiate between overriding and overloading cases?

1052

---