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 sometimes many) paths between two nodes in the graph by traversing down one single path until we can't go any further, checking one child node at a time. Now we tal…
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 edges, the elements that connect the nodes in a graph. In this episode, we look at the different classifications of edges and how, in the context of a graph, edge…
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 search will check to see if any cycles exist, and a large part of that is based on the DFS algorithm checking to see whether or not a graph is a directed acyclic …
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 other node within the same graph data structure, provided that the nodes are reachable from the starting node. It's super important, and you'll see why when you le…
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 node within the same graph data structure, provided that the nodes are reachable from the starting node. Based on Vaidehi Joshi's blog post, "Finding The Shortes…
S9: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 — the compiler — to lead to the creation of the other — the interpreter. Now we get into the Just In Time compiler, or a JIT, which is fusion or combination of…
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 structure, and what are some good resources to check out next. We also take a look back at some of our favorite moments from the show's history, and find a couple of f…
Empathizing too much with your code (featuring Vaidehi Joshi)
Max and Vaidehi talk about doggedly continuing to learn new things and the challenges of sharing them
21: Overcoming Leader Burnout with Vimeo’s Engineering Manager, Vaidehi Joshi
Management has the power to both embolden us, or burn us out.
It’s a very real danger, and we’re all more aware of it thanks to growing awareness of mental wellbeing, but Vimeo’s Vaidehi Joshi knows first hand how to overcome leader burnout.
Vaidehi joins Suzan for this week’s Leaders Unscripted, t…
#012 – Learning Compilers with Cartoons with Vaidehi Joshi
Vaidehi Joshi started BaseCS to document her self-guided journey into computer science. It turned into a much-loved blog, podcast, and video series.
Vaidehi is an engineer at Tilde, in Portland, Oregon, where she works on Skylight (a smart profiler for Ruby and Rails applications). She enjoys buil…
팟캐스트 검색 엔진
당사 웹사이트를 사용하여3,821,620팟캐스트 및195,400,438에피소드를 사람, 장소 또는 주제별로 검색할 수 있습니다.
지식에 대한 투자가 가장 큰 이익을 주기에 저는 팟캐스트를 듣습니다.
‐ Benjamin "Llamacorn" Franklin
