This is a C++ Program to perform encoding matrix using a hidden-key. Encoding is performed using matrix multiplication between given matrix and key matrix. Here is source code of the C++ Program to Perform Encoding of a Message Using Matrix Multiplication. The C++ program is successfully compiled and run on a Linux system. The program … Read more

This is a C++ Program to perform Fast Fourier Transform. A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. Fourier analysis converts time (or space) to frequency and vice versa; an FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse … Read more

This is a C++ Program to shuffle array using Fisher-Yates algorithm. The Fisher–Yates shuffle (named after Ronald Fisher and Frank Yates), also known as the Knuth shuffle (after Donald Knuth), is an algorithm for generating a random permutation of a finite set—in plain terms, for randomly shuffling the set. A variant of the Fisher–Yates shuffle, … Read more

This is a C++ Program to solve fractional knapsack. The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a mass and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to … Read more

This is a C++ Program to implement Gauss Jordan Elimination algorithm. In linear algebra, Gaussian elimination (also known as row reduction) is an algorithm for solving systems of linear equations. It is usually understood as a sequence of operations performed on the associated matrix of coefficients. This method can also be used to find the … Read more

This is a C++ Program to implement Gauss Seidel Method. In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a linear system of equations. Here is source code of the C++ Program to Implement Gauss Seidel Method. The … Read more

This is a C++ Program to find GCD of two numbers using Recursive Euclid Algorithm. In mathematics, the Euclidean algorithm, or Euclid’s algorithm, is a method for computing the greatest common divisor (GCD) of two (usually positive) integers, also known as the greatest common factor (GCF) or highest common factor (HCF). It is named after … Read more

This is a C++ Program to find GCD and LCM of given two numbers. Here is source code of the C++ Program to Find the GCD and LCM of n Numbers. The C++ program is successfully compiled and run on a Linux system. The program output is also shown below. #include<iostream>#include<conio.h>#include<stdlib.h> using namespace std; int gcd(int x, … Read more

This is a C++ Program to generate random hex bytes. The idea is to genrate decimal number first and convert it to hexadecimal. Here is source code of the C++ Program to Generate Random Hexadecimal Bytes. The C++ program is successfully compiled and run on a Linux system. The program output is also shown below. … Read more

This is a C++ Program to find the inverse of matrix. The inverse of any matrix exists only if its determinant is not zero. Here is source code of the C++ Program to Find Inverse of a Matrix. The C++ program is successfully compiled and run on a Linux system. The program output is also … Read more

advertisement

Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He is Linux Kernel Developer & SAN Architect and is passionate about competency developments in these areas. He lives in Bangalore and delivers focused training sessions to IT professionals in Linux Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage, Advanced C Programming, SAN Storage Technologies, SCSI Internals & Storage Protocols such as iSCSI & Fiber Channel. Stay connected with him @
LinkedIn | Youtube | Instagram | Facebook | Twitter