Hashtable « Collections Data Structure « C# / C Sharp

1.	2D Graphics
2.	Class Interface
3.	Collections Data Structure
4.	Components
5.	Data Types
6.	Database ADO.net
7.	Date Time
8.	Design Patterns
9.	Development Class
10.	Event
11.	File Stream
12.	Generics
13.	GUI Windows Form
14.	Internationalization I18N
15.	Language Basics
16.	LINQ
17.	Network
18.	Office
19.	Reflection
20.	Regular Expressions
21.	Security
22.	Services Event
23.	Thread
24.	Web Services
25.	Windows
26.	Windows Presentation Foundation
27.	XML
28.	XML LINQ

1.	Compares the efficiency of the hash map implementation with the tree map
2.	Implement GetHashCode method and store it in a hashtable
3.	Add value to Hashtable and loop through the value key pairs
4.	Enumerating a hash table collection
5.	illustrates the use of a Hashtable
6.	illustrates the use of the Hashtable methods
7.	Demonstrate Hashtable
8.	Get IDictionaryEnumerator enumerator from Hashtable
9.	Properties based on Hashtable
10.	DictionaryEntry Structure Defines a dictionary key/value pair that can be set or retrieved.
11.	Create Hashtable by copying the elements from the specified dictionary to the new Hashtable object.
12.	Hashtable.Clear Method removes all elements from the Hashtable.
13.	Hashtable.Contains Method determines whether the Hashtable contains a specific key.
14.	Hashtable.CopyTo Method copies the Hashtable elements to a one-dimensional Array instance at the specified index.
15.	Hashtable.GetEnumerator Method returns an IDictionaryEnumerator that iterates through the Hashtable.
16.	Hashtable.IsSynchronized Property gets a value indicating whether access to the Hashtable is synchronized (thread safe).
17.	Hashtable.Remove Method removes the element with the specified key from the Hashtable.
18.	IComparer Interface exposes a method that compares two objects.

All other trademarks are property of their respective owners.