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 are nested classes in c#?

0 Answers  

---

What is the different types of private assembly and shared assembly?

0 Answers  

---

Can interface inherit class in c#?

0 Answers  

---

In a stored procedure 4 select stmts there.If error comes in one select stmt will remaining normally executes?

7 Answers   Microsoft,

---

How we free the memory in C#.NET.

3 Answers   Synechron,

---

What is difference between method overriding and method overloading?

0 Answers  

---

Is ram a heap?

0 Answers  

---

Name the control which cannot be placed in mdi?

0 Answers  

---

Explain About stateless and state full web service

0 Answers   Digital GlobalSoft,

---

Types of polymerphism and explain about dynamic polymerphism?

5 Answers  

---

What is the use of regex in c#?

0 Answers  

---

What is use of FormBoarderStyle Propertie

0 Answers   MCN Solutions,

---