Answer / shiva charan

1.basically hashtable stores in terms of (key,value) pair.
2.all the searching operations can be done in O(1) time
complexity.
3. hashtable when u insert the values internally it uses
some optimized algorithm so that accessing will be pretty
much easier.
all the searching operations will be done with less time
complexity if u store the data in a hash table

Answer / subodh kumar

First of all Why HashTable? Answer is very simple. Suppose
you have some data, which needs to be stored in two
dimensional array and have a link format of Key and Value.
For example, a person name and his social security number
and we can access there data using a key.

What language is arduino?

0 Answers  

---

How long does it take to learn c# for unity?

0 Answers  

---

How does a while loop work?

0 Answers  

---

What is a shared assembly?

0 Answers   Wipro,

---

What is extended method in c#

3 Answers   iNautix,

---

---

What's the difference between WindowsDefaultLocation and WindowsDefaultBounds?

0 Answers   BirlaSoft,

---

Is a valid int value?

0 Answers  

---

What Is The Difference Between The System.array.copyto() And System.array.clone()?

0 Answers   Infosys,

---

Contrast System.String and System.Text.StringBuilder classes?

0 Answers   Siebel,

---

What is the meaning of MSIL?

0 Answers   TCS,

---

What is the difference between <c> and <code> xml documentation tag?

0 Answers  

---

What is difference between variable and property in c#?

0 Answers  

---