filmov
tv
NumPy Explained - Full Course (3 Hrs)

Показать описание
Comprehensive course explaining Python NumPy. This course includes theory, examples, and practice problems.
0:00 - promo
0:24 - introduction
1:05 - 2.1 numpy array motivation
6:36 - 2.2 numpy array basics
12:48 - 2.3 creating numpy arrays
17:26 - 2.4 indexing 1d arrays
23:21 - 2.5 indexing multidimensional arrays
28:53 - 2.6 basic math on arrays
30:49 - 2.7 challenge: high school reunion
33:36 - 2.8 challenge: gold miner
36:31 - 2.9 challenge: chic-fil-a
41:12 - 3.1 broadcasting
46:11 - 3.2 newaxis
47:57 - 3.3 reshape()
52:33 - 3.4 boolean indexing
56:14 - 3.5 nan
57:31 - 3.6 infinity
59:04 - 3.7 random
1:10:12 - 3.8 challenge: love distance
1:13:10 - 3.9 challenge: professor prick
1:16:49 - 3.10 challenge: psycho parent
1:20:51 - 4.1 where()
1:24:11 - 4.2 math functions
1:26:35 - 4.3 all() and any()
1:27:40 - 4.4 concatenate()
1:29:00 - 4.5 stacking
1:32:59 - 4.6 sorting
1:37:17 - 4.7 unique()
1:38:50 - 4.8 challenge: movie ratings
1:41:45 - 4.9 challenge: big fish
1:44:46 - 4.10 challenge: taco truck
1:48:44 - 5.1 advanced array indexing
1:56:15 - 5.2 view vs copy
1:58:52 - 5.3 challenge: population verification
2:06:25 - 5.4 challenge: prime locations
2:10:27 - 5.5 challenge: the game of doors
2:16:22 - 5.6 challenge: peanut butter
2:22:41 - 6.1 as_strided()
2:26:24 - 6.2 einsum()
2:31:17 - 6.3 challenge: one-hot-encoding
2:35:08 - 6.4 challenge: cumulative rainfall
2:39:08 - 6.5 challenge: table tennis
2:47:34 - 6.6 challenge: wheres waldo
2:52:25 - 6.7 challenge: outer product
--- Code ------------------------
--- Vids & Playlists ----------------------------------
--- Subscribe To Mailing List ----------------------------------
--- Support ------------------------
0:00 - promo
0:24 - introduction
1:05 - 2.1 numpy array motivation
6:36 - 2.2 numpy array basics
12:48 - 2.3 creating numpy arrays
17:26 - 2.4 indexing 1d arrays
23:21 - 2.5 indexing multidimensional arrays
28:53 - 2.6 basic math on arrays
30:49 - 2.7 challenge: high school reunion
33:36 - 2.8 challenge: gold miner
36:31 - 2.9 challenge: chic-fil-a
41:12 - 3.1 broadcasting
46:11 - 3.2 newaxis
47:57 - 3.3 reshape()
52:33 - 3.4 boolean indexing
56:14 - 3.5 nan
57:31 - 3.6 infinity
59:04 - 3.7 random
1:10:12 - 3.8 challenge: love distance
1:13:10 - 3.9 challenge: professor prick
1:16:49 - 3.10 challenge: psycho parent
1:20:51 - 4.1 where()
1:24:11 - 4.2 math functions
1:26:35 - 4.3 all() and any()
1:27:40 - 4.4 concatenate()
1:29:00 - 4.5 stacking
1:32:59 - 4.6 sorting
1:37:17 - 4.7 unique()
1:38:50 - 4.8 challenge: movie ratings
1:41:45 - 4.9 challenge: big fish
1:44:46 - 4.10 challenge: taco truck
1:48:44 - 5.1 advanced array indexing
1:56:15 - 5.2 view vs copy
1:58:52 - 5.3 challenge: population verification
2:06:25 - 5.4 challenge: prime locations
2:10:27 - 5.5 challenge: the game of doors
2:16:22 - 5.6 challenge: peanut butter
2:22:41 - 6.1 as_strided()
2:26:24 - 6.2 einsum()
2:31:17 - 6.3 challenge: one-hot-encoding
2:35:08 - 6.4 challenge: cumulative rainfall
2:39:08 - 6.5 challenge: table tennis
2:47:34 - 6.6 challenge: wheres waldo
2:52:25 - 6.7 challenge: outer product
--- Code ------------------------
--- Vids & Playlists ----------------------------------
--- Subscribe To Mailing List ----------------------------------
--- Support ------------------------
Комментарии