CS350: Data Structures Queues · 2017-12-09 · CS350: Data Structures Queues • Queues are...

CS350: Data Structures © James Moscola

College Catalog2009–2011

!"#$%&'())*+,-.)/.&01234546708.9:;*&<:(#.="#>&1015?26511??@A9/**/")*&<B!&C(>&1015?2D50633

05?3352775?30?EEEF+C:F(A;

!""#$%%&'$#()*$&+$,-$%.$"

'GHI<GJHK&L<MNK'GONJHK&P@JJHGMFIF&'<IJ@QH&'@OK

!<GR%&'@'HGPOJ&N<F&012

LLEGE O

F PENN

LLEGE C

2009–2011

!""#$%&'()*+,--.../ 012$1$"..."34#3$4.56

!"#$%&'())*+,-.)/.&01234546708.9:;*&<:(#.="#>&1015?26511??@A9/**/")*&<B!&C(>&1015?2D50633

05?3352775?30?EEEF+C:F(A;

!""#$%%&'$#()*$&+$,-$%.$"

LLEGE O

F PENN

LLEGE C

2009–2011

!""#$%&'()*+,--.../ 012$1$"..."34#3$4.56

!"#$%&'())*+,-.)/.&01234546708.9:;*&<:(#.="#>&1015?26511??@A9/**/")*&<B!&C(>&1015?2D50633

05?3352775?30?EEEF+C:F(A;

!""#$%%&'$#()*$&+$,-$%.$"

LLEGE O

F PENN

LLEGE C

G 2009–2011

!""#$%&'()*+,--.../ 012$1$"..."34#3$4.56

James MoscolaDepartment of Engineering & Computer ScienceYork College of Pennsylvania

CS350: Data StructuresQueues

CS350: Data Structures

Queues

• Queues are another very common data structure that can be used for a variety of data storage purposes

• Similar to a line of people waiting for a ride at an amusement park - People enter the line/queue at the rear- People wait behind others that entered the line/queue before them- People exit from the front of the line/queue to get on the ride- People in the middle of the line/queue cannot get out without first

advancing to the front of the line- There is no cutting

• May also be referred to as a FIFO (First-In-First-Out)

Queue Operations

• Queues have two main operations

- Enqueue - inserts an element into the back of the queue

- Dequeue - removes a single element from the front (i.e. the head) of the queue

Queue Operations

Start with Empty Queue

FrontBack

Queue Operations

Enqueue Value: A

FrontBack

Queue Operations

FrontBack

Enqueue Value: B

Queue Operations

FrontBack

Enqueue Value: C

FrontBack

Queue Operations

Dequeue the Front of the Queue:

Queue Interface (Java)

public interface Queue<AnyType> {

public void enqueue( AnyType x ); public AnyType dequeue( );

public AnyType getHead( );

public boolean isEmpty( );

public void makeEmpty( );}

Queue Implementations

• Queues can be implemented in multiple ways

• Two popular methods for implementing queues include - (1) Arrays- (2) Linked Lists

• Both of these implementation approaches allow for constant time operations - O(1)

Queue Implementation Using an Array

Start with Empty Queue (i.e. an array)

tail pointer is initialized to -1

second row is array index

4 3 2 1 0

Enqueue Value: A

4 3 2 1 0

Enqueue Value: B

4 3 2 1 0

Enqueue Value: C

4 3 2 1 0

Dequeue the Head of the Queue:

4 3 2 1 0

• Considerations when using an array implementation - Enqueue, and Dequeue operations run in constant time ... in most

cases- What happens when your array is full and you want to Enqueue

another element?• Array must be increased in size which takes time an more memory• Time to copy and create new array is O(N)• Time to copy array is amortized over the lifetime of the array• May not be suitable for all types of systems (e.g. RTOS)

Queue Implementation Using an Array (Java)

/** * Queue constructor */ public ArrayQueue( ) { theArray = (AnyType []) new Object[ DEFAULT_CAPACITY ]; makeEmpty( ); }

/** * Test if the queue is logically empty. * @return true if empty, false otherwise. */ public boolean isEmpty( ) { return currentSize == 0; }

/** * Make the queue logically empty. */ public void makeEmpty( ) { currentSize = 0; head = 0; tail = -1; }

/** * Insert a new item into the queue. * @param x the item to insert. */ public void enqueue( AnyType x ) { if( currentSize == theArray.length ) doubleQueue( ); tail = increment( tail ); theArray[ tail ] = x; currentSize++; }

/** * Return and remove the least recently inserted item * from the queue. * @return the least recently inserted item in the queue. * @throws UnderflowException if the queue is empty. */ public AnyType dequeue( ) { if( isEmpty( ) ) throw new UnderflowException( "ArrayQueue dequeue" ); currentSize--;

AnyType returnValue = theArray[ head ]; head = increment( head ); return returnValue; }

/** * Internal method to increment with wraparound. * @param x any index in theArray's range. * @return x+1, or 0 if x is at the end of theArray. */ private int increment( int x ) { if( ++x == theArray.length ) x = 0; return x; }

/** * Internal method to expand theArray. */ private void doubleQueue( ) { AnyType [ ] newArray;

newArray = (AnyType []) new Object[ theArray.length * 2 ];

// Copy elements that are logically in the queue for( int i = 0; i < currentSize; i++, head = increment( head ) ) newArray[ i ] = theArray[ head ];

theArray = newArray; head = 0; tail = currentSize - 1; }

Queue Implementation Using a LinkedList

Start with Empty Queue (i.e. a null LinkedList)

head points to the front of the linked list

tailtail points to the back of

the linked list

Enqueue Value: A

Enqueue Value: B

Enqueue Value: C

Dequeue the Front of the Queue:

• Considerations when using an queue implementation - Enqueue and Dequeue operations run in constant time ... still- Each element inserted into the queue requires a pointer to the data

and a second pointer to the next node in the LinkedList

Queue Implementation Using a LinkedList (Java)

/** * Queue constructor */ public ListQueue( ) { head = tail = null; }

private ListNode<AnyType> head; private ListNode<AnyType> tail;

/** * Test if the queue is logically empty. * @return true if empty, false otherwise. */ public boolean isEmpty( ) { return head == null; }

/** * Make the queue logically empty. */ public void makeEmpty( ) { head = null; tail = null; }

/** * Insert a new item into the queue. * @param x the item to insert. */ public void enqueue( AnyType x ) { if( isEmpty( ) ) // Make queue of one element tail = head = new ListNode<AnyType>( x ); else // Regular case tail = tail.next = new ListNode<AnyType>( x ); }

/** * Return and remove the least recently inserted item * from the queue. * @return the least recently inserted item in the queue. * @throws UnderflowException if the queue is empty. */ public AnyType dequeue( ) { if( isEmpty( ) ) throw new UnderflowException( "ListQueue dequeue" );

AnyType returnValue = head.element; head = head.next; return returnValue; }

CS350: Data Structures Queues · 2017-12-09 · CS350: Data Structures Queues • Queues are...

Documents

Transcript of CS350: Data Structures Queues · 2017-12-09 · CS350: Data Structures Queues • Queues are...

CS350 CD3412 User Manual

Heaps and Priority Queues CS 3358 – Data Structures.

CS350: Data Structures Skip Lists - GitHub Pages · 2017. 12. 9. · CS350: Data Structures Skip List Searching • Example -- find the node with a key value 6 9 NULL NULL NULL 1

CS350: Data Structures Heaps and Priority Queues · 2017-12-09 · CS350: Data Structures Binary Heaps • Great for an implementation of a priority queue • Similar in structure

Data Structures Using Java1 Chapter 7 Queues. Data Structures Using Java2 Chapter Objectives Learn about queues Examine various queue operations Learn.

Basic Data Structures - coral.ie.lehigh.edu · Basic Data Structures Queues and Deques Brad Miller David Ranum 1/25/06 Basic Data Structures. Queues Deque Outline 1 Queues What Is

Elementary Data Structures Stacks, Queues, Lists, Vectors, Sequences, Trees, Priority Queues, Heaps, Dictionaries & Hash Tables.

CS350: Data Structures Hash Tables - GitHub Pagesycpcs.github.io/cs350-fall2014/lectures/Hash_Tables.pdf · CS350: Data Structures Hash Function • Hash function maps keys of a given

ETL Queues for Active Data Warehousing

Using Data Queues in Modern Applications

MELJUN CORTES Jedi slides data st-chapter03-queues

CS350 Operating Systemsali/cs350-f19/synch.pdfReview: Processes Aprocessisaninstanceofarunningprogram-Athreadisanexecutioncontext-Processcanhaveoneormorethreads-Threadsshareaddressspace(code,data,heap),openfiles

Concurrent Data Structures: Queues and Stacks

queues1 Queues Data structures that wait their turn.

CS350: Operating Systems

Introduction to Data Structures Arrays, Stacks and Queues.

Data Structures - Lecture 6 [queues]

Using JMS Queues with Oracle Data Integrator (ODI) · PDF file7 | USING JMS QUEUES WITH ORACLE DATA INTEGRATOR Figure 2: JMS XML Queues with ODI Figure 2 above shows the configuration

CSE332: Data Abstractions Lecture 4: Priority Queues

1 Priority Queues & Heaps Priority queues… return to ‘linear’ data structures (sequences, queues,..) Heaps… use of binary trees to efficiently implement.