danvn Goto Github PK

1sheets

algorithms-hw2

algorithms-hw3

Write a python program that takes as input the name of a CSV file containing the historical quotes of a specific symbol (stock), utilizes the maximum subarray method (CLRS 4.1, Sep 11 lecture slides) to compute the optimal (i.e., maximum profit) buy and sale date pair based on the Open price for each day. Run your program on three different stocks and report your results (stock symbol, start date, end date, buy date, sale date, maximum profit).

algorithmshw5

algorithmshw7

Cutting cloth algorithm. AKA Knapsack. Given a cloth of dimensions X,Y , and a list of smaller rectangular cloths, each holding their own selling value, find the maximum profit we can make out of the original XY piece of rectangular cloth

betr

computerscience

Free technical resources for faculty, students, and Microsoft developer advocates for use in computer science learning forums.

crossplatformxamarinforms

csci3753_operating_systems

cu-csci3308-cipractice

Continuous Integration Practice

danvn.github.io

Personal Webpage

finalproject

flaskapp

gerrymandering

git-practice

haikuexpress

News alerts delivered by SMS. In the form of Haikus.

lab3

ml-assignment5

moon

Moon is a minimal, one column jekyll theme.

myocar

myocars

nba-on-twitter

Analyzing how teams in the NBA are mentioned on Twitter.

newrepository

New repo from octokit

operating-systems

pickupteamorder

Teams in pickup basketball come in different amounts of players and want to stay together. This program combines teams of different sizes from individuals to groups of 5 and generates an in order team configuration to answer the question of "Who's got next?".

powerstats

Sports Analytics Graphing Engine

pppl-labs

Lab project files for Principles and Practice in Programming Languages

recaptain

Recaptain, the Slack Bot to feed you Recaps of your favorite channels.

rest-api

Simple Express Server

sabermetrics

Baseball Analytics & Stuff