Fraction is a topic that most of the students don’t like because of the complexity involved in understanding and solving them. Most of the time, we need to convert the…
Mathematical Algorithms
C++ Programming – Program for Newton Raphson Method – Mathematical Algorithms – Given a function f(x) on floating number x and an initial guess for root
C++ Programming – Program for Method Of False Position – Mathematical Algorithms – Given a function f(x) on floating number x and two numbers ‘a’ and ‘b’
C++ Programming – Program for Bisection Method – Mathematical Algorithms – The method is also called the interval halving method, the binary search method
C++ Programming – Program to add two polynomials – Mathematical Algorithms – Addition is simpler than multiplication of polynomials. We initialize result
C Programming – Replace all ‘0’ with ‘5’ in an input Integer – Mathematical Algorithms – The idea is simple, we get the last digit using mod operator ‘%’.
Java Programming – Count ways to reach the n stair – Mathematical Algorithms – The time complexity of above solution is exponential.
C Programming – Count ways to reach the n stair – Mathematical Algorithms – There are n stairs, a person standing at the bottom wants to reach the top.
C++ Programming Multiply two polynomials – Mathematical Algorithms – A simple solution is to one by one consider every term of first polynomial and multiply
C++ Programming – How to check if an instance of 8 puzzle is solvable – Given a 3×3 board with 8 tiles (every tile has one number from 1 to 8) and one empty