Queue Implementation Using List | Data Structure | Python Tutorials

แชร์
ฝัง
  • เผยแพร่เมื่อ 23 ธ.ค. 2024

ความคิดเห็น • 98

  • @meghanathreddy875
    @meghanathreddy875 4 ปีที่แล้ว +7

    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

  • @RohitTiwari-mo8mi
    @RohitTiwari-mo8mi หลายเดือนก่อน +1

    Great series, I love the way you say check as "chuck".

  • @saravanajogan1221
    @saravanajogan1221 2 ปีที่แล้ว +10

    One thing I am missing here is about Time complexity concept, its very necessary in DSA. Please add that also Mam Thanks

    • @heart_says.02
      @heart_says.02 ปีที่แล้ว +5

      Its just Data Structure course mate, Algorithms are not included in it. Time Complexity comes under Algorithms!😄

  • @aryanmathur1046
    @aryanmathur1046 2 ปีที่แล้ว +2

    such a good simplistic good which makes us understand the whole concept without difficulty....Thanks a lot mam

  • @utkarshmalik4471
    @utkarshmalik4471 4 ปีที่แล้ว +3

    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

  • @shreehari2589
    @shreehari2589 4 ปีที่แล้ว +6

    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

    • @AmulsAcademy
      @AmulsAcademy  4 ปีที่แล้ว +1

      Will try :)

    • @techworld7451
      @techworld7451 4 ปีที่แล้ว

      @@AmulsAcademy please mam please try much awaited video data structure using python

  • @kalelmosaiah
    @kalelmosaiah 10 หลายเดือนก่อน

    Thank you so much for this turotial. It is very helpful for my A level CS.

  • @faisalimtiyaz2313
    @faisalimtiyaz2313 4 ปีที่แล้ว +4

    Thank you for such a amazing teaching methods....
    Love your voice..

  • @19_kartikaswal19
    @19_kartikaswal19 4 ปีที่แล้ว +8

    Ma'am please bring all data structures like linked list tress bst and further algorithms like dynamic prgm djstra etc..it would be lovely

  • @somalasresthasomala8974
    @somalasresthasomala8974 3 ปีที่แล้ว +4

    You are absolutely making data structures to learn easily

  • @manishyadav9169
    @manishyadav9169 3 ปีที่แล้ว +1

    Method of teaching is pretty good

  • @mehediazad1780
    @mehediazad1780 ปีที่แล้ว

    thanks mate. you just earned a new subscriber. Always keep up a good work

  • @sikandarkumar7563
    @sikandarkumar7563 4 ปีที่แล้ว +1

    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

  • @complasent
    @complasent 4 ปีที่แล้ว +2

    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))?

    • @sbdastech
      @sbdastech 3 ปีที่แล้ว +2

      To achieve O(1) for both insert and delete, you need to use linked list.

    • @nandhakiran6523
      @nandhakiran6523 3 ปีที่แล้ว

      Use doubly linked list for O(1) deletion and insertion is O(1) for both singly and doubly linked list

    • @randomuser186
      @randomuser186 3 ปีที่แล้ว

      Proper solution is using either a circulary array or a doubly linked list

  • @purpleheart758
    @purpleheart758 4 ปีที่แล้ว +1

    Nice......effective explaination

  • @ashbin7684
    @ashbin7684 4 ปีที่แล้ว +2

    thank mam,
    plz upload more videos on python
    quickly

  • @bruce16120
    @bruce16120 2 ปีที่แล้ว

    Thank you so much, just one quick question, how can i put size of the queue?

  • @reshmametla2181
    @reshmametla2181 2 ปีที่แล้ว

    Great explanation

  • @megami3226
    @megami3226 3 ปีที่แล้ว +1

    love this video , Can i ask some help about Writing a python program that uses queue to store data inputted by the
    user

    • @AmulsAcademy
      @AmulsAcademy  3 ปีที่แล้ว +1

      Thank you 😊

    • @AmulsAcademy
      @AmulsAcademy  3 ปีที่แล้ว

      Here we are using list to implement queue, so you want to use list in your program ?

    • @megami3226
      @megami3226 3 ปีที่แล้ว

      @@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.

    • @megami3226
      @megami3226 3 ปีที่แล้ว +1

      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')

    • @AmulsAcademy
      @AmulsAcademy  3 ปีที่แล้ว

      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 😊

  • @musify6444
    @musify6444 3 ปีที่แล้ว

    popleft is also possible for Dequeue

  • @dgmusicsongs
    @dgmusicsongs 4 ปีที่แล้ว +1

    Please upload more frequently

  • @satyajitdas2780
    @satyajitdas2780 4 ปีที่แล้ว +1

    Thank you so much! you made this easy!

  • @rakibhasan-nk1lv
    @rakibhasan-nk1lv 2 ปีที่แล้ว +1

    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')

  • @HEMANTHKUMAR-ir5hc
    @HEMANTHKUMAR-ir5hc 2 ปีที่แล้ว

    can you do circular queue using list

  • @ruszelsaavedra1647
    @ruszelsaavedra1647 2 ปีที่แล้ว

    I hope you're my prof.

  • @pritam_narwade
    @pritam_narwade 2 ปีที่แล้ว +1

    Just remember - An element is removed in the same order as it is inserted.

  • @dipeshmandanka
    @dipeshmandanka 4 ปีที่แล้ว +1

    linked list and tree and graphs? after completing queue🙏

  • @thippeswamyma1792
    @thippeswamyma1792 2 ปีที่แล้ว

    mam superb mam, thanks a lot

  • @apcs914
    @apcs914 2 ปีที่แล้ว

    thank u for making so easy

  • @jeevapriya4853
    @jeevapriya4853 4 ปีที่แล้ว +1

    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

  • @kamleshkumarv8284
    @kamleshkumarv8284 3 ปีที่แล้ว

    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.

  • @vinodhkumar.s2927
    @vinodhkumar.s2927 ปีที่แล้ว

    Pls teach time complexity ma'am,you break complex things to simple things

  • @homataha5626
    @homataha5626 2 ปีที่แล้ว

    is there a git repo?

  • @rakeshraj1866
    @rakeshraj1866 3 หลายเดือนก่อน

    In enqueue function
    Cannot convert string to int

  • @shubhamrachha8823
    @shubhamrachha8823 3 ปีที่แล้ว +1

    R u from Hyderabad??

  • @FREEFIREGAMER-iv8dx
    @FREEFIREGAMER-iv8dx 2 ปีที่แล้ว +2

    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

    • @RSowmiyaa
      @RSowmiyaa 3 หลายเดือนก่อน

      Yes mam 😢

  • @ankitjain7083
    @ankitjain7083 4 ปีที่แล้ว +1

    Thank u mam😄😄

  • @SivaTechVerse
    @SivaTechVerse 11 หลายเดือนก่อน

    What happen if we write queue=[].in while body

  • @donrueis2774
    @donrueis2774 4 ปีที่แล้ว

    how can i put size of the queue?

  • @unicxogaming1140
    @unicxogaming1140 3 ปีที่แล้ว

    Your voice ❤❤❤❤❤

  • @yathishashettigar24
    @yathishashettigar24 ปีที่แล้ว

    Thank you

  • @vineetkarya1393
    @vineetkarya1393 4 ปีที่แล้ว +1

    Thankyou

  • @pini5076
    @pini5076 ปีที่แล้ว

    thank you!

  • @darkxxslayer2109
    @darkxxslayer2109 3 ปีที่แล้ว +1

    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

    • @AmulsAcademy
      @AmulsAcademy  3 ปีที่แล้ว

      I know.... I will add more videos on that :)

  • @selvanm2872
    @selvanm2872 4 ปีที่แล้ว +2

    👍

  • @prafulrane3591
    @prafulrane3591 ปีที่แล้ว

    Chuck ❤️❤️

  • @abhishekparmar6525
    @abhishekparmar6525 4 ปีที่แล้ว +1

    your vedio is very helpful.And your voice is cute and childish

  • @CharanSaiAnnam
    @CharanSaiAnnam 4 ปีที่แล้ว

    Nice voice

  • @shayanimtiaz2826
    @shayanimtiaz2826 4 ปีที่แล้ว

    can you please send me this code?

  • @abhiskype5291
    @abhiskype5291 3 ปีที่แล้ว +1

    ❤️❤️❤️😘😘😘😘

  • @ItsMeStebina
    @ItsMeStebina ปีที่แล้ว

    🥰💖

  • @tanujpandey6204
    @tanujpandey6204 3 ปีที่แล้ว

    This wil not work in practical or exam total useless this much we can read from book and understand this is not implementation

    • @kamleshkumarv8284
      @kamleshkumarv8284 3 ปีที่แล้ว

      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.

  • @Iammrunkown
    @Iammrunkown 2 ปีที่แล้ว

    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]

  • @beatboss9275
    @beatboss9275 3 ปีที่แล้ว

    behanji time complexity ke upper videos bano doge, samjh nhi aata iska concept.

  • @buchikibuchikii6154
    @buchikibuchikii6154 2 ปีที่แล้ว +1

    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))?

    • @supriyamanna715
      @supriyamanna715 2 ปีที่แล้ว

      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

  • @u.hemanthkumargowd826
    @u.hemanthkumargowd826 2 ปีที่แล้ว

    can you do circular queue using list

  • @hometvfirestick
    @hometvfirestick 3 ปีที่แล้ว

    thanks