this course is far better than code with harry dsa i can say that i have completed his whole playlist but the way you make us understand is great ... you are the goat for teaching dsa
mam...i think this is the best video that is available on youtube❤❤ you have explained the complete concept of deque using circular array (with implementation of all the operations in CODE) that too in such a simple way NOT at all an easy task
You should also cover some example programs (at least 1 or 2) after teaching any data structure related to it. It will be helpful to grasp the practical usage of data structures in a better way. Thanks 😊
Your channel really deserve more growth . The way you explain the things are pretty impressive and clear .I really appreciate your time and hard work .Thank you very much .
Ma'am, its such a bliss for me to have a complete course of DS in such splendid way. I m enjoying this course ,but it would be more satisfactory if it is complete. you told in video itself that u cover priority queue but i cant find it. plz post it ma'am .
Respected dear Jenny mam, Thank u so much for these DS tutorials. Today I have completed these basic linear data structures [Array, L.L., Stack & Queue]. You've explained each n every concept very nicely. Your teaching is very perfect. Academic teacher also not teaches as perfect as u even after taking much fees. Proud of u. Thankful & Well wishes from me. 😇🌹
i can say that for dsa this channel is the best .... i dont mean that u should not follow code with harry or anything like that .. but the content which you are providing at free of cost is far better than any paid course i can say that
what you think, understanding a single topic with your full mindset is easy but understanding a full book and retain its in memory is so difficult. that's the same thing she/mam do. she understand a single topic deeply collect information about that topic deeply from web,book etc and then compress it, make a 30+ min video, but she didn't known everything. she has knowledge only about this. teaching in a university is much difficult then this, every year repeating same thing...
@@Yogesh-bp4vv Knowledge is of no use in teaching field if one cannot properly impart it to students. In university/school also a teacher get a 40min lecture for which he/she can prepare before hand and compress the knowledge from various source and brush up their topics, so that they can explain the concept better in class. But, most of the teachers fails to do so, there are always some exceptions and those exceptions later become the favourite teacher for students.
@@Yogesh-bp4vv Then why should we pay lakhs together fees ?? The very primary task of any lecture is to make them students understand clearly .. in that case the jenny mam is an 100 % good lecture
Before watching this video d queue it was very toughest concept for me but after the watching of this video i got the concept totally. Thank you ma'am.u really deserves much growth 📈.
I am your big fan maam please i have created an algorithm for sorting please tell me its name. "*def sortt(list): n=len(list) for i in range(n-1): temp=list [i] if list[i]>list[i+1]: list[i]=list[i+1] list[i+1]=temp return print(list)"*
Mam you are really very great teacher. You taught everything about deque very well. Excellent and wonderful explanation in proper way. Thank you very much mam ⭐⭐⭐⭐⭐
Hey mam! You are doing great job mam. Mam, i am also currently teaching in the University as a visiting lecturer. Dear mam, can you share any good link related to Mcq’s for OS, CCNA, Ds, and DB. I have already pleaded that if you can?And mam your email please? I have been watching your channel since January ,2019.
Jitna accha padhati ho utini acchi khud bhi lagti ho wow deadly combination ........ lecture is good but ab mam ko dekhne ke chakkar me padhai ho ni ri kal exam hai.. kya karein
maam please prepare a video for priority queue pleaseeeeeeee......your classes are very very understandable.....there is no proper video class for priority queue.....
here f and r means front and rear so we can write f and r instead of front and rear is that true? i think im right becoz we never declared anything like front and rear in the program!!
Maam plz upload video on priority queue from last 1 year everyone is asking for it just because you teach soo good! But still you havent uploaded any video in addition you havent replied though about it . Will it come(y/n)?
as mam you say we are not using linear array as base data structure in deque because we can not able to use memory completely but mam is this only reason or if we are using linear array then once we start inserting data from front then we can not able to do insertion at rear
this course is far better than code with harry dsa i can say that i have completed his whole playlist but the way you make us understand is great ... you are the goat for teaching dsa
Bro both are best.. in terms of their purposes...
Bro when it matter dsa jenny mam but comes to programming harry bhai>>>>>>>>>> than any indian youtuber.
I have never ever seen some one else teaching the tough concepts of DSA in such a best way. You are doing very good thing for the humanity.
mam...i think this is the best video that is available on youtube❤❤
you have explained the complete concept of deque using circular array (with implementation of all the operations in CODE) that too in such a simple way
NOT at all an easy task
Even after 4 yrs, your channel is 👌🙏🙌💯✅
Mam when you will upload lecture on priority queue
for priority queue (explanation with code), you can checkout my channel, might be useful. :)
@@codewithdrv7521 ascending order priority queue using array hai aapke video mai?
You should also cover some example programs (at least 1 or 2) after teaching any data structure related to it. It will be helpful to grasp the practical usage of data structures in a better way. Thanks 😊
Your channel really deserve more growth . The way you explain the things are pretty impressive and clear .I really appreciate your time and hard work .Thank you very much .
I'm in love with these videos
Please release the next one
U haven't added priority queue in ur playlist
+1
I skipped the textbook topic for deck, hoping to find a way to learn it. This video turned to be that way. Best explanation!!Tysm ma'am! :)
Ma'am, its such a bliss for me to have a complete course of DS in such splendid way. I m enjoying this course ,but it would be more satisfactory if it is complete. you told in video itself that u cover priority queue but i cant find it. plz post it ma'am .
I don't think that anybody have any prblm if the video makes lengthy .
thank u its really useful
Way of explanation is very nice with easy english words, everyone can understand very easily... Keep rocking ma'am.....
What a great video indeed mam! Thank you so so so much mam :) Anyone who is looking for there concepts to get cleared, this video is the way to go!
Respected dear Jenny mam, Thank u so much for these DS tutorials. Today I have completed these basic linear data structures [Array, L.L., Stack & Queue]. You've explained each n every concept very nicely. Your teaching is very perfect. Academic teacher also not teaches as perfect as u even after taking much fees. Proud of u. Thankful & Well wishes from me. 😇🌹
i can say that for dsa this channel is the best .... i dont mean that u should not follow code with harry or anything like that .. but the content which you are providing at free of cost is far better than any paid course i can say that
When will u upload priority queue.
I don't know why I didn't get this type of teachers in my college. If she was my teacher I never ever going to miss my class
what you think, understanding a single topic with your full mindset is easy but understanding a full book and retain its in memory is so difficult. that's the same thing she/mam do. she understand a single topic deeply collect information about that topic deeply from web,book etc and then compress it, make a 30+ min video, but she didn't known everything. she has knowledge only about this. teaching in a university is much difficult then this, every year repeating same thing...
smart, and beautiful right
@@Yogesh-bp4vv Knowledge is of no use in teaching field if one cannot properly impart it to students.
In university/school also a teacher get a 40min lecture for which he/she can prepare before hand and compress the knowledge from various source
and brush up their topics, so that they can explain the concept better in class.
But, most of the teachers fails to do so, there are always some exceptions and those exceptions later become the favourite teacher for students.
@@sooryanshsingh2957 Yeah, exactly,...totally agreed.
@@Yogesh-bp4vv Then why should we pay lakhs together fees ?? The very primary task of any lecture is to make them students understand clearly .. in that case the jenny mam is an 100 % good lecture
Very well explained ma'am. You deserve much more likes and subscribers!
Before watching this video d queue it was very toughest concept for me but after the watching of this video i got the concept totally. Thank you ma'am.u really deserves much growth 📈.
No one:
Literally No one:
Le Me: Yaar ye kitni Awesome hai yaar 😆
Your videos are really very helpful mam. Keep up making this kind of videos
maam can you please make a video on priority queues
You the best teacher mam❤
Jenny you are the MVP !
Way of teaching ds is excellent..please do videos on complier design
Thanks for your appreciation words Margnas
Mam.. I'm from EEE. By watching ur videos on DS I helped my frnd to pass his exam who is from CSE
Thank you so much, you are the reason why I get to pass my data structures class
Very well explained mam..!!
Thanks..!!
This is not even my topic but sunkar atcha lagta hai ...
Gyaan jahase bhi mile lelo
I am your big fan maam please i have created an algorithm for sorting please tell me its name.
"*def sortt(list):
n=len(list)
for i in range(n-1):
temp=list [i]
if list[i]>list[i+1]:
list[i]=list[i+1]
list[i+1]=temp
return print(list)"*
sortt([3,1,2,6,4])
Mam what will happen in dequeuerear() if r is 0, but f is also 0? Will it go for the 2nd case or 3rd case?
Mam u r best teacher and best person also
Shouldn't their also be a condition if front = rear - 1 while checking whether the stack is full or not
BEST TEACHER I HAVE EVER SCENE and as well as best beautiful teacher as well
you are too good in terms of explanation Mam
Mam you are really very great teacher.
You taught everything about deque very well.
Excellent and wonderful explanation in proper way.
Thank you very much mam
⭐⭐⭐⭐⭐
Thanks for such a informative video. Please make videos on graphs also.
I wish my teacher teached the class like this instead of blindly reading powerpoints.
Thank you very much. You are a genius.
Mam plz priority queue as soon as possible exam are coming next week
Flawless Explanation 🙏🙏🙏🙏🙏🙏🙏🙏🙏
You Saved My A$$ .... I owe you one 👍
Nice explanation Ma'am
Thank you so much 💓💓
I was finding deque very tough but you made it very easy
Best Explanation Ever. Love from Pakistan
Thank you mam... it's been helpful for us
The condition of while loop in display function should be-
While(i !=rear+1)
Not rear
Right?
Yes, you're right, or better, it should be (rear+1)%N
So far best.
Ma'am please can you explain skip lists and self organising lists topic.?
Instead of (front=rear+1)||(f=0&&r=n-1)
We could just written (r+1)%n=f
yes
Mam.. prefer any book for DS...
Ur's lectures are very good mam... I understood very easily all the concepts..
So nice of u thanks for the lecture
mam you teach all corner cases soo well that coder will never forget any corners while coding thanks and I cant believe i am watching this for free.
Mam when will u upload priority queues??
Please upload it mam as soon as possible...
brother, there is an explanation video with code for the implementation of priority queue (using linked list), on my channel, might be helpful:)
Really wonderful explanation. Thank you very much for this video.
Ma'am wat an amazing explanation !! You are the besttttt .
Thank you so much
Hey mam! You are doing great job mam. Mam, i am also currently teaching in the University as a visiting lecturer. Dear mam, can you share any good link related to Mcq’s for OS, CCNA, Ds, and DB. I have already pleaded that if you can?And mam your email please? I have been watching your channel since January ,2019.
Crystal clear explanation , thankyou Ma'am
Literally exam saver preparation 🙌 🙏 thank you ma'am
bestest teacher💯
Jitna accha padhati ho utini acchi khud bhi lagti ho wow deadly combination ........ lecture is good but ab mam ko dekhne ke chakkar me padhai ho ni ri kal exam hai.. kya karein
maam please prepare a video for priority queue pleaseeeeeeee......your classes are very very understandable.....there is no proper video class for priority queue.....
mam, priority queue ni dala aapne?
and ye circular array se kr rhi ho
doubly linked list se v kr skte hai na
wo jyada easy pdega
Nice explanation mam ❤
mam, please make some videos on backtracking..........i found this topic very difficult
Thank you, Mam for this wonderful lecture. I tried writing a Deque ADT (Python 3) using circular array using the concepts you taught. Let me know your feedback :)
Chief features
---------------------
1. Clean code, I have written simple functions for checking if queue is full, single element is present in array and so on
2. Tried to keep it DRY - short single focused methods.
3. Code appears like reading a prose. When you read a function top-down, you understand the flow
4. Private methods at the bottom and grouped together.
class Deque:
def __init__(self, initial_capacity=5):
self._front = -1
self._rear = -1
self._data = [None] * initial_capacity
self._size = 0
def enqueue_front(self, element):
if self.is_empty():
self._front = self._rear = 0
self._set_element_at_position(self._front, element)
elif self.is_full():
raise Exception("Queue is full")
elif self._does_front_point_at_first_element():
self._front = len(self._data) - 1
self._set_element_at_position(self._front, element)
else:
self._front -= 1
self._set_element_at_position(self._front, element)
self._increment_size()
def enqueue_rear(self, element):
if self.is_empty():
self._front = self._rear = 0
self._set_element_at_position(self._rear, element)
elif self.is_full():
raise Exception("Queue is full")
elif self._does_rear_point_at_last_element():
self._rear = 0
self._set_element_at_position(self._rear, element)
else:
self._rear += 1
self._set_element_at_position(self._rear, element)
self._increment_size()
def _set_element_at_position(self, position, element):
self._data[position] = element
def is_empty(self):
return self._size == 0
def is_full(self):
return self._size == len(self._data)
def print_queue(self):
if self.is_empty():
raise Exception("Queue is empty")
print(self._data)
def dequeue_front(self):
data = None
if self.is_empty():
raise Exception("Queue is empty")
elif self._is_single_element_left():
data = self._delete_element_at_position(self._front)
self._make_front_and_rear_point_to_same_element()
self._decrement_size()
elif self._does_front_point_to_last_element():
data = self._delete_element_at_position(self._front)
self._front = 0
self._decrement_size()
else:
data = self._delete_element_at_position(self._front)
self._front += 1
self._decrement_size()
return data
def dequeue_rear(self):
data = None
if self.is_empty():
raise Exception("Queue is empty")
elif self._is_single_element_left():
data = self._delete_element_at_position(self._rear)
self._make_front_and_rear_point_to_same_element()
self._decrement_size()
elif self._does_rear_point_to_first_element():
data = self._delete_element_at_position(self._rear)
self._rear = len(self._data) - 1
self._decrement_size()
else:
data = self._delete_element_at_position(self._rear)
self._rear -= 1
self._decrement_size()
return data
def _is_single_element_left(self):
return self._front == self._rear
def _make_front_and_rear_point_to_same_element(self):
self._front = self._rear = -1
def _delete_element_at_position(self, position):
data = self._data[position]
self._data[position] = None
return data
def _increment_size(self):
self._size += 1
def _decrement_size(self):
self._size -= 1
def _does_front_point_to_last_element(self):
return self._front == len(self._data) - 1
def _does_rear_point_to_first_element(self):
return self._rear == 0
def _does_rear_point_at_last_element(self):
return self._rear == len(self._data) - 1
def _does_front_point_at_first_element(self):
return self._front == 0
deque = Deque()
deque.enqueue_front(2)
deque.print_queue()
deque.enqueue_front(4)
deque.print_queue()
deque.enqueue_rear(6)
deque.print_queue()
deque.enqueue_rear(8)
deque.print_queue()
deque.enqueue_front(10)
deque.print_queue()
print(deque.dequeue_front())
deque.print_queue()
print(deque.dequeue_front())
deque.print_queue()
print(deque.dequeue_rear())
deque.print_queue()
print(deque.dequeue_rear())
deque.print_queue()
print(deque.dequeue_rear())
Very amazing explanation mam...thank you very very much mam.
here f and r means front and rear
so we can write f and r instead of front and rear is that true?
i think im right becoz we never declared anything like front and rear in the program!!
instead of taking 2 else for insertion, can't we just one else in which we take front=(front-1)%N ??
that will satisfy both if else and else part?..
Awesome Explanation !!
Also on priority queue.....
very nicely and properly explained.
I like your lectures
Maam plz upload video on priority queue from last 1 year everyone is asking for it just because you teach soo good! But still you havent uploaded any video in addition you havent replied though about it .
Will it come(y/n)?
Mam why u don't make videos on priority queue ???
nice video mam looking forward for more.....❤️
Is like insert(right)
Insert(left)
Delete(right)
Delete(left)
?
mam at the time of void enqueueRear , the final else condition is not much accurate, since it given as r++, why there is no r- -?
For increment :- Rear = (Rear + 1)%N
For decrement :- Front =(Front + N - 1)%N
are you referring to adding a front element to a queue and adding a rear element to a queue. also what is N. is that the for example "array.length".
Thanks for your free videos and excellent explanation.
Best teacher 🎉🎉
display function is wrong
thank you so much mam i can easily understand
as mam you say we are not using linear array as base data structure in deque because we can not able to use memory completely but mam is this only reason or if we are using linear array then once we start inserting data from front then we can not able to do insertion at rear
Excellent teacher !!!!! Keep on the good work !!!
Thanks, really useful video lecture
*Greater than winning is never giving up*
Very good 👍 explanation
Very good explanation!
good job
Thank you mam you helping me a lot
Thank you soo much mam 🔥🔥🔥
Great lesson!
excellent video. one of the best explanation for a complex topic.
Madam in enquerear operation if front is at 0 and rear at size -1 . Is it working madam
Amazing explanation.
mam thanks for ol this, but mam plz make complete videos on priority-queues bahut imp topic hai yeh bhi.......
there is a explanation video with code for the implementation of priority queue (using linked list), on my channel, might be helpful:)
❤
mam have u taught priority queue? if yes then plz give me the link.....thank u :)