Knowledge in ANALYSIS AND DESIGN OF ALGORITHM
ANALYSIS AND DESIGN OF ALGORITHM( ADA ) F-SCHEME : 3RD YEAR ( DRONACHARYA COLLEGE OF ENGINEERING)
A COMPLETE HAND WRITTEN STEP BY STEP DETAILED NOTES OF ANALYSIS AND DESIGN OF ALGORITHM COVERING THE WHOLE SYLLABUS.
Ayush Dubey
Dynamic Programming
Hello guys here is concept of dynamic Programming explained in brief. It is used as a method to create algorithms for complex problems. For eg. Traveling salesman problem.
naman bhandari
Backtracking and N queens problem
Backtracking is a major concept in algorithms used to solve complex problems for instance N queens problems.
DESIGN AND ANALYSIS OF ALGORITHM
An algorithm is a set of steps of operations to solve a problem performing calculation, data processing, and automated reasoning tasks. An algorithm is an efficient method that can be expressed within finite amount of time and space. An algorithm is the best way to represent the solution of a particular problem in a very simple and efficient way. If we have an algorithm for a specific problem, then we can implement it in any programming language, meaning that the algorithm is independent from any programming languages. Algorithm Design The important aspects of algorithm design include creating an efficient algorithm to solve a problem in an efficient way using minimum time and space. To solve a problem, different approaches can be followed. Some of them can be efficient with respect to time consumption, whereas other approaches may be memory efficient. However, one has to keep in mind that both time consumption and memory usage cannot be optimized simultaneously. If we require an algorithm to run in lesser time, we have to invest in more memory and if we require an algorithm to run with lesser memory, we need to have more time. Problem Development Steps The following steps are involved in solving computational problems. Problem definition Development of a model Specification of an Algorithm Designing an Algorithm Checking the correctness of an Algorithm Analysis of an Algorithm Implementation of an Algorithm Program testing Documentation Characteristics of Algorithms The main characteristics of algorithms are as follows − Algorithms must have a unique name Algorithms should have explicitly defined set of inputs and outputs Algorithms are well-ordered with unambiguous operations Algorithms halt in a finite amount of time. Algorithms should not run for infinity, i.e., an algorithm must end at some point Pseudocode Pseudocode gives a high-level description of an algorithm without the ambiguity associated with plain text but also without the need to know the syntax of a particular programming language. The running time can be estimated in a more general manner by using Pseudocode to represent the algorithm as a set of fundamental operations which can then be counted.
Shantha Kumar . V
Hamiltonian Path
Here is a slideshow about Hamiltonian Path which are used to create algorithms for shortest paths and also explaination why Hamiltonian Path are called to be NP Complete problem.
Introduction to algorithms
Hello guys check out the introductory slideshow regarding algorithms and how to design them with minimum complexity.
type of complexity in algorithms
Here are some notation like BIG-OH THETA and OMEGA which are complexity in algorithm also some solution are provided along with algorithms for NP hard and NP complete.
Non-deterministic algorithms
Non-deterministic algorithms are two types NP-hard and NP-complete here is details regarding both of them.
vertex cover problems in algorithms
Here is concept and working algorithm for vertex covering problems in ADA.
Parallel algorithm designing.
Here is complete details regarding parallel algorithms designing and its working process as well as algorithms with benefits over normal algorithms.
Genetic algorithm
Genetic algorithm is an interesting and latest application of Artificial Intelligence. Here is a brief view of it.
Rakesh Kundu
Design and Analysis of Algorithm
Following document contains notes for Design and analysis of algorithm. Preferable for students of design and analysis of algorithm
Aditya Sethi