Deadlock Avoidance | Banker's Algorithm (Example) | Part 2

Поділитися
Вставка
  • Опубліковано 3 гру 2024

КОМЕНТАРІ • 10

  • @muhammadtaimourafzal5285
    @muhammadtaimourafzal5285 3 роки тому +2

    can we just appreciate that how much hard work it took to make this video.

  • @adahadapato
    @adahadapato 3 роки тому

    Thank you for this video, its the simplest i have seen so far. Thank you again.

  • @daviddu424
    @daviddu424 7 місяців тому

    The video is amazing! I definitely understand the idea behind Banker's Algorithm in less than 20 minutes. Thanks a lot!

  • @daviddu424
    @daviddu424 7 місяців тому

    Thanks!

    • @makingITsimple1
      @makingITsimple1  7 місяців тому

      Thank you so much for your appreciation :)

  • @khoaang5712
    @khoaang5712 3 роки тому

    Thank you for your video, it's very helpful but I think instead of taking available minus "Need Matrix" and then sum "Max Need Matrix", we can do it easier by summing Allocation because Need = Max - Allocation => Allocation = + Max - Need.

  • @rajeswarim2892
    @rajeswarim2892 3 роки тому +2

    What happened we're waiting for your videos

  • @madkmanufacturers7095
    @madkmanufacturers7095 3 роки тому

    which sofwere are you using for video editing and audio editing brother??

    • @makingITsimple1
      @makingITsimple1  2 роки тому

      Videoscribe for animation,
      Online text to speech for audio and
      Filmora for editing.