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 is linq c#?

0 Answers  

---

What is helper method in c#?

0 Answers  

---

Will finally block get executed if the 1exception had not occurred?

3 Answers  

---

What are callback methods in c#?

0 Answers  

---

Why can?t you specify the accessibility modifier for methods inside the interface?

5 Answers  

---

---

how to communicate inventory system and account system?

1 Answers  

---

Is c# a strongly-typed language?

0 Answers  

---

What is generic collection in c#?

0 Answers  

---

write program in c# using this instructions name avinash varma ,work experiance<2,nochildren his work experiance is higher than 5 years,more than one children one children name is diwakar,number of years of work eperiance at current company is the ratio of children and work experiance is 0.21 to 0.5

0 Answers  

---

What is the difference between ienumerable and enumerable?

0 Answers  

---

What are logical operators in c#?

0 Answers  

---

What is the use of list in c#?

0 Answers  

---