package com.company;

/**
 * Created by lonestar on 30.05.2016.
 */
public class Queue {

    int size;
    int head;
    int tail;
    private int nElem;
    double[] queue;

    Queue(int size)
    {
        this.size = size;
        queue = new double[size];
        head = 0;
        tail = -1;
        nElem = 0;
    }

    void Add(double value)
    {
        if(tail == size -1)
            tail = -1;
        queue[++tail] = value;
        nElem++;
    }

    double Extract(){
        double tmp = queue[head++];
        if(head == size)
            head=0;
        nElem--;
        return  tmp;
    }
    public boolean isEmpty() {
        return (nElem == 0);
    }

    public boolean isFull() {
        return (nElem == size - 1);
    }

    public  double getHead()
    {
        return  queue[head];
    }

    public  double getTail()
    {
        return queue[tail];
    }

    public void ShowAdd()
    {
        System.out.print("Queue task:\n");
        Queue myQueue = new Queue(5);

        myQueue.Add(10);
        myQueue.Add(20);
        myQueue.Add(30);
        myQueue.Add(40);
        myQueue.Add(50.5);

        while (!myQueue.isEmpty()) {
            double N = myQueue.Extract();
            System.out.println("Elem: " + N);

        }

    }

    public  void ShowAfterDelete()
    {
        System.out.print("After Delete:\n");
        Queue myQueue = new Queue(5);

        myQueue.Add(10);
        myQueue.Add(20);
        myQueue.Add(30);
        myQueue.Add(40);
        myQueue.Add(50.5);

        myQueue.Extract();
        myQueue.Extract();
        myQueue.Extract();

        myQueue.Add(60);

        while (!myQueue.isEmpty()) {
            double N = myQueue.Extract();
            System.out.println("Elem: " + N);

        }
    }

}
package com.company;

/**
 * Created by lonestar on 30.05.2016.
 */
public class Stack<T> {
    private Node<T> top;
    private int count;

    public int size() {
        return count;
    }

    public boolean isEmpty() {
        return top == null;
    }

    public void push(T element) {
        top = new Node<T>(element, top);
        count++;
    }

    public T pop() {
        if (top == null) {
            throw new RuntimeException("This stack doesn't contain items.");
        }
        T element = top.item;
        top = top.next;
        count--;
        return element;
    }

    private class Node<T> {
        private Node next;
        private T item;

        public Node(T element, Node<T> head) {
            item = element;
            next = head;
        }
    }

    public  void ShowPush()
    {
        System.out.print("\nStack after push:\n");
        Stack<String> stack = new Stack<>();
        stack.push(Integer.toString(123,2));
        stack.push(Integer.toString(122,2));
        stack.push(Integer.toString(121,2));
        stack.push(Integer.toString(113,2));
        stack.push(Integer.toString(123,2));
        stack.push(Integer.toString(101,2));
        stack.push(Integer.toString(111,2));
        stack.push(Integer.toString(88,2));
        stack.push(Integer.toString(2,2));
        stack.push(Integer.toString(13,2));
        int i=0;
        while (i<stack.size())
        {
            System.out.println(stack.pop());
        }

    }

    public void ShowAfterPop()
    {
        System.out.print("\nStack after pop:\n");
        Stack<String> stack = new Stack<>();

        stack.push(Integer.toString(123,2));
        stack.push(Integer.toString(122,2));
        stack.push(Integer.toString(121,2));
        stack.push(Integer.toString(113,2));
        stack.push(Integer.toString(123,2));
        stack.push(Integer.toString(101,2));
        stack.push(Integer.toString(111,2));
        stack.push(Integer.toString(88,2));
        stack.push(Integer.toString(2,2));
        stack.push(Integer.toString(13,2));

        stack.pop();
        stack.pop();

        for(int i=stack.size();i>0;i--)
        {
            System.out.println(stack.pop());
        }
    }
}