Skip to Main Content
Data Structures Using C, 2nd Edition by Pearson
book

Data Structures Using C, 2nd Edition by Pearson

by A. K. Sharma
May 2024
Intermediate to advanced content levelIntermediate to advanced
521 pages
14h 12m
English
Pearson India
Content preview from Data Structures Using C, 2nd Edition by Pearson
176 Data Structures Using C
Now, the queue is useless because the queue is full (Rear > = N − 1) as well as empty (Front =
Rear
). Thus, no additions and deletions can be performed. This situation can be handled by resetting
Front and Rear to 0th location, i.e., Front = Rear = 0.
(2) The major drawback of linear queue is that at a given time, all the locations to the left of Front
are always vacant and unutilized.
4.3.2 Circular Queue
The drawback of the linear queues, as discussed above, can be removed by making the queue spill over
the elements from last position of array to the 0th element. This arrangement of elements makes the
queue as ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Data Structures Using C

Data Structures Using C

Samir Kumar Bandyopadhyay, Kashi Nath Dey
Intermediate C Programming, 2nd Edition

Intermediate C Programming, 2nd Edition

Yung-Hsiang Lu, George K. Thiruvathukal

Publisher Resources

ISBN: 9781299831582