What is the difference between a Hash Table and a Dictionary?
- 1 Answers
- 589 Views
- I also Faced
- E-Mail Answers
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 |
What is the use of ErrorProvider Control in .NET?
Explain what is an application domain?
What are object pooling and connection pooling and difference?
Explain the use of ‘this’ keyword in Java?
Describe the difference between inline and code behind which is best in a loosely coupled solution?
Is there built-in support for logging?
Explain is the jit an interpreter?
What are three common acronyms used in .net, and what do they stand for?
What is the purpose of delegates in .net?
Tell us why do we use the “using” statement?
What is an assembly? What are the different types of assemblies?
Explain constructor.
Dot Net Framework 
