Difference between revisions of "Queue"

From Computer Science Wiki
Jump to navigation Jump to search
 
(10 intermediate revisions by the same user not shown)
Line 4: Line 4:




== image of a queue ==  
== Image of a queue ==  




[[File:Data Queue.svg.png]]<ref>This Image was created by User:Vegpuff.If you are using the image under the creative commons share alike license please credit the photo Vegpuff/Wikipedia and include a link to this page. No explicit permission is needed from me, but an email if my work has been of help to you.If you dont want to release your work under a creative commons license, please mail me at vegpuff@gmail.com or catch me at my twitter stream for a custom license. - Own work, CC BY-SA 3.0, https://commons.wikimedia.org/w/index.php?curid=7586271</ref>
[[File:Data Queue.svg.png]]<ref>This Image was created by User:Vegpuff.If you are using the image under the creative commons share alike license please credit the photo Vegpuff/Wikipedia and include a link to this page. No explicit permission is needed from me, but an email if my work has been of help to you.If you dont want to release your work under a creative commons license, please mail me at vegpuff@gmail.com or catch me at my twitter stream for a custom license. - Own work, CC BY-SA 3.0, https://commons.wikimedia.org/w/index.php?curid=7586271</ref>


== Access methods of a queue ==
* enqueue
* dequeue
* isEmpty
* peek
== Practical applications of queue's ==
* Printer queues
* Computer modelling of physical queues (like in a supermarket)
== Queue - video example ==
[https://www.youtube.com/watch?v=XuCbpw6Bj1U  This video provides a basic introduction to queues]
== Priority Queue ==
In computer science, a priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority. If two elements have the same priority, they are served according to their order in the queue.<ref>https://en.wikipedia.org/wiki/Priority_queue</ref>.
== A python learning activity ==
Using the python list data structure, implement 4 queue functions, enqueue, dequeue, peek and isEmpty. We assume we know the name of the queue.
<syntaxhighlight lang="python">
myQueue = []
def enqueue(element):
    # do stuff here
    return
def dequeue(element):


    # do stuff here


== Access methods of stack ==
    return
* push
 
* pop
def peek(element):
* isEmpty
 
    # do stuff here
 
    return
 
def isEmpty(stackName):


    # this function should return as boolean True or False
    return


== stack ==
# for extra challenge create a priority queue.
This video discusses the C programming language, but the content is clear to describe stack.  


<html>
</syntaxhighlight>
<iframe width="560" height="315" src="https://www.youtube.com/embed/9Tp8wHD66lw" frameborder="0" allowfullscreen></iframe>
</html>


== Standards ==  
== Standards ==  
Line 33: Line 72:


* [[Abstract data structures]]
* [[Abstract data structures]]
== External Links ==


== References ==
== References ==

Latest revision as of 14:05, 5 December 2017

Programming basics[1]

In computer science, a queue is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue. This makes the queue a First-In-First-Out (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed. This is equivalent to the requirement that once a new element is added, all elements that were added before have to be removed before the new element can be removed. Often a peek or front operation is also entered, returning the value of the front element without dequeuing it. A queue is an example of a linear data structure, or more abstractly a sequential collection.[2]


Image of a queue[edit]

Data Queue.svg.png[3]

Access methods of a queue[edit]

  • enqueue
  • dequeue
  • isEmpty
  • peek

Practical applications of queue's[edit]

  • Printer queues
  • Computer modelling of physical queues (like in a supermarket)

Queue - video example[edit]

This video provides a basic introduction to queues

Priority Queue[edit]

In computer science, a priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority. If two elements have the same priority, they are served according to their order in the queue.[4].

A python learning activity[edit]

Using the python list data structure, implement 4 queue functions, enqueue, dequeue, peek and isEmpty. We assume we know the name of the queue.

myQueue = []

def enqueue(element):

    # do stuff here

    return

def dequeue(element):

    # do stuff here

    return

def peek(element):

    # do stuff here

    return

def isEmpty(stackName):

    # this function should return as boolean True or False
    return 

# for extra challenge create a priority queue.

Standards[edit]

  • Describe the characteristics and applications of a queue.
  • Construct algorithms using the access methods of a queue.
  • Explain the use of arrays as static stacks and queues.

See Also[edit]

References[edit]

  1. http://www.flaticon.com/
  2. https://en.wikipedia.org/wiki/Queue_(abstract_data_type)
  3. This Image was created by User:Vegpuff.If you are using the image under the creative commons share alike license please credit the photo Vegpuff/Wikipedia and include a link to this page. No explicit permission is needed from me, but an email if my work has been of help to you.If you dont want to release your work under a creative commons license, please mail me at vegpuff@gmail.com or catch me at my twitter stream for a custom license. - Own work, CC BY-SA 3.0, https://commons.wikimedia.org/w/index.php?curid=7586271
  4. https://en.wikipedia.org/wiki/Priority_queue