Please enable JavaScript.

Coggle requires JavaScript to display documents.

Encora Apprentice Program: RESET Phase - Coggle Diagram

- - - - Syntax
      - Structure
      - Arrays
      - Maps
      - Lists
      - Function Declaration
      - Objects
    - - Memory
        
        Stack Memory
        
        Heap Memory
      - Recommender
        
        Apache Mahout
      - Package Manager
        
        Maven
    - - Machine Learning
        
        Types of ML
        
        Supervised Learning
        
        Unsupervised Learning
        
        Reinforced Learning
        
        ML Phases
        
        Gather Data
        
        Clean Data
        
        Model Training
        
        Model Validation
        
        Deployment
        
        Data
        
        Text
        
        Tables
        
        Pictures
        
        Videos
        
        Audio
    - - Front-End Dev
        
        Face of the Webpage
        
        HTML
        
        CSS
        
        JavaScript
        
        Frameworks (React, Angular, Vue)
        
        Client-Side
      - Back-End Dev
        
        Logic of the Webpage
        
        Python
        
        PHP
        
        Node.js
        
        C#
        
        Ruby
        
        Java
        
        Server-Side
      - Full-Stack Dev
        
        Both, Front and Back-End
  - - - Arrays
        
        Static
        
        Look up O(1)
        
        Push O(1)
        
        Insert O(n)
        
        Delete O(n)
        
        Dynamic
        
        Look up O(1)
        
        Append O(1)*
        
        Insert O(1)
        
        Delete O(n)
      - Hash Maps
        
        Space O(n)
        
        Insert O(1)
        
        Look up O(1)
        
        Delete O(1)
        
        Collision?
        
        Linked List
        
        Fast Access O(1), More Memory O(n)
      - Stacks
        
        Look up O(n)
        
        Pop O(1)
        
        Push O(1)
        
        Peek O(1)
        
        Array Stack
        
        Linked List Stack
      - Queues
        
        Look up O(n)
        
        Enqueue O(1)
        
        Dequeue O(1)
        
        Peek O(1)
        
        Array Queue
        
        Linked List Queue
      - Linked List
        
        Prepend O(1)
        
        Append O(1)
        
        Look up O(n)
        
        Insert O(n)
        
        Delete O(n)
    - - Binary Search
      - Linear Search
      - Quick Sort
    - - Time Complexity
      - Space Complexity
      - Constant O(1) - BEST
      - Logarithmic O(log n) - GOOD
      - Linear O(n) - FAIR
      - Superlinear O(nlog n) - BAD
      - Polynomial Time O(n^x) - WORST
      - Exponential Time O(x^n) - WORST
      - Factorial Time O(n!) - WORST
- - - - 1 Cue
      - 2 Craving
      - 3 Response
      - 4 Reward
    - - Make it obvious
      - Make it Attractive
      - Make it easy
      - Make it Satisfying
    - - Make it invisible
      - Make it unattractive
      - Make it difficult
      - Make it unsatisfying
  - - - Learn the other side of business
      - Find a Mentor
      - Be a Mentor
      - Practice, Practice, Practice
    - - Have an accomplishment each day
      - Learn to Fail
      - Learn to say NO
      - 8 hours, no more
    - - Choose carefully the technology
      - Learn supply & demand
      - Be the Worst
      - Take risks
    - - Tour guide approach
      - Learn to communicate
      - Make accomplishments in business language
      - Contribute to Open-Source
    - - Keep up to date
      - Catch the new big wave
      - Ask for reviews of yourself
      - Make improvements on yourself everyday