Exercise solutions for chapter 6 plus tests

CKHarrison · CKHarrison · commit 7561161163ca · 2017-12-09T16:57:33.000-08:00
diff --git a/Exercise Solutions/Chapter 6/IsDivisible.java b/Exercise Solutions/Chapter 6/IsDivisible.java
@@ -0,0 +1,11 @@
+public class IsDivisible {
+    public static void main(String[] args) {
+        System.out.println(isDivisible(10, 5));
+    }
+    public static boolean isDivisible(int n, int m) {
+        if(n % m == 0) {
+            return true;
+        }
+        return false;
+    }
+}
diff --git a/Exercise Solutions/Chapter 6/IsDivisibleTest.java b/Exercise Solutions/Chapter 6/IsDivisibleTest.java
@@ -0,0 +1,20 @@
+import junit.framework.TestCase;
+
+/**
+ * A JUnit test case class.
+ * Every method starting with the word "test" will be called when running
+ * the test with JUnit.
+ */
+public class IsDivisibleTest extends TestCase {
+    
+    /**
+     * A test method.
+     * (Replace "X" with a name describing the test.  You may write as
+     * many "testSomething" methods in this class as you wish, and each
+     * one will be called when running JUnit over this class.)
+     */
+    public void testisDivisible() {
+        assertTrue(true, Series.isDivisible(10, 5));
+    }
+    
+}
diff --git a/Exercise Solutions/Chapter 6/IsTriangle.java b/Exercise Solutions/Chapter 6/IsTriangle.java
@@ -0,0 +1,20 @@
+public class IsTriangle {
+    public static void main(String[] args) {
+       boolean result = isTriangle(1, 2, 3);
+       System.out.println(result);
+    }
+    public static boolean isTriangle(int a, int b, int c) {
+        if(a > b + c) {
+            return false;
+        }
+        else if(b > a + c) {
+            return false;
+        }
+        else if(c > a + b) {
+            return false;
+        }
+        else {
+            return true;
+        }
+    }
+}
diff --git a/Exercise Solutions/Chapter 6/IsTriangleTest.java b/Exercise Solutions/Chapter 6/IsTriangleTest.java
@@ -0,0 +1,20 @@
+import junit.framework.TestCase;
+
+/**
+ * A JUnit test case class.
+ * Every method starting with the word "test" will be called when running
+ * the test with JUnit.
+ */
+public class IsTriangleTest extends TestCase {
+    
+    /**
+     * A test method.
+     * (Replace "X" with a name describing the test.  You may write as
+     * many "testSomething" methods in this class as you wish, and each
+     * one will be called when running JUnit over this class.)
+     */
+    public void testisTriangle() {
+        assertEquals(true, Series.isTriangle(1,2,3));
+    }
+    
+}
diff --git a/ch06/Exercise6.java b/ch06/Exercise6.java
@@ -0,0 +1,16 @@
+public class Exercise6 {
+    public static void main(String[] args) {
+        System.out.println(prod(1,4));
+    }
+    public static int prod(int m, int n) {
+        if (m == n) {
+            return n;
+        } else {
+            int recurse = prod(m, n - 1);
+            int result = n * recurse;
+            return result;
+            //return n * (prod(m, n-1);
+        }
+    }
+}
+        
diff --git a/ch06/Exercise6_5.java b/ch06/Exercise6_5.java
@@ -0,0 +1,37 @@
+public class Exercise6_5 {
+    public static void main(String[] args) {
+        boolean flag1 = isHoopy(202);
+        boolean flag2 = isFrabjuous(202);
+        System.out.println(flag1);
+        System.out.println(flag2);
+        
+        if(flag1 && flag2) {
+            System.out.println("ping!");
+        }
+        if(flag1 || flag2) {
+            System.out.println("pong!");
+        }
+    }
+    
+    public static boolean isHoopy(int x) {
+        boolean hoopyFlag;
+        if(x % 2 == 0) {
+            hoopyFlag = true;
+        } else {
+            hoopyFlag = false;
+        }
+        return hoopyFlag;
+    }
+    
+    public static boolean isFrabjuous(int x ) {
+        boolean frabjuousFlag;
+        if(x > 0) {
+            frabjuousFlag = true;
+        } else {
+            frabjuousFlag = false;
+        }
+        return frabjuousFlag;
+    }
+}
+
+// Results are: true; true; ping!; pong!;
diff --git a/ch06/Exercise6_8.java b/ch06/Exercise6_8.java
@@ -0,0 +1,20 @@
+public class Exercise6_8 {
+    public static void main(String[] args) {
+        System.out.println(ack(3,2));
+    }
+    public static int ack(int m, int n) {
+        if(m == 0) {
+            return n + 1;
+        }
+        if(m > 0 && n == 0) {
+            return ack(m - 1, 1);
+        }
+        if(m > 0 && n > 0) {
+            return ack(m -1, ack(m, n - 1));
+            //return 0 if n or m is less than 0;
+        } else {
+            return 0;
+        }
+    }
+        
+}
diff --git a/ch06/Exercise6_9.java b/ch06/Exercise6_9.java
@@ -0,0 +1,15 @@
+public class Exercise6_9 {
+    public static void main(String[] args) {
+        System.out.println(power(2.0, 80));
+    }
+    public static double power(double x, int n) {
+//        double dn = (double)n;
+//        Original Exercise
+//        return x * Math.pow(x, (n - 1));
+        
+//        Optional Exercise
+        double temp = Math.pow(x, (n/2));
+        return Math.pow(temp, 2);
+    }
+}
+                           
diff --git a/ch06/Fibonacci.java b/ch06/Fibonacci.java
@@ -0,0 +1,11 @@
+public class Fibonacci {
+    public static void main(String[] args) {
+        System.out.println(fibonacci(3));
+    }
+    public static int fibonacci(int n) {
+        if(n == 1 || n == 2) {
+            return 1;
+        }
+        return fibonacci(n - 1) + fibonacci(n - 2);
+    }
+}
diff --git a/ch06/FibonacciTest.java b/ch06/FibonacciTest.java
@@ -0,0 +1,22 @@
+import junit.framework.TestCase;
+
+/**
+ * A JUnit test case class.
+ * Every method starting with the word "test" will be called when running
+ * the test with JUnit.
+ */
+public class FibonacciTest extends TestCase {
+    
+    /**
+     * A test method.
+     * (Replace "X" with a name describing the test.  You may write as
+     * many "testSomething" methods in this class as you wish, and each
+     * one will be called when running JUnit over this class.)
+     */
+    public void testFibonacci() {
+        assertEquals(1, Series.fibonacci(1));
+        assertEquals(1, Series.fibonacci(2));
+        assertEquals(2, Series.fibonacci(3));
+    }
+    
+}
diff --git a/ch06/Multadd.java b/ch06/Multadd.java
@@ -0,0 +1,30 @@
+public class Multadd {
+    public static void main(String[] args) {
+        System.out.println(multadd(1.0, 2.0, 3.0));
+        
+        double a = Math.cos(Math.PI/4);
+        double b = 0.5;
+        double c = Math.sin(Math.PI/4);
+        System.out.println(multadd(a, b, c));
+        
+        double a1 = 1;
+        double b1 = Math.log(20);
+        double c1 = Math.log(20);
+        System.out.println(multadd(a1, b1, c1));
+        
+        //expSum
+        System.out.println(expSum(2));
+        
+    }
+    public static double multadd(double a, double b, double c) {
+        return a * b + c;
+    }
+    
+    public static double expSum(double x) {
+        double a2 = x;
+        double b2 = Math.exp(-x);
+        double c2 = Math.sqrt(1 - Math.exp(-x));
+        return multadd(a2, b2, c2);
+    }
+                              
+}
diff --git a/ch06/OddSum.java b/ch06/OddSum.java
@@ -0,0 +1,15 @@
+public class OddSum {
+    public static void main(String[] args) {
+        System.out.println(oddSum(15));
+    }
+    public static int oddSum(int n) {
+        if(n == 0) {
+            return 0;
+        }
+        if(n == 1) {
+            return 1;
+        } else {        
+           return oddSum(n-2) + n;
+        }
+    }
+}
