Circular Queue | Data Structures using C

Circular Queue | Data Structures using C

💡 Also Watch

Subscribe to our channel and hit the bell 🔔🔔🔔 icon to get video updates.

💡 Visit Our Websites

#DataStructures #Training #Course #Tutorials
--------------------------

💡 About NareshIT:

"Naresh IT is having 14+ years of experience in software training industry and the best Software Training Institute for online training, classroom training, weekend training, corporate training of Hadoop, Salesforce, AWS, DevOps, Spark, Data Science, Python, Tableau, RPA , Java, C#.NET, ASP.NET, Oracle, Testing Tools, Silver light, Linq, SQL Server, Selenium, Android, iPhone, C Language, C++, PHP and Digital Marketing in USA, Hyderabad, Chennai and Vijayawada, Bangalore India which provides online training across all the locations

--------------------------

💡 Our Online Training Features:
🎈 Training with Real-Time Experts
🎈 Industry Specific Scenario’s
🎈 Flexible Timings
🎈 Soft Copy of Material
🎈 Share Videos of each and every session.

--------------------------

💡 Please write back to us at

[varunaggarwal]

you are shifting elements but majority of teachers taught us to simply increment front .

[parmodprajapati]

Mind blowing explanation. I watched few video related DS. Not just good but Best
Thanks for your valuable time.

[Bunce]

you explained this better than my university lecturers, incredible job

[vaibbhavdevenderkalra]

Please add Insertion sort, Merge sort, Shell sort, Heap Sort too.

[roshanpawar]

Better than NPTEL. I watched one lecture there and they say FRONT is incremented to next and then return Queue[FRONT]. clearly its deleting the next element and not the one FRONT was pointing.
In real, FRONT always points to the element that has been in it for the longest time.

[dongyuchen]

About the condition of whether the queue is full
why don't just use: (rear+1)%maxsize == front

[PetsonParade]

You
told that always FRONT=0, remaining elements are shifted.so why we do the operation FRONT=FRONT+1;

[poojarohilla]

great explanation.. thank u so much sir for clearing the concept..

[aqibjaved]

very nice sir, u explained very well plzz upload some videos about linked list in simple struture..

[dhruvpatel]

Sir when increment than rear=4 than front=0 if check condition if (frount==rear+1)
P ("queue is fulll");

In this case you will be increment rear value than rear=5 than condition not true but queue is already full

[simmisharma]

great explanation easy to understand and implement :-) thanku

[ShubhRide]

Sir please explain the part where we insert the elements again after deletion of a few elements-the condition part.

[moxithajanan]

Brother index start from zero. the value which is in [0] is always considered as first. just we r assuming [1] as first, but [0] never delete. we can apply same mechanism to simple queue also.
(front=front+1 )

[obaidaljabry]

help, i would like to develop and algorithm program and flowchart to perform the following task, read the sizes, model and prices please

[banothuanilkumar]

Very nice teaching sir, we also want java and python tutorial sir.

[subhasishnathdev]

Initially suppose, #define MAX 5 int info[MAX]; front = rear = 0; while insertion: info[rear] = newitem; After Insertion: rear = (rear+1)%MAX; Now for deletion: printf("Deleted element is %d", info[front]); After Deletion: front = (front+1)%MAX; That's All. Happy coding :)

[kanubhav]

Please upload videos of double ended queue, priority queue, and dequeue...

[pavankulkarni]

sir plzz make a video on double ended queue...

[Surya_]

6:17 shud it be
if(rare==size-1&&front ==-1)
{printf("the queue is full");}

[aakashsolanki]

Can you give the whole program coding as perfect as you teach