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
Articles by Ayush Gupta
Page 19 of 44
C++ program to find the Sum of each Row and each Column of a Matrix
In this tutorial, we will be discussing a program to find the sum of each row and each column for a given matrix.For this, we will be given with a say A*B matrix. Our task is to traverse through all the elements of the matrix and find the sum of each row and each column of the matrix.Example#include using namespace std; #define m 7 #define n 6 //calculating sum of each row void calc_rsum(int arr[m][n]){ int i,j,sum = 0; for (i = 0; i < 4; ++i) { for (j = 0; j < 4; ++j) { sum = sum + arr[i][j]; } cout
Read MoreC++ program to find the sum of the series (1*1) + (2*2) + (3*3) + (4*4) + (5*5) + … + (n*n)
In this tutorial, we will be discussing a program to find the sum of the given series (1*1) + (2*2) + (3*3) + (4*4) + (5*5) + … + (n*n).For this, we will be given with the value of n and our task is to add up every term starting from the first one to find the sum of the given series.Example#include using namespace std; //calculating the sum of the series int calc_sum(int n) { int i; int sum = 0; for (i = 1; i
Read MoreC++ program to find the sum of the series (1/a + 2/a^2 + 3/a^3 + … + n/a^n)
In this tutorial, we will be discussing a program to find the sum of the given series (1/a + 2/a^2 + 3/a^3 + … + n/a^n).For this, we will be given with the value of n and our task is to add up every term starting from the first one to find the sum of the given series.Example#include #include using namespace std; //calculating the sum of the series float calc_sum(int a, int n) { int i; float sum = 0; for (i = 1; i
Read MoreC++ Program to find the sum of the series 23+ 45+ 75+….. upto N terms
In this tutorial, we will be discussing a program to find the sum of the given series 23+ 45+ 75+….. upto N terms.For this, we will be given with the value of N and our task is to add up every term starting from the first one to find the sum of the given series.After solving this, we get the formula for the sum of the series;Sn = (2n(n+1)(4n+17)+54n)/6Example#include using namespace std; //calculating the sum of the series int calc_sum(int N) { int i; int sum = (2 * N * (N + 1) * (4 * ...
Read MoreC++ program to find the sum of the series 1 + 1/2^2 + 1/3^3 + …..+ 1/n^n
In this tutorial, we will be discussing a program to find the sum of the given series 1 + 1/2^2 + 1/3^3 + …..+ 1/n^n.For this, we will be given with the value of n and our task is to add up every term starting from the first one to find the sum of the given series.Example#include #include using namespace std; //calculating the sum of the series double calc_sum(int n) { int i; double sum = 0.0, ser; for (i = 1; i
Read MoreMaximum size rectangle binary sub-matrix with all 1s in C++
In this tutorial, we will be discussing a program to find maximum size rectangle binary sub-matrix with all 1s.For this we will be provided with 2D matrix containing zeroes and ones. Our task is to find the largest 2D matrix subset containing only ones.Example Live Demo#include using namespace std; #define R 4 #define C 4 //finding the maximum area int maxHist(int row[]) { stack result; int top_val; int max_area = 0; int area = 0; int i = 0; while (i < C) { if (result.empty() || row[result.top()]
Read MoreMaximum size of sub-array that satisfies the given condition in C++
In this tutorial, we will be discussing a program to find maximum size of sub-array that satisfies the given condition.For this we will be provided with an array of integers. Our task is to find the maximum length subset of that array satisfying either of arr[k] > arr[k + 1] when k is odd and arr[k] < arr[k + 1] when k is even, arr[k] > arr[k + 1] when k is even and arr[k] < arr[k + 1] when k is odd.Example Live Demo#include using namespace std; //comparing values of a and b int cmp(int a, int b) { ...
Read MoreMaximum product subset of an array in C++
In this tutorial, we will be discussing a program to find maximum product subset of an array.For this we will be provided with an array containing positive and negative values. Our task is to find the maximum product for a subset of the array.Example Live Demo#include using namespace std; int maxProductSubset(int a[], int n) { if (n == 1) return a[0]; int max_neg = INT_MIN; int count_neg = 0, count_zero = 0; int prod = 1; for (int i = 0; i < n; i++) { ...
Read MoreProgram to find sum of first n natural numbers in C++
In this tutorial, we will be discussing a program to find sum of first n natural numbers.For this we will be provided with an integer n. Our task is to add up, find the sum of the first n natural numbers and print it out.Example Live Demo#include using namespace std; //returning sum of first n natural numbers int findSum(int n) { int sum = 0; for (int x=1; x
Read MoreProgram to find root of an equations using secant method in C++
In this tutorial, we will be discussing a program to find the root of an equation using secant method.For this we will be provided with an equation. Our task is to find the roots of that equation using the iterative secant method.Example Live Demo#include using namespace std; float f(float x) { float f = pow(x, 3) + x - 1; return f; } void secant(float x1, float x2, float E) { float n = 0, xm, x0, c; if (f(x1) * f(x2) < 0) { do { //calculating the ...
Read More