Base.cs Podcast

Episodes page 1 of 2

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

   25 Mar 2020 · 26 min

   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…

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

   18 Mar 2020 · 22 min

   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…

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

   11 Mar 2020 · 20 min

   We have been talking a lot about compilers, and in this episode we discuss the differences between compilation versus interpretation. An interpreter is also a translator, just like a compiler, in that it takes a high…

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

   4 Mar 2020 · 19 min

   In this episode, we take our parse tree, an illustrated, pictorial version of the grammatical structure of a sentence, and we take a metaphorical broom to sweep away repetitive bits, sliming it down, and leveling it up…

5. S9:E4 - "Confused about compilers?"

   26 Feb 2020 · 23 min

   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 language), and translates it into another language. You'll want to listen…

6. S9:E3 - "Parsing out parse trees"

   19 Feb 2020 · 23 min

   In this episode, we get into parse trees, an illustrated, pictorial version of the grammatical structure of a sentence, which is important to understanding how computers understand coding syntax. Based on Vaidehi…

7. S9:E2 - "Speeding up our traveling salesperson"

   12 Feb 2020 · 22 min

   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, visiting each city only once. Additionally, they need to end up in…

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

   5 Feb 2020 · 30 min

   We start our season off with something that often pops up in technical interviews: the Traveling Salesman Problem (TSP). In this problem, a salesperson has to travel to every single city in an area, visiting each city…

9. S8:E8 - "Memoizing all the things in dynamic programming"

   11 Dec 2019 · 19 min

   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 sequence! Based on Vaidehi Joshi's blog post, "Less Repetition, More…

10. S8:E7 - "Dynamic Programming is pretty dynamite "

    4 Dec 2019 · 22 min

    In this episode we talk about different paradigms and approaches to algorithmic design: the Divide and Conquer Algorithm, the Greedy Algorithm, and the Dynamic Programming Algorithm, which remembers the subproblems…

11. S8:E6 - "Getting deeper into Dijkastra"

    20 Nov 2019 · 29 min

    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…

12. S8:E5 - "Dijkstra's algorithm is a weighty topic"

    13 Nov 2019 · 26 min

    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…

13. S8:E4 - "DAG, Daniel! Back at it again..."

    6 Nov 2019 · 13 min

    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…

14. S8:E3 - "Living on the edge!"

    29 Oct 2019 · 21 min

    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…

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

    23 Oct 2019 · 25 min

    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…

16. S8:E1 - "Getting deep with depth-first search"

    16 Oct 2019 · 26 min

    We ended last season by starting our discussion of searching, or traversing, through a graph with breadth-first search (BFS). The breadth-first search algorithm traverses broadly into a structure, by visiting…

17. S7:E8 - "Delivering muffins with BFS"

    11 Sep 2019 · 23 min

    In this episode, we start our discussion of searching, or traversing, through a graph with breadth-first search (BFS). The breadth-first search algorithm traverses broadly into a structure, by visiting neighboring…

18. S7:E7 - "Plotting to represent a graph? We got you."

    4 Sep 2019 · 25 min

    In this episode, we continue our discussion of representing graphs with adjacency lists -- a hybrid between an edge list and an adjacency matrix, which we learned about last episode! They are also the most popular and…

19. S7:E6 - "It's laughable how easy it is to get graphical"

    28 Aug 2019 · 21 min

    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 interconnected (this is all stuff you should already know if you have been…

20. S7:E5 - "To b-tree or not to b-tree"

    21 Aug 2019 · 17 min

    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 contain more than one key. This takes us to b-trees, which is a…

21. S7:E4 - "A 2-3 tree for you and me"

    14 Aug 2019 · 20 min

    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 potential child nodes. Not only that, but it can contain MORE THAN ONE KEY.…

22. S7:E3 - "Color me logarithmic!"

    7 Aug 2019 · 23 min

    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 tree red and black, we can make it not only self-balancing, but…

23. S7:E2 - "Stay gold, AVL tree, stay gold"

    31 Jul 2019 · 18 min

    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 have a significantly longer path from the root node than any other…

24. S7:E1 - "The AVL balancing act"

    24 Jul 2019 · 23 min

    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 its efficiency, much like a real life tree bending to the weight of…

25. S6:E8 - "Meet our good friend PATRICIA"

    19 Jun 2019 · 27 min

    In this episode, we continue our talk on Radix Trees and introduce the Practical Algorithm To Retrieve Information Coded In Alphanumeric trees, also known as PATRICIA trees. Yeah, I think we'll just stick with calling…

26. S6:E7 - "The cannibalistic efficiency of radix trees"

    12 Jun 2019 · 23 min

    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 compress. Don't worry, with all of this new added space in the…

27. S6:E6 - "Dear tries, you (auto)complete me"

    5 Jun 2019 · 23 min

    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 Joshi's blog post, "Trying to Understand Tries". We're on Patreon!…

28. S6:E5 - "Tries: the golden retriever of data structures"

    29 May 2019 · 19 min

    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 Understand Tries". We're on Patreon! If you like the show and want…

29. S6:E4 - "Radix sort: the patient zero of sorting algorithms "

    22 May 2019 · 27 min

    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, however, a great integer sorting algorithm, and the first one at that!…

30. S6:E3 - "You can count on counting sort"

    15 May 2019 · 30 min

    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, "Counting Linearly With Counting Sort". We're on Patreon! If you…

31. S6:E2 - "Getting to the bottom of the heap...sort."

    8 May 2019 · 25 min

    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, "Heapify All The Things With Heap Sort". We're on Patreon! If…

32. S6:E1 - "Heaps as arrays"

    1 May 2019 · 17 min

    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 Joshi's blog post, "Learning to Love Heaps". We're on Patreon! If you…

33. S5:E8 - "Shrinking and growing heaps with cats"

    3 Apr 2019 · 17 min

    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 help of a few cats. Based on Vaidehi Joshi's blog post, "Learning to…

34. S5:E7 - "A heap of heaps"

    27 Mar 2019 · 22 min

    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 Joshi's blog post, "Learning to Love Heaps". We're on Patreon! If…

35. S5:E6 - "The big O of quicksort"

    20 Mar 2019 · 29 min

    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's blog post, "Pivoting To Understand Quicksort [Part 2]". We're on…

36. S5:E5 - "Quick sort Queendom"

    13 Mar 2019 · 29 min

    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 a very helpful pivot number. Based on Vaidehi Joshi's blog post,…

37. S5:E4 - "Merge sort stops the suckage"

    5 Mar 2019 · 26 min

    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. Based on Vaidehi Joshi's blog post, "Making Sense of Merge Sort ".…

38. S5:E3 - "Sorting with insertion sort"

    27 Feb 2019 · 19 min

    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 boos. Based on Vaidehi Joshi's blog post, "Inching Towards Insertion…

39. S5:E2 - "What's bubble sort?"

    20 Feb 2019 · 24 min

    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 sorting things. Based on Vaidehi Joshi's blog post, "Bubbling Up With…

40. S5:E1 - "The simple selection sort"

    13 Feb 2019 · 23 min

    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 about it! Based on Vaidehi Joshi's blog post, "Exponentially Easy…

41. S4:E8 - "The Saron Sort"

    19 Dec 2018 · 26 min

    We're at the end of the season! And to wrap things up, we're breaking down the last two ways to classify sorting algorithms: recursive vs. non-recursive and comparison vs. non-comparison. We bring it all together to…

42. S4:E7 - "Sorting the Michaels"

    12 Dec 2018 · 24 min

    Last week, we talked about two ways of classifying sorting algorithms: time complexity and space usage. This episode, we dig into two more! We explore how algorithms can be internal or external, and what "stability"…

43. S4:E6 - "It's sorting time!"

    5 Dec 2018 · 25 min

    You probably sort things all the time -- files, clothes, dishes. But have you thought about how to categorize your sorting? How do your sorting algorithms hold up in terms of, say, time complexity? We give you an…

44. S4:E5 - "Sets, sets, everywhere"

    28 Nov 2018 · 25 min

    Sets are everywhere! If you've worked with relational databases, made a venn diagram, maybe touched some relational algebra, then you've already worked with sets. We talk about why they're so common, how well they…

45. S4:E4 - "Varon explains set theory"

    21 Nov 2018 · 18 min

    Set theory might sound like a scary, super-math thing, but it's not! Well, it is a math thing, but it doesn't have to be super scary. In fact, if you already know how venn diagrams work, then you basically already know…

46. S4:E3 - "Chaining to the rescue!"

    14 Nov 2018 · 27 min

    We're back in our hash table classroom with our multiple Brians that need their own tables! But don't you worry, we've got a brand new collision resolution called chaining to help us out. We talk about how it works and…

47. S4:E2 - "Too many Brians at the (hash)table"

    7 Nov 2018 · 21 min

    School is in session, and the teacher is directing students to their assigned seat. Each unique name gets its own unique table. But there's an unexpected student in the class. There's another Brian! What do we do?! In…

48. S4:E1 - "Gotta hash 'em all"

    31 Oct 2018 · 25 min

    We're kicking off a new season with a brand new topic: hash tables! This episode is full of bookshelves, pizza toppings, and helpful fridge operators who are teaming up to give you the most gentle (and the most fun)…

49. S3:E8 - "BFS is your BFF"

    10 Oct 2018 · 25 min

    Let's break down how breadth-first search (BFS) actually works! We'll walk through a real example, explain the Big O notation of this algorithm, and explore how you might decide whether to use breadth-first search or…

50. S3:E7 - "Getting in line for breadth-first search"

    3 Oct 2018 · 27 min

    We're going broad with breadth-first search! Well, actually, we're getting in line, or enqueuing ;) We walk through the steps of how breadth-first search (BFS) works, complete with holiday themed analogies and…