100 Numpy Exercises
100 Numpy Exercises
The goal is both to offer a quick reference for new and old users
and to provide also a set of exercices for those who teach. If you
remember having asked or answered a (short) problem, you can
send a pull request. The format is:
.. code:: python
# Author: Somebody
print(np.nonzero([1,2,0,0,4,0]))
import numpy as np
print(np.__version__)
np.show_config()
Z = np.zeros(10)
print(Z)
4. How to get the documentation of the numpy add function from the
command line? (★☆☆)
5. Create a null vector of size 10 but the fifth value which is 1 (★☆☆)
Z = np.zeros(10)
Z[4] = 1
print(Z)
Z = np.arange(10,50)
print(Z)
http://www.labri.fr/perso/nrougier/teaching/numpy.100/ 1/14
4/14/2018 100 numpy exercises
Z = np.arange(50)
Z = Z[::-1]
Z = np.arange(9).reshape(3,3)
print(Z)
nz = np.nonzero([1,2,0,0,4,0])
print(nz)
Z = np.eye(3)
print(Z)
Z = np.random.random((3,3,3))
print(Z)
12. Create a 10x10 array with random values and find the minimum
and maximum values (★☆☆)
Z = np.random.random((10,10))
Zmin, Zmax = Z.min(), Z.max()
print(Zmin, Zmax)
13. Create a random vector of size 30 and find the mean value (★☆☆)
Z = np.random.random(30)
m = Z.mean()
print(m)
Z = np.ones((10,10))
Z[1:-1,1:-1] = 0
0 * np.nan
np.nan == np.nan
np.inf > np.nan
np.nan - np.nan
0.3 == 3 * 0.1
16. Create a 5x5 matrix with values 1,2,3,4 just below the diagonal
(★☆☆)
Z = np.diag(1+np.arange(4),k=-1)
print(Z)
17. Create a 8x8 matrix and fill it with a checkerboard pattern (★☆☆)
Z = np.zeros((8,8),dtype=int)
Z[1::2,::2] = 1
Z[::2,1::2] = 1
print(Z)
http://www.labri.fr/perso/nrougier/teaching/numpy.100/ 2/14
4/14/2018 100 numpy exercises
18. Consider a (6,7,8) shape array, what is the index (x,y,z) of the
100th element?
print(np.unravel_index(100,(6,7,8)))
19. Create a checkerboard 8x8 matrix using the tile function (★☆☆)
Z = np.random.random((5,5))
Zmax, Zmin = Z.max(), Z.min()
Z = (Z - Zmin)/(Zmax - Zmin)
print(Z)
22. Multiply a 5x3 matrix by a 3x2 matrix (real matrix product) (★☆☆)
Z = np.dot(np.ones((5,3)), np.ones((3,2)))
print(Z)
23. Given a 1D array, negate all elements which are between 3 and 8,
in place. (★☆☆)
Z = np.arange(11)
Z[(3 < Z) & (Z <= 8)] *= -1
print(sum(range(5),-1))
from numpy import *
print(sum(range(5),-1))
Z**Z
2 << Z >> 2
Z <- Z
1j*Z
Z/1/1
Z<Z>Z
np.array(0) // np.array(0)
np.array(0) // np.array(0.)
np.array(0) / np.array(0)
np.array(0) / np.array(0.)
http://www.labri.fr/perso/nrougier/teaching/numpy.100/ 3/14
4/14/2018 100 numpy exercises
Z = np.random.uniform(-10,+10,10)
print (np.trunc(Z + np.copysign(0.5, Z)))
Z = np.random.uniform(0,10,10)
print (Z - Z%1)
print (np.floor(Z))
print (np.ceil(Z)-1)
print (Z.astype(int))
print (np.trunc(Z))
29. Create a 5x5 matrix with row values ranging from 0 to 4 (★★☆)
Z = np.zeros((5,5))
Z += np.arange(5)
print(Z)
def generate():
for x in xrange(10):
yield x
Z = np.fromiter(generate(),dtype=float,count=-1)
print(Z)
Z = np.linspace(0,1,12,endpoint=True)[1:-1]
print(Z)
Z = np.random.random(10)
Z.sort()
print(Z)
Z = np.arange(10)
np.add.reduce(Z)
34. Consider two random array A anb B, check if they are equal (★★☆)
A = np.random.randint(0,2,5)
B = np.random.randint(0,2,5)
equal = np.allclose(A,B)
print(equal)
Z = np.zeros(10)
Z.flags.writeable = False
Z[0] = 1
http://www.labri.fr/perso/nrougier/teaching/numpy.100/ 4/14
4/14/2018 100 numpy exercises
Z = np.random.random((10,2))
X,Y = Z[:,0], Z[:,1]
R = np.sqrt(X**2+Y**2)
T = np.arctan2(Y,X)
print(R)
print(T)
37. Create random vector of size 10 and replace the maximum value
by 0 (★★☆)
Z = np.random.random(10)
Z[Z.argmax()] = 0
print(Z)
Z = np.zeros((10,10), [('x',float),('y',float)])
Z['x'], Z['y'] = np.meshgrid(np.linspace(0,1,10),
np.linspace(0,1,10))
print(Z)
39. Given two arrays, X and Y, construct the Cauchy matrix C (Cij =
1/(xi - yj))
X = np.arange(8)
Y = X + 0.5
C = 1.0 / np.subtract.outer(X, Y)
print(np.linalg.det(C))
40. Print the minimum and maximum representable value for each
numpy scalar type (★★☆)
np.set_printoptions(threshold=np.nan)
Z = np.zeros((25,25))
print(Z)
42. How to find the closest value (to a given scalar) in an array? (★★☆)
Z = np.arange(100)
v = np.random.uniform(0,100)
index = (np.abs(Z-v)).argmin()
print(Z[index])
http://www.labri.fr/perso/nrougier/teaching/numpy.100/ 5/14
4/14/2018 100 numpy exercises
Z = np.random.random((10,2))
X,Y = np.atleast_2d(Z[:,0]), np.atleast_2d(Z[:,1])
D = np.sqrt( (X-X.T)**2 + (Y-Y.T)**2)
print(D)
Z = np.random.random((10,2))
D = scipy.spatial.distance.cdist(Z,Z)
print(D)
45. How to convert a float (32 bits) array into an integer (32 bits) in
place?
Z = np.arange(10, dtype=np.int32)
Z = Z.astype(np.float32, copy=False)
# File content:
# -------------
1,2,3,4,5
6,,,7,8
,,9,10,11
# -------------
Z = np.genfromtxt("missing.dat", delimiter=",")
Z = np.arange(9).reshape(3,3)
for index, value in np.ndenumerate(Z):
print(index, value)
for index in np.ndindex(Z.shape):
print(index, Z[index])
X, Y = np.meshgrid(np.linspace(-1,1,10), np.linspace(-1,1,10))
D = np.sqrt(X*X+Y*Y)
sigma, mu = 1.0, 0.0
G = np.exp(-( (D-mu)**2 / ( 2.0 * sigma**2 ) ) )
print(G)
# Author: Divakar
n = 10
p = 3
Z = np.zeros((n,n))
np.put(Z, np.random.choice(range(n*n), p, replace=False),1)
http://www.labri.fr/perso/nrougier/teaching/numpy.100/ 6/14
4/14/2018 100 numpy exercises
X = np.random.rand(5, 10)
Z = np.random.randint(0,10,(3,3))
print(Z)
print(Z[Z[:,1].argsort()])
Z = np.random.randint(0,3,(3,10))
print((~Z.any(axis=0)).any())
53. Find the nearest value from a given value in an array (★★☆)
Z = np.random.uniform(0,1,10)
z = 0.5
m = Z.flat[np.abs(Z - z).argmin()]
print(m)
class NamedArray(np.ndarray):
def __new__(cls, array, name="no name"):
obj = np.asarray(array).view(cls)
obj.name = name
return obj
def __array_finalize__(self, obj):
if obj is None: return
self.info = getattr(obj, 'name', "no name")
Z = NamedArray(np.arange(10), "range_10")
print (Z.name)
Z = np.ones(10)
I = np.random.randint(0,len(Z),20)
Z += np.bincount(I, minlength=len(Z))
print(Z)
X = [1,2,3,4,5,6]
I = [1,3,9,3,4,1]
F = np.bincount(I,X)
print(F)
http://www.labri.fr/perso/nrougier/teaching/numpy.100/ 7/14
4/14/2018 100 numpy exercises
w,h = 16,16
I = np.random.randint(0,2,(h,w,3)).astype(np.ubyte)
F = I[...,0]*256*256 + I[...,1]*256 +I[...,2]
n = len(np.unique(F))
print(np.unique(I))
58. Considering a four dimensions array, how to get sum over the last
two axis at once? (★★★)
A = np.random.randint(0,10,(3,4,3,4))
sum = A.reshape(A.shape[:-2] + (-1,)).sum(axis=-1)
print(sum)
D = np.random.uniform(0,1,100)
S = np.random.randint(0,10,100)
D_sums = np.bincount(S, weights=D)
D_counts = np.bincount(S)
D_means = D_sums / D_counts
print(D_means)
# Slow version
np.diag(np.dot(A, B))
# Fast version
np.sum(A * B.T, axis=1)
# Faster version
np.einsum("ij,ji->i", A, B).
61. Consider the vector [1, 2, 3, 4, 5], how to build a new vector with 3
consecutive zeros interleaved between each value? (★★★)
Z = np.array([1,2,3,4,5])
nz = 3
Z0 = np.zeros(len(Z) + (len(Z)-1)*(nz))
Z0[::nz+1] = Z
print(Z0)
A = np.ones((5,5,3))
B = 2*np.ones((5,5))
print(A * B[:,:,None])
http://www.labri.fr/perso/nrougier/teaching/numpy.100/ 8/14
4/14/2018 100 numpy exercises
A = np.arange(25).reshape(5,5)
A[[0,1]] = A[[1,0]]
print(A)
faces = np.random.randint(0,100,(10,3))
F = np.roll(faces.repeat(2,axis=1),-1,axis=1)
F = F.reshape(len(F)*3,2)
F = np.sort(F,axis=1)
G = F.view( dtype=[('p0',F.dtype),('p1',F.dtype)] )
G = np.unique(G)
print(G)
C = np.bincount([1,1,2,3,4,4,6])
A = np.repeat(np.arange(len(C)), C)
print(A)
Z = np.random.randint(0,2,100)
np.logical_not(arr, out=arr)
Z = np.random.uniform(-1.0,1.0,100)
np.negative(arr, out=arr)
69. Consider 2 sets of points P0,P1 describing lines (2d) and a point p,
how to compute distance from p to each line i (P0[i],P1[i])? (★★★)
http://www.labri.fr/perso/nrougier/teaching/numpy.100/ 9/14
4/14/2018 100 numpy exercises
P0 = np.random.uniform(-10,10,(10,2))
P1 = np.random.uniform(-10,10,(10,2))
p = np.random.uniform(-10,10,( 1,2))
print(distance(P0, P1, p))
70. Consider 2 sets of points P0,P1 describing lines (2d) and a set of
points P, how to compute distance from each point j (P[j]) to each
line i (P0[i],P1[i])? (★★★)
Z = np.random.randint(0,10,(10,10))
shape = (5,5)
fill = 0
position = (1,1)
R = np.ones(shape, dtype=Z.dtype)*fill
P = np.array(list(position)).astype(int)
Rs = np.array(list(R.shape)).astype(int)
Zs = np.array(list(Z.shape)).astype(int)
R_start = np.zeros((len(shape),)).astype(int)
R_stop = np.array(list(shape)).astype(int)
Z_start = (P-Rs//2)
Z_stop = (P+Rs//2)+Rs%2
Z = np.arange(1,15,dtype=uint32)
R = stride_tricks.as_strided(Z,(11,4),(4,4))
print(R)
http://www.labri.fr/perso/nrougier/teaching/numpy.100/ 10/14
4/14/2018 100 numpy exercises
Z = np.random.uniform(0,1,(10,10))
U, S, V = np.linalg.svd(Z) # Singular Value Decomposition
rank = np.sum(S > 1e-10)
Z = np.random.randint(0,10,50)
print(np.bincount(Z).argmax())
75. Extract all the contiguous 3x3 blocks from a random 10x10 matrix
(★★★)
Z = np.random.randint(0,5,(10,10))
n = 3
i = 1 + (Z.shape[0]-3)
j = 1 + (Z.shape[1]-3)
C = stride_tricks.as_strided(Z, shape=(i, j, n, n), strides=Z.strides + Z.strides)
print(C)
class Symetric(np.ndarray):
def __setitem__(self, (i,j), value):
super(Symetric, self).__setitem__((i,j), value)
super(Symetric, self).__setitem__((j,i), value)
def symetric(Z):
return np.asarray(Z + Z.T - np.diag(Z.diagonal())).view(Symetric)
S = symetric(np.random.randint(0,10,(5,5)))
S[2,3] = 42
print(S)
77. Consider a set of p matrices wich shape (n,n) and a set of p vectors
with shape (n,1). How to compute the sum of of the p matrix
products at once? (result has shape (n,1)) (★★★)
p, n = 10, 20
M = np.ones((p,n,n))
V = np.ones((p,n,1))
S = np.tensordot(M, V, axes=[[0, 2], [0, 1]])
print(S)
# It works, because:
# M is (p,n,n)
# V is (p,n,1)
# Thus, summing over the paired axes 0 and 0 (of M and V independently),
# and 2 and 1, to remain with a (n,1) vector.
78. Consider a 16x16 array, how to get the block-sum (block size is
4x4)? (★★★)
Z = np.ones(16,16)
k = 4
S = np.add.reduceat(np.add.reduceat(Z, np.arange(0, Z.shape[0], k), axis=0),
np.arange(0, Z.shape[1], k), axis=1)
http://www.labri.fr/perso/nrougier/teaching/numpy.100/ 11/14
4/14/2018 100 numpy exercises
79. How to implement the Game of Life using numpy arrays? (★★★)
def iterate(Z):
# Count neighbours
N = (Z[0:-2,0:-2] + Z[0:-2,1:-1] + Z[0:-2,2:] +
Z[1:-1,0:-2] + Z[1:-1,2:] +
Z[2: ,0:-2] + Z[2: ,1:-1] + Z[2: ,2:])
# Apply rules
birth = (N==3) & (Z[1:-1,1:-1]==0)
survive = ((N==2) | (N==3)) & (Z[1:-1,1:-1]==1)
Z[...] = 0
Z[1:-1,1:-1][birth | survive] = 1
return Z
Z = np.random.randint(0,2,(50,50))
for i in range(100): Z = iterate(Z)
Z = np.arange(10000)
np.random.shuffle(Z)
n = 5
# Slow
print (Z[np.argsort(Z)[-n:]])
# Fast
print (Z[np.argpartition(-Z,n)[:n]])
def cartesian(arrays):
arrays = [np.asarray(a) for a in arrays]
shape = (len(x) for x in arrays)
ix = np.indices(shape, dtype=int)
ix = ix.reshape(len(arrays), -1).T
return ix
Author: Ryan G.
x = np.random.rand(5e7)
%timeit np.power(x,3)
1 loops, best of 3: 574 ms per loop
%timeit x*x*x
1 loops, best of 3: 429 ms per loop
http://www.labri.fr/perso/nrougier/teaching/numpy.100/ 12/14
4/14/2018 100 numpy exercises
%timeit np.einsum('i,i,i->i',x,x,x)
1 loops, best of 3: 244 ms per loop
84. Consider two arrays A and B of shape (8,3) and (2,2). How to find
rows of A that contain elements of each row of B regardless of the
order of the elements in B? (★★★)
A = np.random.randint(0,5,(8,3))
B = np.random.randint(0,5,(2,2))
85. Considering a 10x3 matrix, extract rows with unequal values (e.g.
[2,2,3]) (★★★)
Z = np.random.randint(0,5,(10,3))
E = np.logical_and.reduce(Z[:,1:] == Z[:,:-1], axis=1)
U = Z[~E]
print(Z)
print(U)
87. Given a two dimensional array, how to extract unique rows? (★★★)
Z = np.random.randint(0,2,(6,3))
T = np.ascontiguousarray(Z).view(np.dtype((np.void, Z.dtype.itemsize * Z.shape[1])))
_, idx = np.unique(T, return_index=True)
uZ = Z[idx]
print(uZ)
np.einsum('i->', A) # np.sum(A)
np.einsum('i,i->i', A, B) # A * B
np.einsum('i,i', A, B) # np.inner(A, B)
np.einsum('i,j', A, B) # np.outer(A, B)
http://www.labri.fr/perso/nrougier/teaching/numpy.100/ 13/14
4/14/2018 100 numpy exercises
phi = np.arange(0, 10*np.pi, 0.1)
a = 1
x = a*phi*np.cos(phi)
y = a*phi*np.sin(phi)
90. Given an integer n and a 2D array X, select from X the rows which
can be interpreted as draws from a multinomial distribution with n
degrees, i.e., the rows which only contain integers and which sum
to n. (★★★)
http://www.labri.fr/perso/nrougier/teaching/numpy.100/ 14/14