what is Difference beetween Array and Hash Table.?
Answers were Sorted based on User's Feedback
Answer / pkl
An ArrayList behaves just like
an array, except that it will dynamically expand and
contract when you
add/remove elements to it. A HashTable is useful when you
want to
lookup objects indexed by a 'key' value. It also dynamically
expands and contracts but doesn't impose an order on the
elements like
an array does. Put a different way: you index elements in an
ArrayList with a numeric index, you index elements in a
HashTable with
a key. Such a key is often a string.
Is This Answer Correct ? | 19 Yes | 1 No |
Answer / versha
In array we can acces it using index which we always to
rember when we want but in case of hashtable we can define
keys to that so that we can easily identify.
Is This Answer Correct ? | 16 Yes | 0 No |
Answer / ranjana tyagi
In An array We make collection of same type of data.But in
hash table we can collect different type of objects.
2.In array we can access the element using index.we have to
access element one by one.If we do'nt remember index then
we cant acess the element.On the other hand in hash table
we can acess the element by using key.Also in hash table we
can take the key of the element a string also.
Is This Answer Correct ? | 13 Yes | 2 No |
Answer / annu
araay is a collection of same data type in which we make
use of index,,
while in Hash table we make use of key and values...
And Hash table is a collection of different dataype
Is This Answer Correct ? | 11 Yes | 0 No |
Answer / dinesh tiwari
Array is a collection of same datatype
while
Hash table is a colletion of different datatype.
Is This Answer Correct ? | 10 Yes | 0 No |
Answer / vinod raj
An array is a mechanism which having similar data types or
collection of same data types and here we make use of index
ex:int[] myArray(100,0) here 0 is index.But in hash it is
collection of different data types and we can make use of
key and values
Is This Answer Correct ? | 1 Yes | 0 No |
Answer / salman mohammed
1.) arrays can be access from initial position. for example if we want to search 100th element then it will starts from 0 and then it will checks one by one and then it will reaches to 99. So here it is some what reliable but it tooks a lot of time for searching.
2.) Whereas in hash we are having key and value. Based on this we can easily identify the element which we need with in a short period of time than arrays.
So it is much reliable than arrays.
But both are important to us. Because both are having some good properties which helps us in our programming.
Is This Answer Correct ? | 1 Yes | 0 No |
Answer / 6 cg
arrray has 5 characters in its name
hash has 4 characters in its name
Is This Answer Correct ? | 3 Yes | 12 No |
What does the "EnableViewState" property do? Why would I want it on or off?
Explain cache memory? : .NET Architecture
Explain the number or character entered through keyboard gets converted to equivalent ascii code & it get stored on ram in the binary form. What is the exact procedure. : Dot net architecture
What is .net mobile utility controls. : Microsoft dot net mobile
while developing a asp.net 2.0 ajax application how to maitain and check the ACID property for each transaction
Explain difference between machine config vs. Web config : Dot net architecture
What is an interrupt? : Dot net architecture
what is ado.net
can u give me real example of how web.config overrides the machine.config file?
What is cache coherency and how is it eliminated? : .NET Architecture
What is a memory management?
readonly syntax ?