Home
Add Document
Sign In
Create An Account
Queues
Recommend Documents
No documents
Queues
Download PDF
3 downloads
154 Views
147KB Size
Report
Comment
typedef struct. { int head; char* strings[CAPACITY]; int size;. } queue;. {. Page 4. Enqueue TODOs: [0]. [1]. [2]. [3].
Queues
FIFO
enqueue dequeue
typedef struct { int head; char* strings[CAPACITY]; int size; } queue; {
Enqueue TODOs:
size < CAPACITY? store at tail size++
{
head
[5] [4] [3] [2] [1] [0]
Dequeue TODOs:
size > 0? move head size-return element
{
head
[5] [4] [3] [2] [1] [0]
×
Report "Queues"
Your name
Email
Reason
-Select Reason-
Pornographic
Defamatory
Illegal/Unlawful
Spam
Other Terms Of Service Violation
File a copyright complaint
Description
×
Sign In
Email
Password
Remember me
Forgot password?
Sign In
Our partners will collect data and use cookies for ad personalization and measurement.
Learn how we and our ad partner Google, collect and use data
.
Agree & close