Upload File

queue – first in / first out (fifo) data structure that supports two operations: -push for adding...

  • Home
  • Documents
  • Queue – First In / First Out (FIFO) data structure that supports two operations: -push for adding new element at the end of the queue -pop for removing
12
Queue – First In / First Out (FIFO) data structure that supports two operations: - push for adding new element at the end of the queue - pop for removing new element at the front of the queue Queue Queue

Upload: godfrey-hawkins

Post on 13-Dec-2015

216 views

Category:

Documents


1 download

Report

TRANSCRIPT

Page 1: Queue – First In / First Out (FIFO) data structure that supports two operations: -push for adding new element at the end of the queue -pop for removing

Queue – First In / First Out (FIFO) data structure that supports two operations:

- push for adding new element at the end of the queue

- pop for removing new element at the front of the queue

QueueQueue

Page 2: Queue – First In / First Out (FIFO) data structure that supports two operations: -push for adding new element at the end of the queue -pop for removing

Queue: PushQueue: Push

Max

Lex

Nika

VladPushJoe

top Max

Lex

Nika

Vlad

Joe

top

Page 3: Queue – First In / First Out (FIFO) data structure that supports two operations: -push for adding new element at the end of the queue -pop for removing

Queue: PopQueue: Pop

pop

Lex

Nika

Vlad

Joe

Max

Lex

Nika

Vlad

Joe

top

Max

Page 4: Queue – First In / First Out (FIFO) data structure that supports two operations: -push for adding new element at the end of the queue -pop for removing

#include <queue>

queue<string> myQueue;

size() returns queue size;

front() returns the front queue element;

push () adds new element to (the end of) the queue;

pop() removes element from (the front of) the queue;

Generic queue Class (STL)Generic queue Class (STL)

Page 5: Queue – First In / First Out (FIFO) data structure that supports two operations: -push for adding new element at the end of the queue -pop for removing

Various lists: print queues, message queues, service request queues, process / thread queues; O(1) push & pop operations.

Round robin: circular queue (front element linked to last.

ApplicationsApplications

Page 6: Queue – First In / First Out (FIFO) data structure that supports two operations: -push for adding new element at the end of the queue -pop for removing

A queue can be implemented with the help of a linked list:

ImplementationImplementation

Max

Lex

Nika

Vladend

front

Page 7: Queue – First In / First Out (FIFO) data structure that supports two operations: -push for adding new element at the end of the queue -pop for removing

DEQueue – Double-Ended Queue = stack + queue hybrid, supports adding and removing elements at the front and at the end.

- push for adding new element at the end of the queue

- pop for removing new element at the front of the queue

DequeDeque

Page 8: Queue – First In / First Out (FIFO) data structure that supports two operations: -push for adding new element at the end of the queue -pop for removing

Deque: PushDeque: Push

Max

Lex

Nika

Vlad

push_frontJoe top

endpush_endJane

Max

Lex

Nika

Vlad

top

end

Joe

Jane

Page 9: Queue – First In / First Out (FIFO) data structure that supports two operations: -push for adding new element at the end of the queue -pop for removing

#include <deque>deque<string> myDeque;

* supports all of the methods of vector and list (including indexes and iterators)

size() returns deque size;front() returns the front deque element;back() returns the back deque element;push_front() - adds new element to the front of the deque;push_end() - adds new element to the end of the deque;pop_front() - removes element from the front of the deque;pop_end() - removes element from the back of the deque;

Generic deque Class (STL)Generic deque Class (STL)

Page 10: Queue – First In / First Out (FIFO) data structure that supports two operations: -push for adding new element at the end of the queue -pop for removing

Figure out the priority of operations in an algebraic expression, e.g.

Expression: a*(b+c)-d/e+fPriority: 2 3 1 3 1Using string and queue- Read expression from cin into a string- Look at each character and if it is +,-,*,/

determine the priority of arithmetic operation- populate the queue with operation in its

priority, e.g.(*,2) (+,3) (-,1) (/,3) (+,1)

- Print the queue contents

Exercise: Operation PriorityExercise: Operation Priority

Page 11: Queue – First In / First Out (FIFO) data structure that supports two operations: -push for adding new element at the end of the queue -pop for removing

1) Declare user-defined type:struct OperationPriority{ char Operation; int Priority;};

2) Your queue must store OperationPriority objects 3) Assign priority levels to operations: 2 for *,/; 1 for +,-4) Read expression into string5) Set nestingLevel=06) Look at each character

- If the character is ‘(‘ then nestingLevel++- If the character is ‘)‘ then nestingLevel--- If the character is ’*’, ’/’ then priority = nestingLevel*2 + 2- If the character is ’+’, ’-’ then priority = nestingLevel*2 + - If the character is ’+’, ’-’, ‘*’, ‘/’ then add it to queue including

the priority value7) cout the queue

Operation Priority SolutionOperation Priority Solution

Page 12: Queue – First In / First Out (FIFO) data structure that supports two operations: -push for adding new element at the end of the queue -pop for removing

Read chapter 6, prepare for quiz next class.

I will randomly question 10 students. Correct answer earns 1%, incorrect earns -1%.

AssignmentAssignment


first in, first out (FIFO) - Wellesley CScs.wellesley.edu/~cs230/slides/11-Queues.pptx.pdf · position in the sort key ... Original list front of queue à 1-8 ... // Represents a

Damian Gordon. What is a queue? It’s a structure that conforms to the principle of First In, First Out (FIFO). The first item to join the

PowerPoint Presentation...Queue ADT •FIFO: First in, first out –like a line/queue at a shop •Implemented with a list, O(1) enqueue/dequeue Stack ADT •LIFO: Last in, first out

Scanned by CamScanner - syriamath.net · Queue (J#JI gi) JiJJl - (FIFO) Jñ.wiJ19 JD è9iñnJl clcgJI auhj än;lñ öJ14C JIBijlJl 'hir gm J.Þic Jgi ( First in First out ) VliJl!

LogiCORE IP FIFO Generator v9 - Xilinx · FIFO Generator v9.2 8 PG057 July 25, 2012 Chapter 1 Overview The FIFO Generator core is a fully verified first-in first-out memory queue

UART with FIFO Buffer - Altera with FIFO Buffer Walkthrough ... The universal asynchronous receiver transmitter module (UART) with first-in first-out (FIFO)

LogiCORE IP FIFO Generator v11 - XilinxFIFO Generator v11.0 7 PG057 December 18 , 2013 Chapter 1 Overview The FIFO Generator core is a fully verified first-in first-out memory queue

First In First Out (FIFO) And Priority Packet Scheduling

LogiCORE IP FIFO Generator v10 - Xilinx · The FIFO Generator core is a fully verified first-in first-out memory queue for use in any application requiring in-order storage and retrieval,

The Effect of Queuing Mechanisms First in First out (FIFO ...5.1. First in, First out (FIFO) FIFO is an acronym for First In First Out. This expression describes the principle of a

CS 1301 – Ch 6, Handout 1mypages.valdosta.edu/dgibson/courses/cs3410/notes/ch…  · Web viewA regular Queue is First-In, First-Out (FIFO). A PriorityQueue is different in that

Priority Queues and Binary Heaps Chapter 6.5 1. 107 - Trees Some animals are more equal than others A queue is a FIFO data structure the first element

ECE-C 302 Lecture Data Storage Prawat Nagvajara Stack: Last-in First-out (LIFO) Queue: First-in First-out (FIFO) Random Access Memory

2 -1 Chapter 2 The stack. 2 -2 Stack and Queue Stack: Last-In-First-Out (LIFO) Last-Come-First-Serve (LCFS) only one end Queue: First-In-First-Out (FIFO)

10/28/2015IT 1791 Queue a FIFO (First In First Out) efbh front rear poll, remove offer add peek, element capacity size Java Doc java.util Interface Queue

1 Consensus Hierarchy Part 2. 2 FIFO (Queue) FIFO Object headtail

1 linked list€¦ · //3 queue using doubly linked list #include #include struct node{//node of queue (FIFO) int val;//value part struct node *next,

1 First Come, First Served (FCFS) The simplest algorithm –When a process becomes ready, it enters the FIFO queue. –When the currently-running process ceases

Functions Comp Sci 1575 Data Structurespriority queue Algorithms Priority queue: most important rst Recall: queue is FIFO A normal queue data structure would not implement a priority

SDL Forum 2007 SDL-RT tutorial - PragmaDev Studio · Process: message queue Process B • A process has an implicit message queue • The message queue is a FIFO • Process should

Congestion Control - Princeton University Computer Science...TCP Congestion Control 20. 6 Congestion in a Drop-Tail FIFO Queue •Access to the bandwidth: first-in first-out queue

1 Breadth First Search AB F I EH DC G FIFO Queue - front

Breadth First Search AB F I EH DC G FIFO Queue - front

Benefits. - Princeton University Computer Science · Queue. ¥Remove the item least recently added . ¥Analogy: Registrar's line. FIFO = "first in first out" LIFO = "last in first

LogiCORE IP FIFO Generator v8 - Xilinx · The Xilinx LogiCORE™ IP FIFO Generator is a fully verified first-in first-out (FIFO) memory queue for applications requiring in-order storage

Stack and Queuecse.iitkgp.ac.in/~ppchak/course/pds/Lect-28-Stack-Queue.pdf · 2013-10-02 · Queue In Data structure with First-In First C B A Out-Out (FIFO) behavior 18 B A. Typical

Bootcamp – Azure Service Bus · •Namespaces •Queues •Topics / Subscriptions •BrokeredMessages •Outros recursos (Sessions(FIFO), Autoforwarding, Dead-letter queue, Scheduled

Priority Queue. Priority Queues Queue (FIFO). Priority queue. Deletion from a priority queue is determined by the element priority. Two kinds of priority

CPU Scheduling - UMassPreemptive Shortest (remaining) Job First (PSJF) Round Robin Scheduling (RR) 27 First-Come First Served (FCFS) Managed by a strict FIFO queue CPU Gantt chart

The Abstract Data Type Queue A queue New items enter at the back, or rear, of the queue Items leave from the front of the queue First-in, first-out (FIFO)

Cmpt-225 Queues. A queue is a data structure that only allows items to be inserted at the end and removed from the front Queues are FIFO (First In First

Comp 245 Data Structures Queues. Introduction to the Queue ADT It is a FIFO (first-in, first-out) structure Access to the Queue can take place at two

FIFO Generator v13 - Xilinx€¦ · The FIFO Generator core is a fully verified first-in first-out memory queue for use in any application requiring ordered storage and retrieval,

Fifo first in first out powerpoint presentation templates

FIFO Queue Synchronization - TAUmcg.cs.tau.ac.il/papers/moshe-hoffman-msc.pdf · The best known linearizable FIFO queue implementation is the lock-free queue of Michael and Scott