Discipline	Computer Science
Lab	Data Structure Lab
Experiment	Implementation of Circular Queue using array.

The objective of this lab is to teach students various data structures and to explain them algorithms for performing various operations on these data structures. This lab complements the data structures course. Students will gain practical knowledge by writing and executing algorithm by using various data structures such as arrays, linked lists, stacks, queues, trees, graphs, hash tables and search trees.Circular queue is a linear data structure. It follows FIFO (First In First Out) principle. In circular queue the last node is connected back to the first node to make a circle. Elements are added at the rear end and the elements are deleted at front end of the queue. The queue is considered as a circular queue when the positions 0 and MAX-1 are adjacent. Any position before front is also after rear.

B. Tech. 2nd year Students and Teachers

B.Tech.

Dr. A.P.J. Abdul Kalam Technical University, Lucknow, Uttar Pradesh

Name of Developer	Dr. Satyendra Kumar Pandey
Institute	Institute of Technology & Management, GIDA, Gorakhpur
Email id	satyendrakpandey@gmail.com
Department	Department of Computer Science

Mentored by	Dr Ramesh Sharma
Institute	Feroze Gandhi Institute of Engineering and Technology
Email id	sharmarameshfgiet@gmail.com
Department	Department of Applied science

SrNo	Name	Faculty or Student	Department	Institute	Email id
1	Abhishek Mishra	Student	Computer Science and Engineering	Institute of Technology & Management, GIDA, Gorakhpur	mishraabhi8924@gmail.com
2	Ashish Shukla	Student	Computer Applications	Institute of Management Studies, Noida, Uttar Pradesh	ashishgkp22@yahoo.com
3	Kriti Shukla	Student	Computer Science and Engineering	Institute of Technology & Management, GIDA, Gorakhpur	kritishukla2019@gmail.com
4	Pankaj Kumar Gond	Student	Information Technology	Institute of Technology & Management, GIDA, Gorakhpur	pankajkumargond79@gmail.com

The link of the website ishere