Home
Categories
EXPLORE
True Crime
Comedy
Business
Society & Culture
Health & Fitness
Sports
Technology
About Us
Contact Us
Copyright
© 2024 PodJoint
00:00 / 00:00
Podjoint Logo
US
Sign in

or

Don't have an account?
Sign up
Forgot password
https://is1-ssl.mzstatic.com/image/thumb/Podcasts123/v4/45/89/41/458941df-5fcb-6da6-5531-f4803c74fa45/mza_429193314674687027.png/600x600bb.jpg
Base.cs Podcast
CodeNewbie
73 episodes
9 months ago
Beginner-friendly computer science lessons based on Vaidehi Joshi's base.cs blog series, produced by CodeNewbie.
Show more...
Technology
Tech News
RSS
All content for Base.cs Podcast is the property of CodeNewbie and is served directly from their servers with no modification, redirects, or rehosting. The podcast is not affiliated with or endorsed by Podjoint in any way.
Beginner-friendly computer science lessons based on Vaidehi Joshi's base.cs blog series, produced by CodeNewbie.
Show more...
Technology
Tech News
Episodes (20/73)
Base.cs Podcast
S9:E8 - "In the end, the code you take is equal to the code you make"
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!
Show more...
5 years ago
26 minutes 17 seconds

Base.cs Podcast
S9:E7 - "This way to translate is le-JIT"
This episode is going to make you want to dance the JIT-ter Bug.
Show more...
5 years ago
21 minutes 57 seconds

Base.cs Podcast
S9:E6 - "Two translators, both alike in dignity"
What are you going to choose, compilation or interpretation?
Show more...
5 years ago
19 minutes 51 seconds

Base.cs Podcast
S9:E5 - "Paring down our parse trees with AST"
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.
Show more...
5 years ago
18 minutes 36 seconds

Base.cs Podcast
S9:E4 - "Confused about compilers?"
We phase into understanding compilers by getting into phase one of how compilers work: lexical analysis.
Show more...
5 years ago
22 minutes 53 seconds

Base.cs Podcast
S9:E3 - "Parsing out parse trees"
What exactly is a the computer version of a “sentence”? And how do we go about diagramming it, exactly?
Show more...
5 years ago
23 minutes 14 seconds

Base.cs Podcast
S9:E2 - "Speeding up our traveling salesperson"
In our last episode we were a little disappointed that our salesperson was traveling in factorial time, so now we are speeding them up!
Show more...
5 years ago
21 minutes 38 seconds

Base.cs Podcast
S9:E1 - "Take a journey with the Traveling Salesman"
Make your salesperson the most efficient around by using the Hamiltonian path.
Show more...
5 years ago
30 minutes 4 seconds

Base.cs Podcast
S8:E8 - "Memoizing all the things in dynamic programming"
Get the memo and memoize!
Show more...
5 years ago
19 minutes 4 seconds

Base.cs Podcast
S8:E7 - "Dynamic Programming is pretty dynamite "
"I will not repeat myself again." - Dynamic Programming
Show more...
5 years ago
21 minutes 38 seconds

Base.cs Podcast
S8:E6 - "Getting deeper into Dijkastra"
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.
Show more...
5 years ago
29 minutes 23 seconds

Base.cs Podcast
S8:E5 - "Dijkstra's algorithm is a weighty topic"
To get from one point to any other point in a graph, make Dijkstra your weapon of choice.
Show more...
5 years ago
26 minutes 7 seconds

Base.cs Podcast
S8:E4 - "DAG, Daniel! Back at it again..."
DAG-nabbit! Don't forget to check whether or not a graph is a directed acyclic graph.
Show more...
5 years ago
13 minutes 25 seconds

Base.cs Podcast
S8:E3 - "Living on the edge!"
Traversing through a graph is pretty edgy.
Show more...
6 years ago
20 minutes 54 seconds

Base.cs Podcast
S8:E2 - "Jump around the indexes with DFS!"
To go about coding the depth-first search algorithm (DFS), we revisit an old friend: adjacency lists.
Show more...
6 years ago
24 minutes 51 seconds

Base.cs Podcast
S8:E1 - "Getting deep with depth-first search"
When going through a maze, hitting a dead end isn't always a bad thing, especially in depth-first search (DFS).
Show more...
6 years ago
25 minutes 34 seconds

Base.cs Podcast
S7:E8 - "Delivering muffins with BFS"
Take a deep breath as we dive into breadth-first search, a super nifty graph traversing algorithm, which gives the shortest way to get from one node to another.
Show more...
6 years ago
23 minutes 1 second

Base.cs Podcast
S7:E7 - "Plotting to represent a graph? We got you."
Adjacency lists are the new type of hybrid you're going to want to be driving around your code.
Show more...
6 years ago
24 minutes 37 seconds

Base.cs Podcast
S7:E6 - "It's laughable how easy it is to get graphical"
We tackle representing graphs and the parts that make it up.
Show more...
6 years ago
21 minutes 4 seconds

Base.cs Podcast
S7:E5 - "To b-tree or not to b-tree"
You won't want to miss the buzz about b-trees, the general version of a 2-3 tree, and a super efficient data storing tree structure.
Show more...
6 years ago
16 minutes 50 seconds

Base.cs Podcast
Beginner-friendly computer science lessons based on Vaidehi Joshi's base.cs blog series, produced by CodeNewbie.