Leaves One

Alan Richard's Blog

TODO List for Self-taught Computer Science

TODO List

  • 🔋 Assembly (WangShuang)
    • [Chapter 1] Basic Knowledge
    • [Chapter 2] Registers
    • [Chapter 3] Registers (Memory Access)
    • [Chapter 4] The First Program
    • [Chapter 5] [BX] & LOOP Instructions
    • [Chapter 6] Program with Multiple Segments
    • [Chapter 7] A More Flexible Method for Locating Memory Address
    • [Chapter 8] Two Basic Problems In Data Processing
    • [Chapter 9] Principles of Branch Instructions
    • [Chapter 10] CALL & RET Instructions
    • [Chapter 11] The “FLAGS” Register
    • [Chapter 12] Internal Interrupt
    • [Chapter 13] INT instruction
    • [Chapter 14] Ports
    • [Chapter 15] External Interrupt
    • [Chapter 16] Direct Addressing Table
    • [Chapter 17] Keyboard Input & Disk I/O Using BIOS
    • [Chapter 18] Comprehensive Research
  • 🔋 Mathematics for Computer Science (Discrete Mathematics) (MIT 6.042J)
    • Unit 1: Proofs
      • [1.1] Intro To Proofs
      • [1.2] Proof Methods
      • [1.3] Well Ordering Principle
      • [1.4] Logic & Propositions
      • [1.5] Quantifiers & Predicate Logic
      • [1.6] Sets
      • [1.7] Binary Relations
      • [1.8] Induction
      • [1.9] State Machines - Invariants
      • [1.10] Recursive Definition
      • [1.11] Infinite Sets
    • Unit 2: Structures
      • [2.1] GCDs
      • [2.2] Congruences
      • [2.3] Euler’s Theorem
      • [2.4] RSA Encryption
      • [2.5] Digraphs: Walks & Paths
      • [2.6] Directed Acyclic Graphs (Dags) & Scheduling
      • [2.7] Partial Orders And Equivalence
      • [2.8] Degrees & Isomorphism
      • [2.9] Coloring & Connectivity
      • [2.10] Trees
      • [2.11] Stable Matching
    • Unit 3: Counting
      • [3.1] Sums & Products
      • [3.2] Asymptotics
      • [3.3] Counting With Bijections
      • [3.4] Repetitions & Binomial Theorem
      • [3.5] Pigeonhole Principle, Inclusion-Exclusion
    • Unit 4: Probability
      • [4.1] Intro To Discrete Probability
      • [4.2] Conditional Probability
      • [4.3] Independence & Causality
      • [4.4] Random Variables, Density Functions
      • [4.5] Expectation
      • [4.6] Deviation: Markov & Chebyshev Bounds
      • [4.7] Sampling & Confidence
      • [4.8] Random Walks & Pagerank
  • Introduction to Computer Systems (CMU 15-213)
  • Computation Structures (MIT 6.004)
  • Introduction to Algorithms (MIT 6.006)
  • Data Structures (UCB CS61B)
  • Databases Systems (CMU 15-445/645)
  • Distributed Computer Systems Engineering (MIT 6.824)

Notes

Jun 25, 2021

Again, the final exam preparation has begun, and these days are rife with outdoor practices e.g. terrain survey (which has nothing to do with computer science).

Apr 21, 2021

Code of labs written by me for Assembly (WangShuang) is published at: https://github.com/richardhyy/AssemblyLab

Apr 6, 2021
Several mid-term exams are approaching in the college, so I will be left little time for self-taught CS these days because of the heavy work load from my major.