Volume:1 Issue:2 Oct ' 2015
||A Survey- Knapsack Problem Using Dynamic Programming
Vijay Tiwari , Ashok Gupta.
A Survey- Knapsack Problem Using Dynamic Programming
A method for finding an optimal solution of mixed integer programming problems with
one constraint is proposed. Initially, this method lessens the number of variables and the interval of
their change; then, for the resulting problem one derives recurrent relations of dynamic programming
that are used for computing. dynamic programming is a method for solving a complex problem by
breaking it down into a collection of simpler subproblems, solving each of those subproblems just
once, and storing their solutions. Using a matrix for information storage, we can solve problems of a
sufficiently large dimension. The computational experiments demonstrate that the method in
question is highly efficient. In this paper shows study about Knapsack problem.
||Comparison of various page Rank Algorithms
Comparison of various page Rank Algorithms
Web is expanding day by day and people generally rely on search engine to explore the
web Thus, it has become very important for the sources to give relevant and qualified result. The
main aim of this paper is to get the knowledge about various page rank algorithm and to find the
optimize result among them. The comparison will be done on the basis of their speed, limitations,
benefits and input parameters, efficiency of results.
||Study about AVL Tree & Operations
Viraj Mehta , Kapil Prajapati.
Study about AVL Tree & Operations
AVL tree is the first dynamic tree in data structure which minimizes its height during
insertion and deletion operations. This is because searching time is directly proportional to the height
of binary search tree (BST). When insertion operation is performed it may result into increasing the
height of the tree and when deletion is performed it may result into decreasing the height. To make
the BST a height balance tree (AVL tree) creators of the AVL tree proposed various rotations. This
paper shows BST and its operation and AVL.