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 synchronous and asynchronous operations?

0 Answers  

---

What are collection classes?

0 Answers  

---

Distinguish between a class and struct?

0 Answers  

---

What is type safe code?

0 Answers  

---

Explain About delegates

0 Answers   TCS,

---

Why are c# strings immutable?

0 Answers  

---

Explain the difference between proc. Sent by val and by sub?

0 Answers  

---

What is the difference between int.Parse() and Convert.toInt32().

2 Answers  

---

What is the difference between readonly and constant in c#

2 Answers   Fulcrum Logic,

---

Is list immutable in c#?

0 Answers  

---

What is the difference between dataset and datatable in c#?

0 Answers  

---

Explain the types of comments in c#?

0 Answers  

---