Data structures: Array implementation of Queue

Source code link is not working

2 hr before exam

would help if you showed us the actual code

Thank you.
You just explained the whole thing very understandably

The way he teaches one can easily understand thankyou sir

best explanation ever🙌🙌

Timeless greatneess

Harsha will remain immortal until these videos are here. May God bless his soul. Thankyou for creating this channel. For Many like me it's a treasure.

Glad that I stuck to the end! At first, it was so simple I almost skipped to the next video, but then you started talking about circular implementation of the array. That's a genius way of making use of all the memory available!

Its 2022, 9 years since they uploaded this video and its still helpful.

FAKE QUEUES!!!

very nice explanation :)

please start making videos, it is my humble request.

PLEASE answer below question

write a c program that create data structure that are larger than the amount of physical memory contained in their machine

difficult

Can anyone explain to me, how to search an element in a queue?. I mean the code for it.

There is a mistake in this. For Ex: if we enqueued 3 numbers 2,3,4 and then dequeued those 3 numbers out. Now the queue is empty, but in the empty function he had given if front=-1 and rear=-1, it should show empty. Now according to example condition, front=2and rear=2 still the queue is empty. The code he wrote is not showing the queue as empty.

Grazie cugino di Harpreet

All is right about this video except for the fact that you didn't address the issue of figuring out when a circular array-based queue is empty or full? You didn't address the issue of keeping a RESERVED SPACE and also changing the IsEmpty condition.

This guy was ahead of his time! He is a brilliant teacher.......

I wonder where would you use this function in a real scenario either for an app or a game script...

Best course of DS i have ever seen <3

Thank you so much, this video clarified this topic for me!

694,694th viewer lol

My man.

Thanks a lot man!
u made it so easy to understand and simple!. GJ!

I Just hate how coding interview has become like competitive exam like C.A.T , where the problems for coding has significance
In real system design , and even though you know coding u cannot solve untill you practice like hell.

do you really need front = (front + 1) % n? because we would hit rear before we could loop into the circular array?

just A W E S O M E!

why is there +N in the previous position formulae , I am unable to think about it can someone help me out with it?

I'm really not sure what those arrows are indicating. Can someone clarify that for me?

Hey! Thank you for the video. It has helped me a lot with learning about queues and circular queue. Can you please show the code implementation of adding and removing from the back of the queue.

No thanks to you my friend

done!

Can Enqueue and Dequeue can take place simultaneously or not.

One of the best explanation in the world !! Crystal Clear explanation .Thank You !!

In circular array, if the array is empty shouldn't we set both front and rear is equal to -1?

I don't know how to thankyou for making concepts so easy and clear.. god bless you.

My print function:
void PRINT() {
int index = front;
//Have null check here.
printf (" My queue is : ");

do{
printf("%d \t", A[index]);
index++;
}while((rear+1)%MAX_SIZE != index);
printf("\n\n");
}

Great video explanation...BTW one correction I can think of in isFull() function where we should check if (rear + 1 == front) along with rear+ 1 == len(array) in a circular fashion

Thank you thank you THANK YOU! This is so simple and everything makes sense!

great content ..very very helpful...i am addicted to ur channel completed 42 videos of DS within 2 days..i..!!can someone plz suggest any channel for DBMS i am unable to find in this channel...

Nice 💯