Skip to Main Content
Programming and Data Structures
book

Programming and Data Structures

by Ashok Kamthane
August 2009
Intermediate to advanced content levelIntermediate to advanced
604 pages
21h 39m
English
Pearson India
Content preview from Programming and Data Structures
Linear Data Structure 491
14.17 REPRESENTATION OF QUEUE
The queue can be put into operation in two ways,
a) Static implementation : Static implementation means array implementation. In this
implementation, we should be assured of the number of elements we want in the queue. The
size of the array is decided before execution at compile time. Once the array is declared, its size
cannot be altered. The array at run time neither enlarged nor shrunk. The beginning of the
array, that is, Oth element is the front and the last memory location will be rear of the queue. A
queue can be declared as an array of any data type.
int queue[7];
In
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

Learning Data Structures and Algorithms

Learning Data Structures and Algorithms

Rod Stephens
Data Structures and Algorithms in C++, Second Edition

Data Structures and Algorithms in C++, Second Edition

Michael T. Goodrich, Roberto Tamassia, David M. Mount

Publisher Resources

ISBN: 9789332506343