austin/bradley-university
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

added old projects

Browse Source
This commit is contained in:
Austin Bennett
2026-02-03 08:18:39 -06:00
parent 43acf989bf
commit 2451448b8a
623 changed files with 28117 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
CS101/proj4/.vscode/launch.json
Vendored
+23
View File
@@ -0,0 +1,23 @@
{
// Use IntelliSense to learn about possible attributes.
// Hover to view descriptions of existing attributes.
// For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
"version": "0.2.0",
"configurations": [
{
"type": "java",
"name": "Launch Current File",
"request": "launch",
"mainClass": "${file}",
"args": "all"
},
{
"type": "java",
"name": "Launch RationalTester",
"request": "launch",
"mainClass": "RationalTester",
"projectName": "project4_9aee4ddf"
}
]
}
CS101/proj4/.vscode/settings.json
Vendored
+4
View File
@@ -0,0 +1,4 @@
{
"java.project.sourcePaths": ["src"],
"java.project.outputPath": "bin"
}
CS101/proj4/README.md
+18
View File
@@ -0,0 +1,18 @@
## Getting Started
Welcome to the VS Code Java world. Here is a guideline to help you get started to write Java code in Visual Studio Code.
## Folder Structure
The workspace contains two folders by default, where:
- `src`: the folder to maintain sources
- `lib`: the folder to maintain dependencies
Meanwhile, the compiled output files will be generated in the `bin` folder by default.
> If you want to customize the folder structure, open `.vscode/settings.json` and update the related settings there.
## Dependency Management
The `JAVA PROJECTS` view allows you to manage your dependencies. More details can be found [here](https://github.com/microsoft/vscode-java-dependency#manage-dependencies).
CS101/proj4/bin/Rational.class
BIN
View File
Binary file not shown.
CS101/proj4/bin/RationalTester.class
BIN
View File
Binary file not shown.
CS101/proj4/src/Rational.java
+162
View File
@@ -0,0 +1,162 @@
/***************************************************************
<Austin Bennett>
<Rational.java>
<Project 4 - Rational Class>
<This class will reduce a rational. add, subtract, multiply, or multiply it against another rational. output the fraction to a string>
***************************************************************/
import java.lang.Math.*;
public class Rational implements Comparable
{
// Initializing Variables
long _numer;
long _denom;
// Default Contructor
public Rational()
{
_numer = 0;
_denom = 1;
}
// Overloaded Contructor for only one arguement
public Rational(long a)
{
_numer = a;
_denom = 1;
}
// Overloaded Contructor to create and reduce the given fraction
public Rational(long a, long b) throws ArithmeticException
{
// Checks for stupid humans making a bad rational
if (a == 0 || b == 0)
{
_numer = 0;
_denom = 1;
}
else
{ // reduces the fraction
long temp = gcd(a, b);
_numer = a / temp;
if(b == 0) // Checks for stupid humans having a zero denominator
throw new ArithmeticException("Denominator cannot be zero");
_denom = b / temp;
if (_numer < 0 || _denom < 0)
{ // Properly writes negative fractions
_numer = Math.abs(_numer);
_denom = Math.abs(_denom);
_numer = 0 - _numer;
}
}
}
// Accesor for the _denom variable
public long getDenominator()
{
return _denom;
}
// Accessor for the _numer variable
public long getNumerator()
{
return _numer;
}
// Handles Adding the two rationals
public Rational add(Rational r)
{
// Makes sure user is actually adding a real number
if (r == null)
return new Rational(_numer, _denom);
else
{
// a/b + c/d = a*d + b*c / b*d
long numerator = _numer * r.getDenominator() + _denom * r.getNumerator();
long denominator = _denom * r.getDenominator();
return new Rational(numerator, denominator);
}
}
// Handles Subtracting the two rationals
public Rational subtract(Rational r)
{
// Makes sure user is actually subtracting a real number
if (r == null)
return new Rational(_numer, _denom);
else
{
// a/b - c/d = a*d - b*c / b*d
long numerator = _numer * r.getDenominator() - _denom * r.getNumerator();
long denominator = _denom * r.getDenominator();
return new Rational(numerator, denominator);
}
}
// Handles Multiplying the two rationals
public Rational multiply(Rational r)
{
// Makes sure user is actually multiplying by a real number
if (r == null)
return new Rational(0, 0);
else
{
// a/b * c/d = a*c / b*d
long numerator = _numer * r.getNumerator();
long denominator = _denom * r.getDenominator();
return new Rational(numerator, denominator);
}
}
// Handles Dividing the two rationals
public Rational divide(Rational r)
{
// Makes sure user is actually dividing by a real number
if (r == null)
throw new ArithmeticException();
else
{
// a/b / c/d = a*d / b*c
long numerator = _numer * r.getDenominator();
long denominator = _denom * r.getNumerator();
return new Rational(numerator, denominator);
}
}
//
// Find the Greatest Common Divisor of Two Integers
//
public long gcd(long p, long q)
{
if (q == 0)
return p;
else
return gcd(q, p % q); // recursive function to find the gcd
}
public String toString()
{
if (_denom == 1 || _denom == -1) return "" + _numer;
return _numer + "/" + _denom;
}
public int compareTo(Object obj)
{
if (obj == null) return -1;
if (!(obj instanceof Rational)) return 1;
if (this.equals((Rational)(obj))) return 0;
return (this.subtract((Rational)(obj)).getNumerator() > 0 ? 1 : -1);
}
// Returns true if and only if obj are the same number or reference the same object
public boolean equals(Object obj)
{
if (obj == null) return false;
if (obj == this) return true;
if (this.subtract((Rational)obj).getNumerator() == 0) return true;
return false;
}
}
CS101/proj4/src/RationalTester.java
+699
View File
@@ -0,0 +1,699 @@
import java.util.ArrayList;
public class RationalTester
{
private static final int CONSTRUCTOR = 1;
private static final int CONSTRUCTOR_LONG = 2;
private static final int GCD = 3;
private static final int CONSTRUCTOR_LONG_LONG = 4;
private static final int GET_DENOMINATOR = 5;
private static final int GET_NUMERATOR = 6;
private static final int ADD = 7;
private static final int SUBTRACT = 8;
private static final int MULTIPLY = 9;
private static final int DIVIDE = 10;
private static final int TEST_MIN = CONSTRUCTOR;
private static final int TEST_MAX = DIVIDE;
private static final int MAX_NUM_TESTS = TEST_MAX + 1;
private static int TEST = 0;
private static int TEST_CASE = 0;
private static int TEST_CASES_FAILED = 0;
private static boolean TEST_PASSED = false;
private static ArrayList<Integer> parseCommandLine(String[] args)
{
ArrayList<Integer> tests = new ArrayList<Integer>();
boolean perform_all = false;
for (int i = 0; i < args.length; i++)
{
if (args[i].equals("all"))
{
perform_all = true;
}
}
if (perform_all)
{
System.out.println("All tests specified to be executed.");
for (int i = TEST_MIN; i <= TEST_MAX; i++)
{
tests.add(new Integer(i));
}
}
else
{
System.out.println(args.length +
" command line arguments specified to be executed.");
for (int i = 0; i < args.length; i++)
{
int test = new Integer(args[i]).intValue();
System.out.print(test + " ");
if (test >= TEST_MIN && test <= TEST_MAX)
{
tests.add(new Integer(test));
}
}
System.out.println();
}
System.out.println(tests.size() +
" valid tests specified to be executed.");
return tests;
}
private static void dump_error_message(String message)
{
System.out.println("<" + TEST + "," + TEST_CASE + "> " + message);
TEST_PASSED = false;
TEST_CASES_FAILED++;
}
private static void checkContents(String contents, String test_contents)
{
if (!contents.equals(test_contents))
{
dump_error_message(" expected [" + test_contents + "] found [" + contents + "]");
}
TEST_CASE++;
}
public static void main(String args[])
{
ArrayList<Integer> tests = parseCommandLine(args);
boolean[] TestResults = new boolean[MAX_NUM_TESTS];
// initialize test results array
for (int i = 0; i <= TEST_MAX; i++)
{
TestResults[i] = false;
}
int total_test_cases = 0;
int total_failed_test_cases = 0;
for (int i = TEST_MIN; i <= TEST_MAX; i++)
{
TEST_PASSED = true;
TEST_CASES_FAILED = 0;
if (tests.contains(new Integer(i)))
{
TEST = i;
TEST_CASE = 1;
System.out.println("\nTest " + TEST + " started");
switch(i)
{
case CONSTRUCTOR:
testConstructor();
break;
case CONSTRUCTOR_LONG:
testConstructorLong();
break;
case GCD:
testGCD();
break;
case CONSTRUCTOR_LONG_LONG:
testConstructorLongLong();
break;
case GET_DENOMINATOR:
{
int[] requiredPassedTests = { CONSTRUCTOR, CONSTRUCTOR_LONG, CONSTRUCTOR_LONG_LONG, GCD };
for (int rpt = TEST_MIN; rpt < requiredPassedTests.length; rpt++)
{
if (!TestResults[rpt])
{
dump_error_message("Cannot perform this test since test " + rpt + " failed.");
break;
}
}
testGetDenominator();
}
break;
case GET_NUMERATOR:
{
int[] requiredPassedTests = { CONSTRUCTOR, CONSTRUCTOR_LONG, CONSTRUCTOR_LONG_LONG, GCD, GET_DENOMINATOR };
for (int rpt = TEST_MIN; rpt < requiredPassedTests.length; rpt++)
{
if (!TestResults[rpt])
{
dump_error_message("Cannot perform this test since test " + rpt + " failed.");
break;
}
}
testGetNumerator();
}
break;
case ADD:
{
int[] requiredPassedTests = { CONSTRUCTOR, CONSTRUCTOR_LONG, CONSTRUCTOR_LONG_LONG, GCD };
for (int rpt = TEST_MIN; rpt < requiredPassedTests.length; rpt++)
{
if (!TestResults[rpt])
{
dump_error_message("Cannot perform this test since test " + rpt + " failed.");
break;
}
}
testAdd();
}
break;
case SUBTRACT:
{
int[] requiredPassedTests = { CONSTRUCTOR, CONSTRUCTOR_LONG, CONSTRUCTOR_LONG_LONG, GCD };
for (int rpt = TEST_MIN; rpt < requiredPassedTests.length; rpt++)
{
if (!TestResults[rpt])
{
dump_error_message("Cannot perform this test since test " + rpt + " failed.");
break;
}
}
testSubtract();
}
break;
case MULTIPLY:
{
int[] requiredPassedTests = { CONSTRUCTOR, CONSTRUCTOR_LONG, CONSTRUCTOR_LONG_LONG, GCD };
for (int rpt = TEST_MIN; rpt < requiredPassedTests.length; rpt++)
{
if (!TestResults[rpt])
{
dump_error_message("Cannot perform this test since test " + rpt + " failed.");
break;
}
}
testMultiply();
}
break;
case DIVIDE:
{
int[] requiredPassedTests = { CONSTRUCTOR, CONSTRUCTOR_LONG, CONSTRUCTOR_LONG_LONG, GCD };
for (int rpt = TEST_MIN; rpt < requiredPassedTests.length; rpt++)
{
if (!TestResults[rpt])
{
dump_error_message("Cannot perform this test since test " + rpt + " failed.");
break;
}
}
testDivide();
}
break;
default:
System.out.println("Unrecognized test " + i);
}
System.out.println("Test " + TEST + " " + (TEST_PASSED ? "passed" : "failed"));
TestResults[TEST] = TEST_PASSED;
System.out.println("Test " + TEST + " " + "Failed (" + TEST_CASES_FAILED
+ " / " + TEST_CASE + ") test cases");
total_test_cases += TEST_CASE;
total_failed_test_cases += TEST_CASES_FAILED;
TEST_CASES_FAILED = 0;
TEST_CASE = 0;
System.out.println("Test " + TEST + " ended");
}
}
int failed_count = 0;
int passed_count = 0;
for (int i = TEST_MIN; i <= TEST_MAX && i < TestResults.length; i++)
{
if (tests.contains(new Integer(i)))
{
if (TestResults[i])
{
passed_count++;
}
else
{
failed_count++;
}
}
}
System.out.println("\nFailed " + total_failed_test_cases + " / " + total_test_cases + " test cases");
System.out.println("Passed: " + passed_count + " / " + tests.size() + " tests");
System.out.println("Failed: " + failed_count + " / " + tests.size() + " tests");
}
private static void testConstructor()
{
Rational test_rational = new Rational();
checkContents(test_rational.toString(), "0");
}
private static void testConstructorLong()
{
for (int i = 0; i < 100; i++)
{
Rational test_rational = new Rational(i);
checkContents(test_rational.toString(), (new Integer(i)).toString());
}
}
private static void testGCD()
{
long a;
long b;
long gcd_expected;
long gcd_result;
Rational test_rational = new Rational();
//
// Relatively Prime Tests
//
a = 2; b = 3; gcd_expected = 1;
gcd_result = test_rational.gcd(a,b);
if (gcd_result != gcd_expected)
{
dump_error_message("Expected GCD " + gcd_expected + "; found " + gcd_result);
}
TEST_CASE++;
a = 97; gcd_expected = 1;
for (int k = 2; k < 97; k++)
{
gcd_result = test_rational.gcd(a, k);
if (gcd_result != gcd_expected)
{
dump_error_message("Expected GCD " + gcd_expected + "; found " + gcd_result);
}
TEST_CASE++;
}
a = 2; gcd_expected = 1;
for (int k = 97; k >= 2; k -= 2)
{
gcd_result = test_rational.gcd(k, a);
if (gcd_result != gcd_expected)
{
dump_error_message("Expected GCD " + gcd_expected + "; found " + gcd_result);
}
TEST_CASE++;
}
//
// gcd(a,b) > 1
//
for (int k = 2; k < 100; k++)
{
gcd_result = test_rational.gcd(k, k);
if (gcd_result != k)
{
dump_error_message("Expected GCD " + gcd_expected + "; found " + k);
}
TEST_CASE++;
}
a = 3; gcd_expected = 3;
for (int k = 3; k < 1000; k *= 3)
{
gcd_result = test_rational.gcd(a, k);
if (gcd_result != gcd_expected)
{
dump_error_message("Expected GCD " + gcd_expected + "; found " + gcd_result);
}
TEST_CASE++;
}
a = 7654321; b = 56791; gcd_expected = 19;
gcd_result = test_rational.gcd(a, b);
if (gcd_result != gcd_expected)
{
dump_error_message("Expected GCD " + gcd_expected + "; found " + gcd_result);
}
TEST_CASE++;
}
private static void testConstructorLongLong()
{
for (int i = 1; i < 100; i++)
{
Rational test_rational = new Rational(i, i);
checkContents(test_rational.toString(), "1");
}
for (int i = 1; i < 100; i += 2)
{
Rational test_rational = new Rational(i, i*2);
checkContents(test_rational.toString(), "1/2");
}
for (int i = 1; i < 100; i += 2)
{
Rational test_rational = new Rational(2*i, i*3);
checkContents(test_rational.toString(), "2/3");
}
for (int i = 1; i < 100; i++)
{
Rational test_rational = new Rational(i, -1);
checkContents(test_rational.toString(), new Integer(-i).toString());
}
}
private static void testGetDenominator()
{
for (int k = 1; k < 100; k++)
{
long denom = new Rational(k).getDenominator();
if (denom != 1)
{
dump_error_message("Expected Denominator 1; found " + denom);
}
TEST_CASE++;
}
for (int k = 1; k < 100; k += 2)
{
long denom = new Rational(k, 2).getDenominator();
if (denom != 2)
{
dump_error_message("Expected Denominator " + "2" + "; found " + denom);
}
TEST_CASE++;
}
}
private static void testGetNumerator()
{
for (int k = 1; k < 100; k++)
{
long numer = new Rational(k).getNumerator();
if (numer != k)
{
dump_error_message("Expected Numerator " + k + "; found " + numer);
}
TEST_CASE++;
}
}
private static void testAdd()
{
try
{
checkContents((new Rational(1)).add(null).toString(), "1");
}
catch(NullPointerException e1)
{
dump_error_message("Null pointer thrown in add; null not treated as zero.");
}
for (int i = 1; i < 100; i++)
{
Rational test_rational1 = new Rational(i);
Rational test_rational2 = new Rational(-i);
Rational sum = test_rational1.add(test_rational2);
checkContents(sum.toString(), "0");
}
for (int i = 1; i < 100; i++)
{
Rational test_rational1 = new Rational(i);
Rational test_rational2 = new Rational(i);
Rational sum = test_rational1.add(test_rational2);
checkContents(sum.toString(), new Integer(i * 2).toString());
}
for (int i = 3; i < 100; i += 2)
{
Rational test_rational1 = new Rational(1, i);
Rational test_rational2 = new Rational(1, i);
Rational sum = test_rational1.add(test_rational2);
checkContents(sum.toString(), "2/" + new Integer(i).toString());
}
for (int i = 2; i < 100; i++)
{
Rational test_rational1 = new Rational(i);
Rational test_rational2 = new Rational(1, i);
Rational sum = test_rational1.add(test_rational2);
checkContents(sum.toString(), new Integer(i * i + 1).toString() + "/" + new Integer(i).toString());
}
}
private static void testSubtract()
{
try
{
checkContents((new Rational(1)).subtract(null).toString(), "1");
}
catch(NullPointerException e1)
{
dump_error_message("Null pointer thrown in subtract; null not treated as zero.");
}
for (int i = 1; i < 100; i++)
{
Rational test_rational1 = new Rational(-i);
Rational test_rational2 = new Rational(i);
Rational difference = test_rational1.subtract(test_rational2);
checkContents(difference.toString(), new Integer (- 2 * i).toString());
}
for (int i = 1; i < 100; i++)
{
Rational test_rational1 = new Rational(i);
Rational test_rational2 = new Rational(-i);
Rational difference = test_rational1.subtract(test_rational2);
checkContents(difference.toString(), new Integer (2 * i).toString());
}
for (int i = 1; i < 100; i++)
{
Rational test_rational1 = new Rational(i);
Rational test_rational2 = new Rational(i);
Rational difference = test_rational1.subtract(test_rational2);
checkContents(difference.toString(), "0");
}
for (int i = 3; i < 100; i += 2)
{
Rational test_rational1 = new Rational(1, i);
Rational test_rational2 = new Rational(1, i);
Rational difference = test_rational1.subtract(test_rational2);
checkContents(difference.toString(), "0");
}
for (int i = 2; i < 100; i++)
{
Rational test_rational1 = new Rational(i);
Rational test_rational2 = new Rational(1, i);
Rational difference = test_rational1.subtract(test_rational2);
checkContents(difference.toString(), new Integer(i * i - 1).toString() + "/" + new Integer(i).toString());
}
Rational test_rational1 = new Rational(3, 4);
Rational test_rational2 = new Rational(7, 13);
Rational difference = test_rational1.subtract(test_rational2);
checkContents(difference.toString(), new Integer(11).toString() + "/" + new Integer(52).toString());
test_rational1 = new Rational(4, 3);
test_rational2 = new Rational(7, 13);
difference = test_rational1.subtract(test_rational2);
checkContents(difference.toString(), new Integer(31).toString() + "/" + new Integer(39).toString());
test_rational1 = new Rational(4, 10);
test_rational2 = new Rational(7, 15);
difference = test_rational1.subtract(test_rational2);
checkContents(difference.toString(), "-1/15");
test_rational1 = new Rational(9, 10);
test_rational2 = new Rational(7, 15);
difference = test_rational1.subtract(test_rational2);
checkContents(difference.toString(), "13/30");
test_rational1 = new Rational(13, 10);
test_rational2 = new Rational(7, 15);
difference = test_rational1.subtract(test_rational2);
checkContents(difference.toString(), "5/6");
}
private static void testMultiply()
{
try
{
checkContents((new Rational(1)).multiply(null).toString(), "0");
}
catch(NullPointerException e1)
{
dump_error_message("Null pointer thrown in multiply; null not treated as zero.");
}
for (int i = 2; i < 100; i++)
{
Rational test_rational1 = new Rational(i);
Rational test_rational2 = new Rational(1, i);
Rational product = test_rational1.multiply(test_rational2);
checkContents(product.toString(), "1");
}
for (int i = 2; i < 100; i++)
{
Rational test_rational1 = new Rational(i);
Rational test_rational2 = new Rational(2, -i);
Rational product = test_rational1.multiply(test_rational2);
checkContents(product.toString(), "-2");
}
for (int i = 2; i < 100; i++)
{
Rational test_rational1 = new Rational(-i);
Rational test_rational2 = new Rational(2, -i);
Rational product = test_rational1.multiply(test_rational2);
checkContents(product.toString(), "2");
}
int[] primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37 };
for (int i = 0; i < primes.length; i++)
{
for (int j = 0; j < primes.length; j++)
{
for (int k = 0; k < primes.length; k++)
{
for (int m = 0; m < primes.length; m++)
{
if (i != j &&
i != k &&
i != m &&
j != k &&
j != m &&
k != m)
{
Rational test_rational1 = new Rational(primes[i], primes[j]);
Rational test_rational2 = new Rational(primes[k], primes[m]);
Rational product = test_rational1.multiply(test_rational2);
checkContents(product.toString(), new Integer(primes[i] * primes[k]).toString() + "/" + new Integer(primes[j] * primes[m]).toString());
}
}
}
}
}
Rational test_rational1 = new Rational(3, 7);
Rational test_rational2 = new Rational(7, 15);
Rational product = test_rational1.multiply(test_rational2);
checkContents(product.toString(), "1/5");
test_rational1 = new Rational(9, 10);
test_rational2 = new Rational(7, 15);
product = test_rational1.multiply(test_rational2);
checkContents(product.toString(), "21/50");
test_rational1 = new Rational(17, 12);
test_rational2 = new Rational(18, 5);
product = test_rational1.multiply(test_rational2);
checkContents(product.toString(), "51/10");
}
private static void testDivide()
{
try
{
new Rational(1).divide(null);
dump_error_message("Expect an ArithmeticException to be thrown on null");
}
catch(NullPointerException e1)
{
dump_error_message("Null pointer thrown in divide; null not treated as zero.");
}
catch(ArithmeticException e2)
{
// Good.
}
TEST_CASE++;
for (int i = 2; i < 100; i++)
{
Rational test_rational1 = new Rational(i);
Rational test_rational2 = new Rational(1, i);
Rational quotient = test_rational1.divide(test_rational2);
checkContents(quotient.toString(), new Integer (i * i).toString());
}
for (int i = 1; i < 100; i += 2)
{
Rational test_rational1 = new Rational(i);
Rational test_rational2 = new Rational(2, -i);
Rational quotient = test_rational1.divide(test_rational2);
checkContents(quotient.toString(), new Integer (-i * i).toString() + "/2");
}
for (int i = 1; i < 100; i += 2)
{
Rational test_rational1 = new Rational(-i);
Rational test_rational2 = new Rational(2, -i);
Rational quotient = test_rational1.divide(test_rational2);
checkContents(quotient.toString(), new Integer (i * i).toString() + "/2");
}
int[] primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37 };
for (int i = 0; i < primes.length; i++)
{
for (int j = 0; j < primes.length; j++)
{
for (int k = 0; k < primes.length; k++)
{
for (int m = 0; m < primes.length; m++)
{
if (i != j &&
i != k &&
i != m &&
j != k &&
j != m &&
k != m)
{
Rational test_rational1 = new Rational(primes[i], primes[j]);
Rational test_rational2 = new Rational(primes[k], primes[m]);
Rational quotient = test_rational1.divide(test_rational2);
checkContents(quotient.toString(), new Integer(primes[i] * primes[m]).toString() + "/" + new Integer(primes[j] * primes[k]).toString());
}
}
}
}
}
Rational test_rational1 = new Rational(3, 7);
Rational test_rational2 = new Rational(7, 15);
Rational quotient = test_rational1.divide(test_rational2);
checkContents(quotient.toString(), "45/49");
test_rational1 = new Rational(9, 10);
test_rational2 = new Rational(7, 15);
quotient = test_rational1.divide(test_rational2);
checkContents(quotient.toString(), "27/14");
test_rational1 = new Rational(12, 17);
test_rational2 = new Rational(18, 5);
quotient = test_rational1.divide(test_rational2);
checkContents(quotient.toString(), "10/51");
}
}
CS101/proj4/src/proj4.zip
BIN
View File
Binary file not shown.