What is the difference between a Hash Table and a Dictionary?
- 1 Answers
- 581 Views
- I also Faced
- E-Mail Answers
Answer Posted / hrindows@gmail.com
The main differences are listed below.
Dictionary:
Returns an error if the key does not exist
No boxing and unboxing
Faster than a Hash table
Hashtable:
Returns NULL even if the key does not exist
Requires boxing and unboxing
Slower than a Dictionary
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Which dll is required to translate xml to sql in internet information server (iis)?
How anonymous method is different from a lambda expression?
What is heap and what is stack?
How we can achieve Connection pooling in .Net?
Explain me what is an anonymous method and how is it different from a lambda expression?
What is the difference between imperative and interrogative code?
What is .net debug & trace?
Why do we use msmq?
Explain how to spawn a thread?
What is the new three features of COM+ services, which are not there in COM (MTS)
Explain me what is a design pattern and what is it for?
What is implement a generic action in webapi?
What is the difference between a class and an object, and how do these terms relate to each other?
Differences between namespace, class, assembly?
If you are executing these statements in commandobject. Select * from table1; select * from table2? How you will deal result set? 42. How do you sort a dataset.
