Understanding NP-Hard and NP-Complete Problems | Prasad Sir

Here in this Video *Î*😇 Explained About *"NP-Hard and NP-Complete ClasseS* Which is Part of *NP-Hard and NP-Complete ProblemS* in 2-Chapter / 2-Part from 5-UNIT in *DAA(Design and Analysis of Algorithms)* Subject.

While Designing a SoftWare We *Type Programs* before that We Write *"ALGORITHMS."*

*ProblemS*(AlgorithmS / ProgramS / SoftwareS) is of Two(2) GroupS:-
*1).* PoLyNoMial Time AlgorithmS(Determistic/Less Time) *&*
*2).* Non-Polynomial Time AlgorithmS(Non-Deterministic/Exponential Time/More Time)

Again
*Non-Polynomial AlgorithmS* are Divided into Two(2) Types
*1).* NP-Hard *&*
*2).* NP-Complete.

For Remaining Total Explanation Watch This Video by Clicking👆 the above Link.

*Design and Analysis of Algorithms(DAA)* Subject ALL My *Video PLAY LIST:-*
https://youtube.com/playlist?list=PLGhRIPgzPVzhzSznvJshWBDhg-HzM-cG2

*Subscribe the Educational Channel:-*
https://youtube.com/c/PrasadCareerization

*Follow me on Instagram:-* https://www.instagram.com/prasadsirworldfamous

*Like me on FaceBook:-*
https://www.facebook.com/masterbhanuprasad


#NPHardAndNPCompleteProblems
#NPHardAndNPCompleteClasses
#PrimsAlgorithm #PrimAlgorithm #MinimumCostSpanningTree #GreedyMethod #KnapSackProblem
#0or1KnapSackProblem #KnapSack #OptimalBanarySearchTree #OBST #ReliabilityDesign #DynamicProgramming #DAA #StrassensMatrixMultiplication #MatrixMultiplication #DivideAndConquer
#TowersOfHaNoi #RecursiveAlgorithm #AlgorithmSpecification #PerformanceAnalysis #Algorithms #DAA #QuickSort #QuickSortAlgorithm #QuickSortAlgorithmByPartitioning #SORT
#BinarySearch #BinarySearchAlgorithm #Search #Sort #LinearSearch #SequentialSearch
#BTech #jntuh #coa #r18 #PrasadSir #Prasad #PrasadCareerization #PRASADsir