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 is the difference between preemptive scheduling and time slicing in java programming?

970

---

What is the purpose of static methods and static variables?

997

---

How can you make sure that your singleton class will always return single instance in multi-threaded environment?

959

---

Why is it called buffering?

1049

---

Can constructor be inherited?

976

---

What is a flag variable?

908

---

How will you call an Applet using Java Script Function?

961

---

Write a program based on Java script program.

1060

---

Can a class be private?

911

---

How to run a JAR file through command prompt?

1204

---

Can Exception handling we can handle multiple catch blocks?

977

---

What do bitwise operators do?

946

---

Can size_t be negative?

1065

---

Is void a return type?

899

---

Where we write javascript code in html page?

997

---