Base.cs Podcast

We explore the world (forest?) of trees even further! We learn what a tree's depth and height are, why they're important, and why unbalanced trees can cause computational problems.

What's in a tree? And why do they always seem to pop up in computer science? We dig into the different parts of a tree, and how certain "tree truths" make them so special.

Where do we see queues in real life? We explore how queues are used in different parts of the tech stack, and help us do things like send email, create animations, and manage requests.

What's in a queue? And how does it relate to stacks? We explore what they do, how they work, and how to implement them.

Where do you see stacks in real life? We look at how browser histories, call stacks, and undo/redo functionality in blogging are implementations of a stack. We also dig into what exactly a stack is made of and how it operates.

Stack Overflow is an awesome resource, but it's also a real life technical thing! We dig into what causes a stack overflow and unpack the rules of creating and working with stacks.

Big O Notation can be scary. But it doesn't have to be! We unpack this popular cs topic and show you how to use it to evaluate different data structures (like linked lists!) and make better programming decisions.

You may be familiar with arrays and hashes and variables, but how much do you know about linked lists? We dig into what they are, how they work, and the pros and cons of using this popular data structure.

Vaidehi and Saron walk through how to count in hexes, discuss where we might see the hexadecimal system in real life, and breakdown the math that makes number 16 so special.

Vaidehi and Saron walk through how to count in hexes, discuss where we might see the hexadecimal system in real life, and breakdown the math that makes number 16 so special.