This document discusses representing a queue using a linear list in FIFO (First In First Out) order. It explains that a queue with a list uses a head and tail pointer, with elements added to the end (insert last) and removed from the front (delete first). It instructs the reader to create a new project called "QUEUELIST_0xxxx" with their 4 digit student ID to work on queue representation exercises.

1. ADT QUEUE-Representasi
Dengan List linier
PSDA-11

2. QUEUE
Elemen QUEUE tersusun secara FIFO
(First In First Out)

3. List Linier First Last
First
First
Last
Last

4. Queue dengan List
Head
Head
Head
Tail
Tail
Tail

5. ADD
P
8
Head
Tail
6
5
Add = Insert Last

6. DEL
Tail
Head
4
P
6
X = Info(P)
Dealokasi(P)
Del = Delete First
5

7. KERJAKAN PSDA-11
BUAT PROJECT BARU DGN NAMA
QUEUELIST_0xxxx (4 DIGIT NIM TERAKHIR)
SELAMAT MENGERJAKAN 