Circular Queue in Data Structure in Hindi | Circular Queue using Array
ฝัง
- เผยแพร่เมื่อ 14 ต.ค. 2024
- Master Data Structures & Algorithms for Top Tech Jobs: techvidvan.com...
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
Learn Data Structures and Algorithms in C: data-flair.tra...
📌 Website: data-flair.tra...
📌 Telegram: t.me/dataflair
📌 Twitter: / dataflairws
📌 LinkedIn: / dataflair-web-services...
📌 Instagram: / dataflair
📌 Facebook: / dataflairws
#comment #pythonprogramming #knowledgeispower #engineering #data
Get ready for top companies with our placement-ready DSA using C full course on TechVidvan: techvidvan.com/courses/dsa-c-hindi/?campaign=ytdsad&ref=1374
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
In case of any queries, please contact us on 8451097879 / info@techvidvan.com
Sir no one can beat your teaching style
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.💙💙💙
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.
Genuinely your teaching method are toooo good and easy to understand.❤
I was unable to understand this topic and you made it so simple now...Thank you so much sir 🙏
highly underated😶
Yupp
😊 finally I found a DSA best teacher......❤........
Thanks, keep learning with DataFlair.
Amazing explanation Sir❤❤
Really glad to have found this channel, have been really struggling with these concepts this semester , but now everything is clear🙏🙏
Glad to hear that, Just a small request: please help me in spreading this video with everyone.
Best explanation ❤
Sir please make more lectures 🙏🏻💛
Sir very nice explanation
Thank you ❤❤❤❤❤❤❤❤❤❤
Sir you are best teacher
❤❤❤❤❤❤❤❤❤
Everything push in mid in one time.
Thank you so much for your kind words! It means a lot to me that you enjoyed the DSA using C course video and found them helpful. Please help us in our Mission of Free Education - share these free courses with your friends.
Keep Learning with DataFlair.😊
best lec on youtube
Top class lectures sir❤
The way to comprehend sir ❤️ Absolutely amazing 😊😊😊
Thanks, keep learning with DataFlair.
amazing lectures
Ek din sir aapka videos sab baacha dekhe ga ..😅😅
Keep doing
beautifully explained
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
To get all the videos and become job ready, please join our placement-ready full course (link in description)
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
Which previous lecture you are talking about in this video
exactly im also unable to found
For complete course, please enroll in DSA placement ready full course on TechVidvan (link in description)
All the lectures are available in full course, please vist TechVidvan (link in description) and enroll now
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 ..🤔
yes bro it consist in 3rd position
you are great sir
Thanks, keep learning with DataFlair
Linear queue ke practical implementation vala video nahi mil Raha hai sir, kya kare. Specially source code?
it's available in DSA full course on TechVidvan (link in description)
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
Please try all the codes with your condition, like insert, delete, and display.
Sir really good 👍
highly underated
Thank you so much Sir!
sir please make a video on stack using linked list and double pointer
And queue using linked list and double pointer
such a great explanation ❣
We're thrilled you liked our content! Please help us in our Mission of Free Education - share these free courses with your friends. Knowledge is best when it's shared.
Keep Learning With DataFlair.😊
Maja aagya sir .nice lecture ❤
pr sir 2:30 pe rear side se delete kaise karenge ??? delete toh fromt side se hi hoga na
Sir if maxsize 9 hoga to ye logic kam karega sir
yes it is
sir if wwe find peek so whats is the logic
Sir C++ mai class aur object mai bhi bna do video pure oops ke concept. 🙆♂️
It's available in full course on TechVidvan (link in description)
kya smjhaya hai sir mja aa gya
Thank you for your kind words! We're passionate about making education accessible to all. If you've found value in our courses, please consider sharing them with others. Together, we can create a world where knowledge knows no bounds. 🌏📖
sir what if
i == rare; ??
Condition is not proper in that case.
sir in display function we also use
for(i=front; i!=rear+1; i=(i+1)%MAXSIZE)
Try it if it displays correctly with no issues.
How 3%10=3 it is 1 because modulus means remainder can u clarity my doubt
sir why you change your board
sir can you please explain this rear = (rear+1)%MZ in detail
Hello bro ....Your linear Queue Code is running is VS code ??
@@jauharansari3113 yess
Sir please make circular quene implementation of linked list please sir
We will start working on this topic in a couple of weeks. it'll be available on the portal shortly. Keep up the great work in your learning journey with DataFlair!
where is smart board sir. don't tell me you sell your smart board for us😢😢😢
%5d kyu hua ?
Due to five spaces
30:00
amazing lectures