Fully Polynomial Randomized Approximation Schemes
Check out the video here:
Tag: algorithms
Asymptotic Notations
Let’s start with the basic question, ‘What are Asymptotic Notations?’ Asymptotic notations are mathematical notations that describe the limiting behaviour of a function when the argument tends towards a particular value (or may be infinity). The phrase ‘limiting behaviour’ here is important. The notations describe the restriction and boundaries towards a function. Let’s stay for… Continue reading Asymptotic Notations
Prim’s and Kruskal’s Algorithm
Prim Kruskal Grows with minimum cost vertex Grows with minimum cost edge If we stop in the middle, Prim always generates connected trees If we stop the algorithm in the middle, Kruskal can give a disconnected tree or forest Need not give attention on cycle check Need to give attention on cycle check Graph must… Continue reading Prim’s and Kruskal’s Algorithm
Data Structure and Algorithms Lab Resources
A few programs and related resources can be found here in the github repo: DSA Resources
Algorithm for a Self-Creating Algorithm
We have advanced so much with data science, machine learning and artificial learning that sometimes I really wonder if writing an algorithm would makes sense. With changing data, algorithm turns out to be highly dynamic and difficult to predict how it might behave after certain point of time if we are not aware of type… Continue reading Algorithm for a Self-Creating Algorithm
Algorithms and 10 Step Process
When we talk of algorithms, following are the properties we generally refer to: The non-ambiguity requirement for each step of an algorithm cannot be compromised The range of inputs for which an algorithm works has to be specified carefully The same algorithm can be represented in several different ways Several algorithms for solving the same… Continue reading Algorithms and 10 Step Process
PH Bytes 