rossedfort

Web Sockets Lesson Plan

• Fork this gist
• Include a link to your application's repo
• Your repo should have a link to your production app in the README
• Include questions/comments for anything you'd like us to specifically give you feedback on

The websockets homework is graded on 'completion' or 'semi-completion' - but we'll try to leave you feedback on anything we see that requires feedback in the gist.

Repository

rossedfort

1. Follow this Lesson Plan
2. Fork this gist
3. Include a link to your version in the gist fork
4. MY VERSION

rossedfort

• Fork this gist
• Complete this tutorial
• Include an inline link to your Creact repo
• Profit!
• INLINE LINK

rossedfort

##PROTIP: README Love

READMEs are AWESOME. They are one of the best things you can add to a repo, (other than quality code), to make it look professional.

####Things that make a README great:

• A link to the production site on heroku
• A screenshot (or a few) of what the app does (This is especially important if you don't have the production app up and running yet)
• Directions on how to clone or fork the repo and run it locally (explain it like you're explaining things to a totally new programmer)

rossedfort

• Watch Recursion
• Fork this gist
• Answer the following questions in your fork
  • Do you pronounce 'babel' in the same way?
    • No
    • Follow Up Question: Will you now?
      • Yes, bobble FTW
  • What is an example of why/where you might use recursion
• An example of when I would use recursion is if I had a linked list or tree-like data structure that I needed to parse. Instead of looping through every element of the data-set, I could use recursion to format it.

rossedfort

Step One: Watch Mary Rose Cook Live Codes Space Invaders from Front-Trends. (The second worst conference name ever?)

Step Two: Fork this gist.

Step Three: Respond to this question in your fork: What is one approach you can take from this Mary's code and implement in your project?

• One approach from Mary's implementation of space invaders that I could use in flappy bird was her use of the .filter() method for collision detection. It would be great for Flappy Bird because we are already instantiating our pipes as an array of nwe pipe objects. I think with some simple refactoring, we could improve upon our collision detection.

Step Four: Totally Optional: take a look at some of the other forks and comment if the spirit moves you.

rossedfort

Step One: Watch Writing Testable JavaScript - Rebecca Murphey from Full Frontal 2012 (award for worst conference name ever?)

Step Two: Fork this gist.

Step Three: Consider the four responsibilities that Rebecca lists for client side code (hint: they're color coded).

• Did any of the responsibilities that she lists surprise you?

  The part about application state surprised me a little bit, because it is not something I usually think about while writing client side code. It's not that I don't know it's a very important factor of client side code, it's just that I don't usually realize how it ties in to my application. For me, 'state' is an ambiguous concept that I don't fully understand.

• Do you feel like you mentally split your client side code in IdeaBox and other past projects into these responsibilities?

rossedfort

When you start working with WebPack for GameTime, you'll notice that you can't just define a variable in one file and find it in another as easily as you can in Rails.

Read Node.js, Require and Exports and Organize Your Code with RequireJS

Fork this gist and answer the following questions:

• In the context of Node, what is a module?

rossedfort

**Step One**: Watch [Sorting Algorithms in JavaScript](https://www.youtube.com/watch?v=uRyqlhjXYQI)

**Step Two**: Fork this gist.

**Step Three**: Respond to this question in your fork: "What are some of the balances and trade offs between different sorting algoritms?"

The most important things to think about when chosing a sorting algorithm are space and time.. OOoooOOoooOoo. By space I mean memory to perform calculations. And by time, I mean how long the sorting algorithm will take. Bubble sort is slow, but takes up little memory, and Merge sort is super fast, but takes up large chunks of memory to perform it's recursive functions. Insertion sort is right in the middle, which makes it desirable in some occasions. However, like most times in programming, the answer of which sorting algorithm to use, is 'it depends'

**Step Four**: _Totally Optional_: take a look at some of the other forks and comment if the spirit moves you. 

rossedfort

JavaScript Functions

I can explain the difference between function declarations and function expressions.

• yes

I can explain what the value of this is in a normal function.

• yes