BaseCS Article Table of Contents

BaseCS is Computer Science content produced by Vaidehi Joshi

Scope

Broadly, this represents the most commonly referenced computer science topics especially within the context of engineering interviews:

• Strings
• Arrays
• Linked Lists
• Big O
• Hash Tables
• Binary Trees, BFS, DFS, BST, Heaps
• Sorting Algorithms
• Backtracking and Recursive Algorithms
• Bit Manipulation
• Stacks/Queues
• Dynamic Programming
• Greedy Algorithms
• Graphs

The BaseCS articles on these topics and more are covered below.

Fundamental Theory

• Bits and Bytes
• Hexes
• Set Theory
• Logarithms

Data Structures

• Linked Lists + Part 2
• Hash Tables
• Queues
• Stacks

Graphs

• Graph Theory
• Graphs
• BFS Graph Traversal
• DFS Graph Traversal
• Acyclic Graphs
• Königsberg

Trees

• Basics of Trees
• Leaf Overview
• Breadth-first Search
• Depth-first Search
• Heaps
• Tries
• Radix Trees
• AVL Trees
• Red-Black Trees
• B-Trees

Algorithms

• Hashing Algorithms
• Fibonacci

Sorting

• Sorting Algorithms Overview
• Selection Sort
• Bubble Sort
• Insertion Sort
• Merge Sort: Part One
  • Merge Sort: Part Two
• Quick Sort: Part One
  • Quick Sort: Part Two
• Heap Sort
• Counting Sort