0% found this document useful (0 votes)
60 views14 pages

Linear Queue

This document describes a linear queue data structure. A linear queue only allows adding elements to the back/tail of the queue and removing elements from the front/head of the queue. The document lists sample queue elements with timestamps and provides definitions and characteristics of linear queues, including common queue operations like insert, delete, and reset. It also discusses the different states a queue can be in like empty, not full yet, full, and special conditions.

Uploaded by

Kurnia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
60 views14 pages

Linear Queue

This document describes a linear queue data structure. A linear queue only allows adding elements to the back/tail of the queue and removing elements from the front/head of the queue. The document lists sample queue elements with timestamps and provides definitions and characteristics of linear queues, including common queue operations like insert, delete, and reset. It also discusses the different states a queue can be in like empty, not full yet, full, and special conditions.

Uploaded by

Kurnia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

LINEAR QUEUE

1. Lutfi Aman
(18.11.2523)
2. Windi Aulia R (18.11.2533)
3. Rizma Reza E
(18.11.2543)
4. Kurnia Hidayati
(18.11.2548)
5. Yulia Nur Santi
(18.11.2571)
6. Ikhwan Tri Y
(18.11.2580)

http://www.free-powerpoint-templates-design.com
Kumpulan data dimana:
• penambahan data
DEFIN (elemen) hanya melalui
satu sisi yaitu belakang
ISI (tail)

• penghapusan data
(elemen) hanya melalui
sisi depan (head)
Karakteristik

Elemen 1 4 Count
Antrian

Front 2 5 Status

Tail 3
FIRST IN PRINSIP
FIRST
OUT

FIRST

OPPORTUNITIES
COME
FIRST
SERVE
O THREATS
PROSES

DELETE

RESET
INSERT
PROSE
S

AWAL
Fungsi Fungsi
inQueue deQueue

Fungsi Empty Fungsi init

Fungsi Full
Fungsi Clear

OPERASI DASAR
Keadaan Linear
01
Keadaan Kosong
(Awal)
02
Keadaan Masih
dapat Diisi
03
Keadaan Kosong

04 Keadaan Penuh

04 Keadaan Khusus
wal
isiA
nd
Ko

pus
a
di h
atA
sa
an
eser
rg
Pe

a b,
t
n da
s era
er ge .
i si p c, d
nd
Ko
Kond
isi da
dihap ta A
us

Kond
isi da
dihap ta B
us

Kond
isi Lo
Gese ket
r
et elah
on gs
n kos ni
ria dilaya
Ant

ya ni
m ela
sudah nya
y ang ntrian
ndisi ua a
Ko sem

r e set
h di-
la
sete
ondisi
K
Thank You
DAFTAR PUSTAKA
 http://elearning.amikom.ac.id/index.php/download/materi/190302288-ST
015 11/2018/05/20180521_Jurnal%20Praktikum%20SD%20Chapter%209%20Queue.pdf/f9b902fc3289af4dd08de5d
1de54f68f

https://elib.unikom.ac.id/files/disk1/468/jbptunikompp-gdl-fitridiani-23353-9-pertemua-9.pdf
 
http://eprints.unsri.ac.id/2916/1/modul%20strukdat.pdf
 
http://mercubuana.ac.id/files/StrukturData/Mod6.ppt
 
https://www.cappluse.com/2018/02/dasar-analisis-algoritma-queue-atau.html
 
https://sites.google.com/site/rizkyluthpiyanaif15d120/linear-queue

You might also like