Diophantine equations are polynomial equations with integer coefficients. In 1970, Matiyasevich proved that an algorithm to decide whether a given Diophantine equation has a solution does not exist. We investigated some such equations including Pell and Thue equations, that have an infinite and finite number of solutions, respectively. Geometrically the solution set of Diophantine equations in 2 variables corresponds to plane curves, e.g. elliptic or hyperelliptic curves, and the number of rational solutions is related to the genus of the corresponding curve. We gathered statistics on the size of the solution sets in an attempt to address an important unsolved problem in arithmetic geometry, known as Uniformity Conjecture of Caporaso, Harris and Mazur. Our project involved an analysis of Python and C code, specifically through the CoCalc development platform, utilizing data from the L-functions and Modular Forms Database (LMFDB). Currently our results agree with the current known data on the sizes of solution sets, and we hope to extend our results to gather data on curves not currently in the LMFDB. This will serve as a testing ground for the Uniformity Conjecture.