The basecs series

A compiled, chronological list of content from the basecs series.

This series builds upon itself. It is recommended to read the content in order if you are new to computer science! 🙂 The basecs series was created with 💛 in 2017 by Vaidehi.

January

• Bits, Bytes, Building With Binary
• Hexes and Other Magical Numbers
• What’s a Linked List, Anyway? (Part 1)
• What’s a Linked List, Anyway? (Part 2)
• Stacks and Overflows

February

• To Queue Or Not To Queue
• How To Not Be Stumped By Trees
• Leaf It Up To Binary Trees
• Looking For The Logic Behind Logarithms

March

• A Gentle Introduction To Graph Theory
• Königsberg: Seven Small Bridges, One Giant Graph Problem

April

• Demystifying Depth-First Search
• Breaking Down Breadth-First Search
• Taking Hash Tables Off The Shelf
• Hashing Out Hash Functions

May

• Set Theory: the Method To Database Madness
• Sorting Out The Basics Behind Sorting Algorithms
• Exponentially Easy Selection Sort
• Bubbling Up With Bubble Sorts
• Inching Towards Insertion Sort

June

• Making Sense of Merge Sort (Part 1)
• Making Sense of Merge Sort (Part 2)
• Pivoting To Understand Quicksort (Part 1)
• Pivoting To Understand Quicksort (Part 2)

July

• Learning to Love Heaps
• Heapify All The Things With Heap Sort
• Counting Linearly With Counting Sort
• Getting To The Root Of Sorting With Radix Sort
• Trying to Understand Tries

August

• Compressing Radix Trees Without (Too Many) Tears
• The Little AVL Tree That Could
• Finding Fibonacci In Golden Trees
• Painting Nodes Black With Red-Black Trees

September

• Busying Oneself With B-Trees
• From Theory To Practice: Representing Graphs
• Going Broad In A Graph: BFS Traversal
• Deep Dive Through A Graph: DFS Traversal

October

• Spinning Around In Cycles With Directed Acyclic Graphs
• Finding The Shortest Path, With A Little Help From Dijkstra
• Less Repetition, More Dynamic Programming

November

• The Trials And Tribulations Of The Traveling Salesman
• Speeding Up The Traveling Salesman Using Dynamic Programming
• Grammatically Rooting Oneself With Parse Trees
• Reading Code Right, With Some Help From The Lexer

December

• Leveling Up One’s Parsing Game With ASTs
• A Deeper Inspection Into Compilation And Interpretation
• A Most Perfect Union: Just-In-Time Compilers

For even more basecs-related content, check out the basecs podcast!