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 the properties of string?

0 Answers  

---

What is extension method in c# and how to use them?

0 Answers  

---

Give some examples for built in datatypes in c#?

0 Answers  

---

What do you know about WM_CHAR message?

0 Answers   C DAC,

---

Write the sample code for threading in c# .net..

4 Answers   Logica CMG,

---

main concept of c sharp

3 Answers  

---

How does bubble sort work?

0 Answers  

---

What are the advantages of using delegates in c#?

0 Answers  

---

What is readline library?

0 Answers  

---

Assignment # 1 Print the pattern given below using single printf statement XX XX XX XX XX XX X X X X XX XX XX XX XX XX Assignment # 2 Print the pattern given below using single printf statement (please do NOT use the string function below) 0 909 89098 7890987 678909876 56789098765 4567890987654 345678909876543 23456789098765432 1234567890987654321

3 Answers   Wipro,

---

What is int32?

0 Answers  

---

Describe the difference between inline and code behind - which is best?

0 Answers   Siebel,

---