65 episodes

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

# Base.cs Podcast CodeNewbie

• Technology

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

S8:E8 - "Memoizing all the things in dynamic programming"

## S8:E8 - "Memoizing all the things in dynamic programming"

Get the memo and memoize!

• 19 min
S8:E7 - "Dynamic Programming is pretty dynamite "

## S8:E7 - "Dynamic Programming is pretty dynamite "

"I will not repeat myself again." - Dynamic Programming

• 21 min
S8:E6 - "Getting deeper into Dijkastra"

## S8:E6 - "Getting deeper into Dijkastra"

We use Dijkstra's algorithm to find the shortest path from one node to another in a complicated house-shaped graph. Also, Vaidehi sings us a song.

• 29 min
S8:E5 - "Dijkstra's algorithm is a weighty topic"

## S8:E5 - "Dijkstra's algorithm is a weighty topic"

To get from one point to any other point in a graph, make Dijkstra your weapon of choice.

• 26 min
S8:E4 - "DAG, Daniel! Back at it again..."

## S8:E4 - "DAG, Daniel! Back at it again..."

DAG-nabbit! Don't forget to check whether or not a graph is a directed acyclic graph.

• 13 min
S8:E3 - "Living on the edge!"

## S8:E3 - "Living on the edge!"

Traversing through a graph is pretty edgy.

• 20 min