S9:E8 - "In the end, the code you take is equal to the code you make"
For our final episode, we answer your burning questions including the Base.cs origin story, Saron and Vaidehi's favorite niche data structur...
Radio and PodcastLive Radio & PodcastsTechnology
Base.cs Podcast
Beginner-friendly computer science lessons based on Vaidehi Joshi's base.cs blog series, produced by CodeNewbie.
Episodes
20 of 73 episodesS9:E7 - "This way to translate is le-JIT"
We've been talking a lot about the differences between compilers and interpreters, and how both of them work, and the ways that allowed one...
S9:E6 - "Two translators, both alike in dignity"
We have been talking a lot about compilers, and in this episode we discuss the differences between compilation versus interpretation. An int...
S9:E5 - "Paring down our parse trees with AST"
In this episode, we take our parse tree, an illustrated, pictorial version of the grammatical structure of a sentence, and we take a metapho...
S9:E4 - "Confused about compilers?"
In this episode, we get into what a compiler is and does. In short, a compiler is a program that reads our code (or any code, in any program...
S9:E3 - "Parsing out parse trees"
In this episode, we get into parse trees, an illustrated, pictorial version of the grammatical structure of a sentence, which is important t...
S9:E2 - "Speeding up our traveling salesperson"
We continue our journey with the Traveling Salesman Problem (TSP), where this we imagine a salesperson has to travel to every single city in...
S9:E1 - "Take a journey with the Traveling Salesman"
We start our season off with something that often pops up in technical interviews: the Traveling Salesman Problem (TSP). In this problem, a...
S8:E8 - "Memoizing all the things in dynamic programming"
In this last episode of the season we continue our discussion of dynamic programming, and show just how efficient it can be by using the Fib...
S8:E7 - "Dynamic Programming is pretty dynamite "
In this episode we talk about different paradigms and approaches to algorithmic design: the Divide and Conquer Algorithm, the Greedy Algorit...
S8:E6 - "Getting deeper into Dijkastra"
We continue our talk about Dijkstra's algorithm, which can be used to determine the shortest path from one node in a graph to every other no...
S8:E5 - "Dijkstra's algorithm is a weighty topic"
In this episode, we talk about Dijkstra's algorithm, which can be used to determine the shortest path from one node in a graph to every othe...
S8:E4 - "DAG, Daniel! Back at it again..."
We end our section of the DFS algorithm with a discussion on DAGs (directed acyclic graphs), because most implementations of depth-first sea...
S8:E3 - "Living on the edge!"
Throughout our exploration of graphs, we’ve focused mostly on representing graphs, and how to search through them. We also learned about edg...
S8:E2 - "Jump around the indexes with DFS!"
Last episode, we talked about traversing through a graph with the depth-first search (DFS) algorithm, which helps us determine one (of somet...
S8:E1 - "Getting deep with depth-first search"
We ended last season by starting our discussion of searching, or traversing, through a graph with breadth-first search (BFS). The breadth-fi...
S7:E8 - "Delivering muffins with BFS"
In this episode, we start our discussion of searching, or traversing, through a graph with breadth-first search (BFS). The breadth-first sea...
S7:E7 - "Plotting to represent a graph? We got you."
In this episode, we continue our discussion of representing graphs with adjacency lists -- a hybrid between an edge list and an adjacency ma...
S7:E6 - "It's laughable how easy it is to get graphical"
Graphs come from mathematics, and are nothing more than a way to formally represent a network, which is a collection of objects that are all...
S7:E5 - "To b-tree or not to b-tree"
In last episode, we talked about 2-3 trees, where the nodes of every tree contain data in the form of keys, as well as potential child nodes...