FISTS Academy
FISTS Academy
  • Видео 181
  • Просмотров 109 812

Видео

Lec 37 | Knapsack Problem | Greedy Methods | Algorithm Design Techniques | @fistsAcademy
Просмотров 1978 месяцев назад
This video will cover Knapsack problem which is an important problem which follow Greedy Methods. It will explain step by step algorithm for solving the problem along with time complexity for the same.
Lec 36 | Bellman-Ford Algorithm | Greedy Method | Algorithm Design Techniques | @fistsAcademy
Просмотров 2288 месяцев назад
This video will give an overview about Bellman-Ford algorithm which is an example of Greedy methods in Algorithm Design techniques. It will explain the complete process with example graphs along with time complexity of this algorithm as well.
Lec 35 | Greedy Method | Algorithm Design Techniques | @fistsAcademy
Просмотров 1428 месяцев назад
This video will explain about one of the Algorithm Design Techniques i.e., Greedy Method. It will also explain Optimisation problems and various applications of Greedy Approach.
Lec 34 | DIJKSTRA Algorithm | Algorithm Analysis | @fistsAcademy
Просмотров 37110 месяцев назад
This video will give an overview of DIJKSTRA Algorithm with the help of example graph.
Lec 33 | PRIM'S Algorithm | Algorithm Analysis | @fistsAcademy
Просмотров 30610 месяцев назад
This video will give an overview of PRIM'S Algorithm with the help of example graph.
Ledc 32 | Strassen's Algorithm for Matrix Multiplication | Algorithm Analysis | @fistsAcademy
Просмотров 30310 месяцев назад
This video will cover two approaches for Matrix Multiplication which are Divide & Conquer Algorithm and Strassen's Algorithm along with the Time Complexity of each approach.
Lec 31 | Binomial Heap Extract Min Operation | Binomial Heap | Algorithm Analysis | @fistsAcademy
Просмотров 20710 месяцев назад
This video will given an overview about the process of extracting minimum element from a given Binomial Heap.
Lec 30 | Binomial Heap Insertion Operation | Binomial Heap | Algorithm Analysis | @fistsAcademy
Просмотров 26610 месяцев назад
This video will explain the process of inserting keys in a given Binomial Heap with the help of an example question.
Lec 29 | Union of Two Binomial Heaps | Binomial Heap | Algorithm Analysis | @fistsAcademy
Просмотров 40410 месяцев назад
This video will give an overview of the union process of two Binomial Heaps with the help of an example question. It will provide step by step detail of entire procedure.
Lec 28 | Binomial Tree and Heap | Binomial Heap | Algorithm Analysis | @fistsAcademy
Просмотров 30510 месяцев назад
This video will give an overview of Binomial Tree and Binomial Heaps along with the explanation of its properties.
Lec 27 | Insertion in Red-Black Tree | Red Black Tree | Algorithm Analysis | @fistsAcademy
Просмотров 39710 месяцев назад
This video will give an overview of Insertion process of Red Black Tree in step by step fashion. It will explain the insertion of every key from given set with the help of an example Red-Black Tree.
Lec 26 | Height of Red-Black Tree | Algorithm Analysis | @fistsAcademy
Просмотров 30610 месяцев назад
This video will explain the proof of height of Red Black Tree.
Lec 25 | Red-Black Tree | Algorithm Analysis | @fistsAcademy
Просмотров 33110 месяцев назад
This video will give an overview of Red-Black Tree along with the explanation of its important properties.
Lec 24 | Minimum Keys in B-Tree | B Tree | Algorithm Analysis | @fistsAcademy
Просмотров 17210 месяцев назад
This video will give an overview of the process to figure out minimum keys in given B Tree.
Lec 23 | Maximum Keys in B-Tree | B Tree | Algorithm Analysis | @fistsAcademy
Просмотров 21810 месяцев назад
Lec 23 | Maximum Keys in B-Tree | B Tree | Algorithm Analysis | @fistsAcademy
Lec 22 | Deletion In B-Tree | B-Tree | Algorithm Analysis | @fistsAcademy
Просмотров 38110 месяцев назад
Lec 22 | Deletion In B-Tree | B-Tree | Algorithm Analysis | @fistsAcademy
Lec 21 | Insertion In B-Tree | B-Tree | Algorithm Analysis | @fistsAcademy
Просмотров 33910 месяцев назад
Lec 21 | Insertion In B-Tree | B-Tree | Algorithm Analysis | @fistsAcademy
Lec 19 | Counting Sort | Algorithm Analysis | @fistsAcademy
Просмотров 29410 месяцев назад
Lec 19 | Counting Sort | Algorithm Analysis | @fistsAcademy
Lec 20 | B Tree | Generalised BST | Algorithm Analysis | @fistsAcademy
Просмотров 31810 месяцев назад
Lec 20 | B Tree | Generalised BST | Algorithm Analysis | @fistsAcademy
Lec 18 | Height of Binary Heap | Binary Heap | Algorithm Analysis | @fistsAcademy
Просмотров 17710 месяцев назад
Lec 18 | Height of Binary Heap | Binary Heap | Algorithm Analysis | @fistsAcademy
Lec 17 | Heap Sort Algorithm | Binary Heap | Algorithm Analysis | @fistsAcademy
Просмотров 33010 месяцев назад
Lec 17 | Heap Sort Algorithm | Binary Heap | Algorithm Analysis | @fistsAcademy
Lec 16 | Build Heap and Heapify Procedure | Binary Heap | Algorithm Analysis | @fistsAcademy
Просмотров 33010 месяцев назад
Lec 16 | Build Heap and Heapify Procedure | Binary Heap | Algorithm Analysis | @fistsAcademy
Lec 15 | Binary Heap | Algorithm Analysis | @fistsAcademy
Просмотров 28510 месяцев назад
Lec 15 | Binary Heap | Algorithm Analysis | @fistsAcademy
Lec 14 | Time Complexities of Quick Sort Algorithm | Algorithm Analysis | @fistsAcademy
Просмотров 20111 месяцев назад
Lec 14 | Time Complexities of Quick Sort Algorithm | Algorithm Analysis | @fistsAcademy
Lec 13 | Quick Sort Algorithm | Algorithm Analysis | @fistsAcademy
Просмотров 30411 месяцев назад
Lec 13 | Quick Sort Algorithm | Algorithm Analysis | @fistsAcademy
Lec 12 | Master Method |Subtract & Conquer Recurrences |Algorithm Analysis |Algorithms @fistsAcademy
Просмотров 22411 месяцев назад
Lec 12 | Master Method |Subtract & Conquer Recurrences |Algorithm Analysis |Algorithms @fistsAcademy
Lec 11 | Master Method |Divide & Conquer Recurrences |Algorithm Analysis |Recurrence @fistsAcademy
Просмотров 24311 месяцев назад
Lec 11 | Master Method |Divide & Conquer Recurrences |Algorithm Analysis |Recurrence @fistsAcademy
Lec 10 | Recursion Tree Ex |Recurrence Relation method|Algorithm Analysis |Algorithms @fistsAcademy
Просмотров 21411 месяцев назад
Lec 10 | Recursion Tree Ex |Recurrence Relation method|Algorithm Analysis |Algorithms @fistsAcademy
Lec 9 |Recursion Tree Method |Recurrence Relations |Algorithm Analysis |ADA |Algorithm @fistsAcademy
Просмотров 25511 месяцев назад
Lec 9 |Recursion Tree Method |Recurrence Relations |Algorithm Analysis |ADA |Algorithm @fistsAcademy

Комментарии

  • @techon1913
    @techon1913 День назад

    Sir complete the playlist

  • @husenshaikh6605
    @husenshaikh6605 8 дней назад

    Thank you so much sir ❤❤

  • @husenshaikh6605
    @husenshaikh6605 8 дней назад

    Ur teaching just amazing sir❤

  • @MichaelsYT1
    @MichaelsYT1 9 дней назад

    Thank you sir

  • @syedmanzoor3890
    @syedmanzoor3890 15 дней назад

    excellent explanation

  • @nilofarshaikh6653
    @nilofarshaikh6653 23 дня назад

    Keep it up sir❤

  • @boxer134
    @boxer134 Месяц назад

    awsm sir

  • @tanishksonkar4186
    @tanishksonkar4186 Месяц назад

    very nice explanation

  • @manishchaudhary9793
    @manishchaudhary9793 Месяц назад

    best teacher of tafl on youtube

  • @AmanSingh-en3bq
    @AmanSingh-en3bq Месяц назад

    sir, you are superb 😇...

  • @divyanshsingh8907
    @divyanshsingh8907 Месяц назад

    sir 2nd question mai agar 2 baar a ko push krke dekhe tb toh pda se solve kr skte hai?

    • @fistsAcademy
      @fistsAcademy Месяц назад

      Not possible...by pushing a two times you can assure the sum of b and c equal to a but the equalization of b and c can not be assured

  • @laquzoeshiyasha
    @laquzoeshiyasha Месяц назад

    clear explanation 👏

  • @Okayboy678
    @Okayboy678 Месяц назад

    Sir, I'm an AKTU student can I watch this playlist for my semester exams?

  • @ashishmaurya9231
    @ashishmaurya9231 Месяц назад

    Very good explanation but why people not watch support please 😊

  • @nikhilrajbhar131
    @nikhilrajbhar131 Месяц назад

    nice

  • @SiddharthKumar-nl6mf
    @SiddharthKumar-nl6mf Месяц назад

    Sir initial state q0 pr self Loop nhi lga skte kya first question m ?

  • @Deepak-q5y
    @Deepak-q5y Месяц назад

    very nice explain tafl

  • @Deepak-q5y
    @Deepak-q5y Месяц назад

    👌👌👌

  • @Deepak-q5y
    @Deepak-q5y Месяц назад

    very nice sir explain

  • @Sachin-tn6sh
    @Sachin-tn6sh Месяц назад

    Nice explanation

  • @Shalinimaddheshiya0
    @Shalinimaddheshiya0 Месяц назад

    is it enough for semester?

  • @Sachin-tn6sh
    @Sachin-tn6sh Месяц назад

    Great Explanation.. Thanks Sir

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

    is it necessary to remove common state ? can i solve without reducing the states.

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

    best

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

    the underrated one keep this consistent sir i wish you get what you deserve ❤❤

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

    thanku sir

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

    sir pumping lemma for cfl p lecture bnao

  • @SiddharthKumar-nl6mf
    @SiddharthKumar-nl6mf 2 месяца назад

    Sir , DFA ak question k alg alg ho skte h kya ?

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

    Such a quality content loving to watch your videos and actually having so much of interest .....keep uploading such edu videos Thank you sir ❤️❤️

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

    Awesome sir.. Watching from NIT SRINAGAR

  • @Otaku-Chan01
    @Otaku-Chan01 3 месяца назад

    Great explanation sir, Just mind blowing, I had so much trouble learning this but watching your simple and easy explanation helps me ease this topic! Thank you sir.

  • @Hejehh83nsbjwk73
    @Hejehh83nsbjwk73 3 месяца назад

    Sir your explanation is very good and understandable. Keep making lectures like this. ~Your 351th subscriber

  • @surajdang7587
    @surajdang7587 4 месяца назад

    Great

  • @arnavchawla8166
    @arnavchawla8166 4 месяца назад

    sir , example mein DFA ke Q tuple mein {AB} na hoke {A,B} nahi hoga?

  • @Azeem_Idrisi
    @Azeem_Idrisi 5 месяцев назад

    Great content 💯

  • @Azeem_Idrisi
    @Azeem_Idrisi 5 месяцев назад

    Great video sir 💯

  • @mahimabastola61
    @mahimabastola61 6 месяцев назад

    Great...It helped me alot💯

  • @abhijeetsinghyadav8988
    @abhijeetsinghyadav8988 8 месяцев назад

    Easily explained 😇

  • @Azeem_Idrisi
    @Azeem_Idrisi 9 месяцев назад

    It's was very difficult for me thanks for the easy explanation 🙏🏻🙏🏻

  • @Azeem_Idrisi
    @Azeem_Idrisi 9 месяцев назад

    Thanks sir 🙏🏻

  • @Azeem_Idrisi
    @Azeem_Idrisi 9 месяцев назад

    Clear explanation 🔥

  • @Azeem_Idrisi
    @Azeem_Idrisi 9 месяцев назад

    Sir your videos helped a lot in PUT. THANK YOU 🙏🏻 Wishing you luck.

  • @nickyharu4997
    @nickyharu4997 9 месяцев назад

    Thanks sir your way of teaching is very interesting😊 Maine Kai sari videos skip ki lekin aapki video per Aakar ruk gaya😅

  • @sumitsahu1665
    @sumitsahu1665 9 месяцев назад

    Excellent sir 👍

  • @AB007
    @AB007 10 месяцев назад

    Thank you Sir, Your explanation is superb....👍

  • @fistsAcademy
    @fistsAcademy 10 месяцев назад

    The number of Internal nodes for a subtree rooted at X is [(2 raise to the power bh(X)) - 1] and not [twice of bh(X) - 1], it has been mentioned as latter one by mistake at few places in this video. Please don't get confuse.

  • @tomfooler7692
    @tomfooler7692 10 месяцев назад

    best explanation!!!!!!!!.

  • @anstjd_ys
    @anstjd_ys 11 месяцев назад

    Great explanation!

  • @anonymous1306
    @anonymous1306 11 месяцев назад

    Thank you so much.

  • @Razor-dc3ve
    @Razor-dc3ve 11 месяцев назад

    Sir please upload next lectures