Founder at work

Master the skills to create and launch your next SaaS company

CS 10 Berkeley class notes

by Leave a Comment

Lecture 2:How 3D graphics works

  1. Films, television, print
  2. Video games
    1. million of polygons per seconds
  3. four stage pipeline
    1. modeling
    2. animation

Lecture 3:Video games

    1. Shigeru Miyamoto
      1. Donkey kong
      2. Super Mario bros
      3. Super Mario
      4. The legend of zelda
      5. DS, Wii

Lecture 4:Functions

  1. why are functions so great?
    1. if a function only depends on the information gets a input, then nothing else can affect the output
    2. it can run on any computer the same answer
    3. this makes incredibly easy to parallelize the function.
    4. functional programming is a great model for writing software that run in multiple machines  at the same time
  2. What is recursion?
    1. defining functions that use themselves to complete their own definition.
    2. function inside of another function f(g(x))

Lecture 5:Programming Paradigms lecture

  1. the way you interact when you programming
  2. what is a imperative programming?
    1. computation a series of steps
    2. mutation allowed
      1. changing variables
    3. like following a recipe
      1. harder way to think
      2. have to keep track of all things
  3. what is object-oriented programming (oop)
    1. Java C++
    2. objects as data structures
    3. classes & instances
    4. Inheritance saves code

Lecture 6:

    1. what is a algorithm?
      1. we have built them all time without knowing
      2. ceremonies
      3. recipes
      4. building instructions
    2. what are the three types of ways you can attack a problem?
      1. brute force
        1. keep trying stuff until something works
      2. top down
        1. divide the full problem up into smaller subproblems
      3. bottom up
        1. start with simple solutions and built up to complex ones
    3. what is a turing completeness language?
      1. a language that is turing complete can do anything that other turing complete languages can do.
      2. a language cannot be more powerful than turing complete language
      3. a language that can simulate a turing machine

Lecture 8:what is cloud computing?

  1. companies have their own clusters
    1. the owners of the clusters do not need all the computers
    2. rent out their computers
  2. John von Neumann
  3. What is moore’s law?
    1. predicts:2x transistors/chip every 2 years
    2. Moving in a exponential curve
    3. Heat created by the cpu
  4. what is amdahl’s law?
    1. a program can be broken into 2 parts
      1. parallel portion
      2. serial portion
        1. cant speed this processes anymore
  5. what is parallel programming?
    1. how to divide a program in a certain area.
    2. send the data around between processors
  6. what is a concurrency problem?
    1. a deadlock
    2. “two people need to draw a graph but there is only one pencil and one rule”
    3. Livelock also possible
      1. movement no progress
      2. infinite loop of being stuck

Lecture 9:what is Recursion?

  1. Fractal geometry
    1. when something creates something else and you leave it be
  2. an algorithmic technique where a function, in order to accomplish a task, calls itself with some part ofthe task.
    1. base case
    2. recursion cases
      1. divide
      2. invoke
      3. combine
  3. how can you trust the recursion?
    1. just as powerful as, easier
    2. divide and conquer

Lecture 11:Recursion part 2?

  1. fibonacci recursion
  2. counting change
    1. recursion *having a super good problem

Lecture 14: Computational Game theory