Queue

Содержание

1. Queue
2. A queue is a first-in first-out (FIFO) abstract data
3. For example:Keyboard Buffer - you want the
4. There are several different types of queues
5. Array implementationhttps://www.youtube.com/watch?v=okr-XE8yTO8
6. Слайд 6
7. ?
8. Слайд 8
9. The queue supports the following operations:push -
10. ?q.Count - ?
11. ?What will be printed as a result of this code?
12. A Linear queue is constantly working its
13. 2. CircularUnlike linear queues Circular queues allow
14. Слайд 14
15. Скачать презентанцию

A queue is a first-in first-out (FIFO) abstract data type that is heavily used in computing. Uses for queues involve anything where you want things to happen in the order that they were

Слайды и текст этой презентации

Слайд 1Queue
describe the functioning of the stack and queue data types

correctly using the terms ‘last in last out’ and ‘first

in first out’

Queuedescribe the functioning of the stack and queue data types correctly using the terms ‘last in last

Слайд 2A queue is a first-in first-out (FIFO) abstract data type that is

heavily used in computing. Uses for queues involve anything where

you want things to happen in the order that they were called, but where the computer can't keep up to speed.

A queue is a first-in first-out (FIFO) abstract data type that is heavily used in computing. Uses for queues

Слайд 3For example:
Keyboard Buffer - you want the letters to appear

on the screen in the order you press them. You

might notice that when your computer is busy the keys you press don't appear on the screen until a little while after you press them. When they do appear they appear in the order you press them.

Printer Queue - you want print jobs to complete in the order you sent them, i.e. page 1, page 2, page 3, page 4 etc. When you are sharing a printer several people may send a print job to the printer and the printer can't print things instantly, so you have to wait a little while, but the items output will be in the order you sent them.

For example:Keyboard Buffer - you want the letters to appear on the screen in the order you

Слайд 4There are several different types of queues such as the

ones described below:
Linear.

In this queue form, elements are able to

join the queue at one end and can exit from the queue at the other end. First In First Out (FIFO).

Head

Tail

There are several different types of queues such as the ones described below:Linear.In this queue form, elements

Слайд 5Array implementation
https://www.youtube.com/watch?v=okr-XE8yTO8

Слайд 6

Слайд 7?

Слайд 8

Слайд 9The queue supports the following operations:

push - (Enqueue) - the

operation of inserting a new element,
pop - (Dequeue) - the

operation to delete a new item,
count - check the number of items in the queue.

The queue supports the following operations:push - (Enqueue) - the operation of inserting a new element,pop -

Слайд 10?
q.Count - ?

Слайд 11?
What will be printed as a result of this code?

Слайд 12A Linear queue is constantly working its way through memory,

it does not re-use memory. As a result if a

large number of items are being added and removed from the list this means the lists will grow very large without containing much data. It is not a very efficient solution and will use up large amounts of memory.