Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
C++ Articles
Page 591 of 597
C++ Program to Represent Linear Equations in Matrix Form
This is a C++ program to represent Linear Equations in matrix form.AlgorithmBegin 1) Take the no of variables n and the coefficients of each variable as input. 2) Declare a matrix[n][n] and constant[n][1]. 3) Make for loops i = 0 to n-1 and j = 0 to n-1 to take the coefficients of each variable as the elements of the matrix. 4) Display the matrix by using nested for loops. EndExample#include using namespace std; int main(void) { char variable[] = { 'x', 'y', 'z', 'd' }; cout > n; cout > matrix[i][j]; } cin >> constant[i][0]; } cout
Read MoreC++ Program to Implement Gauss Seidel Method
Gauss Seidel method is used to solve linear system of equations in iterative method. This is a C++ Program to Implement Gauss Seidel Method.AlgorithmBegin Take the dimensions of the matrix p and its elements as input. Take the initials values of x and no of iteration q as input. While q>0 Make a for loop i = 0 to p-1 initialize n[i] = (b[i] / a[i][i]). Make a for loop i = 0 to p-1 If (j == ...
Read MoreC++ Program to Implement Modular Exponentiation Algorithm
This is a C++ program to implement Modular Exponentiation Algorithm.AlgorithmBegin function modular(): // Arguments: base, exp, mod. // Body of the function: initialize res = 1 while (exp > 0) if (exp mod 2 == 1) res= (res * base) % mod exp = exp left shift 1 base = (base * base) % mod return res. EndExample#include using namespace std; long long modular(long long base, long long exp, int mod) { long long res = 1; while (exp > 0) { if (exp % 2 == 1) res= (res * base) % mod; exp = exp >> 1; base = (base * base) % mod; } return res; } int main() { long long b, e; int mod; coutb; coute; coutmod; cout
Read MoreC++ Program to Optimize Wire Length in Electrical Circuit
This is a C++ Program to optimize Wire Length in Electrical Circuit.AlgorithmBegin Function optimizeLength() : 1) Declare a array dist[N]. 2) sptSet[i] will be true if component i is included in shortest path tree or shortest distance from src to i is finalized. 3) Initialize all distances as INFINITE and stpSet[] as false 4) Distance of source component from itself will be always 0. 5) Run a for loop cnt = 0 to N-2, Find shortest path for all components. A) Pick the minimum distance component from the set of ...
Read MoreC++ Program to Generate N Number of Passwords of Length M Each
This is a C++ Program to Generate N Number of Passwords of Length M Each.AlgorithmBegin Take the length of password as input. function permutation() generate random passwords: /* Arguments A pointer array a. Total Number of random numbers m. Length of the password s. */ // Body of the function: if (m == s) for i = 0 to s-1 Print *(a + i) else for i = m to s-1 ...
Read MoreC++ Program to Perform Optimal Paranthesization Using Dynamic Programming
This is a C++ program to perform Optimal Paranthesization using Dynamic Programming.AlgorithmBegin Take the length n and dimension of matrix as input. MatrixChain() to find out minimum multiplications: Arguments: a[i][j]=Minimum number of scalar multiplications needed to compute the matrix A[i]A[i+1]...A[j] = A[i..j] where dimension of A[i] is p[i-1] x p[i]. a[i][j] means cost is zero when multiplying one matrix. L is chain length. m = cost / scalar multiplications. Body of the function: for i = ...
Read MoreHow to initialize private static members in C++?
Here we will see how to initialize the private static member variables initialization in C++. We can put static members (Functions or Variables) in C++ classes. For the static variables, we have to initialize them after defining the class.To initialize we have to use the class name then scope resolution operator (::), then the variable name. Now we can assign some value.The following code will illustrate the of static member initializing technique.Example#include using namespace std; class MyClass{ private: static int st_var; public: MyClass(){ st_var++; //increase the value ...
Read MoreMeaning of 'const' last in a function declaration of a C++ class?
Sometimes we can find the keyword ‘const’ present at the last of function declaration. So what does it mean?Using this one function can be made as constant. The idea of constant function is that, the function cannot be modified from the objects, where they are called. It is recommended to use the constant functions in our program.Let us see one example of constant function.Example#include using namespace std; class MyClass { int value; public: MyClass(int val = 0) { value = val; } int getVal() const ...
Read MoreC++ Program to Find a Good Feedback Edge Set in a Graph
In this Program we will basically find a feedback arc set which contains edges which when removed from the graph, graph becomes directed acyclic graph.AlgorithmBegin function checkCG(int n) : n: number of vertices. arr: struct graph variable. Initialize cnt = 0 and size = (n-1). For i =0 to n-1 if (cnt == size) return 0 if (arr[i].ptr == NULL) Increase cnt. for j = 0 to n-1 while (arr[j].ptr != NULL) if ((arr[j].ptr)->des == (arr[i].ptr)->des) ...
Read MoreC++ Program to Find Strongly Connected Components in Graphs
Weakly or Strongly Connected for a given a directed graph can be found out using DFS. This is a C++ program of this problem.Functions usedBegin Function fillorder() = fill stack with all the vertices. a) Mark the current node as visited and print it b) Recur for all the vertices adjacent to this vertex c) All vertices reachable from v are processed by now, push v to Stack End Begin Function DFS() : a) Mark the current node as visited and print it b) Recur for all the vertices adjacent to this vertex EndExample#include ...
Read More