56.Queue Class Example in C#

 using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

using System.Collections;

namespace queue

{

    class Program

    {

        static void Main(string[] args)

        {

            Queue q1 = new Queue();


            q1.Enqueue(5);

            q1.Enqueue(15);

            q1.Enqueue(25);

            q1.Enqueue(35);

            q1.Enqueue(45);


            foreach (int var in q1)

            {

                Console.WriteLine(var);

            }

            Console.WriteLine("==== After Dequeue ====");


            q1.Dequeue();

            q1.Dequeue();


            foreach (int var in q1)

            {

                Console.WriteLine(var);

            }

            Console.WriteLine("Peek() Result is:" + q1.Peek().ToString());

            Console.WriteLine("Total Element in Queue is :" + q1.Count);

            Console.WriteLine("Contains () Result is :" + q1.Contains(3));


            Queue q2 = (Queue)q1.Clone();

            Console.WriteLine("======After Clone Method =========");

            foreach (int val in q2)

            {

                Console.WriteLine(val);

            }

            object[] arr1;

            arr1 = q1.ToArray();

            Console.WriteLine("====== After Convert into Array ========");

            foreach (object val in arr1)

            {

                Console.WriteLine(val);

            }

            q1.Clear();

            Console.WriteLine("======= After Clear Method ========");

            Console.WriteLine("Total Element in Queue is : " + q1.Count);

            Console.Read();

        }

    }

}

OUTPUT:
5
15
25
35
45
==== After Dequeue ====
25
35
45
Peek() Result is:25
Total Element in Queue is :3
Contains () Result is :False
======After Clone Method =========
25
35
45
====== After Convert into Array ========
25
35
45
======= After Clear Method ========
Total Element in Queue is : 0

Comments

Popular posts from this blog

Questions 2 : Assume there are three small caches, each consisting of four one-word blocks. On cache is direct-mapped, a second is two-way set-associative, and the third is fully associative. Find the number of hits for each cache organization given the following sequence of block addresses: 0, 8, 6, 5, 10, 15 and 8 are accessed twice in the same sequence. Make a tabular column as given below to show the cache content on each of columns as required. Show all the pass independently pass. Draw as many numbers Assume the writing policy is LRU. Memory location Hit/Mis Add as many columns as required

Quetion 6 : Consider the "in-order-issue/in-order-completion" execution sequence shown in f In Figure Decode OWE Execute 12 12 12 14 16 13 16 13 15 15 16 Write 024/06/02 11 3 4 11 12 13 13 N 15 16 a. Identify the most likely reason why I could not enter the execute fourth cycle. stage until the [2] b. Will "in-order issue/out-of-order completion" or "out-of-order issue/out-of-order completion" fix this? If so, which? Explain

7.Write a program to read a list containing item name, item code and cost interactively and produce a three-column output as shown below. NAME CODE COST Turbo C++ 1001 250.95 C Primer 905 95.70 ------------- ------- ---------- ------------- ------- ---------- Note that the name and code are left-justified and the cost is right-justified with a precision of two digits. Trailing zeros are shown.