Minimum Cost Spanning Tree with Example using Greedy Method |L-25||DAA|

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

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

  • @KaratampatiSindhu
    @KaratampatiSindhu Месяц назад +1

    Thank you so much mam❤ ..this video is very helpful for me

  • @HariniGoud-c1m
    @HariniGoud-c1m 18 дней назад +2

    Mam can you please make a video on cook's theorem

  • @Mylipillichandu
    @Mylipillichandu Месяц назад +1

    Teachers like you don't deserve a like... you deserve a heart... please take mine madam😩🤌🏻

  • @kavyaks7056
    @kavyaks7056 17 дней назад +2

    Mam can you please explain daa program tracing

  • @ankitsharma2566
    @ankitsharma2566 2 месяца назад +1

    Mam ek DBMS pe ek series bna dijiye ...pls

  • @yashkunwar2604
    @yashkunwar2604 2 месяца назад

    hi sharavya, please make a video on ADALINE and MADALINE networks

  • @keerthirdd_
    @keerthirdd_ 2 месяца назад

    Please do a video on priority queues using heap min and Max heap by today

  • @Hanumantharaya-g8r
    @Hanumantharaya-g8r Месяц назад +1

    can you please explain code also mam

  • @bharanidhar1021
    @bharanidhar1021 Месяц назад +2

    So from past few years you're in the same teaching styles.... You're working anywhere?