S8:E2 - "Jump around the indexes with DFS!"

Base.cs Podcast by Base.cs Podcast

Oct 23, 201900:24:51Technology

Last episode, we talked about traversing through a graph with the depth-first search (DFS) algorithm, which helps us determine one (of sometimes many) paths between two nodes in the graph by traversing down one single pa...

Related Episodes

Continue listening to more episodes from Base.cs Podcast.

S9:E8 - "In the end, the code you take is equal to the code you make"

Mar 25, 2020 - 00:26:17

For our final episode, we answer your burning questions including the Base.cs origin story, Saron and Vai...

S9:E7 - "This way to translate is le-JIT"

Mar 18, 2020 - 00:21:57

We've been talking a lot about the differences between compilers and interpreters, and how both of them w...

S9:E6 - "Two translators, both alike in dignity"

Mar 11, 2020 - 00:19:51

We have been talking a lot about compilers, and in this episode we discuss the differences between compil...

S9:E5 - "Paring down our parse trees with AST"

Mar 4, 2020 - 00:18:36

In this episode, we take our parse tree, an illustrated, pictorial version of the grammatical structure o...

S9:E4 - "Confused about compilers?"

Feb 26, 2020 - 00:22:53

In this episode, we get into what a compiler is and does. In short, a compiler is a program that reads ou...

S9:E3 - "Parsing out parse trees"

Feb 19, 2020 - 00:23:14

In this episode, we get into parse trees, an illustrated, pictorial version of the grammatical structure...

S9:E2 - "Speeding up our traveling salesperson"

Feb 12, 2020 - 00:21:38

We continue our journey with the Traveling Salesman Problem (TSP), where this we imagine a salesperson ha...

S9:E1 - "Take a journey with the Traveling Salesman"

Feb 5, 2020 - 00:30:04

We start our season off with something that often pops up in technical interviews: the Traveling Salesman...