Added descriptive readme.md for Queue

queue/README.md

@@ -0,0 +1,34 @@
+                                                              ---QUEUE---
+
+
+1)Introduction-A Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO). A good example of a queue is any queue of consumers for a resource where the consumer that came first is served first. The difference between stacks and queues is in removing. In a stack we remove the item the most recently added; in a queue, we remove the item the least recently added.
+
+2)List of problems with descriptions
+
+Q)Implementing a queue using an integer array of size given as input.
+  ASSUMPTIONS:
+ 1. Integer array
+ 2. Front is one step behind the value at the front.
+ 3. Rear is at the value in the array.
+
+  Description:
+  1.This is a program showing the functionality of Queue an Dequeue using Arrays.
+
+Q) QueueHelper     
+   Description : 
+   1.This is a program that implements Collection framework in Java and calles the inbuild Queue for various functionalities.
+   2.It gives the user the choice of Enqueue, Dequeue, print and exit from the program.
+
+
+Q) QueueImplementer 
+   Description : 
+   1.This is a program that uses the collection framework to show how queue can be used as a linkedList.
+   2.It gives the user the choice of Enqueue, Dequeue, print and exit from the program.
+
+
+Q) QueueLinkedList
+   Description :
+   1.This is a program that shows how inner classes are used in Java.
+   2.A QueueNode an inner class is made that is meant to hold the value and point to it's next node.
+   3.It gives the user the choice of Enqueue, Dequeue, print and exit from the program.
+