Circular Queue in Data Structure in Hindi | Circular Queue using Array

preview_player
Показать описание

This video covers:
1. What is Circular Queue
2. How Circular Queue solves the problem associated with Linear Queue
3. How to insert elements in Circular Queue
4. How to delete elements from Circular Queue
5. How to move rear and front in Circular Queue

#comment #pythonprogramming #knowledgeispower #engineering #data
Рекомендации по теме
Комментарии
Автор


Apart from structured learning, you will get:
- Study Material
- Notes
- Practical Codes
- Quizzes & Tests
- Interview Questions
- Real-time Projects
- Videos in Sequential Order
- Video Playlist
- Roadmap to get job
- Job updates
- Industry-recognized Certificate

DataFlairHindi
Автор

Sir no one can beat your teaching style

vikas
Автор

hope this underrated channel gets reach it deserves. thank you so much sir. i rarely comment on any video but your way teaching and clearing doubts encouraged me to comment and appreciate.💙💙💙

_studywithme_
Автор

after watching multiple videos of other creators, i got to understand the topic by you only, teaching in such a detailed way is most appreciable.

raghavrajgupta
Автор

Genuinely your teaching method are toooo good and easy to understand.❤

Rohitt_-rd
Автор

I was unable to understand this topic and you made it so simple now...Thank you so much sir 🙏

Anima_Pandey
Автор

kya baat hai sir great teacher ....no one beat you sir

MdMahfoozSheikh
Автор

Amazing explanation Sir❤❤
Really glad to have found this channel, have been really struggling with these concepts this semester , but now everything is clear🙏🙏

jaiveersinghsahni
Автор

Sir you are best teacher
❤❤❤❤❤❤❤❤❤
Everything push in mid in one time.

ayushsharma
Автор

The way to comprehend sir ❤️ Absolutely amazing 😊😊😊

shubhampandey
Автор

Sir very nice explanation
Thank you ❤❤❤❤❤❤❤❤❤❤

singmanassingh
Автор

Ek din sir aapka videos sab baacha dekhe ga ..😅😅
Keep doing

cosmic
Автор

what more can I say? But Thank you sir for explaining this in a very simple way.

ErenYeager-nzrx
Автор

sir i have a doubt in 28:11 how the queue become overflow the front==-1 can u explain ..
by the way u have can teach me better than my university lecturers

editz
Автор

Sir jo apne kaha dubara inser karne ki 0th element p new element overwrite karne ka vo to bas jab rear =9 mean hoga tabhi 0th element m over write hoga agr ham bas 2th position tk element bharte h or fir delete karte h besak 0th element hi hatega par jab ham new element insert karnege to vo 3th position par aiga na ki 0th position par overwrite hoga ..🤔

shorts__live
Автор

Sir if we use initially front and rear 0 in insert function then there is no need of checking (front ==-1&&rear==-1)
front =0
rear=0

Rajeev_Sanatani
Автор

Which previous lecture you are talking about in this video

satyajeetmahto
Автор

sir please make a video on stack using linked list and double pointer
And queue using linked list and double pointer

PriyaRathore-iq
Автор

Sir, where is the last video link... it is not in the playlist. I watched the linear queue implementation using c and after that I got this video. Can you please share the last video link . Thanks

technicalindies
Автор

Linear queue ke practical implementation vala video nahi mil Raha hai sir, kya kare. Specially source code?

sppeace