AALEKH

Iris Dataset : https://archive.ics.uci.edu/ml/machine-learning-databases/iris/iris.data

AALEKH

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.

AALEKH

FROM: http://benanne.github.io/2015/03/17/plankton.html

Meta-Tricks:
	- Use %10 for validation with STRATIFIED SAMPLING (my mistake)
	- Cyclic Pooling 
	- Leaky ReLU = max(x, a*x) learned a
		- reduces overfitting with a ~= 1/3
	- Orthogonal initialization http://arxiv.org/pdf/1312.6120v3.pdf
	- Use larger weight decay for larger models since otherwise some layers might diverge

AALEKH

tmux shortcuts & cheatsheet

start new:

tmux

start new with session name:

tmux new -s myname

AALEKH

#include "box.h"
#include <iostream>
#include <string>
#include <vector>

int main(){

	std::vector<int> vec;
	vec.push_back(1);
	vec.push_back(13);

AALEKH

// make_tuple example
#include <iostream>
#include <tuple>
#include <functional>
#include <vector>

using namespace std;

vector<tuple<int, int, int, int>> create_tuple()
{

AALEKH

//
// Copyright (c) 2013 Juan Palacios juan.palacios.puyana@gmail.com
// Subject to the BSD 2-Clause License
// - see < http://opensource.org/licenses/BSD-2-Clause>
//

#include "Queue.h"
#include <iostream>

void produce(Queue<int>& q) {

AALEKH

//
// Copyright (c) 2013 Juan Palacios juan.palacios.puyana@gmail.com
// Subject to the BSD 2-Clause License
// - see < http://opensource.org/licenses/BSD-2-Clause>
//

#ifndef CONCURRENT_QUEUE_
#define CONCURRENT_QUEUE_

#include <queue>

AALEKH

cmake_minimum_required(VERSION 3.0)                                              
  2 project(hpxflowproject)                                                          
  3                                                                                  
  4 ###############################################################################  
  5 ## file globbing ##############################################################  
  6 ###############################################################################  
  7                                                                                  
  8 file( GLOB_RECURSE sources ../src/algorithm/*.cpp ../src/algorithm/*.h )         
  9 file( GLOB_RECURSE sources_t  ../src/core_layer/*.cpp ../src/core_layer/*.h )    
 10 file( GLOB_RECURSE sources_f  ../src/dataflow/*.cpp ../src/dataflow/*.h )        

AALEKH

 1 #include <boost/version.hpp>                                                     
  2 #include <iostream>                                                              
  3 #include <iomanip>                                                               
  4                                                                                  
  5 int main()                                                                       
  6 {                                                                                
  7     std::cout << "Boost version: "                                               
  8           << BOOST_VERSION / 100000                                              
  9           << "."                                                                 
 10           << BOOST_VERSION / 100 % 1000