Answer / navin chandra pandit

Hash table & Arrays both are collection but the main diff. is
that- Hash Table follows hashing technique, means it has two
parts-one is hash code while second is value corresponds to
the hash code. To access a value from hash table, we use the
hash code. While array has only value part. To access a
value from array, we use index no. generally.

Answer / senthil kumar

Both the hash table and arrays is used to store the
element.hash table is derived from the collection base
class.array is the base class of system.object.array is
reference type.which is identified with the position of
array for both insertion and retreival.but the hash table
is stored the data with unique key which helps to refer the
data.

if it is right ok! other wise correct me.

Answer / kanan

Following are some diff.

1) Hash table store data as name,value pair. while in array
only value is store.

2) to access value from hash table, you need to pass name.
while in array, to access value , you need to pass index number.

3) you can store different type of data in hash table, say
int,string etc. while in array you can store only similar
type of data.

correct me if i am wrong.

Answer / debjit

Has table is seriliazed but Array list is not

Answer / jagadish

In array we can store data of a similar type only.

Where as in hash table we can store different data types

Answer / kalidoss

Basically both are used to store the data,but the array is
the collection same object which is accessed by index or
supscript,but in hash table we can store different type
object like a structure but hastable follows two fields,
one is hash key another one is value.The value will be
fetched from hashtable by hash key but sometime hash key
might be string

Answer / ravi

a) Hash table store data as name,value pair. while in array
only value is store.

b) to access value from hash table, you need to pass name.
while in array, to access value , you need to pass index number.

c) you can store different type of data in hash table, say
int,string etc. while in array you can store only similar
type of data.

Answer / naga samrat chowdary narla

In both these data structures you require index to access the element(s). in case of hash table we use hash function to calculate the index from key.

one more we can say with respect to time complexity for insert, delete and search

Thanks,
Naga Samrat Chowdary, Narla

Answer / amit singh

Hashtable is not type safe while array is.
Boxing takes place while u store value in hastable.Because
hastable stores data as objects and when u retreive value
then unboxing takes plase.

Answer / revaz khvedelidze

Also, Array stores fixed size of collection of elements and
it slower than Hash Table

Helo , Help Me , Help Me About : C# Windows Application - Network How To Manage IP Client's Accessiblity To The Internet Share concise Substitute , Minor ISA Server

0 Answers  

Can we change static value in c#?

0 Answers  

Describe ways of cleaning up objects.

8 Answers   Wipro,

Is a dll an assembly?

0 Answers  

Why dataset is used in c#?

0 Answers  

Explain the features of an abstract class in net.

0 Answers  

What is tryparse?

0 Answers  

How to make a class non-inheritable other than sealed?

7 Answers  

Can c# inherit multiple classes?

0 Answers  

Which is the best way for keeping the data in XML or SQL server..and why?

8 Answers   Infosys, Satyam,

What is a pre-requisite for connection pooling?

2 Answers  

What are the advantages of properties in c#?

0 Answers