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
-
Economics & Finance
Articles on Trending Technologies
Technical articles with clear explanations and examples
Evaluate a 3-D polynomial at points (x, y, z) in Python
To evaluate a 3-D polynomial at points (x, y, z), use the polynomial.polyval3d() method in Python Numpy. The method returns the values of the multidimensional polynomial on points formed with triples of corresponding values from x, y, and z. The parameters are x, y, z. The three dimensional series is evaluated at the points (x, y, z), where x, y, and z must have the same shape. If any of x, y, or z is a list or tuple, it is first converted to an ndarray, otherwise it is left unchanged and if it isn’t an ndarray it is treated ...
Read MoreReplace NaN with zero and fill positive infinity values in Python
To replace NaN with zero and infinity with large finite numbers, use the numpy.nan_to_num() method in Python. The method returns, x, with the non-finite values replaced. If copy is False, this may be x itself. The 1st parameter is the input data. The 2nd parameter is copy, whether to create a copy of x (True) or to replace values in-place (False). The in-place operation only occurs if casting to an array does not require a copy. Default is True.The 3rd parameter is nan, the value to be used to fill NaN values. If no value is passed then NaN values ...
Read MoreCompute a matrix transpose with Einstein summation convention in Python
The einsum() method evaluates the Einstein summation convention on the operands. Using the Einstein summation convention, many common multi-dimensional, linear algebraic array operations can be represented in a simple fashion. In implicit mode einsum computes these values. In explicit mode, einsum provides further flexibility to compute other array operations that might not be considered classical Einstein summation operations, by disabling, or forcing summation over specified subscript labels.To compute a matrix transpose with Einstein summation convention, use the numpy.einsum() method in Python. The 1st parameter is the subscript. It specifies the subscripts for summation as comma separated list of subscript labels. ...
Read MoreReturn the modified Bessel function evaluated at each of the elements of x in Python
To return the modified Bessel function evaluated at each of the elements of x, use the numpy.io() method. The parameter x is an Argument of the Bessel function. The method returns the modified Bessel function evaluated at each of the elements of x.StepsAt first, import the required libraries −import numpy as npCreate an array using the array() method −arr = np.array([10, 20, 30, 40, 50]) Display the array −print("Array...", arr)Get the type of the array −print("Our Array type...", arr.dtype) Get the dimensions of the Array −print("Our Array Dimension...", arr.ndim)Get the shape of the Array −print("Our Array Shape...", arr.shape) To return ...
Read MoreReturn the multiple vector cross product of two (arrays of) vectors in Python
To compute the cross product of two vectors, use the numpy.cross() method in Python Numpy. The method returns c, the Vector cross product(s). The 1st parameter is a, the components of the first vector(s). The 2nd parameter is b, the components of the second vector(s). The 3rd parameter is axisa, the axis of a that defines the vector(s). By default, the last axis. The 4th parameter is axisb, the axis of b that defines the vector(s). By default, the last axis.The 5th parameter is axisc, the axis of c containing the cross product vector(s). Ignored if both input vectors have ...
Read MoreC++ Program to check cats words are right or not with colored hats
Suppose we have an array A with N elements. Consider there are N cats and they are numbered from 1 to N. Each cat is wearing a hat and ith cat says "there are exactly A[i] number of different colors among the N-1 hats owned by the cats except me". We have to check whether there exists a sequence of colors of the hats which is consistent with the remarks of the cats.So, if the input is like A = [1, 2, 2], then the output will be True, because if cat 1, 2 and 3 wears hats in colors ...
Read MoreC++ program to check we can buy product with given money or not
Suppose we have a number N. A cake seller is selling cakes with 40 rupees, and doughnuts with 70 rupees each. We have to check whether we can buy some of them with exactly N rupees or not.So, if the input is like N = 110, then the output will be True, because 40 + 70 = 110.To solve this, we will follow these steps −o := false Define a function dfs(), this will take i, if i > n, then: return false if i is same as n, then: return true if dfs(i + 40), then: ...
Read MoreC++ Program to check we can remove all stones by selecting boxes
Suppose we have an array A with N elements. Consider there are N boxes and they are arranged in a circle. The ith box contains A[i] stones. We have to check whether we can remove all stones from the boxes by repeatedly performing the operation: Select a box say ith box. For each j in range 1 to N, remove exactly j stones from the (i+j)th box. Here (N+k)th box is termed as kth box. This operation cannot be performed if a box does not contain sufficient number of stones.So, if the input is like A = [4, 5, 1, ...
Read MoreC++ program to find last value of matrix with given constraints
Suppose we have a list of numbers A with N elements in it. The elements are 1, 2 or 3, Consider a number X[1][j] = A[j] where j is in range 1 to N. And X[i][j] = |X[i-1][j] - X[i-1][j+1]| where i is in range 2 to N and j is in range 1 to N+1-i. We have to find the value of X[i][j].So, if the input is like A = [1, 2, 3, 1], then the output will be 1, becauseX[1][1] to X[1][4] are 1, 2, 3, 1 X[2][1], X[2][2], X[2][3] are |1-2| = 1, |2 - 3| = ...
Read MoreC++ Program to find minimum possible unlancedness of generated string T
Suppose we have a string S with possible characters '0', '1' or '?'. We want to make string T by replacing each occurrence of '?' with 0 or 1. The unbalancedness of T is like: maximum of the all absolute differences between number of occurrences of 0 and 1 in between lth and rth character in S where 0 1; if (check(S, Mid)) R = Mid - 1; else L = Mid + 1; } return R + 1; } int main() { string S = "0??0"; cout
Read More