1. C++ Programming examples on “Solving Linear Equations”
The C++ programs in this section performs encoding matrix using a hidden-key and LU Decomposition of any matrix. It also deals with implementation of Coppersmith Freivald’s Algorithm to check if the 3rd matrix is the result of multiplication of the given two matrices. Gauss jordan elimination is an algorithm for solving systems of linear equations. Gauss seidel method is an iterative method used to solve a linear system of equations.
2. C++ Programming examples on “Bandwidth Reduction”
The C++ programs in this section performs bandwidth reduction on graphs, implementation of different algorithms like RCM and optimize wire length in electrical circuit.
C++ Program to Implement RCM Algorithm
C++ Program to Optimize Wire Length in Electrical Circuit
C++ Program to Perform Bandwidth Reduction on Graphs
3. C++ Programming examples on “Matrix Multiplication”
This section contains C++ programs on matrix multiplication and multiplication for complex numbers, implementation of strassen’s algorithm for matrix multiplication. This section also contains programs on how to check sparsity of a given matrix and also multiplicability of two matrices.
4. C++ Programming examples on “Determinants and Permanents”
The C++ programs in this section on invertible a matrix and evaluating matrix determinant.
C++ Program to Check if a Matrix is Invertible
C++ Program to Compute Determinant of a Matrix
5. C++ Programming examples on “Constrainted and UnConstrained Optimization”
This section contains a C++ programs to find the minimum and maximum value of any algebraic expressions and compute local optima by implementing steepest descent method and conjugate method.
C++ Program to Find Minimum Value of any Algebraic Expression
C++ Program to Find Maximum Value of any Algebraic Expression
C++ Program to Implement Steepest Descent Method and Compute Local Optima
C++ Program to Implement Conjugate Method and Compute Local Optima
C++ Program to Implement Modular Exponentiation Algorithm
6. C++ Programming examples on “Linear Programming”
This section contains C++ Programs on optimising solutions for different applications using linear programming concept and also contains a program to find the maximum value of an expression.
C++ Program to Find Maximum Value of an Expression and Given 3 Inequalities
C++ Program to Optimize Solution for Employer Applicant Mark Problem Using Linear Programming
7. C++ Programming examples on “Random Number Generation”
This section contains C++ programs on genrating passwords with specified length and range, generating random numbers and random hexadecimal bytes, generate random numbers using probability distribution function, middle square and carry methods, implementing rand and srand functions
8. C++ Programming examples on “Factoring and Primality Testing”
This section contains C++ programs to generate prime numbers using sieev wheel, sieve of eratosthenes, sieve of atkin, sieve of sundaram and rabin-miller primalty test. It also contains programs on computing GCD, LCM and factorization of numbers. It also explains the program to perform baillie-PSW and fermat primality test.
9. C++ Programming examples on “Arbitrary-Precision Arithmetic”
The C++ programs in this section to perform addition operations and multiplication using bitwise operators, implementation of schonhage strassen algorithm, euler theorem, russian peasant multiplication and fermats little theorem.
C++ Program to Perform Addition Operation Using Bitwise Operators
C++ Program to Implement Booth’s Multiplication Algorithm for Multiplication of 2 signed Numbers
C++ Program to Implement the Schonhage-Strassen Algorithm for Multiplication of Two Numbers
C++ Program to Perform Arithmetic Operations on Numbers of Size Greater than that of Int Without Using any Data Type of Size Greater than Int
C++ Program to Implement Russian Peasant Multiplication
C++ Program to Implement Euler Theorem
C++ Program to Implement Extended Euclidean Algorithm
C++ Program to Implement Fermat’s Little Theorem
10. C++ Programming examples on “Knapsack Problem”
The C++ programs in this section deals with implementation like 0-1 knapsack problem, fractional knapsack problem, bin packing algorithm and dynamic programming.
C++ Program to Solve the 0-1 Knapsack Problem
C++ Program to Solve the Fractional Knapsack Problem
C++ Program to Perform Partition of an Integer in All Possible Ways
C++ Program to Fill Given n Numbers into a Given N Number and Ensure that Minimum is Left from N
C++ Program to Implement the Bin Packing Algorithm
C++ Program to Solve Knapsack Problem Using Dynamic Programming
C++ Program to Calculate Maximum Payoff by ReOrdering Two Given Sets
11. C++ Programming examples on “Discrete Fourier Transform”
This section contains C++ programs on computing DFT coefficients, naive approach and fast fourier transform method. It also performs Complex 2D Array.
12. C++ Programming examples on “Factorials and Fibonacci Numbers”
This section contains C++ programs to find the factorial number using recursion, iteration and dynamic programming, fibonacci numbers using recursion, iteration, dynamic programming and matrix exponentiation.