How to resolve the algorithm Queue/Usage step by step in the C# programming language

Published on 12 May 2024 09:40 PM
#C_Sharp

How to resolve the algorithm Queue/Usage step by step in the C# programming language

Table of Contents

Problem Statement

Create a queue data structure and demonstrate its operations. (For implementations of queues, see the FIFO task.)

Operations:

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Queue/Usage step by step in the C# programming language

The program creates a queue–a first-in, first-out (FIFO) data structure–and pushes three integer elements into it using the Enqueue() method. Then, it pops–retrieves and removes–three elements from the queue using the Dequeue() method in FIFO order, which means that the first element pushed into the queue is the first to be popped.

It checks if the queue is empty by using the Count property and prints the result, which is a boolean value. An empty queue has a count of 0.

Finally, it tries to pop an element from an empty queue, which results in an InvalidOperationException with the message "Queue empty." being thrown.

Source code in the csharp programming language

using System;
using System.Collections.Generic;

namespace RosettaCode
{
    class Program
    {
        static void Main()
        {
            // Create a queue and "push" items into it
            Queue<int> queue  = new Queue<int>();
            queue.Enqueue(1);
            queue.Enqueue(3);
            queue.Enqueue(5);

            // "Pop" items from the queue in FIFO order
            Console.WriteLine(queue.Dequeue()); // 1
            Console.WriteLine(queue.Dequeue()); // 3
            Console.WriteLine(queue.Dequeue()); // 5

            // To tell if the queue is empty, we check the count
            bool empty = queue.Count == 0;
            Console.WriteLine(empty); // "True"

            // If we try to pop from an empty queue, an exception
            // is thrown.
            try
            {
                queue.Dequeue();
            }
            catch (InvalidOperationException exception)
            {
                Console.WriteLine(exception.Message); // "Queue empty."
            }
        }
    }
}

You may also check:How to resolve the algorithm Catalan numbers step by step in the PHP programming language
You may also check:How to resolve the algorithm Maximum triangle path sum step by step in the Perl programming language
You may also check:How to resolve the algorithm Validate International Securities Identification Number step by step in the Perl programming language
You may also check:How to resolve the algorithm Box the compass step by step in the Visual Basic .NET programming language
You may also check:How to resolve the algorithm Permutations by swapping step by step in the Quackery programming language