yeolyi.comSeongyeol's CS

Seongyeol's CS

Computer science, built up by hand from 0 and 1.

The English edition is in progress. Posts appear here as they are translated.

Information and Logic

Describing the world with 0 and 1

  1. Digital
  2. 0 and 1
  3. Boolean Algebra

Logic Gates

Building every decision from and, or, and not

  1. AND, OR, NOT Gates
  2. Sum of Products
  3. NAND

Combinational Circuits

Circuits whose answer depends only on the current input

  1. Multiplexer
  2. Decoder
  3. Half Adder
  4. Full Adder
  5. Ripple-Carry Adder
  6. Two's Complement

Sequential Circuits

Circuits that remember and move to a beat

  1. SR Latch
  2. D Latch
  3. Clock
  4. Flip-Flop
  5. Registers
  6. Register Files
  7. Memory
  8. Sequential Logic
  9. Traffic Lights
  10. Sequence Door Lock

A Programmable Machine

Changing the job with values in memory instead of wiring

  1. Stored Programs
  2. Instructions
  3. Machine Code

CPU

A computer completed one instruction at a time

  1. Moving Data
  2. Control Unit
  3. ALU
  4. Jump
  5. Call and Return
  6. Instruction Set
  7. Input and Output
  8. The Finished Computer
  9. Swapping Programs
  10. Assembly
  11. Pipelining

Memory

Making slow memory feel fast

  1. Locality
  2. Caches
  3. The Memory Hierarchy

C and the Compiler

How a C program becomes machine code

  1. High-level languages and compilers
  2. Variables

Algorithm Basics

Writing procedures and measuring their speed

  1. Time Complexity

Discrete Mathematics

Proving, counting, and dividing

  1. Proof
  2. Counting
  3. Probability
  4. Modular arithmetic
  5. GCD and Primes

Linear Data Structures

Containers that hold data in a line

  1. Arrays