kchia

NYCDA JULY'17 PTWDI PROJECTS

Cart-o-grapher

Raymond Metrulis, Sean McNeeley, Mikhal Misenas

• Demo: N/A
• Github: https://github.com/MangoMartin/cart-o-grapher

Daddy’s Watching

Nethanel Kohen, Martin Pham

• Demo: N/A
• Github: https://github.com/nethanelkohen/Daddy-is-Watching

kchia

Studying for a Tech Interview Sucks, so Here's a Cheat Sheet to Help

This list is meant to be a both a quick guide and reference for further research into these topics. It's basically a summary of that comp sci course you never took or forgot about, so there's no way it can cover everything in depth. It also will be available as a gist on Github for everyone to edit and add to.

Data Structure Basics

###Array ####Definition:

• Stores data elements based on an sequential, most commonly 0 based, index.
• Based on tuples from set theory.

kchia

// Use Gists to store code you would like to remember later on
console.log(window); // log the "window" object to the console

kchia

// sets up Board class for an n x n board, where n is the dimension
var Board = function(dimension, mines) {
  this.board = [];
   
  // place all mined cells into array first, followed by mine-less cells
  this.plantMines(dimension,mines);
  
  // perform an in-place shuffle to randomly place mines on board; see algorithm below
  this.board = shuffle(this.board);
  

kchia

// sets up Board class
var Board = function(dimension, mines) {
  this.board = [];
  for(var i = 0; i < dimension; i++) {
    var row = [];
    for(var j = 0; j < dimension; j++) {
      row.push(new Cell(false));
    }
    this.board.push(row);
  }