QUESTION:Select the 4 (four) public method of the BitwiseUtil class specified in the appendix and test using JUnit to retrieve data from files.

Please share as text file. burhan.kivrak98 gm ail.com

package org.csystem.util;

import static java.lang.Math.*;

public final class NumberUtil { private static final String [] ONES_TR; private static final String [] TENS_TR;

static { ONES_TR = new String[]{"", "bir", "iki", "", "drt", "be", "alt", "yedi", "sekiz", "dokuz"}; TENS_TR = new String[]{"", "on", "yirmi", "otuz", "krk", "elli", "altm", "yetmi", "seksen", "doksan"}; }

private static int[] getDigits(long val, int n) { long value = Math.abs(val); int count = value == 0 ? 1 : (int)Math.log10(value) / n + 1; int [] digits = new int[count]; int powerOfTen = (int)Math.pow(10, n);

for (int i = count - 1; i >= 0; digits[i] = (int)(value % powerOfTen), value /= powerOfTen, --i) ;

return digits; }

private static String numberToText3DigitsTR(int val) { if(val == 0) return "sfr";

String text = val < 0 ? "eksi" : ""; int value = Math.abs(val); int a = value / 100; int b = value / 10 % 10; int c = value % 10;

if (a != 0) { if (a != 1) text += ONES_TR[a]; text += "yz"; }

if (b != 0) text += TENS_TR[b];

if (c != 0) text += ONES_TR[c];

return text; }

private NumberUtil() { }

public static int factorial(int n) { if (n < 0) return -1; int result = 1; for (int i = 2; i <= n; ++i) result *= i; return result; }

public static int[] getDigits(int val) { return getDigits((long)val); }

public static int[] getDigits(long val) { return getDigits(val, 1); }

public static int[] getDigitsInTwos(long val) { return getDigits(val, 2); }

public static int[] getDigitsInThrees(long val) { return getDigits(val, 3); }

public static int getDigitsCount(long val) { return val == 0 ? 1 : (int)log10(abs(val)) + 1; } public static int getDigitsPowSum(int val) { int count = getDigitsCount(val); int sum = 0; while (val != 0) { sum += pow(val % 10, count); val /= 10; } return sum; } public static int getDigitsSum(int val) { val = abs(val); int sum = 0; while (val != 0) { sum += val % 10; val /= 10; } return sum; } public static int getFibonacciNumber(int n) { if (n <= 0) return -1; if (n <= 2) return n - 1; int prev1 = 1, prev2 = 0, val = 0; for (int i = 2; i < n; ++i) { val = prev1 + prev2; prev2 = prev1; prev1 = val; } return val; }

public static int getNextFibonacciNumber(int val) { if (val < 0) return 0; int prev1 = 1, prev2 = 0, result; for (;;) { result = prev1 + prev2; if (result > val) return result; prev2 = prev1; prev1 = result; } } public static int getPrime(int n) { if (n <= 0) return -1; int count = 0; int val = 2; for (int i = 2; count < n; ++i) if (isPrime(i)) { ++count; val = i; } return val; } public static int getReverse(int val) { int reverse = 0; while (val != 0) { reverse = reverse * 10 + val % 10; val /= 10; } return reverse; } public static boolean isArmstrong(int val) { if (val < 0) return false; return getDigitsPowSum(val) == val; } public static boolean isEven(int val) { return val % 2 == 0; } public static boolean isOdd(int val) { return !isEven(val); } public static boolean isPrime(int val) { if (val <= 1) return false; if (val % 2 == 0) return val == 2; if (val % 3 == 0) return val == 3; if (val % 5 == 0) return val == 5; if (val % 7 == 0) return val == 7; int sqrtVal = (int)sqrt(val); for (int i = 11; i <= sqrtVal; i += 2) if (val % i == 0) return false; return true; }

public static boolean isNotPrime(int val) { return !isPrime(val); } public static int max(int a, int b, int c) { return Math.max(Math.max(a, b), c); }

public static int min(int a, int b, int c) { return Math.min(Math.min(a, b), c); }

public static String numberToTextTR(long val) { String text;

//TODO: Homework-012-3. soru text = numberToText3DigitsTR((int)val);

return text; }

public static int pow(int a, int b) { if (b <= 0) return 1; int result = 1; while (b-- > 0) result *= a; return result; } }