What a brilliant teacher you are. Am completely zero in this subject. Just wanna observe the revision section (though it's not advisable before going through the subject topic videos as you have suggested) I was able to capture many key areas with these glimpse. I'll definitely go through the other videos for sure. Also it's a sweet surprise for me that, amidst of all the Hindi channels under this exam & topics, the one English channel of yours... Wov... We are really blessed to have this one. Thanks a lot. God bless you. Am interested to know about your private coaching for UGC NET Computer science. 🙏
For question no. 8 at @ 21:00, L2 can also be represented by CFG right? For the first a if I push two times p (p = n+m) in the stack, and then when b comes I pop one a for every b and then when a comes again I pop a again for each occurrence of a, then the stack would be empty at the end for the strings generated by the language. So I think option (3) should be the answer.
TOC Series: th-cam.com/play/PLfSaRwyMrokykQ_wSjT_-BeM1qxpV-GrL.html
Watch Rapid revision of other subjects playlist here CS Rapid Revision Series: th-cam.com/play/PLfSaRwyMrokwGzCBHpQSfSoA5dNxmPzdn.html
amazing ma'am!! all my small doubts were resolved! Thanks!
What a brilliant teacher you are. Am completely zero in this subject. Just wanna observe the revision section (though it's not advisable before going through the subject topic videos as you have suggested) I was able to capture many key areas with these glimpse. I'll definitely go through the other videos for sure. Also it's a sweet surprise for me that, amidst of all the Hindi channels under this exam & topics, the one English channel of yours... Wov... We are really blessed to have this one. Thanks a lot. God bless you.
Am interested to know about your private coaching for UGC NET Computer science. 🙏
Thank you. What's app me in 8697365460
Good explanation 👏 👍 mam😊
Thank u so much mam... Our revision will be incomplete without u...
Very helpful session mam.. thankyou so much for the video.. ♥️
Thank you ma'am looking forward for more such amazing rapid sessions before exam
Watch Rapid revision of other subjects playlist here CS Rapid Revision Series: th-cam.com/play/PLfSaRwyMrokwGzCBHpQSfSoA5dNxmPzdn.html
You are amazing.. ❤
Thank you so much mam. Now done TOC revision mam.
For question no. 8 at @ 21:00, L2 can also be represented by CFG right? For the first a if I push two times p (p = n+m) in the stack, and then when b comes I pop one a for every b and then when a comes again I pop a again for each occurrence of a, then the stack would be empty at the end for the strings generated by the language. So I think option (3) should be the answer.
thank maim ab aap continued rkho plz,,🙏🙏
Thanku so much mam its outstanding 😍
Thanku so much mam for this session
Mam plz conversion from DFA to NFA bhi karva
Thank you so much mam...
Thank you ma'am I have watched the entire playlist of rapid revision series,please post for dbms and discrete maths also ma'am,its a request
Yes I will
Thank u so much mam
Very nice mam
Thank you mam I am waiting for your class mam
Will start 9pm
Thank you mam