Introduction 0:54 to 15:11

  • a computer has a simplistic language: it either has or has not have electricity (maps to yes finger or no finger)
    • that language is binary, "bi" meaning two
  • in binary in computers, you only have two digits- zero and one because there is a direct mapping between power off (zero) and power on (one) or from electrons, battery, or the wall.
    • instead of a ones, tens, hundreds place, binary has ones, twos, fours, etc. place because computers use powers of 2
  • bits can be described as the amount of fingers to represent something
  • The system used to convert numbers to letters is ASCII, American Standard Code for Information Interchange (65 = A, 66 = B, etc.)
  • A letter in binary only needs the amount of bits needed for it (for example, you do not need to add an extra zero to 123 like 0123, because it still represents 123)
  • binary is considered "low-level" for solving problems (w/ zeros and ones), better if decimal at the least

Abstraction 15:03

  • abstraction is about taking low-level details and simplifying them and not "worry" of where the electricity is coming from ( my computer can represent zeros and ones, therefore it can represent numbers --> ASCII or letters)
  • ASCII uses 8 bits ultimately, so you can only represent 256 characters using ASCII with numbers, preventing the ability to represent more characters beyond that

Unicode 17:24

  • Can use one-four bytes with Unicode (eight-32 bits)to represent characters

RGB 18:54

  • Interprets binary as images
  • a pixel: one dot on the screen
  • By using the bytes Red, Green, and Blue, RGB determines how much of a color is shown in a pixel (and how much it is combined with the other colors)
  • range goes from 0 to 255 of

22:03 Movies?

  • Movies and videos are collections of images.
  • Movies --> Images --> Colors --> Bits --> Result of electricity coming in or transistors turning switches on and off.

23: 41 Algorithms

  • Input --> [ ] --> Output
  • Step-by-step action to solve a problem

30:09 Pseudo-code/Algorithm

  • Pseudo-code : English like syntax

31:09 Functions

  • A function is a specific step/action you take in order to do something (verbs, actions)

31:36 Conditions

  • "Branches" in the road (else, if,)

31:54 Booleans

  • Specific questions asked to make a decision (yes/no, true/false, one/zero) to decide which branch to go down

32:17 Loops

  • Induces a cycle or loop (e.x.: go back to step 2)

48:25 Unary...?

  • "Oldschool" hashmark approach

1:05:04 Libraries

  • Code that other humans wrote before that serves as a useful tool for future coders
apr 6 2019 ∞
may 24 2019 +