For two months i have been trying to understand these concepts of data structure but failed every time my mid exams are coming right after two weeks and now i am here and completely got all these concepts thank you Mam i really appreciate your effort. In return i liked your videos and subscribed to your channel please continue your work for public welfare Thank you.
@abhiavasthi6244 жыл бұрын
the unsorted array trick was genius, thank you ma'am.
@piyushkumar-jw8eb4 жыл бұрын
her content are way more complete and updated than other channels.
@wardoonacademy4 жыл бұрын
Madam, I am from Somalia, as an IT student you helped me alot, the way you explain is super easy to understand, I am sure you have a deep knowledge of what you are Teaching and you know how to Teach. the way you explain is better than the way my University Teachers explain. LOVE AND RESPECT FROM SOMALIA. THANK YOU SO MUCH. keep on that Good work.
@anonymouussssss Жыл бұрын
No sponser, no request for like & subscribe ❤ True dedication ❣️🙏🙏
@nibinaugustin2 жыл бұрын
Correction in program. In the if else part the for loop condition should be. for(i=0;i
@AnuragRawat01 Жыл бұрын
Broo it's not right Just make a dry run then you'll understand
@justcurious1940 Жыл бұрын
@@AnuragRawat01 last element is not omitted because : a[i] = a[i+1] ----> a[i+1] is the last element .
@rohithbollu836 ай бұрын
her content are way more complete and updated than other c
@ShubhamSingh-cd1jf4 жыл бұрын
Mam , thank you so much for this playlist . We have no good faculties in my college of DATA STRUCTURES 🙏🙏🙏
@mukulverma9966 Жыл бұрын
thank you very much for creating this master piece this will help to years to years many students to learn DS, everyone's thinks ds is complicated it is very hard to learn DS but you make it easy ,,,, your teaching way is very good . keep doing ma'am :)
@rashmikadeshan2710 Жыл бұрын
Thank you so much for your great teaching. Your explanation was very clear. I didn't have any idea of removing items from array.but after watching your video.i got a clear understanding of it.keep up the good work.
@justcurious1940 Жыл бұрын
Thanks, so clear and easy to follow here is a version of the code using dynamic memory allocation : void delete(int *array, int *size,int pos){ for(int i = pos-1 ; i < *size-1 ; i++){ array[i] = array[i+1]; } --(*size); array = realloc(array,*size); } int main (int argc , char *argv[]) { int size ; printf("Enter the size of the array : "); scanf("%d",&size); int *array = malloc(sizeof(int)*size); printf("Enter the elements of the array : "); for(int i = 0 ; i < size ; i++){ scanf("%d",&array[i]); } int pos; printf("Enter the position of the element that u want to delete : "); scanf("%d",&pos); delete(array,&size,pos); for(int i = 0 ; i < size ; i++) printf("%d\t",array[i]); free(array); return 0 ; }
@mdmainulhassan035 жыл бұрын
mam mein apko 1 saal see follow kar raha Hoon......aap bohut great Hai mam ....apke video se bohut madat hothi hai
@JennyslecturesCSIT5 жыл бұрын
happy to hear that.. :)
@tasteyourlappy Жыл бұрын
You are a gifted one, few only can be good speaker..and the audience understand everything...thank you so much di
@kcalls49924 жыл бұрын
The best explanation ever 👏👏
@cgi75433 жыл бұрын
I am addicted to your channel
@Annieswarna6 ай бұрын
I cannot explain how much relief i got ...learning from your videos i respect your effort mam and thank you so much❤
@PROTECHRAHUL4 жыл бұрын
Beauty with brain 😅 Your teaching makes me feel like I m an intelligent student😅
@amanprajapati34174 жыл бұрын
Me 2
@Ihavetoreturnsomevideotapes4 жыл бұрын
simp
@HariPrasad-ox5ri4 жыл бұрын
simp
@bscit42194 жыл бұрын
Simp
@LazerEyeX_X3 жыл бұрын
Simp
@amanprajapati34174 жыл бұрын
After seeing your last video I am able to apply deletion operation by myself Thank u mam🤗🔥
@vgk-lm8vl Жыл бұрын
first thanku so much mam for this series And My code logic is: int a[30],pos,size; printf("enter the size of the array "); scanf("%d",&size); printf("Enter the element of array "); for(int i=0;i
@smileplease23494 жыл бұрын
Excellent course, very well explained and really simple.
@Muhammedfahadkp1 Жыл бұрын
You are The best University ever I had
@lubuzlife5 жыл бұрын
Mam kindly aap automata and compiler design subjects ka v video share karna..bohot hi patience k sathe and clearly aap topic ko explain karte hain..aur v videos share kijiyega mam plz..
@reemjanina4542 жыл бұрын
Your explaniation is super clear I am realy happy that this my first time I can understand data structure
@MrSundramRay Жыл бұрын
REALLY HELPFUL MAAM WITH COMPLETE BASIC DETAILS🙏
@xyz-pc3tl3 жыл бұрын
🙏🙏🙏Thanks a lot sir🙏🙏🙏 Your videos are so helpful and useful during my university , I can't understand in online lecture and I don't attend it but I see Your all videos to study and I pass with good marks in my sem 3 university exam which is offline its because Your youtube channel and your extraaudinary teaching . Thanks a lot for making this videos and giving precious time us. -Thanks a lot -God bless you ..sir -I don't have words to express thankfullness to you Your youtube channel is an individual university. Thanks a lot for helping us 🙏🙏🙏🙏🙏
@subratakundu26103 жыл бұрын
Thanks ma'am for giving this type of lecture.
@manojrajput99303 жыл бұрын
Thank you dany mam i AM finaly understand traversal, insertion and deletion in array by ur videos💥🎯💣
@mitwamodi54203 жыл бұрын
I got an incredible teacher on teacher's day...😊✨
@preetamgiri1556 Жыл бұрын
I can't explain how much it helped me thank you so much mam for such an easy explanation
@youms2374 жыл бұрын
This teacher is very good. Thank you Madam.
@shinebaka56964 жыл бұрын
First 4 minutes was enough ty lady
@srilekhaviswanatha334 жыл бұрын
Please make some videos on STL for cpp codes in data structures. It will be very helpful for me. Thank you so much ma'am. Your lectures are very easy to understand and to gain confidence.
@thrilltrekdocumentariesАй бұрын
if(pos size - 1) but you wrote if(pos size ) beacause we are dealing with indexes not position or size so we can delete from zeroth location and cannot delete from 5th location which you wrote size.it should be size - 1 &
@kamatchib5530 Жыл бұрын
Excellent crystal clear teaching
@Rifat-nj3nl Жыл бұрын
I love you mam ❤❤ আপনাকে অনেক ভালো লাগে তাই আপনার ক্লাস করি ❤ Love you so much ❤
@computerknowledge41483 жыл бұрын
Very good to see you. You are a best programing person.
@indiascars5702 жыл бұрын
thanks mam Ab jaake samaj aayi saari working👍👍😀😀
@someoneyouIoved2 ай бұрын
thank you, you are a great TEACHER
@saurabhdubey47003 жыл бұрын
one word for you... Thank you..
@blobhit24713 жыл бұрын
bruh that's two words, no offence. lol
@mohanraj-zp3kc4 жыл бұрын
Thanks a lot mam love from Pondicherry ♥️♥️♥️
@stakidlyrics86913 жыл бұрын
Best lecture ever for begginners like us
@dikshapandey27054 жыл бұрын
You are still my sunshine..thanku mam...you are amazing🤩🤩🤩♥️
@bongboy55043 жыл бұрын
Didi your teaching is just wow. Love u didi
@harshitachaurasia12464 жыл бұрын
Thanks a lot ma'am for all your efforts i can think logically now
@rajprajapati76974 жыл бұрын
Mam, you are teaching so nicely.
@AbdulSalam-de1ew3 жыл бұрын
Asalam Alikom. Thank you mam. Your very w'll explain .From Pakistan
@neerajKumar-fi7su4 жыл бұрын
Best Teacher ever
@ayshariya92376 ай бұрын
Mam, u r a gem😭💙💯
@jaxverma62044 жыл бұрын
Your voice is mind blowing 😍😍♥️♥️
@vivek-rathod4 жыл бұрын
Awesome explanation on array Awesome teacher Thank you mam Very very thank you Please complete DBMS series and make series of all GATE subjects please please Mam I want to learn all subject from you only cause your explanations are wonderful Thank you mam once again
@naveenar51582 жыл бұрын
Mam ...in the previous video u took size as 5 so that the index is 4...now in for loop u took size as 4( which is the index.)..if we take size as 5...then the for loop condition will change as size-2..is that so?
@shivaarjun7202 жыл бұрын
your way of teaching is awsome mam but pls upload notes for dsa mam.
@CodeFlects2 ай бұрын
At 09:35 a[3] is only assigned the value of a[4] .I might be wrong on this but is it true that a[4] still contains that value? 5
@lifemalayalamyoutube71924 ай бұрын
Thank you jenny🥰God bless you🙏🏾
@karanshankar67055 жыл бұрын
Jenny Can you upload videos of core Java concepts for beginners (like me who don’t know abt computer science bt trying to learn)starting with basics. Eg: what is Class , object etc
@denisonshinglai Жыл бұрын
very well teaches, i have no doubt at all
@re-animating4 жыл бұрын
mam your lecture is too gudd....but inlast u say gud by and takecare is nice..
@MySirGee3 жыл бұрын
Thank mam, very helpful and easy to understand concepts. cout
@sarveshrs232 ай бұрын
Understandable 👍
@ashutoshpatel50304 жыл бұрын
Thank u Jenny mam , your videos are very helpful and easy to understand concepts ❤️❤️
@anitsharma99502 ай бұрын
but how we will move value of last element of array
@usamamukhtar25674 жыл бұрын
Thnx ma'am very Good method of teaching
@rumiNITPatna3 ай бұрын
thank u mam for such a wonderful video!
@kamatchib5530 Жыл бұрын
Excellent teaching mam
@prithvini044 жыл бұрын
Jenny, please do videos on some leetCode problem solving. Please explain Median of two sorted arrays
@csSasitharans2 жыл бұрын
i love your teaching
@chandrasekhar58583 жыл бұрын
finally, you smile at the end of video :):):)
@moni64682 жыл бұрын
one video on how to find time complexity pls mam
@fahhasan4 жыл бұрын
excellent.....great skills for Explanation
@shajithvk70524 жыл бұрын
Madam, your class is awesome, could you take c++ class
@kathiravan67793 жыл бұрын
Great effort, Good teaching.
@AISHWARIAROYSNIGDHA4 жыл бұрын
Very helpful video,thank you ma'am.
@adreesmughaladreesmughal38765 жыл бұрын
Mam thanks for this informative lecture ..... when u will make video on tree sort ... plz mam .....❤❤❤❤
@JennyslecturesCSIT5 жыл бұрын
Bcoz of my busy schedule, I am not getting so much time nowadays.. but will try to upload it asap.. :)
@adreesmughaladreesmughal38765 жыл бұрын
Ok mam thanks..... mam 1 more thing .... heap sort me heapify tou ho jata hai but deletion me problem hota hai...plz agr ap bta skein tou...boht acha hoga..plz mam
@anju73342 жыл бұрын
Had mam completed the topics of asymptotic notations, best case and worst case and time complexity??
@Isha75585 жыл бұрын
So helpful mam tqsm 🤩
@Isha75585 жыл бұрын
🤗
@twinklelight98292 жыл бұрын
Here I go...i found an army ....I'm soo happy that I'm not alone💜💜💜💜💜💜💜💜💜
@asifiqbalsekh3 жыл бұрын
Thanks Mam.. I love you mam....Superb Lecture...!
@sanjujacob38884 жыл бұрын
Mam u have forgotten to declare " i " variable at the start. But ur lectures are so understandable, thank you....
@pkart84512 жыл бұрын
4:15, how we delete And ,size -1 Reduce the size of array Is last , 5 consume storage?
@sunilverma-ry8yn4 жыл бұрын
Why you have taken increment of (i) on 8:19? It should be decrement?
@srijanajain77169 ай бұрын
great explanation ma'am but in the for(i= pos-1 ; i< size -1 ; i++) here the condition should be ( i < size ) as the code will automatically go uptill size -1 because we haven't added (
@bigk23677 ай бұрын
If the size is 5 then loop will go until 4 but we don't want to go till 4, we just have to go till 3 and that's why we should write size-1 in for loop.
@CodeFlects2 ай бұрын
You're wrong on this unfortunate because we want to traverse till 2nd last index.and if size is 5 last index is 4 and 2nd last index is 3 so (3
@samarthgupta51324 жыл бұрын
niceely explained mam
@anupkb225 жыл бұрын
You're the Best.
@anju73342 жыл бұрын
Mam kindly make videos on time complexity , binary and linear search , notations( theta(1), big O (1) )and worst and best time in DS🙏🙏🙏 It's a humble request mam
@kirtikhohal50253 жыл бұрын
We can use the same for loop for all the three conditions in deletion as well as in insertion....
@Akash-s6q8hАй бұрын
nice explanation mam
@thebeast_3 жыл бұрын
mam in this we didnt deleted the data from the last position , we just shifted and then only printing out size - - array. How can we actually vacant that memory ? edited: just put arr[size-1]={ }; this will put a space and an array cant have space so system will put no value and you dont neeed to decrease the size of the array
@sm-op9zg3 жыл бұрын
Waahh...!! Thnx..
@gayatripatidar91362 жыл бұрын
but still in place of a[size-1] ele are present that mean 0 (zero) are there and array does not free the memory so their is also no mean to initialize zero to last index
@anju73342 жыл бұрын
Had mam completed the topics of asymptotic notations, best case and worst case and time complexity??
@mampisarkar13 жыл бұрын
Very good explanation
@atharvaboarde62713 жыл бұрын
thank you for helping us for free mam :)
@zaidmemon26734 жыл бұрын
Didi please make entire playlist for digital fundamentals too
@yatinsingh13314 жыл бұрын
Fabulous video ma'am......
@AbrarMalik-y5sАй бұрын
Madam ye india hai yaha 80 percent logo ko Hindi samaj mei ati hai
@thecloudterminal2 жыл бұрын
Thank you for this lecture mam 🙏
@abhishekkumar-bj6cd4 жыл бұрын
Great explanation
@subhadipmondal37673 жыл бұрын
in the for loop when i=pos the code is properly run... thank you ma'am...
@usamamukhtar25674 жыл бұрын
Alhamdullah I clearly understood the topics
@VinodThakur-i4i5 жыл бұрын
Thanks mam 😊
@amanavengeraman5 жыл бұрын
mam when i am using (i=pos-1; i
@sunilverma-ry8yn4 жыл бұрын
Why we are using increment on (i) why not decrement?
@crickballer9391 Жыл бұрын
i have data structures in my mids, but without coding, i dont need the coding either, any suggestions on how i can watch your amazing videos??
@gargaarohi4 жыл бұрын
Ma'am your are best
@vishalpatel50104 жыл бұрын
6:45 if(pos>=0 || pos < size) if i m not wrong?
@rishabhmthakur24 жыл бұрын
She is marking the negative scenario with the if statement. Position can only >=1 and
@arhmarehman22484 жыл бұрын
What will be the algorithm for sorted array? That shifting array guarantees that in the end we'll get sorted array?