Base.cs Podcast

✓

Påstand

Integrer denne søgefelt på dit websted

SØG BLANDT TIDLIGERE EPISODER

Søg efter gamle afsnit af Base.cs Podcast.

SIDSTE EPISODER 🔗

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

18. marts 2020

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…

00:21:57

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

11. marts 2020

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 level language (our source text) and converts it into machine code. However, it do…

00:19:51

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

4. marts 2020

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 by creating an abstract syntax tree (AST). Based on Vaidehi Joshi's blog post, "…

00:18:36

S9:E4 - "Confused about compilers?"

26. februar 2020

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 in to find out just how it does this! Based on Vaidehi Joshi's blog post, "Readi…

00:22:53

S9:E3 - "Parsing out parse trees"

19. februar 2020

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 Joshi's blog post, "Grammatically Rooting Oneself With Parse Trees". We're on Patreon…

00:23:14

S9:E2 - "Speeding up our traveling salesperson"

12. februar 2020

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 the same city where they starts their journey from, and do this in the most effici…

00:21:38

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

5. februar 2020

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 only once. Additionally, they need to end up in the same city where they starts t…

00:30:04

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

11. december 2019

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

00:19:04

S8:E7 - "Dynamic Programming is pretty dynamite "

4. december 2019

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 that it has seen and solved before so as not to repeat doing the same thing over aga…

00:21:38