Name: Angelo T.

Realda BSIT- 2A

Queue:

Code:
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Char
{
class Program
{
static void Main(string[] args)
{

Queue q = new Queue(6);

q.enqueue(4);
Console.WriteLine();
q.displayItems();
q.enqueue(7);
Console.WriteLine();
q.displayItems();
q.enqueue(5);
Console.WriteLine();
q.displayItems();
q.dequeue();
Console.WriteLine();
q.displayItems();
q.dequeue();
Console.WriteLine();
q.displayItems();
q.enqueue(9);
Console.WriteLine();
q.displayItems();
q.enqueue(8);
Console.WriteLine();
q.displayItems();
q.enqueue(3);
Console.WriteLine();
q.displayItems();
q.enqueue(10);
Console.WriteLine();
q.displayItems();
Console.WriteLine("\nREMAINING ELEMENTS IN QUEUE: ");
q.displayItems();
q.size();
q.peek();
Console.ReadKey();

}
}
}

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace Char
{
class Node
{
private int item;
private Node next;
public Node(int item, Node next)
{
this.item = item;
this.next = next;
}
public Node()
{
this.item = 0;
this.next = null;
}
public Node(int item)
{
this.item = item;
this.next = null;
}
public int getItem()
{
return item;
}
public Node getNext()
{
return next;
}
public void setItem(int item)
{
this.item = item;
}
public void setNext(Node next)
{
this.next = next;
}
}
}

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Char
{
class Queue
{
private Node front;
private Node rear;
private int count;
private int limit;
public Queue()
{
front = null;
rear = null;
count = 0;
limit = 10;
}
public Queue(int limit)
{
front = null;
rear = null;
count = 0;
this.limit = limit;
}
public void enqueue(int item)
{
Node newNode = new Node(item);
if (isEmpty() != true && isFull() != true)
{
rear.setNext(newNode);
rear = newNode;
}
else if (isEmpty())
{
front = newNode;
rear = newNode;
}
else
{
Console.WriteLine("Queue is full");
newNode = null;
count--;
}
count++;
}
public void dequeue()
{
if (isEmpty() != true)
{
Node temp = front.getNext();
front = null;
front = temp;
}
else if (count == 1)
{
front = rear = null;
}
else
{
Console.WriteLine("Queue is empty.");
}
count--;
}
public void displayItems()
{
Node current = front;
while (current != null)
{
Console.WriteLine(current.getItem() + "");
current = current.getNext();
}
}
public int peek()
{
if (front != null)
Console.WriteLine("The front of the queue is " + front.getItem());
else
Console.WriteLine("Queue is empty.");
return 0;
}
public int size()
{
Console.WriteLine("\nThe size of the queue is " + count);
 return count;
}
public bool isEmpty()
{
if (front == null)
return true;
else
return false;
}
public bool isFull()
{
if (count == limit)
return true;
else
return false;
}
}
}

Output: