2.6 KiB
2.6 KiB
Introduction
This short document outlines a path forwards for vastly increasing my knowledge of Computer Science Fundamentals for Mathematics. It includes an ordered list of TODOs which mimic the order in which one would approach learning mathematics from a high school to undergraduate college level of mathematics, specifically tailored for a Computer Science Degree. Obviously, this should be supplemented with books/homework. A list of helpful books is coming.
TODO:
- PreAlgrebra
- Intermediate Algebra
- Trigonometry
- Pre-Calculus
- Calculus I
- Calculus II
- Logic
- Sets and Functions
- Number Theory
- Graph Theory
- Combinatorics
- Discrete Probability
- Algorithms and Data Structures
- Discrete Mathematics
- Linear Algebra
- Probability and Statistics
VIDEO RESOURCES:
- Prealgebra (Full Length Videos)
- Professor Leonard Precalculus - College Algebra/Trigonometry
- Professor Leonard Calculus 1
- Professor Leonard Calculus 2
- Professor Leonard Calculus 3
- Math 125A -- Mathematical Logic
- Set Theory and Logic Lectures
- Discrete Math (Sets, Logic, Proofs, Relations, Counting, Number Theory, Functions)
- Introduction to number theory (Berkeley Math 115)
- MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 - MIT OpenCourseWare - English Version
- MIT 6.006 Introduction to Algorithms, Spring 2020
- Discrete Math (Full Course: Sets, Logic, Proofs, Probability, Graph Theory, etc)
- MIT 18.06SC Linear Algebra, Fall 2011
- Gilbert Strang lectures on Linear Algebra (MIT)
- Statistics 110: Probability