What is the difference between Hash Table and Arrays?

Answer Posted / 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

Is This Answer Correct ?    4 Yes 3 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Why do we use polymorphism in c#?

484


What are the different types of constructors in c#?

511


What are the properties in c#?

498


How can I check the type of an object at runtime?

542


Is there an equivalent of exit() for quitting a c# .net application?

499






What is the difference between abstraction and encapsulation in c#?

501


Why we need get set property in c#?

550


What does type safe mean in c#?

517


Is int a class in c#?

516


Can we have two main methods in c#?

542


What is escape character in c#?

517


What is a reference type c#?

532


What is unsigned int?

532


How can we set class to be inherited, but prevent the method from being over-ridden?

542


What is #region in c#?

510