Problem 1 implements, in pieces, a k nearest neighbor algorithm to calculate the expected time of a New York Taxi Trip given the start and end locations.

Problem 2 implements, in pieces, a binary decision tree using the ID3 algorithm to determine whether a given IMDB movie review is positive or negative.