It is similar to ArrayList, but with two differences: Vector is synchronized, and it contains many legacy methods that are not part of the collections framework.

Vector is fast as compared to Array list

vector grows at a double rate as compared to array list .5 times  

 In ArrayList we can store only the same data type values. But in Vector we can store the different data type values.

        In Vector, there is a constructor for specifing  initial capacity and incremental capacity. Where as in ArrayList there no constructor for specifing incremental capacity.

      Vector, it defaults to doubling the size of an array.  In ArrayList, it icreases its array size by 50%.  

-Arraylist has no default size while vector has a default size of 10.
-Arraylist don't define any increment size while vector does.
-arraylist can be seen directly without any iterator while vector requires an iterator to display all it's content. (not very sure).

Request tll all those who post reply..please only post replies if u know correct..or if u r not sure..alteast mention not sure...why to say something wrong that creates problem for others..this is very good site...pls let us maintain it correctness...

Vector and Arraylist both has initial capacity and it is 10

Vector is synchronized and Arraylist is not

Vector has option to set incremental capacity Arraylist does not have.

There is a difference b/w thw way both grows but I am not sure exactly what is the difference in terms of growth rate.

It is similar to ArrayList, but with two differences: Vector is synchronized, and it contains many legacy methods that are not part of the collections framework.