JoeKarlsson

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

JoeKarlsson

var fs = require('fs'); // require is a special function provided by node
var path = require('path'); //require path function provided by node

var pathName = process.argv[2]; //full path name passed in as array
var ext = process.argv[3]; //extenstion we need to filter array by passed in as string

var filteredList = undefined; //Global variable. We do not know the file type, so I set to undefined.

function filteredLS(callback) {
  fs.readdir(pathName, function doneReading(err, files) {  //Async node call. Pass in pathname and async function

JoeKarlsson

###Console History Sim Stack Trace Challenge

Using a linked list, we are going to demonstrate a use case for a linked list and simulate a stack like you see in a stack trace that replays the history of what we typed.

1. Add a text box to an HTML page and a 2 buttons, save and dump.
2. Every time the user clicks the first button to save, we are going to save the text input to our linked list as the most recent node or head.
3. Whenever someone clicks the dump button we are going to dump out all of the input they've typed in to that point from most recent to oldest. This should be written as HTML to the page.

JoeKarlsson

##Your Challenge Reflection is a common utility in Object Oriented languages for inspecting classes and deriving information about what properties/methods they expose and other classes they inherit from. We will be writing our own JavaScript reflector today!

We are going to write a simple utility that will inspect a given object, and tell us about the object and it's inheritance chain.

###Your Tasks

1. Create 3 classes:

• User
• GroupUser
• SuperUser

JoeKarlsson

'use strict'

const Rocket = require('./Rocket.js');


module.exports = class Missle extends Rocket {
  constructor( speed, year ) {
    super('Mach 10', 'North Korea', year)
    this._speed = speed;
  }

JoeKarlsson

function palindromic(number, steps) {
  var returnObj = {};
  steps = steps || '0';

  // check if number passed in is palindrome
  var numberStrReversed = number.toString().split("").reverse().join("");
  if (number.toString() === numberStrReversed) {
    returnObj.value = number;
    returnObj.steps = parseInt(steps);

JoeKarlsson

/**
 * @method invoke
 *
 * Allows the spellcaster to cast spells.
 * The first parameter should either be a `Spell` or `DamageSpell`.
 * If it is a `DamageSpell`, the second parameter should be a `Spellcaster`.
 * The function should return `false` if the above conditions are not satisfied.
 *
 * You should use `instanceof` to check for these conditions.
 *

JoeKarlsson

Sorting Algorithms

For this assignment you will be responsible for the following:

1. Create a module that implements each of the folowing sorting algorithms:
2. Quick sort
3. Bubble sort
4. Merge sort
5. Insertion sort
6. Selection sort

JoeKarlsson

Pig Latin Translator

A new alien species has moved to earth and they only speak pig-latin! The president has called you and says that they need your help!

Your mission is to create a module that is capable of taking an english sentence and translating it into pig latin. We must also be able to understand what our new alien friends are saying, so the module needs to be able to convert pig-latin back to english.

TL;DR: Create a module that translates a string into Pig Latin, and is capable of translating Pig Latin back into in the native language.

How Pig Latin Works

Basically, the Pig Latin system used here works as follows:

JoeKarlsson

###Test...Solve...Refactor...Commit

###The Challenge

We are going to be doing a quickfire challenge to solve the following objectives in a short amount of time in the following order:

1. In your algorithm repository, create a new branch called 'tests'
2. Setup mocha/chai to be our testing framework
3. Write tests for the algorithm we are working on (Quicksort, Bubblesort, Mergesort, etc.)