C# is a powerful programming language that provides a wide array of collections for managing data. Among these collections, Hashtables, Stacks, and Queues stand out due to their unique data structures and functionalities. This tutorial will provide an in-depth look at these advanced C# collections, covering their definitions, uses, and best practices for effective utilization.<\/p>\n\n\n\n
A Hashtable is a collection that stores key-value pairs in a way that allows for fast retrieval based on the key. This makes it ideal for situations where you need to look up values frequently.<\/p>\n\n\n
using<\/span> System;\nusing<\/span> System.Collections;\n\nclass<\/span> HashtableExample<\/span>\n{\n static<\/span> void<\/span> Main<\/span>(<\/span>)<\/span>\n {\n Hashtable hashtable = new<\/span> Hashtable();\n hashtable.Add(\"ID001\"<\/span>, \"John Doe\"<\/span>);\n hashtable.Add(\"ID002\"<\/span>, \"Jane Smith\"<\/span>);\n hashtable.Add(\"ID003\"<\/span>, \"Sam Brown\"<\/span>);\n\n foreach<\/span> (DictionaryEntry entry in<\/span> hashtable)\n {\n Console.WriteLine($\"{entry.Key}<\/span>: {entry.Value}<\/span>\"<\/span>);\n }\n }\n}<\/code><\/span>Code language:<\/span> C#<\/span> (<\/span>cs<\/span>)<\/span><\/small><\/pre>\n\n\n1.2 Adding and Removing Elements<\/h3>\n\n\n\n
Elements in a Hashtable are added using the Add<\/code> method and removed using the Remove<\/code> method.<\/p>\n\n\nhashtable.Add(\"ID004\"<\/span>, \"Alice White\"<\/span>);\nhashtable.Remove(\"ID002\"<\/span>);<\/code><\/span>Code language:<\/span> C#<\/span> (<\/span>cs<\/span>)<\/span><\/small><\/pre>\n\n\n1.3 Accessing Elements<\/h3>\n\n\n\n
Elements can be accessed using their key.<\/p>\n\n\n
string<\/span> value<\/span> = (string<\/span>)hashtable[\"ID001\"<\/span>];\nConsole.WriteLine(value<\/span>); \/\/ Output: John Doe<\/span><\/code><\/span>Code language:<\/span> C#<\/span> (<\/span>cs<\/span>)<\/span><\/small><\/pre>\n\n\n1.4 Handling Collisions<\/h3>\n\n\n\n
Collisions occur when two keys hash to the same index. The Hashtable manages collisions using chaining, where each bucket points to a list of entries that have the same hash.<\/p>\n\n\n\n
1.5 Performance Considerations<\/h3>\n\n\n\n
Hashtables offer average-time complexity of O(1) for lookups, insertions, and deletions. However, performance can degrade if there are too many collisions, making it essential to manage load factors and resize the Hashtable when necessary.<\/p>\n\n\n\n
2. Stacks<\/h2>\n\n\n\n2.1 Introduction to Stacks<\/h3>\n\n\n\n
A Stack is a collection that follows the Last-In-First-Out (LIFO) principle. It is used when you need to manage elements in a way where the most recently added element is the first to be removed.<\/p>\n\n\n
using<\/span> System;\nusing<\/span> System.Collections.Generic;\n\nclass<\/span> StackExample<\/span>\n{\n static<\/span> void<\/span> Main<\/span>(<\/span>)<\/span>\n {\n Stack<int<\/span>> stack = new<\/span> Stack<int<\/span>>();\n stack.Push(1<\/span>);\n stack.Push(2<\/span>);\n stack.Push(3<\/span>);\n\n while<\/span> (stack.Count > 0<\/span>)\n {\n Console.WriteLine(stack.Pop());\n }\n }\n}<\/code><\/span>Code language:<\/span> C#<\/span> (<\/span>cs<\/span>)<\/span><\/small><\/pre>\n\n\n2.2 Basic Operations<\/h3>\n\n\n\n\nPush<\/code>: Adds an element to the top of the stack.<\/li>\n\n\n\nPop<\/code>: Removes and returns the element at the top of the stack.<\/li>\n\n\n\nPeek<\/code>: Returns the element at the top of the stack without removing it.<\/li>\n<\/ul>\n\n\nstack.Push(4<\/span>);\nint<\/span> top = stack.Peek();\nConsole.WriteLine(top); \/\/ Output: 4<\/span>\nint<\/span> popped = stack.Pop();\nConsole.WriteLine(popped); \/\/ Output: 4<\/span><\/code><\/span>Code language:<\/span> C#<\/span> (<\/span>cs<\/span>)<\/span><\/small><\/pre>\n\n\n2.3 Use Cases<\/h3>\n\n\n\n
Stacks are commonly used for:<\/p>\n\n\n\n
\n- Undo mechanisms in applications.<\/li>\n\n\n\n
- Parsing expressions (e.g., balancing parentheses).<\/li>\n\n\n\n
- Depth-first search algorithms in graphs.<\/li>\n<\/ul>\n\n\n\n
3. Queues<\/h2>\n\n\n\n3.1 Introduction to Queues<\/h3>\n\n\n\n
A Queue is a collection that follows the First-In-First-Out (FIFO) principle. It is used when you need to manage elements in a way where the first added element is the first to be removed.<\/p>\n\n\n
using<\/span> System;\nusing<\/span> System.Collections.Generic;\n\nclass<\/span> QueueExample<\/span>\n{\n static<\/span> void<\/span> Main<\/span>(<\/span>)<\/span>\n {\n Queue<string<\/span>> queue = new<\/span> Queue<string<\/span>>();\n queue.Enqueue(\"First\"<\/span>);\n queue.Enqueue(\"Second\"<\/span>);\n queue.Enqueue(\"Third\"<\/span>);\n\n while<\/span> (queue.Count > 0<\/span>)\n {\n Console.WriteLine(queue.Dequeue());\n }\n }\n}<\/code><\/span>Code language:<\/span> C#<\/span> (<\/span>cs<\/span>)<\/span><\/small><\/pre>\n\n\n3.2 Basic Operations<\/h3>\n\n\n\n\nEnqueue<\/code>: Adds an element to the end of the queue.<\/li>\n\n\n\nDequeue<\/code>: Removes and returns the element at the front of the queue.<\/li>\n\n\n\nPeek<\/code>: Returns the element at the front of the queue without removing it.<\/li>\n<\/ul>\n\n\nqueue.Enqueue(\"Fourth\"<\/span>);\nstring<\/span> front = queue.Peek();\nConsole.WriteLine(front); \/\/ Output: Fourth<\/span>\nstring<\/span> dequeued = queue.Dequeue();\nConsole.WriteLine(dequeued); \/\/ Output: Fourth<\/span><\/code><\/span>Code language:<\/span> C#<\/span> (<\/span>cs<\/span>)<\/span><\/small><\/pre>\n\n\n3.3 Use Cases<\/h3>\n\n\n\n
Queues are commonly used for:<\/p>\n\n\n\n
\n- Order processing systems.<\/li>\n\n\n\n
- Managing tasks in a multi-threaded environment.<\/li>\n\n\n\n
- Breadth-first search algorithms in graphs.<\/li>\n<\/ul>\n\n\n\n
4. Best Practices for Using Hashtables, Stacks, and Queues<\/h2>\n\n\n\n4.1 Choosing the Right Collection<\/h3>\n\n\n\n\n- Use Hashtables when you need fast lookups and the data can be represented as key-value pairs.<\/li>\n\n\n\n
- Use Stacks for LIFO-based processing, such as parsing expressions or implementing undo functionalities.<\/li>\n\n\n\n
- Use Queues for FIFO-based processing, such as task scheduling or order processing.<\/li>\n<\/ul>\n\n\n\n
4.2 Managing Capacity<\/h3>\n\n\n\n
For Hashtables:<\/p>\n\n\n\n
\n- Monitor the load factor and resize the Hashtable when the load factor exceeds a certain threshold.<\/li>\n\n\n\n
- Use prime number sizes for the Hashtable capacity to reduce the likelihood of collisions.<\/li>\n<\/ul>\n\n\n\n
For Stacks and Queues:<\/p>\n\n\n\n
\n- Consider the initial capacity and growth factor if the size of the collection is expected to grow significantly.<\/li>\n<\/ul>\n\n\n\n
4.3 Thread Safety<\/h3>\n\n\n\n\n- For multi-threaded applications, use concurrent collections like
ConcurrentDictionary<\/code>, ConcurrentStack<\/code>, and ConcurrentQueue<\/code>.<\/li>\n\n\n\n- Alternatively, use synchronization mechanisms like locks to ensure thread safety.<\/li>\n<\/ul>\n\n\n\n
5. Advanced Techniques<\/h2>\n\n\n\n5.1 Custom Hash Functions<\/h3>\n\n\n\n
Implementing custom hash functions can help reduce collisions in a Hashtable.<\/p>\n\n\n
class<\/span> CustomHashTable<\/span>\n{\n private<\/span> const<\/span> int<\/span> SIZE = 100<\/span>;\n private<\/span> LinkedList<KeyValuePair<string<\/span>, string<\/span>>>[] buckets = new<\/span> LinkedList<KeyValuePair<string<\/span>, string<\/span>>>[SIZE];\n\n private<\/span> int<\/span> GetHash<\/span>(string<\/span> key<\/span>)<\/span>\n {\n int<\/span> hash = 0<\/span>;\n foreach<\/span> (char<\/span> c in<\/span> key)\n {\n hash = (hash * 31<\/span> + c) % SIZE;\n }\n return<\/span> hash;\n }\n\n public<\/span> void<\/span> Add<\/span>(string<\/span> key, string<\/span> value<\/span><\/span>)<\/span>\n {\n int<\/span> index = GetHash(key);\n if<\/span> (buckets[index] == null<\/span>)\n {\n buckets[index] = new<\/span> LinkedList<KeyValuePair<string<\/span>, string<\/span>>>();\n }\n buckets[index].AddLast(new<\/span> KeyValuePair<string<\/span>, string<\/span>>(key, value<\/span>));\n }\n\n public<\/span> string<\/span> Get<\/span>(string<\/span> key<\/span>)<\/span>\n {\n int<\/span> index = GetHash(key);\n if<\/span> (buckets[index] != null<\/span>)\n {\n foreach<\/span> (var<\/span> pair in<\/span> buckets[index])\n {\n if<\/span> (pair.Key == key)\n {\n return<\/span> pair.Value;\n }\n }\n }\n return<\/span> null<\/span>;\n }\n}<\/code><\/span>Code language:<\/span> C#<\/span> (<\/span>cs<\/span>)<\/span><\/small><\/pre>\n\n\n5.2 Implementing Custom Stacks and Queues<\/h3>\n\n\n\n
You can create custom implementations of stacks and queues to meet specific requirements, such as adding extra functionality or optimizing performance.<\/p>\n\n\n\n
Custom Stack Example<\/h4>\n\n\nclass<\/span> CustomStack<\/span><T<\/span>>\n{\n private<\/span> LinkedList<T> list = new<\/span> LinkedList<T>();\n\n public<\/span>