Which is faster hashtable or dictionary?
Answer / Deepika Rawat
In general, Dictionary provides better performance than Hashtable for key-value pair operations such as add, remove, and lookup. This is because Dictionary was introduced later in the .NET Framework and is implemented with a more efficient data structure.
| Is This Answer Correct ? | 0 Yes | 0 No |
Does C# support multiple inheritance?
What is datasource c#?
What’s a strong name?
Is c# strongly typed?
What is difference between internal and protected internal in c#?
Describe an abstract class?
Can you prevent your class from being inherited and becoming a base class for some other classes?
Why do we need serialization?
Can we extend sealed class in c#?
How to move to a state-related codebase?
How does a while loop work?
What?s the difference between System.String and System.StringBuilder classes?
Visual Basic (800)
C Sharp (3816)
ASP.NET (3180)
VB.NET (461)
COM+ (79)
ADO.NET (717)
IIS (369)
MTS (11)
Crystal Reports (81)
BizTalk (89)
Dot Net (2435)
Exchange Server (362)
SharePoint (720)
WCF (340)
MS Office Microsoft (6963)
LINQ Language-Integrated Query (317)
WPF (371)
TypeScript (144)
Microsoft Related AllOther (311)