ProDeveloperTutorial.com

In this chapter we shall solve Travelling Salesman Problem with help of dynamic programming. Problem statement: A salesman will start from a parent city and visit all the cities only once and return to parent city. He has to do it with least cost possible.   …

Introduction: This technique can be applied in different ways. It can be applied on strings and also on integers. Below are the 2 ways in which we can apply this technique. 1.Fixed size window : Here you will be presented with an array and a fixed …

Introduction: Sieve Of Eratosthenes is one of the mose simple and efficient algorithm to find the prime numbers for a given set of limit. Working of the algorithm: The working of algorithm is very simple. Step 1: First we write down all the numbers from 2 …

Introduction Tower of Hanoi is a classic problem that can be solved with the help of recursion. Problem statement: The problem statement is as follows: There are different size of rings placed on top of each other in ascending order. There might be “n” number of …

In the previous chapter we have solved fractional knapsack problem. In this chapter we shall solve 0/1 knapsack problem. Problem Statement: You are given ‘n’ number of object with their weights and profits.   You are given a bag with max capacity it can hold. Objective …

Introduction: There are 2 variants of Knapsack Problem General Knapsack problem / Fractional Knapsack problem: Here the items can be divided. This problem can be solved by greedy method. 0/1 knapsack problem: Where the items cannot be divided. Either you take the whole item or dint …

In this tutorial we shall understand how Rabin Karp algorithm will work. This is the 2ndkind of algorithm we study in pattern matching algorithm set. Rabin karp algorithm uses a hash function and brute force approach to check if a pattern is present inside a string. …