sir your teaching is excellent but plzz upload the example programs so that we score good marks and there will be no backlogs...as you know that theory part is not important for cs but the programs very important... plzz sir requesting you to help the students like me..... ]
Thank you so much sir 🙏🙏....these videos are really very useful.... 🙏 Sir one more request --can u make videos on " complexity and big 'o' notations "in Java... Plz sir....
i watch it at 2x ,moreover i love the fact that under 10-15 min i could grasp a topic of data str. ,all thanks to the sir who explains everything so easily
Great video as usually. But I have one doubt will you also be covering all topics which I've mentioned below Trees (Tree Traversals, Tree Operations, Binary Search Tree, AVL Tree), Hashing,Heaps (Max Heap, Min Heap, Heap Sort)2.7 Graphs (Representation of graphs, BFS, DFS), Skip List,Red-Black Trees,B Trees,B+ Trees, Splay Trees, Segment Trees,Binomial Heap, Fibonacci Heap, Tries, Ternary Search Tree, Disjoint Sets If so then thankyou in advance.
my sincere request to u is plss make a video of c program to find frequency of each element in a array and how to print unique elements in array.in net i am unable to understand the code.so pls it will be helpful for me
i have a doubt, if we delete elements from the queue, doesn't the capacity of the array reduce? since we can't add elements from front, only from rear. and rear is closer to size-1 after adding elements
Sir if we do it in for loop it would be more easy why to use functions? Also...generally elements will be displayed using arrays why to display elements in queue manner
Sir after deleting one element queue has one empty in that time if we want to insert an element then rare end is not empty what will be do in that time
My doubt is : Whenever we Dequeue an element and increasing Front pointer , we will be losing the spaces used by previous deleted element right. So we can directly use cyclic method of inserting elements with modulo operation? What i mean is whenever front is exceeding size-1 we can reassign them with modulo right?
Whenn Rear==front is equal we delete 40 wo only move front but in this condition rare is olso be moved??because last element delete. .so it may be rear-- I am from Pakistan
Sir, you should have removed the lines FRONT=REAR=-1 while performing DEQUEUE operation on the board as it is giving a wrong notion that initially we have set FRONT AND REAR value as -1.
Hi Actually after deleting the element we have to free the memory using free ( ) function. So we need not shift the elements. I forget to free the memory. Hope your doubt has been clarified
When i become an engineer I'll buy this man an air conditioner. He a real one 🙏🏻🔥💯.
😂😂
Me tooo👍
The best teacher of graphics!! you are also best on Datastructure and algorithm!! you deserve an appreciation, thanks and respect!!
The way you're working hard to provide us these kind of content is really worth appreciating. Thank you a lot Sir. Massive respect.
Good
Sir, you made people think i'm dull they don't know i have the best teacher behind the scene....thanks😇
unreal dedication for not using fans to avoid sound;
no doubt smooth explanation;
Awesome lecture sir. You take a lot of effort to teach. Writing points on board and explaining stuff in an easy manner.
my doubts were automatically disappeared once I watched your lectures sir. Thank you so much:)
Superb dedication in the intense heat!! Hats off to the teacher
Awesome explanation !!!
All concepts cleared !
Thank you so much sir im learning from your lectures and implementing it through javascript. What a legend you are love and respect ❤
Good explanation with simple English.....sir.,we are able to learn the subjects easily with u r videos..sir.....I heartfully thank you sir....🥰
No Words sir, clear cut explanation, thanks for this masterpiece !!!!!!
sir your teaching is excellent but plzz upload the example programs so that we score good marks and there will be no backlogs...as you know that theory part is not important for cs but the programs very important... plzz sir requesting you to help the students like me.....
]
Sir awesome Lecture.. But pls upload video on CIRCULAR QUEUE as well. Pls sir
itni garmi me bhi hardwork kr rhahe hai without the single fan
👋
any word will be less for you Sir.🙏🙏
the way of your teaching is so satisfying for us..❤💌
The best teacher I have ever seen really ❤😇
Thank you so much sir 🙏🙏....these videos are really very useful.... 🙏
Sir one more request --can u make videos on " complexity and big 'o' notations "in Java... Plz sir....
Awesome explanation. Helped me alot in clearing my doubts.
Guys watch on 1.25 speed it is perfect
so true
Ya ! but, I watch on 1.75
Ha
i watch it at 2x ,moreover i love the fact that under 10-15 min i could grasp a topic of data str. ,all thanks to the sir who explains everything so easily
U r the best teacher thank u sir ❤❤great explanation 😍
Awsome teaching sir easily uderstanding line by line thank you in my soul
All things are clear, greets from Turkey, Thnks Sir
hats off to ur hardwork sir...really appreciate the way u teach..
your really wow sir ,your dedication will never fail, i love this way you taught ; your really great
TQ sir meeru chala Baga cheptadu TQ so much sir 🙏🙏🙏🙏🙏🙏
Thank you soo much sir,Nice explanation and great effort in teaching.
Sir Your hardwork motivates every student to study hard
Great video as usually. But I have one doubt will you also be covering all topics which I've mentioned below
Trees (Tree Traversals, Tree Operations, Binary Search Tree, AVL Tree), Hashing,Heaps (Max Heap, Min Heap, Heap Sort)2.7 Graphs (Representation of graphs, BFS, DFS), Skip List,Red-Black Trees,B Trees,B+ Trees, Splay Trees, Segment Trees,Binomial Heap, Fibonacci Heap, Tries, Ternary Search Tree, Disjoint Sets
If so then thankyou in advance.
Hi
Sure I will upload till trees and graphs concept
@@sundeepsaradhi oh thank you very much
@@sundeepsaradhi sir make videos on ds using c++
ThanQ sir!!! Highly inspire with your teaching methodology & style💪👌👍
I like your hard work..... And I am gonna subscribe your channel in all my family members mobiles
Superb explanation sir. Tnq u. Really short and sweet explanation.
You are the best teacher ever sir
very very very very very very very very detailed explaination sir
Thank you so much sir . God blesses will be there for you ever
Very pleasant explanation sir.thank you so much sir🤗🤗
Sir your explanation is more useful to me sir please make video on hasing functions
Good explanation
tq sir for such good explanation
Hardcore respect for you sir!! Thanks a lot
salute to your great work, sir
You are the best teacher 💖
1:56 sir was wrong but corrected very soon might be due to speed .. but best class sir👍
amazing class sir. Thanks a lot
my sincere request to u is plss make a video of c program to find frequency of each element in a array and how to print unique elements in array.in net i am unable to understand the code.so pls it will be helpful for me
Laajawaab 👍👍😀
Poor guy is sweating to get his points through but he did a wonderful job explaining the concepts
Thank you sir, you clear my all doubt.please make video on web technology
Thank you sir.. Great teaching..
In dequeue () YOU have given rear==-1 it is wrong ,front==-1is correct
it is really helpful thank u sooooo much sir
Awesome class sir😍
Namaskar sir.. Very very good sir
Mind blowing extrodinary sir
Super explanation sir ❤️
Good explanation..sir..thank....u....
Massive respect.
Very nicely explained sir. Thank you
Thank u ☺️ sir I understand very well 😊
U deserve👏👏 gr8 work
Superb sir.. Very thank u
S
😳 😳
i have a doubt, if we delete elements from the queue, doesn't the capacity of the array reduce? since we can't add elements from front, only from rear. and rear is closer to size-1 after adding elements
Thank you sir.....
Super explanation
please make the circular Queue.. as well
You're just amazing 🙏😊😊
Super explainnation sir
Good explanation ...thank you sir
Bahut hard sir
Thank you sir. I understand very well
Thank you sir 🎉❤
Super sir
Sir if we do it in for loop it would be more easy why to use functions? Also...generally elements will be displayed using arrays why to display elements in queue manner
Loop will increase the time complexity however easy it might be but can't afford coslty implementation
Please correct the description to QUEUE as it has "STACKS IMPLEMENTATION USING ARRAYS
" .
Thank you
Done and Thanks for intimation.
Thank u sir , doing great job
Nice👍
Thank u sir💖
💯💯
all viver like and subscribe sir ke liye fan lena ahi
Fan causes disturbance in sound man.
AC is still fine
Sir after deleting one element queue has one empty in that time if we want to insert an element then rare end is not empty what will be do in that time
use circular queue
Why to take both front=-1 and rear=-1 in queue with array??
Thanks sir
Hello Sundeep, Is it possible to get notes for Data Structures?
Share your email
My doubt is : Whenever we Dequeue an element and increasing Front pointer , we will be losing the spaces used by previous deleted element right. So we can directly use cyclic method of inserting elements with modulo operation? What i mean is whenever front is exceeding size-1 we can reassign them with modulo right?
There can be further changes in the logic , then . But what am asking is correct, right?
@@shanmuganathanb7673 yes
Display ()
Is ok
But one dupt sir
F(........)👈what simpol sir
Love u sir
Whenn Rear==front is equal we delete 40 wo only move front but in this condition rare is olso be moved??because last element delete. .so it may be rear-- I am from Pakistan
Sir queues lo front and rear maname declare cheyyala??
Sir, you should have removed the lines FRONT=REAR=-1 while performing DEQUEUE operation on the board as it is giving a wrong notion that initially we have set FRONT AND REAR value as -1.
Sir,which book of DSA is best for 1st year student of mca...
Cant we do this by using for loop
Sir, someone says that"front didn't change from the zeroth location"
How to write program sir i could understand but cannot write program in my own
sir can you explain reverse of string using stack
Sir pl tell me ,to implement queue using stack
Few more examples plzz sir🙏🙏🙏
Sir circular queue is not there.please upload it sir .And double ended queue is also not there.
Sir, after deleting an element we have to shift elements know sir
Hi
Actually after deleting the element we have to free the memory using free ( ) function. So we need not shift the elements. I forget to free the memory.
Hope your doubt has been clarified
Super super super😅
Sir please explain programs .
Why front and rear intialise to -1