Skip to content

Latest commit

 

History

History
72 lines (57 loc) · 1.56 KB

README.md

File metadata and controls

72 lines (57 loc) · 1.56 KB
Raw

Computer Science Compendium

I created this document as a way to solidify my CS fundementals, study for technical interviews, as well as practice LaTeX. My goal was to greatly simplify and classify the information; Providing common use cases, memorable diagrams, easy-to-folow pseudocode, and Big-O notation. The bulk of my research comes from CLRS and Cracking The Code Interview, and I refernce the page number in the column when possible.

I hope you'll find it as useful as I have. Enjoy!

Contents

Data Structures

  • Stacks
  • Queues
  • Linked Lists
  • Heaps
  • Hashtables

Sorting

  • MergeSort
  • QuickSort
  • HeapSort

Trees

  • Binary Search Trees
  • B-Trees
  • Tries
  • Radix Tree
  • Self-Balancing Trees
  • Bloom Filter

Bit Manipulation

  • Operations
  • Common Tasks

Graph Algorithms

  • Representation
  • Breadth-First Search
  • Depth First Search
  • Topological Sort
  • Minimum Spanning Tree
  • Dijsktra’s Algorithm
  • A*
  • Convex Hull
  • k-Means Clustering

Dynamic Programming

  • Top-down
  • Bottom-up

Systems

  • Scheduling
  • Threads
  • Locks
  • Condition Variables
  • Semaphores
  • Deadlocks

Cryptography

  • Assymetric Cryptosystems
  • Cryptographic Hash Functions
  • Security Attacks

Behavourial Questions

  • Project Questions
  • Weaknesses
  • Questions for Your Interviewer

Designing Algorithms

  • Five Algorithm Approaches
  • Design Patterns
  • Object-Oriented Design
  • Testing