ICMC-USP

English

• Mairo Vergara
• Anki
• Grammarly

Roadmap Software Engineering

• Coding Interview University
• Teach Yourself CS
• wiki.icmc.usp.br

Algorithms and Data Structs

• Most Recommended Book
  • Algoritmos Teoria e Prática - Thomas H. Cormen
• YouTube
  • Linguagem C Programação Descomplicada :skull:
• Sites
  • GeeksForGeeks
  • AssemblyProgressivo.net
• Code Training
  • Project Euler
  • HackerRank
  • Edabit
  • URI Online Judge
• KhanAcademy
  • Computer Science
  • Notação assintótica
• Recursion :skull:
  • O que é recursão? Teste de Mesa com Fatorial - Softblue
• Data Structs Visualization
  • VisualGo
  • University of San Francisco - CS
• Work Hard, Have Fun & Make Things :smile: :heart: :baby:
  • RaspberryPi
  • Arduino
    • Brasilino - Uma biblioteca que permite programar em linguagem Arduino utilizando comandos facilitados em PT-BR.
  • MIT Scratch
  • Pico8
    • NerdyTeachers
    • NerdTeachers YouTube
  • CodeCombat
  • Code.org
  • CodeMonkey
  • MonkeyUser
  • VidaDeProgramador
  • VidaDeHipster
  • Onde Comprar?
    • FilipeFlop
• Big O
  • A beginner's guide to Big O notation
  • A coffee-break introduction to time complexity of algorithms
  • O(1) Constant Time
    • Best Case Possible
    • If an algorithm has a constant time, it means that it always takes the same amount time to produce the output.
    • Example: array.pop()
  • Logarithms O(log n)
    • Preferible in most of times
    • Logarithms are the inverse of exponentiation.
    • Example: Classic Binary search algorithm -> divide-to-conquer
  • Linear time O(n)
    • Preferible in most of times
    • If an algorithm has a linear time, it means that the running time of an algorithm grows as the input size grows.
    • Example: array.forEach() sum all values
  • Linear Logarithms O(n log n)
    • Acceptable
    复制

    x = n
    while ( x > 0 ) {
      y = x
      while ( y > 0 ) {
         y = y / 2
      }
      x = x - 1
    }

    • Example: classic merge sort -> divide-to-conquer
  • Quadratic time O(n²) :skull:
    • Nice To Avoid
    • The running time of an algorithm is directly proportional to the square of the size of the input.
    • Example: sum of matrizes
    复制

    for (var outer = 0; outer < elements.Count; outer++){
      for (var inner = 0; inner < elements.Count; inner++){
        ...
      }
    }

  • Exponential Time O(2^n) :skull: :skull:
    • Worst Case Possible, always try to avoid
    • Denotes an algorithm whose growth doubles with each additon to the input data set. The growth curve of an O(2N) function is exponential - starting off very shallow, then rising meteorically
    • Example: recursive calculation of Fibonacci numbers
    复制

    int Fibonacci(int number){
        if (number <= 1) return number;
        return Fibonacci(number - 2) + Fibonacci(number - 1);
    }

Unix

• Linux
  • Sites
    • Guia Foca
    • SS64 - Commands CLI References
    • Kernel.org
  • Apps
    • Linux Command Library
  • YoTube
    • Diolinux
    • Toca do Tux
    • Curso de Linux Básico / Certificação LPIC1
  • Tools
    • VirtualBox
    • Etcher - Flash OS images to SD cards & USB drives
    • Rufus.ie for Windows
    • WineHQ
    • Vim Para Noobs
    • Lutris.net :video_game:
    • $ sudo apt install zsnes :video_game:
    • $ sudo apt install playonlinux :video_game:
  • Operation System
    • Lubuntu - OS I Use and Recommend. Simple, Light and Usefull
• FreeBSD
  • Sites
    • Documentation PT-BR
  • Books
    • FreeBSD: O Poder dos Servidores em Suas Mãos - 2 Edição

Windows

• Sites
  • Baboo
  • Baboo Cursos
• Tools
  • Cmder

Security

• Sites
  • OWASP
  • EUGDPR.org
  • LGPD - Lei Geral de Proteção de Dados Pessoais
  • Livro - Fundamentos de Engenharia Reversa - Mente Binária
  • Forum CaveiraTech
• YouTube
  • Gabriel Pato
  • CaveiraTech
  • Curso de Engenharia Reversa Online - Papo Binário
• Courses
  • Fundamentos de Ethical Hacking - Udemy
  • Solyd
  • Técnicas de Invasão
  • Desenvolimento de Software Seguro - Curso Online Gratuito - ICA Instituto
• DAT Protocol
  • DatProject.org
  • Try Dat
• Database
  • World's fastest password cracker
    • HashCat
  • Recommended Data Encryption
    • Argon2
    • PBKDF2
    • Scrypt
    • BCrypt
  • NOT RECOMMENDED
    • MD5
    • SHA1-2-256
• Tools
  • Operation Systems
    • Kali Linux
    • Tails Linux
  • Virtual Machines for Pentest
    • PentesterLab
    • PentestBox
      • tools.pentestbox.org
  • Transport Layer Security/Secure Sockets Layer
    • Let's Encrypt
  • Softwares
    • WireShark
    • metasploit
    • DataBases
      • Exploit-DB
      • SQLMap
    • CLI
      • $ nmap site_url
      • $ traceroute site_url
      • $ curl site_url
      • $ whafw00f site_url
      • $ ping site_url
      • $ host site_url
      • $ whois site_url
    • Browser
      • DuckDuckGo
      • Bernes Lee Solid
      • Beaker Browser
      • TorProject
        • TheHiddenWiki

Functional Programming

• Aprender Haskell será um grande bem para você

Open Source

• Sites
  • OpenSource.org
  • OpenSource.Guide
  • Creative Commons
  • Scrum Poker Online
• Software
  • ERP - SigeLite
  • Audio - Audacity

Online Courses

• Udemy - Courses I'm enrolled
• Coursera - Learning How to Learn: Powerful Mental Tools to Help You Master Tough Subjects

Blogs

• Medium - A LOT
• Quora - A LOT
• Akita on Rails - A LOT
• Reddit - A LOT
• Rafael Falcon
• Hacker News
• Stalt
• JornadaPeloConhecimento
• Joel Spolsky OnSoftware
• WaitButWhy
• ThinkWithGoogle
• Hacks Mozilla
• Willian Justen
• Felipe Fialho
• Luiz Tools
• Henrique Bastos
• RockSeat
• Umbler Blog
• InfoQ
• WBruno
• Nateliason
• RamonSilva
• O Futuro Das Coisas
• Filipe Deschamps
• BugginhoAcademy
• Gabs Ferreira
• Jaydson Gomes
• Phil Calcado
• VidaDeSuporte
• TiagoGouvea
• VidaDeProgramador
• ProfissionaisTI

Nice Articles

• [O que é propósito de vida](https://mopora.com/artigos/o-que-e-proposito-de-vi