/* related posts with thumb nails */

operations on queue ADT:

In a queue, insertion occurs at the rear of the list, and deletion occurs at the front of the list. This is called as “first-in-first-out” (FIFO) method.

The operations on queue are discussed below:

§ qstore: adding elements at the end of a queue.

§ qdelete: removing elements from the front of the queue.

§ isfull: isfull finds out whether the queue is full

§ isempty: isempty finds out whether the queue is empty

§ create: to create an empty queue

§ first: to return the first element of a queue

§ last: to return the last element of a queue

Related Topics:


Post a Comment