Abdul Bari
Abdul Bari
  • 115
  • 97 591 875
[New] Matrix Chain Multiplication using Dynamic Programming Formula
Matrix Chain Multiplication using Dynamic Programming Formula
PATREON : www.patreon.com/bePatron?u=20475192
Courses on Udemy
================
Java Programming
www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6
Data Structures using C and C++
www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D
C++ Programming
www.udemy.com/course/cpp-deep-dive/?referralCode=E4246A516919D7E84225
zhlédnutí: 750 592

Video

4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming
zhlédnutí 466KPřed 5 lety
Optimal Binary Search Tree using Successful and Unsuccessful Search Probabilities​ PATREON : www.patreon.com/bePatron?u=20475192 Courses on Udemy Java Programming www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6 Data Structures using C and C www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D C Programming www.udemy.com/course/cpp-deep-dive/?re...
Bresenham's Line Drawing Algorithm
zhlédnutí 426KPřed 5 lety
PATREON : www.patreon.com/bePatron?u=20475192 Courses on Udemy Java Programming www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6 Data Structures using C and C www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D C Programming www.udemy.com/course/cpp-deep-dive/?referralCode=E4246A516919D7E84225 Bresenham's Line Drawing Algorithm 1. Basics 2. Dra...
2.6.3 Heap - Heap Sort - Heapify - Priority Queues
zhlédnutí 2,1MPřed 5 lety
PATREON : www.patreon.com/bePatron?u=20475192 Courses on Udemy Java Programming www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6 Data Structures using C and C www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D C Programming www.udemy.com/course/cpp-deep-dive/?referralCode=E4246A516919D7E84225 Topics Covered 1. Array Representation of Binary Tr...
4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming
zhlédnutí 1,1MPřed 6 lety
Longest Common Subsequence Problem using 1. Recursion 2. Memoization 3. Dynamic Programming PATREON : www.patreon.com/bePatron?u=20475192 Courses on Udemy Java Programming www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6 Data Structures using C and C www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D C Programming www.udemy.com/course/cpp-deep...
7.3 Traveling Salesman Problem - Branch and Bound
zhlédnutí 1,7MPřed 6 lety
Traveling Salesman Problem - Branch and Bound PATREON : www.patreon.com/bePatron?u=20475192 Courses on Udemy Java Programming www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6 Data Structures using C and C www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D C Programming www.udemy.com/course/cpp-deep-dive/?referralCode=E4246A516919D7E84225
DDA Line Drawing Algorithm - Computer Graphics
zhlédnutí 520KPřed 6 lety
DDA explained using Examples. DDA (Digital Differential Analyzer) Line Drawing Algorithm PATREON : www.patreon.com/bePatron?u=20475192 Courses on Udemy Java Programming www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6 Data Structures using C and C www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D C Programming www.udemy.com/course/cpp-deep-di...
4.8 Reliability Design - Dynamic Programming
zhlédnutí 364KPřed 6 lety
Reliability Design System Design PATREON : www.patreon.com/bePatron?u=20475192 Courses on Udemy Java Programming www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6 Data Structures using C and C www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D C Programming www.udemy.com/course/cpp-deep-dive/?referralCode=E4246A516919D7E84225
8.1 NP-Hard Graph Problem - Clique Decision Problem
zhlédnutí 561KPřed 6 lety
NP-Hard Graph Problem - Clique Decision Problem CDP is proved as NP-Hard PATREON : www.patreon.com/bePatron?u=20475192 Courses on Udemy Java Programming www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6 Data Structures using C and C www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D C Programming www.udemy.com/course/cpp-deep-dive/?referralCode...
6.4 Hamiltonian Cycle - Backtracking
zhlédnutí 975KPřed 6 lety
Hamiltonian Cycle using Backtracking PATREON : www.patreon.com/bePatron?u=20475192 Courses on Udemy Java Programming www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6 Data Structures using C and C www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D C Programming www.udemy.com/course/cpp-deep-dive/?referralCode=E4246A516919D7E84225
1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find
zhlédnutí 833KPřed 6 lety
Disjoint Sets Data Structure - Weighted Union and Collapsing Find PATREON : www.patreon.com/bePatron?u=20475192 Courses on Udemy Java Programming www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6 Data Structures using C and C www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D C Programming www.udemy.com/course/cpp-deep-dive/?referralCode=E4246A...
4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula
zhlédnutí 499KPřed 6 lety
Traveling Salesman Problem - Dynamic Programming - Explained using Formula PATREON : www.patreon.com/bePatron?u=20475192 Courses on Udemy Java Programming www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6 Data Structures using C and C www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D C Programming www.udemy.com/course/cpp-deep-dive/?referralCo...
6. Everything about Variables in JAVA
zhlédnutí 42KPřed 6 lety
Variables explained in details. all attributes of variables and how they are provided in JAVA Courses on Udemy Java Programming www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6 Data Structures using C and C www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D C Programming www.udemy.com/course/cpp-deep-dive/?referralCode=E4246A516919D7E84225
9.2 Rabin-Karp String Matching Algorithm
zhlédnutí 754KPřed 6 lety
Rabin-Karp String Matching Algorithm It is useful for matching multiple patterns simultaneously. PATREON : www.patreon.com/bePatron?u=20475192 Courses on Udemy Java Programming www.udemy.com/course/java-se-programming/?referralCode=C71BADEAA4E7332D62B6 Data Structures using C and C www.udemy.com/course/datastructurescncpp/?referralCode=BD2EF8E61A98AB5E011D C Programming www.udemy.com/course/cpp...
10.2 B Trees and B+ Trees. How they are useful in Databases
zhlédnutí 1,2MPřed 6 lety
This video explains B Trees and B Trees and how they are used in databases. Insertion, Deletion and Analysis will be covered in next video. Each node of a B Tree is a block on Disk. The degree of a Tree is decided based number of keys and child pointers that can fit inside a block. PATREON : www.patreon.com/bePatron?u=20475192 Courses on Udemy Java Programming www.udemy.com/course/java-se-progr...
5. Everything about JAVA Data Types
zhlédnutí 46KPřed 6 lety
5. Everything about JAVA Data Types
4. Why public static void main(String args[ ]) ? JAVA
zhlédnutí 90KPřed 6 lety
4. Why public static void main(String args[ ]) ? JAVA
3. Why to Set Path ? JAVA
zhlédnutí 43KPřed 6 lety
3. Why to Set Path ? JAVA
9.1 Knuth-Morris-Pratt KMP String Matching Algorithm
zhlédnutí 1,6MPřed 6 lety
9.1 Knuth-Morris-Pratt KMP String Matching Algorithm
2. Why and How Java is platform independent
zhlédnutí 65KPřed 6 lety
2. Why and How Java is platform independent
1. Why One should Learn Java - Introduction to Java
zhlédnutí 173KPřed 6 lety
1. Why One should Learn Java - Introduction to Java
10.1 AVL Tree - Insertion and Rotations
zhlédnutí 1,2MPřed 6 lety
10.1 AVL Tree - Insertion and Rotations
4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming
zhlédnutí 309KPřed 6 lety
4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming
4.5.1 0/1 Knapsack Problem (Program) - Dynamic Programming
zhlédnutí 519KPřed 6 lety
4.5.1 0/1 Knapsack Problem (Program) - Dynamic Programming
1.1 Priori Analysis and Posteriori Testing
zhlédnutí 936KPřed 6 lety
1.1 Priori Analysis and Posteriori Testing
4.1.1 MultiStage Graph (Program) - Dynamic Programming
zhlédnutí 299KPřed 6 lety
4.1.1 MultiStage Graph (Program) - Dynamic Programming
8. NP-Hard and NP-Complete Problems
zhlédnutí 1,8MPřed 6 lety
8. NP-Hard and NP-Complete Problems
7.2 0/1 Knapsack using Branch and Bound
zhlédnutí 1,1MPřed 6 lety
7.2 0/1 Knapsack using Branch and Bound
7.1 Job Sequencing with Deadline - Branch and Bound
zhlédnutí 323KPřed 6 lety
7.1 Job Sequencing with Deadline - Branch and Bound
6.3 Graph Coloring Problem - Backtracking
zhlédnutí 1,1MPřed 6 lety
6.3 Graph Coloring Problem - Backtracking

Komentáře

  • @arpitgupta890
    @arpitgupta890 Před 10 hodinami

    Is it not possible to solve this problem using Djikstra's algorithm for finding the shortest path between 2 nodes.

  • @nidhirohani
    @nidhirohani Před 12 hodinami

    Apke video ko samjhne ke liy phle hmko koi or video dekh ke ana hota h

  • @cmikhail7289
    @cmikhail7289 Před 12 hodinami

    thank you sir

  • @tusharbairagi9552
    @tusharbairagi9552 Před 13 hodinami

    Very well explained thankyou so much ❤

  • @qamarhussain4004
    @qamarhussain4004 Před 15 hodinami

  • @isurajmahto
    @isurajmahto Před 15 hodinami

    Makaut attendence

  • @navneetsingh7209
    @navneetsingh7209 Před 16 hodinami

    Tu Kha thik padhata hai

  • @tuneermukherjee5495
    @tuneermukherjee5495 Před 16 hodinami

    Wrong calculation

  • @sibonilemthunzi6297

    wow you are just so good. this is the best video about hashing I have watched.

  • @prathameshjadhav2942

    These 30 my minutes are mind blowing you will never regret after watching it all

  • @redtree732
    @redtree732 Před dnem

    Amazing video

  • @alekyajaini3749
    @alekyajaini3749 Před dnem

    The very best way of explaining the concepts sir.. Thankyou! Please do more such videos

  • @Atlal-hk3rq
    @Atlal-hk3rq Před dnem

    Great Explanation thank you! Please some more videos on reducibility

  • @minecraftplayer8992

    just like messi, made it look easy!

  • @KiyoGam1
    @KiyoGam1 Před dnem

    5/3 = 1.66..... rest is top tier sir.

  • @Reyna-yj6vo
    @Reyna-yj6vo Před dnem

    God level explanation

  • @ProgrammingKT
    @ProgrammingKT Před dnem

    00:31 tree != graph

  • @darshanyadav7727
    @darshanyadav7727 Před dnem

    after struggling through lot of documents, this video gave me complete and satisfying answer.😊

  • @saisurya1723
    @saisurya1723 Před dnem

    Me, who Today having DAA exam😂

  • @joonwantsdat
    @joonwantsdat Před dnem

    this guy is legend... i now understand how KMP works. Thank you so much.

  • @ananthraj9386
    @ananthraj9386 Před dnem

    Epic

  • @GoodMorning-bv6rf
    @GoodMorning-bv6rf Před 2 dny

    Can anyone explain from 27:45 How he created the tree

  • @Atlal-hk3rq
    @Atlal-hk3rq Před 2 dny

    Great explanation!!!! Thank you a lot

  • @kubasliwinski2771
    @kubasliwinski2771 Před 2 dny

    pivot, or /ˈpɪvət/, pi·vuht

  • @117bpiyushsonisoni9

    Does the dsa is for c++ or other lang?

  • @artizanal60
    @artizanal60 Před 2 dny

    7:42 starts here

  • @haniakrami1136
    @haniakrami1136 Před 2 dny

    Amazing🎉

  • @shivanshplays9218
    @shivanshplays9218 Před 2 dny

    watching this for me endsem in 2024...evergreen leher sir <3

  • @haniakrami1136
    @haniakrami1136 Před 2 dny

    You are perfectt❤❤

  • @BlenBete
    @BlenBete Před 2 dny

    woo this is sooooooooooooooo godddddddddddddddddddddd

  • @trendingmemes4874
    @trendingmemes4874 Před 2 dny

    Anyone from earth?

  • @user-ib5pe2cc2h
    @user-ib5pe2cc2h Před 2 dny

    Hi For upper and lower bound of f(n) = n! can this be solution: (n-1)! <= f(n) <= 2(n!)

  • @BhawaniNandan-lj9um

    Came here from that lady on the instagram

  • @anmoltrvd06
    @anmoltrvd06 Před 3 dny

    He looks dangerous but teaches very calmly and beautifully

  • @FasikaYemane
    @FasikaYemane Před 3 dny

    sir thankyou a lot it took time to me to understand this when my lecturer have been studied in university

  • @anushkasingh2735
    @anushkasingh2735 Před 3 dny

    sir (A[i] > pivot ) and (A[j] <= pivot ) n as u told us i will search for the element which are greater than pivot and j will search for the element which are smaller than pivot....................please explain sir?

  • @RVB938
    @RVB938 Před 3 dny

    Sir 30*0 anthe 0 kadha Sir 30 enduku Vesrau

  • @techs9994
    @techs9994 Před 3 dny

    Actually Backtracking and Brute force approach is different method isnt it???

  • @ramprathap2739
    @ramprathap2739 Před 3 dny

    Best explanation for Toh I have learnt easily by watching it

  • @lorenzocroce3858
    @lorenzocroce3858 Před 3 dny

    Meglio di pucci

  • @user-lq5if5vl5f
    @user-lq5if5vl5f Před 3 dny

    Is this for c++ or general

  • @fio6143
    @fio6143 Před 3 dny

    84 videos before the exam tomorrow lesgo

  • @SayanBanikAuthor
    @SayanBanikAuthor Před 3 dny

    Understood sir

  • @itsaayush7357
    @itsaayush7357 Před 3 dny

    Anyone today?

  • @PrachiJain-mk8gk
    @PrachiJain-mk8gk Před 3 dny

    Thanks a lot sir helped just before my exam

  • @srinivaskari
    @srinivaskari Před 4 dny

    Sir you have explained the concepts so well.

  • @notjod4948
    @notjod4948 Před 4 dny

    Absolutely Magic ✨

  • @NajeebSayyed
    @NajeebSayyed Před 4 dny

    How simple language sir use to teach. Amazing . Thank you sir 😊

  • @_AURORA._._._..__22

    Watching this in 2024 for my exam 👍👍

  • @prakharsinha7
    @prakharsinha7 Před 5 dny

    19:24 Sir I think your cost for matrix 7 and 8 are incorrect