using System;

using System.ComponentModel.DataAnnotations;

​

namespace Queues

{

    internal class Program

    {

        static void Main(string[] args)

        {

            string[] queue = new string[10]; //FOR EFFECTIVE TESTING 

            int front = 0;

            int rear = -1;

            int size = 0;

            //max is the same as string array value

​

            //loop to act as tester, iteraters through data

            for (int i = 0; i < 12; i++) 

            {

                if (isFull(size))

                { break; }

                Console.WriteLine("Enter data:");

                string data = Console.ReadLine();

                enQueue(queue, ref rear, ref size, data);

            }//should stop when 10th data is added

            //check for sunroutines

            Console.WriteLine("End of adding");

            if (isEmpty(size)) { Console.WriteLine("Empty"); }

            if (isFull(size)) { Console.WriteLine("Full"); }

​

            //write check

            for (int i = 0; i < 12; i++)

            {

                if (isEmpty(size))

                { break; }

                int positiionF = front % 10;

                Console.WriteLine(queue[positiionF]);

                deQueue(ref front, ref size);

            }//should stop when 10th data is added

            //writes out stack in FIFO order

            //check for sunroutines

            Console.WriteLine("End of removing");

            if (isEmpty(size)) { Console.WriteLine("Empty"); }

            if (isFull(size)) { Console.WriteLine("Full"); }

​

        }

        public static bool isFull(int size)

        {

            if (size == 10) { return true;}

            else { return false;}

        }

        public static bool isEmpty(int size)

        {

            if (size == 0) { return true; }

            else { return false; }

        }

​

        public static void enQueue(string[] queue, ref int rear, ref int size, string data)

        {

            if (isFull(size)) { Console.WriteLine("Queue isFull"); } //uses subroutine to ensure no error occurs

            else

            {

                rear++;

                size++;

                int positionR = rear % 10;

                queue[positionR] = data;

            }

        }

        public static void deQueue(ref int front, ref int size)

        {

            if (isEmpty(size)) { Console.WriteLine("Queue isEmpty"); } //uses subroutine to ensure no error occurs

            else

            {front++; size--; }

        }

        // ++rear rear/maxsize(10) MOD (remainer) so if rear == 11

        // then 11/10 == 1.1 so 1 would be remainer 

    }

}

​