Base.cs Podcast
Kanal-Details
Base.cs Podcast
Beginner-friendly computer science lessons based on Vaidehi Joshi's base.cs blog series, produced by CodeNewbie.
Neueste Episoden
73 Episoden
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 wha...
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 comp...
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 interpreter i...
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 metaphorical broo...
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 programming langu...
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 to understa...
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 an area,...
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 salesperso...
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 Fibonacci seq...
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 Algorithm, and th...
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...
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 wit...
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 c...
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 el...
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)...
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-first search...
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 search algori...
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 matrix, whic...
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 interconn...
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, and can...
S7:E4 - "A 2-3 tree for you and me"
We continue our discussion of tree data structures with 2-3 trees, where the nodes of every tree contain data in the form of keys, as well as potentia...
S7:E3 - "Color me logarithmic!"
In this episode, we are looking at a different type of self-balancing tree: red-black trees. By following four very important rules while we paint our...
S7:E2 - "Stay gold, AVL tree, stay gold"
Last episode, we learned about AVL trees, a type of self-balancing binary search tree that follows a golden rule: no single leaf in the tree should ha...
S7:E1 - "The AVL balancing act"
When you're dealing with data structures like trees, the balance of its "leaves" (data/nodes) matters. The moment a tree becomes unbalanced, it loses...
S6:E8 - "Meet our good friend PATRICIA"
In this episode, we continue our talk on Radix Trees and introduce the Practical Algorithm To Retrieve Information Coded In Alphanumeric trees, also k...
S6:E7 - "The cannibalistic efficiency of radix trees"
In this episode, join us as we adventure into the safari that is radix trees, where parent nodes eat their offspring nodes as they chomp them down and...
S6:E6 - "Dear tries, you (auto)complete me"
In this episode we continue our talk on pies and tries, and how this data structure is used to power such things as auto-complete! Based on Vaidehi Jo...
S6:E5 - "Tries: the golden retriever of data structures"
In this episode we go through some trie-als and tribulations to retrieve and build words using tries! Based on Vaidehi Joshi's blog post, "Trying to U...
S6:E4 - "Radix sort: the patient zero of sorting algorithms "
This episode we're diving into radix sort! The word has no relation to Raid, so it is definitely non-toxic and you don't have to bug out. It IS, howev...
S6:E3 - "You can count on counting sort"
You may have noticed that it's really hard to sort things efficiently. Well, that's where counting sort comes in! Based on Vaidehi Joshi's blog post,...
S6:E2 - "Getting to the bottom of the heap...sort."
We've gotten acquainted with heaps as arrays, now we're diving into heap sort with some help from a few condiments! Based on Vaidehi Joshi's blog post...
S6:E1 - "Heaps as arrays"
So we've talked about heaps, but how do you represent heaps as arrays? And why would you want to? We break it down step by step! Based on Vaidehi Josh...
S5:E8 - "Shrinking and growing heaps with cats"
Now that you've got your heap, what do you do with it? Shrink and grow it of course! We talk about how to add and remove values from a heap with the h...
S5:E7 - "A heap of heaps"
What are heaps? How are they related to binary trees? We use losers, winners, and some cards to help us get to the bottom of heaps! Based on Vaidehi J...
S5:E6 - "The big O of quicksort"
How does quicksort perform? And how do variables, like the pivot number, affect it? We walk through three examples to find out! Based on Vaidehi Joshi...
S5:E5 - "Quick sort Queendom"
We learn all about our second "divide and conquer" algorithm, quick sort! We walk through how it works with help from a queendom, a few pointers, and...
S5:E4 - "Merge sort stops the suckage"
Finally, a sorting algorithm that doesn't suck! We explore how merge sort works and why it performs better than insertion, bubble, and selection sort....
S5:E3 - "Sorting with insertion sort"
We dig into how insertion sort works, how we know where to do our inserting, and how this sorting algorithm performs, all with the help of our new boo...
S5:E2 - "What's bubble sort?"
We are super bubbly about bubble sort! We dig into our second sorting algorithm and break down how it works and why it's actually not a great way of s...
S5:E1 - "The simple selection sort"
What is selection sort? How does this algorithm work? And just as importantly, how does it perform? We use broken books and cookies to tell you all ab...