Compute modulus division by a power of 2 number – Bit Algorithm – operators, where d is a power of 2 number.Let it bit from right is set in d. For getting n
Algorithm
Python Programming – 0-1 Knapsack Problem – Dynamic Programming simple solution is to consider all subsets of items and calculate the total weight and value
Java Programming – 0-1 Knapsack Problem – Dynamic Programming simple solution is to consider all subsets of items and calculate the total weight and value
C++ Programming – 0-1 Knapsack Problem – Dynamic Programming simple solution is to consider all subsets of items and calculate the total weight and value
C Programming-Backtracking Set 2 – Backtracking – A Maze is given as N*N binary matrix of blocks where source block is the upper left most block..maze[0][0] and destination block is lower rightmost block i.e., maze[N-1][N-1].
C Programming – 0-1 Knapsack Problem – Dynamic Programming simple solution is to consider all subsets of items and calculate the total weight and value
Java Programming – Binomial Coefficient – Dynamic Programming binomial coefficient can be defined as the coefficient of X^k in the expansion of (1 + X)^n
Python Programming – Binomial Coefficient – Dynamic Programming binomial coefficient can be defined as the coefficient of X^k in the expansion of (1 + X)^n
C Programming – Binomial Coefficient – Dynamic Programming binomial coefficient can be defined as the coefficient of X^k in the expansion of (1 + X)^n
C Programming – Matrix Chain Multiplication – Dynamic Programming MCM is an optimization problem that can be solved using dynamic programming.