Please enable JavaScript.

Coggle requires JavaScript to display documents.

Learning Path (Math for Computer Science (Basic Proofs (How do I know when…

- - - - Directed
      - Networks
      - Simple
      - Planar
  - - - And
      - Or
- - - - Declarative Coding
      - Substitution Model
      - Conditionals
      - Expressions and Evaluation
    - - Syntactic Recursion vs Procedural Recursion
      - Procedural Recursion
        
        Linear Recursion
        
        Tree Recursion
      - Iteration
    - - Levels of Abstraction
      - Lists (sequences)
      - Hierarchies (recursive data)
      - Symbols
      - Sets
      - Data directed coding
      - Generic functions (overloading)
    - - Assignment
      - Environment Model of Evaluation
      - Mutable Data
        
        Lists
        
        Queues
        
        Tables
      - Concurrency
      - Streams, "Lazy" Coding
    - - Building an evaluator
    - - Designing register machines
      - Register machine simulators
      - Storage allocation and garbage collection
      - Explicit control evaluator
      - Compilation
- - - - Design Patterns
      - Coding with JavaScript
        
        Object Oriented
        
        Functional
      - Learning the language
      - Building Apps
        
        Mobile apps: React Native
        
        Data Layer / Backend: Flux
        
        Web apps: React
      - Problem Solving Practice
  - - - Real World Haskell
      - Learn You a Haskell
  - - - C
      - C++
      - C#
- - - - Insertion Sort
      - Selection Sort
      - Heap Sort
      - Merge Sort
      - Quick Sort
    - - Integer Arithmetic
      - Karatsuba Multiplication
    - - Trees
      - Unweighted
      - Weighted
    - - Monte Carlo
      - Hill Climbing
      - Simulated Annealing
    - - Common Growth Classifications
        
        O(n), Linear
        
        O(1), Constant
        
        O(n lg n), Superlinear
        
        O(n²), Polynomial
        
        O(2ⁿ), Exponential
        
        O(n!), Hella big
    - - P vs NP
      - Satisfiability
  - - - Linked List
      - Array
      - Hash Table
      - Graph
        
        Tree
        
        Red Black Tree
        
        Trie
        
        Binary Search Tree
        
        Other
        
        Adjacency Matrix
        
        Adjacency List
      - Heap
      - Bit Vector
    - - Dictionary
        
        Linked List
        
        Array
        
        Hash Table
        
        Tree
      - Priority Queue
        
        Heap
        
        Tree
      - Queue
        
        Linked List
        
        Array
      - Graph
        
        Adjacency List
        
        Adjacency Matrix
      - Set
        
        Bit Vector
        
        Dictionary
        
        Bloom Filter
        
        Linked List
      - Stack
        
        Linked List
        
        Array