Queue ADT | CIE A Level Computer Science (9618)

Поделиться
HTML-код
  • Опубликовано: 23 дек 2024

Комментарии • 11

  • @bak1707
    @bak1707 Год назад +3

    sir to be honest I never really understood ADT's since the start in school. But by just watching your wonderful playlist I have fully understood ADT's. Thankyou soooo much. I can't thank you enough. every teacher shoud be like you. you explain wonderfully!>
    Thankyou

  • @jwanfuqaha537
    @jwanfuqaha537 Год назад +2

    your videos are amazing, could you please upload the rest of the series?

  • @thepineappleman5587
    @thepineappleman5587 Год назад

    Thanks a lot for the video!

  • @danthemantis453
    @danthemantis453 Год назад

    Cheers mate good video

  • @raj_7317
    @raj_7317 Год назад

    THANKYOUUU

  • @bak1707
    @bak1707 Год назад

    sir you didnt include the link...

    • @rjmcompsci
      @rjmcompsci  Год назад +1

      Sorry, I filmed this to be part of a series covering all ADTs and search algorithms. Sadly I didn't get the videos for linked list and binary tree filmed. I hope to complete the series soon.

    • @bak1707
      @bak1707 Год назад

      @@rjmcompsci thankyou sir for the quick response. the exam is on 22nd May

    • @kaixx1984
      @kaixx1984 Год назад

      @@rjmcompsci Please upload them over this weekend. Would really be helpful!!

  • @maryamimran9714
    @maryamimran9714 Год назад

    why is numofelements >= SIZE and not numofelements == SIZE? the number of elements cant exceed the size of the array.

    • @rjmcompsci
      @rjmcompsci  Год назад +3

      If everything else goes smoothly, == will work fine. But in general when we are programming, we want to think about making our code as robust as possible. If something goes wrong elsewhere and numElements somehow goes above size, we still want these checks to catch that.