Skip to content

Latest commit

 

History

History
215 lines (191 loc) · 17.6 KB

watchlist.md

File metadata and controls

215 lines (191 loc) · 17.6 KB

YouTube

Sometimes I watch YouTube videos on various software engineering topics to reinforce concepts encountered in other contexts and/or to pick up a new trick here and there.

Notes taken here are likely to be very sparse - this is intended to be a relatively low-key extracurricular study activity to kill time on the elliptical. In the spirit of the Dokugaku project, I mostly just want to keep a record of which videos I have watched so far.

Contents

Abdul Bari Algorithms

A well-regarded playlist on algorithms (link).

Started: 2022/01/27

Finished:

Watch Records / Notes

  • 2022/01/27: 1.0 Introduction to Algorithms
  • 2022/01/27: 1.1 Priori Analysis and Posteriori Testing
  • 2022/01/27: 1.2 Characteristics of Algorithm
  • 2022/01/27: 1.3 How Write and Analyze Algorithm
  • 2022/01/30: 1.4 Frequency Count Method
  • 2022/01/30: 1.5.1 Time Complexity #1
  • 2022/01/30: 1.5.2 Time Complexity Example #2
  • 2022/01/30: 1.5.3 Time Complexity of While and if #3
  • 2022/01/31: 1.6 Classes of functions
  • 2022/01/31: 1.7 Compare Class of Functions
  • 2022/01/31: 1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1
  • 2022/01/31: 1.8.2 Asymptotic Notations - Big Oh - Omega - Theta #2
  • 2022/01/31: 1.9 Properties of Asymptotic Notations
  • 2022/01/31: 1.10.1 Comparison of Functions #1
  • 2022/02/03: 1.10.2 Comparison of Functions #2
  • 2022/02/03: 1.11 Best Worst and Average Case Analysis
  • 2022/02/03: 1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find
  • 2022/02/03: 2 Divide And Conquer
  • 2022/02/04: 2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1
  • 2022/02/04: 2.1.2 Recurrence Relation (T(n)= T(n-1) + n) #2
  • 2022/02/04: 2.1.3 Recurrence Relation (T(n)= T(n-1) + log n) #3
  • 2022/02/04: 2.1.4 Recurrence Relation T(n)=2 T(n-1)+1 #4
  • 2022/02/04: 2.2 Masters Theorem Decreasing Function

Discrete Math

Logical Connectives and Compound Propositions

Predicates and Quantifiers

Sets and Set Operations

Styles of Proof

Relations

Functions

Sequences and Summation

Mathematical Induction

Integers

GCD's and the Euclidean Algorithm

Fundamental Theorem of Arithmetic

Modular Arithmetic

Permutations and Combinations

Inclusion-Exclusion Counting

Counting Using Recurrence Relations

Rust