hi Sis,these are really worth videos thanks a lot for sharing the content . Guys who are reading the comment and really want to learn Data Strucures in Python,here is the Amulya Sis who always explained in a laymen terminology so that everyone understands. And one small request guys, since this sister is doing this much for us,pls donot skip the adds,just watch fully ,pls donot skip, so that our sister will get the income. This is the least way we can help her. Thanks SIS
Maam it's a humble request to uplod all the Data structure videos in Python as soon as possible Because your way of teaching helps in better understanding of the topic
Hey amulya one request, please upload data structures in python completely as soon as possible, i mean please upload this whole course as soon as possible, your videos are awesome!!! Thank you
Great video! Just a couple of questions. The .pop(n) and .insert() operations both have a complexity of O(n), don't they? Would you say that this is an accurate implementation of a queue, since enqueueing and dequeueing must happen in constant time (O(1))?
@@AmulsAcademymy program has an error, can i ask some help?i will really appreciate it how to do this one , Write a python program that uses queue to store data inputted by the user that satisfies the conditions below: • Whenever a name is inputted, the name is stored in the queue. • Whenever an asterisk (*) is inputted, the element pointed by front/head is displayed. • Whenever a number is inputted, the program terminates.
here's my code many errors need help to correct it queue=[] queue.append(str) def enqueue(): element=input ("Enter a name:") print(element, "is added to queue") enqueue() while True:
data =input ("Enter an element:")
if str.lower(data) == element: print(element," is added to queue")
First take input using eval() my_input = eval(input()) It allow us to take Any type of input. Then check input type, if it is name then add that to queue. If it is * then pop the output If it is number then stop the program 😊
queue=[] def enqueue(): element=input('please enter the element') queue.append(element) print('append element is ',element) def dequeue(): if not queue: print('list is empty') else: e=queue.pop(0) print('remove element is : ',e) def display(): print(queue) while True: print('please select the option 1.add 2.remove 3.display 4.Quit') choice = int(input()) if choice ==1: enqueue() elif choice ==2: dequeue() elif choice ==3: display() elif choice ==4: break else: print('please enter the correct operation')
Mam plz make videos on stack implementation using queues, queue implementation using stack ,reversing the stacknd queue,which is the largest ele in stack nd queue ..... asap
Ma'am please small help ma'am , please make a video implementation of stacks and queues using linked list this is big topic for us please ma'am do it as fast as possible
it wold have been better if u had explained stack and queue without using built in functions....this way of implementing stack n queue may be easy but its of no use
These are to know the concepts. You should implement in real time with you ideas. Altough everyone cant learn by reading books, example guys like me lol.
Great video! Just a couple of questions. The .pop(n) and .insert() operations both have a complexity of O(n), don't they? Would you say that this is an accurate implementation of a queue, since enqueueing and dequeueing must happen in constant time (O(1))?
well these types of implimentation are based on principals, Lifo or Fifo is the defining point for stack and queue as of now as we have implimented using list
hi Sis,these are really worth videos thanks a lot for sharing the content .
Guys who are reading the comment and really want to learn Data Strucures in Python,here is the Amulya Sis who always explained in a laymen terminology so that everyone understands.
And one small request guys, since this sister is doing this much for us,pls donot skip the adds,just watch fully ,pls donot skip, so that our sister will get the income. This is the least way we can help her.
Thanks SIS
Great series, I love the way you say check as "chuck".
One thing I am missing here is about Time complexity concept, its very necessary in DSA. Please add that also Mam Thanks
Its just Data Structure course mate, Algorithms are not included in it. Time Complexity comes under Algorithms!😄
such a good simplistic good which makes us understand the whole concept without difficulty....Thanks a lot mam
Maam it's a humble request to uplod all the Data structure videos in Python as soon as possible
Because your way of teaching helps in better understanding of the topic
I will try :)
Hey amulya one request, please upload data structures in python completely as soon as possible, i mean please upload this whole course as soon as possible, your videos are awesome!!! Thank you
Will try :)
@@AmulsAcademy please mam please try much awaited video data structure using python
Thank you so much for this turotial. It is very helpful for my A level CS.
Thank you for such a amazing teaching methods....
Love your voice..
Thank you :)
Ma'am please bring all data structures like linked list tress bst and further algorithms like dynamic prgm djstra etc..it would be lovely
yes
Will try :)
Yeah mam .....
Yes
You are absolutely making data structures to learn easily
Thank you 😊
Method of teaching is pretty good
Thank you 😊
thanks mate. you just earned a new subscriber. Always keep up a good work
We can use pop the element by reverse the queue list and pop up element. I think this is third method to follow the fifo rule
Great video! Just a couple of questions. The .pop(n) and .insert() operations both have a complexity of O(n), don't they? Would you say that this is an accurate implementation of a queue, since enqueueing and dequeueing must happen in constant time (O(1))?
To achieve O(1) for both insert and delete, you need to use linked list.
Use doubly linked list for O(1) deletion and insertion is O(1) for both singly and doubly linked list
Proper solution is using either a circulary array or a doubly linked list
Nice......effective explaination
Thanks a lot :)
thank mam,
plz upload more videos on python
quickly
Sure I will :)
Thank you so much, just one quick question, how can i put size of the queue?
Great explanation
love this video , Can i ask some help about Writing a python program that uses queue to store data inputted by the
user
Thank you 😊
Here we are using list to implement queue, so you want to use list in your program ?
@@AmulsAcademymy program has an error, can i ask some help?i will really appreciate it
how to do this one , Write a python program that uses queue to store data inputted by the
user that satisfies the conditions below:
• Whenever a name is inputted, the name is stored in the queue.
• Whenever an asterisk (*) is inputted, the element pointed by
front/head is displayed.
• Whenever a number is inputted, the program terminates.
here's my code
many errors
need help to correct it
queue=[]
queue.append(str)
def enqueue():
element=input ("Enter a name:")
print(element, "is added to queue")
enqueue()
while True:
data =input ("Enter an element:")
if str.lower(data) == element:
print(element," is added to queue")
elif str.lower(data) == chr:
print(element)
elif str.lower(data) == int:
break
else:
print('done')
First take input using eval()
my_input = eval(input())
It allow us to take Any type of input.
Then check input type, if it is name then add that to queue.
If it is * then pop the output
If it is number then stop the program 😊
popleft is also possible for Dequeue
Please upload more frequently
I will try :)
Thank you so much! you made this easy!
Glad to hear that :)
queue=[]
def enqueue():
element=input('please enter the element')
queue.append(element)
print('append element is ',element)
def dequeue():
if not queue:
print('list is empty')
else:
e=queue.pop(0)
print('remove element is : ',e)
def display():
print(queue)
while True:
print('please select the option 1.add 2.remove 3.display 4.Quit')
choice = int(input())
if choice ==1:
enqueue()
elif choice ==2:
dequeue()
elif choice ==3:
display()
elif choice ==4:
break
else:
print('please enter the correct operation')
can you do circular queue using list
I hope you're my prof.
Just remember - An element is removed in the same order as it is inserted.
linked list and tree and graphs? after completing queue🙏
Yes :)
@@AmulsAcademy Thanks a lot.. 🙏
mam superb mam, thanks a lot
thank u for making so easy
Mam plz make videos on stack implementation using queues, queue implementation using stack ,reversing the stacknd queue,which is the largest ele in stack nd queue ..... asap
I will try :)
@@AmulsAcademy kkkie mam 🙂🙂
Thanks for you videos. Learned a lot from your channel and I got placed in one of the top most IT. Make more videos like this.
where??
does companies allow dsa in py?
Pls teach time complexity ma'am,you break complex things to simple things
is there a git repo?
In enqueue function
Cannot convert string to int
R u from Hyderabad??
No :)
Ma'am please small help ma'am , please make a video implementation of stacks and queues using linked list this is big topic for us please ma'am do it as fast as possible
Yes mam 😢
Thank u mam😄😄
Most welcome 😊
What happen if we write queue=[].in while body
how can i put size of the queue?
Your voice ❤❤❤❤❤
Thank you
Thankyou
You’re welcome 😊
thank you!
it wold have been better if u had explained stack and queue without using built in functions....this way of implementing stack n queue may be easy but its of no use
I know.... I will add more videos on that :)
👍
Thank you :)
Chuck ❤️❤️
your vedio is very helpful.And your voice is cute and childish
Thanks a lot 😊
Nice voice
can you please send me this code?
❤️❤️❤️😘😘😘😘
Thank You :)
🥰💖
This wil not work in practical or exam total useless this much we can read from book and understand this is not implementation
These are to know the concepts. You should implement in real time with you ideas. Altough everyone cant learn by reading books, example guys like me lol.
class Queue:
def __init__(self):
self.items = []
def enqueue(self, item):
self.items.append(item)
def dequeue(self):
if not self.items:
return None
else:
return self.items.pop(0)
def front(self):
if not self.items:
return None
else:
return self.items[0]
def end(self):
if not self.items:
return None
else:
return self.items[-1]
behanji time complexity ke upper videos bano doge, samjh nhi aata iska concept.
I will try :)
Great video! Just a couple of questions. The .pop(n) and .insert() operations both have a complexity of O(n), don't they? Would you say that this is an accurate implementation of a queue, since enqueueing and dequeueing must happen in constant time (O(1))?
well these types of implimentation are based on principals, Lifo or Fifo is the defining point for stack and queue as of now as we have implimented using list
can you do circular queue using list
thanks