Documentation
¶
Overview ¶
***************************************
* File Name : qarray.go
* Creation Date : 03-09-2020
* Last Modified : Thursday 03 September 2020 10:20:31 AM
* Created By : Bhaskar Tallamraju
* Description: queue implementation using arrays * * Queue: its a data structure which works based on principle of first in first out (FIFO). * In computing world, queue data structure can be applied in many applications where order is important * such as holding messages. enqueue and dequeue are the operations that are provided for insertion * of an element into the stack and the removal of an element from the queue. * * two indexes, readq follows writeq. After reading, check if readq equals writeq and then * re-initialize the indexes. ****************************************
***************************************
* File Name : qllist.go
* Creation Date : 03-09-2020
* Last Modified : Thursday 03 September 2020 10:16:26 AM
* Created By : Bhaskar Tallamraju
* Description: queue implementation using linkedlist * * Queue: its a data structure which works based on principle of first in first out (FIFO). * In computing world, queue data structure can be applied in many applications where order is important * such as holding messages. enqueue and dequeue are the operations that are provided for insertion * of an element into the stack and the removal of an element from the queue. * * head -> |6|next| -> |5|next| -> |7|next| -> |newData|next|->NULL * q -> * * head ptr points to the first element inserted and q points to the latest element added. ***************************************
Source Files