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.

Why do we use methods in c#?

0 Answers  

---

What is distribute by in hive?

0 Answers  

---

What is check/uncheck?

0 Answers  

---

What is difference between an reference type and value type in C#?

0 Answers   B-Ways TecnoSoft,

---

What is regex c#?

0 Answers  

---

Is string passed by reference in c#?

0 Answers  

---

What is a console file?

0 Answers  

---

if you do have a stack overflow profile.what is your ranking?

0 Answers  

---

Types of polymerphism and explain about dynamic polymerphism?

5 Answers  

---

Did it possible to cast a generic type of derived class to generic type of base class?

2 Answers   TCS,

---

What is the difference between firstordefault and singleordefault?

0 Answers  

---

Why do we need delegates in c#?

0 Answers  

---