Alastair Paragas alastairparagas

On the VirtualBox Menu:

-> Devices -> Shared Folders

Mount on OS:

sudo mount -t vboxsf -o uid=1000,gid=1000 cop4610 /home/cop4610/<folder path>

Edit fstab (add last line):

cop4610 /home/cop4610/ vboxsf defaults 0 0

🎆 Programming Recommendations

THIS WILL BE CONTINUALLY UPDATED!

What should I pick up?

A lot of people ask me questions on what programming languages to pick up - most of them asking if language X is better than language Y.

First off - whatever you can build in one programming language, you can build in another programming language. If I wanted to make a desktop application, I could use JavaFX or Swing all in Java, PyQt in Python, Threepenny-gui in Haskell or Electron in Javascript (NodeJS variant). If I wanted to build a mobile app, I could either make a web app that looks like a mobile app and has access to device sensors using Cordova with HTML, CSS and Javascript, build using the native GUI components of the mobile platform but use the convenience of Javascript using something like React Native, use something like Kivy if I am insistent on building it with Python, or use good old Java.

Choosing a programming language is more about what language suits the job more and

	module IterativeStochasticGradient where

	{-
	Train is a function that accepts a:
	- a list of training example that consists of a list
	of input features and a target value
	- a list of starting weights for each input feature
	- an intercept value
	- a learning rate
	Outputs a tuple: list of weights for each corresponding input

	#include<linux/linkage.h>
	#include<linux/sched.h>
	#include<linux/time.h>

	asmlinkage long sys_alastair_paragas(int pantherid)
	{
	// System Call - returns back provided panther id
	// and the current system time in hh:mm:ss, month day, year format
	struct timeval time_in_sec;
	struct tm time_info;

	import greenery.lego as lego
	import itertools

	"""
	Theory of Algorithms 3.1
	An Introduction to Formal Languages and Automata
	Solution Checker Program
	"""

	def unmatched_samples(regex1Obj, regex2Obj):

	/*
	* SLOB Allocator: Simple List Of Blocks
	*
	* Matt Mackall <[email protected]> 12/30/03
	*
	* NUMA support by Paul Mundt, 2007.
	*
	* How SLOB works:
	*
	* The core of SLOB is a traditional K&R style heap allocator, with

	/*
	* SLOB Allocator: Simple List Of Blocks
	*
	* Matt Mackall <[email protected]> 12/30/03
	*
	* NUMA support by Paul Mundt, 2007.
	*
	* How SLOB works:
	*
	* The core of SLOB is a traditional K&R style heap allocator, with

	Array.prototype.slice.call(document.getElementsByTagName('a')).map(htmlNode => {
	htmlNode.addEventListener('click', () => location.reload());
	});

	module Main where

	import Control.Monad.IO.Class (liftIO)
	import Control.Monad.Trans.Resource (runResourceT)
	import Data.Conduit (($$+-), ($=+), runConduit)
	import Data.Conduit.List (mapM_, map, filter, catMaybes)
	import qualified Data.ByteString.Char8 (pack)
	import Data.Text (unpack)
	import qualified Data.Text (pack)
	import Data.Maybe (fromJust)

	(*
	Homework 2.1
	Write an uncurried F# function cartesian (xs, ys) that takes as input
	two lists xs and ys and returns a list of pairs that represents the
	Cartesian product of xs and ys. (The pairs in the Cartesian product
	may appear in any order.)
	*)
	let rec cartesian = function
	\| (xs, []) -> []
	\| (xs, y::ys) -> List.map (fun x -> (x, y)) xs @ cartesian (xs, ys) ;;