Base.cs Podcast

It is the end of the Base.cs series, so we answer some of your questions and take a look back at some of our favorite moments!

This episode is going to make you want to dance the JIT-ter Bug.

What are you going to choose, compilation or interpretation?

We get into abstract syntax trees, (usually just referred to as an AST), which is really nothing more than a simplified, condensed version of a parse tree.

We phase into understanding compilers by getting into phase one of how compilers work: lexical analysis.

What exactly is a the computer version of a “sentence”? And how do we go about diagramming it, exactly?

In our last episode we were a little disappointed that our salesperson was traveling in factorial time, so now we are speeding them up!

Make your salesperson the most efficient around by using the Hamiltonian path.

Get the memo and memoize!

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

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.

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

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

Traversing through a graph is pretty edgy.

To go about coding the depth-first search algorithm (DFS), we revisit an old friend: adjacency lists.