Read About Queue Data Structure In C In Brief.

Asked By Zimmerman Jesus 0 points N/A Posted on - 06/08/2017

Hello,
I am willing to learn C language with accuracy and precision. But I am stuck at the concept of Queue Data Structure in C. Can someone explain about it in C language?
Please reply ASAP.

• Status: Open
• Question Views: 272
• Answer Count: 1
• Vote Up 0 Vote Down

• Answer Accepted: No
• Question Category: Database
• Question Tags: C language | Queue Data Structure

Answered By jamior miston 0 points N/A #298775

Read About Queue Data Structure In C In Brief.

A queue works on the concept of FIFO which stands for First-In-First-Out, which means that the first entered item will remove first. The queue has two ends front and rear, from the front end, you can insert element, and from the other end, you can delete one.

A real-life example of a queue is a movie ticket counter, the first person who stands in front of the ticket window takes first and remove from that line, and a new person always stand in the line from the end.

About jamior miston

Questions
11

Answers
1

Best Answers
0

• Vote Up 0 Vote Down

• Posted on - 06/08/2017
• Question Category: Database