title

Base.cs Podcast

CodeNewbie

13
Followers
0
Plays
Base.cs Podcast
Base.cs Podcast

Base.cs Podcast

CodeNewbie

13
Followers
0
Plays
OVERVIEWEPISODESYOU MAY ALSO LIKE

Details

About Us

Beginner-friendly computer science lessons based on Vaidehi Joshi's base.cs blog series, produced by CodeNewbie.

Latest Episodes

S8:E1 - "Getting deep with depth-first search"

When going through a maze, hitting a dead end isn't always a bad thing, especially in depth-first search (DFS).

25 MIN1 days ago
Comments
S8:E1 - "Getting deep with depth-first search"

S7:E8 - "Delivering muffins with BFS"

Take a deep breath as we dive into breadth-first search, a super nifty graph traversing algorithm, which gives the shortest way to get from one node to another.

23 MINSEP 11
Comments
S7:E8 - "Delivering muffins with BFS"

S7:E7 - "Plotting to represent a graph? We got you."

Adjacency lists are the new type of hybrid you're going to want to be driving around your code.

24 MINSEP 4
Comments
S7:E7 - "Plotting to represent a graph? We got you."

S7:E6 - "It's laughable how easy it is to get graphical"

We tackle representing graphs and the parts that make it up.

21 MINAUG 28
Comments
S7:E6 - "It's laughable how easy it is to get graphical"

S7:E5 - "To b-tree or not to b-tree"

You won't want to miss the buzz about b-trees, the general version of a 2-3 tree, and a super efficient data storing tree structure.

16 MINAUG 21
Comments
S7:E5 - "To b-tree or not to b-tree"

S7:E4 - "A 2-3 tree for you and me"

We dive into a tree data structure that can contain more than one key, which is unlike any tree structure we've covered so far. It is also the reason for their name: 2-3 tree.

20 MINAUG 14
Comments
S7:E4 - "A 2-3 tree for you and me"

S7:E3 - "Color me logarithmic!"

If you thought self-balancing AVL trees were cool, just wait till you learn about red-black trees, which also run in logarithmic time!

23 MINAUG 7
Comments
S7:E3 - "Color me logarithmic!"

S7:E2 - "Stay gold, AVL tree, stay gold."

Listen and learn about a pattern that you can use to figure out the minimum number of nodes we’ll need to create any height-balanced AVL tree, how it leads us to the Fibonacci sequence, and the golden ratio.

18 MINJUL 31
Comments
S7:E2 - "Stay gold, AVL tree, stay gold."

S7:E1 - "The AVL balancing act"

We look at the earliest version of the height-balanced tree concept: the AVL tree.

23 MINJUL 24
Comments
S7:E1 - "The AVL balancing act"

S6:E8 - "Meet our good friend PATRICIA"

Take a listen as our binary "dog" barks up the PATRICIA tree.

27 MINJUN 19
Comments
S6:E8 - "Meet our good friend PATRICIA"

Latest Episodes

S8:E1 - "Getting deep with depth-first search"

When going through a maze, hitting a dead end isn't always a bad thing, especially in depth-first search (DFS).

25 MIN1 days ago
Comments
S8:E1 - "Getting deep with depth-first search"

S7:E8 - "Delivering muffins with BFS"

Take a deep breath as we dive into breadth-first search, a super nifty graph traversing algorithm, which gives the shortest way to get from one node to another.

23 MINSEP 11
Comments
S7:E8 - "Delivering muffins with BFS"

S7:E7 - "Plotting to represent a graph? We got you."

Adjacency lists are the new type of hybrid you're going to want to be driving around your code.

24 MINSEP 4
Comments
S7:E7 - "Plotting to represent a graph? We got you."

S7:E6 - "It's laughable how easy it is to get graphical"

We tackle representing graphs and the parts that make it up.

21 MINAUG 28
Comments
S7:E6 - "It's laughable how easy it is to get graphical"

S7:E5 - "To b-tree or not to b-tree"

You won't want to miss the buzz about b-trees, the general version of a 2-3 tree, and a super efficient data storing tree structure.

16 MINAUG 21
Comments
S7:E5 - "To b-tree or not to b-tree"

S7:E4 - "A 2-3 tree for you and me"

We dive into a tree data structure that can contain more than one key, which is unlike any tree structure we've covered so far. It is also the reason for their name: 2-3 tree.

20 MINAUG 14
Comments
S7:E4 - "A 2-3 tree for you and me"

S7:E3 - "Color me logarithmic!"

If you thought self-balancing AVL trees were cool, just wait till you learn about red-black trees, which also run in logarithmic time!

23 MINAUG 7
Comments
S7:E3 - "Color me logarithmic!"

S7:E2 - "Stay gold, AVL tree, stay gold."

Listen and learn about a pattern that you can use to figure out the minimum number of nodes we’ll need to create any height-balanced AVL tree, how it leads us to the Fibonacci sequence, and the golden ratio.

18 MINJUL 31
Comments
S7:E2 - "Stay gold, AVL tree, stay gold."

S7:E1 - "The AVL balancing act"

We look at the earliest version of the height-balanced tree concept: the AVL tree.

23 MINJUL 24
Comments
S7:E1 - "The AVL balancing act"

S6:E8 - "Meet our good friend PATRICIA"

Take a listen as our binary "dog" barks up the PATRICIA tree.

27 MINJUN 19
Comments
S6:E8 - "Meet our good friend PATRICIA"