Sikkim Manipal University
Latest uploads at Sikkim Manipal University. Looking for notes at Sikkim Manipal University? We have lots of notes, study guides and study notes available for your school.
-
16
- 0
-
1
All courses for Sikkim Manipal University
-
Analysis and Design of Algorithms MCA4040 14
-
Immunology 1
-
Quality Measurement in Service operation 1
Latest notes & summaries Sikkim Manipal University
This unit defines the technique of transform and conquers. It describes the 
method of presorting, the Gaussian elimination technique and the approach of AVL and 2-3 trees in balanced search trees. It also defines heap sort and the problem reduction strategy.
- Package deal
- Class notes
- • 27 pages's •
-
Sikkim Manipal University•Analysis and Design of Algorithms
-
Analysis and Design of Algorithms• By nikhilcs
Preview 3 out of 27 pages
This unit defines the technique of transform and conquers. It describes the 
method of presorting, the Gaussian elimination technique and the approach of AVL and 2-3 trees in balanced search trees. It also defines heap sort and the problem reduction strategy.
This unit explains the types of asymptotic notations. It lists the basic 
asymptotic efficiency classes. It also describes the efficient analysis of non recursive algorithms with illustrations.
- Package deal
- Class notes
- • 22 pages's •
-
Sikkim Manipal University•Analysis and Design of Algorithms
-
Analysis and Design of Algorithms• By nikhilcs
Preview 3 out of 22 pages
This unit explains the types of asymptotic notations. It lists the basic 
asymptotic efficiency classes. It also describes the efficient analysis of non recursive algorithms with illustrations.
This unit defines recursion and recursive algorithm with examples. It also 
discusses the empirical analysis of algorithms and algorithm visualization 
with examples.
- Package deal
- Class notes
- • 23 pages's •
-
Sikkim Manipal University•Analysis and Design of Algorithms
-
Analysis and Design of Algorithms• By nikhilcs
Preview 3 out of 23 pages
This unit defines recursion and recursive algorithm with examples. It also 
discusses the empirical analysis of algorithms and algorithm visualization 
with examples.
This unit you covers the concepts of Greedy technique algorithms that are Used for optimization problems such as Kruskal's algorithm and F 
algorithm for finding minimum spanning trees. It also describes the Dijkstra s algorithm for finding single-source shortest paths, and the algorithm for finding optimum Huffman trees
- Package deal
- Class notes
- • 21 pages's •
-
Sikkim Manipal University•Analysis and Design of Algorithms
-
Analysis and Design of Algorithms• By nikhilcs
Preview 3 out of 21 pages
This unit you covers the concepts of Greedy technique algorithms that are Used for optimization problems such as Kruskal's algorithm and F 
algorithm for finding minimum spanning trees. It also describes the Dijkstra s algorithm for finding single-source shortest paths, and the algorithm for finding optimum Huffman trees
This unit covers algorithm analysis framework with respect to complexity of an algorithm. It gives an idea about various methods used for analyzing 
algorithms and explains the techniques involved in amortization. It also 
includes some case studies in algorithm analysis.
- Package deal
- Class notes
- • 22 pages's •
-
Sikkim Manipal University•Analysis and Design of Algorithms
-
Analysis and Design of Algorithms• By nikhilcs
Preview 3 out of 22 pages
This unit covers algorithm analysis framework with respect to complexity of an algorithm. It gives an idea about various methods used for analyzing 
algorithms and explains the techniques involved in amortization. It also 
includes some case studies in algorithm analysis.
Unit 11: Dynamic Programming-2 
This unit defines the Principle of Optimality and analyzes binary search 
trees using dynamic programming. It also introduces the Knapsack problem and solves an instance of it using dynamic programming and memory functions.
- Package deal
- Class notes
- • 25 pages's •
-
Sikkim Manipal University•Analysis and Design of Algorithms
-
Analysis and Design of Algorithms• By nikhilcs
Preview 3 out of 25 pages
Unit 11: Dynamic Programming-2 
This unit defines the Principle of Optimality and analyzes binary search 
trees using dynamic programming. It also introduces the Knapsack problem and solves an instance of it using dynamic programming and memory functions.
This unit introduces the Dynamic Programming technique with an example to calculate the n Fibonacci number. It explains the dynamic programming 
approach to compute binomial coefficients. It also describes the Warshall's 
and Floyd's algorithms.
- Package deal
- Class notes
- • 22 pages's •
-
Sikkim Manipal University•Analysis and Design of Algorithms
-
Analysis and Design of Algorithms• By nikhilcs
Preview 3 out of 22 pages
This unit introduces the Dynamic Programming technique with an example to calculate the n Fibonacci number. It explains the dynamic programming 
approach to compute binomial coefficients. It also describes the Warshall's 
and Floyd's algorithms.
This unit explains the Divide and Conquer methodology which is a well known general design methodology. It performs different sorting techniques, 
builds and traverses a binary tree. It also applies the Strassen's matrix 
method using the Divide and Conquer methodology.
- Package deal
- Class notes
- • 26 pages's •
-
Sikkim Manipal University•Analysis and Design of Algorithms
-
Analysis and Design of Algorithms• By nikhilcs
Preview 3 out of 26 pages
This unit explains the Divide and Conquer methodology which is a well known general design methodology. It performs different sorting techniques, 
builds and traverses a binary tree. It also applies the Strassen's matrix 
method using the Divide and Conquer methodology.
This unit explains the concepts of 'decrease and conquer 
methodology it uses in various algorithms. It explains the algorithm used for and the insertion sort, Depth-first search, Breadth-first search and topological sorting. It also analyzes the algorithm for generating combinatorial objects.
- Package deal
- Class notes
- • 22 pages's •
-
Sikkim Manipal University•Analysis and Design of Algorithms
-
Analysis and Design of Algorithms• By nikhilcs
Preview 3 out of 22 pages
This unit explains the concepts of 'decrease and conquer 
methodology it uses in various algorithms. It explains the algorithm used for and the insertion sort, Depth-first search, Breadth-first search and topological sorting. It also analyzes the algorithm for generating combinatorial objects.
This unit explains how to cope with some of the limitations of algorithms power. It analyzes the algorithm technique of Backtracking and explains the solution strategy of Branch-and-Bound algorithms. This unit also discusses approximation algorithms for NP-Hard problems like the Traveling Salesman and the Knapsack problems.
- Package deal
- Class notes
- • 21 pages's •
-
Sikkim Manipal University•Analysis and Design of Algorithms
-
Analysis and Design of Algorithms• By nikhilcs
Preview 3 out of 21 pages
This unit explains how to cope with some of the limitations of algorithms power. It analyzes the algorithm technique of Backtracking and explains the solution strategy of Branch-and-Bound algorithms. This unit also discusses approximation algorithms for NP-Hard problems like the Traveling Salesman and the Knapsack problems.