Browse P
Alphabetical listing with fast deep pagination.
81033 items • Page 1616 / 1621
public static ArrayList doArrayListSearchGreatest(int numItems) { Syste
public static ArrayList<Integer> doArrayListSearchGreatest(int numItems) { System.out.print("doArrayListSearchGreatest: "); ArrayList<Integer> list = new…
public static ArrayList doArrayListSearchGreatest(int numItems) { Syste
public static ArrayList<Integer> doArrayListSearchGreatest(int numItems) { System.out.print("doArrayListSearchGreatest: "); ArrayList<Integer> list = …
public static ArrayList doArrayListSearchMedian(int numItems) { System.
public static ArrayList<Integer> doArrayListSearchMedian(int numItems) { System.out.print("doArrayListSearchMedian: "); ArrayList<Integer> list = new Arr…
public static ArrayList doArrayListSearchMedian(int numItems) { System.
public static ArrayList<Integer> doArrayListSearchMedian(int numItems) { System.out.print("doArrayListSearchMedian: "); ArrayList<Integer> list = new Arr…
public static ArrayList doArrayListSearchMedian(int numItems) { System.
public static ArrayList<Integer> doArrayListSearchMedian(int numItems) { System.out.print("doArrayListSearchMedian: "); ArrayList<Integer> list = new Arr…
public static ArrayList doArrayListSearchSmallest(int numItems) { Syste
public static ArrayList<Integer> doArrayListSearchSmallest(int numItems) { System.out.print("doArrayListSearchSmallest: "); ArrayList<Integer> list = …
public static HashSet doHashSetInsertMedian(int numItems) { System.out.
public static HashSet<Integer> doHashSetInsertMedian(int numItems) { System.out.print("doHashSetInsertMedian: "); HashSet<Integer> set = new HashSet&l…
public static HashSet doHashSetRemoveMedian(int numItems) { System.out.
public static HashSet<Integer> doHashSetRemoveMedian(int numItems) { System.out.print("doHashSetRemoveMedian: "); HashSet<Integer> set = new HashSet<&…
public static HashSet doHashSetSearchGreatest(int numItems) { System.ou
public static HashSet<Integer> doHashSetSearchGreatest(int numItems) { System.out.print("doHashSetSearchGreatest: "); HashSet<Integer> set = new HashSet&…
public static HashSet doHashSetSearchGreatest(int numItems) { System.ou
public static HashSet<Integer> doHashSetSearchGreatest(int numItems) { System.out.print("doHashSetSearchGreatest: "); HashSet<Integer> set = new HashS…
public static HashSet doHashSetSearchMedian(int numItems) { System.out.
public static HashSet<Integer> doHashSetSearchMedian(int numItems) { System.out.print("doHashSetSearchMedian: "); HashSet<Integer> set = new HashSet&l…
public static HashSet doHashSetSearchSmallest(int numItems) { System.ou
public static HashSet<Integer> doHashSetSearchSmallest(int numItems) { System.out.print("doHashSetSearchSmallest: "); HashSet<Integer> set = new HashSet&…
public static LinkedHashSet doLinkedHashSetRemoveFromSmallest(int numIt
public static LinkedHashSet<Integer> doLinkedHashSetRemoveFromSmallest(int numItems) { System.out.print("doLinkedHashSetRemoveFromSmallest: "); LinkedHashSet&l…
public static LinkedHashSet doLinkedHashSetSearchSmallest(int numItems)
public static LinkedHashSet<Integer> doLinkedHashSetSearchSmallest(int numItems) { System.out.print("doLinkedHashSetSearchSmallest: "); LinkedHashSet<Intege…
public static LinkedList doLinkedListInsertAtMedian(int numItems) { Sys
public static LinkedList<Integer> doLinkedListInsertAtMedian(int numItems) { System.out.print("doLinkedListInsertAtMedian: "); LinkedList<Integer> list =…
public static LinkedList doLinkedListSearchSmallest(int numItems) { Sys
public static LinkedList<Integer> doLinkedListSearchSmallest(int numItems) { System.out.print("doLinkedListSearchSmallest: "); LinkedList<Integer> lis…
public static List distrib( int n, int k, int p ) { if (p > n) ret
public static List<List<String>> distrib( int n, int k, int p ) { if (p > n) return new ArrayList<List<String>>(); if (k ==1) return new ArrayList<Li…
public static String mystery (String s) { char []temp = new char[1]; if (s.equal
public static String mystery (String s) { char []temp = new char[1]; if (s.equals("")) return""; if("aeiouAEIOU".indexOf(s.charAt(0)) != -1) { temp[0]=s.charAt(0); return new Stri…
public static String rotateString( String s. int n) Return the result of rotatin
public static String rotateString( String s. int n) Return the result of rotating the string n places to the right, circularly: rotateString( "Pineapple". 0) returns "Pineapple" r…
public static String toString(Point [] data ) -- returns the data in String form
public static String toString(Point[] data) -- returns the data in String form with the following format: {(x1, y1), (x2, y2), (x3, y3),...} (in other words, the Points in typical…
public static boolean allTheKnightsAreSafe(ArrayList coordinateStrings,
public static boolean allTheKnightsAreSafe(ArrayList<String> coordinateStrings, int boardSize) Description: Given an ArrayList of coordinate strings representing the locatio…
public static boolean hasOddStraight(Card[] cards) Five cards (not four) with va
public static boolean hasOddStraight(Card[] cards) Five cards (not four) with values that are consecutive odd values without "wrapping around" is called an "Odd Straight". For exa…
public static boolean isEaster(int month, int day, int year) isEaster : This met
public static boolean isEaster(int month, int day, int year) isEaster : This method has 3 int type parameters for month, day and year. This method returns true if the date represe…
public static boolean isValid(long number) int numSize - getSize(number); if (nu
public static boolean isValid(long number) int numSize - getSize(number); if (numSize > 16 1I numSize 13) return false; int sumsumOfDoubleEvenPlace (number)sumOfoddPlace (numbe…
public static char methodHeading(int n, double num) Based on the method heading
public static char methodHeading(int n, double num) Based on the method heading in the accompanying figure, what is the return type of the value returned? a static b char c int d …
public static double secret(int first, double second) { double temp; if (second
public static double secret(int first, double second) { double temp; if (second > first) temp = first * second; else temp = first - second; return temp; } What is the name of t…
public static double[] calcPerceptronInput(double[] example, double[][] kernelSe
public static double[] calcPerceptronInput(double[] example, double[][] kernelSet, double variance){ //Create a new 1D array for an input to the perceptron stage //length: one lar…
public static double[][] selectKernelSet(double[][] trainingSet, double kernelPr
public static double[][] selectKernelSet(double[][] trainingSet, double kernelProportion, Random rng){ /*Create a new 2D array for the kernel set. number of rows: kernelProportion…
public static double[][] selectKernelSet(double[][] trainingSet, double kernelPr
public static double[][] selectKernelSet(double[][] trainingSet, double kernelProportion, Random rng){ //Create a new 2D array for the kernel set. //number of rows: kernelProporti…
public static double[][] selectKernelSet(double[][] trainingSet, double kernelPr
public static double[][] selectKernelSet(double[][] trainingSet, double kernelProportion, Random rng){ /*Create a new 2D array for the kernel set. number of rows: kernelProportion…
public static double[][] trainNetwork(double[][] trainingSet, double[][] kernelS
public static double[][] trainNetwork(double[][] trainingSet, double[][] kernelSet, double variance, int nClassifications, double learningRate, int nIterations, Random rng){ //Cre…
public static in max(int a, int b) { int result; if(a > b) result = a; else resu
public static in max(int a, int b) { int result; if(a > b) result = a; else result = b; return result; } public static double max(int a, double ){ double result; if (a > b) …
public static int binarySearch(int anArray[], int first, int last, int value) {
public static int binarySearch(int anArray[], int first, int last, int value) { /*Searches the array items anArray[first] through anArray[last] for value by using a binary search.…
public static int classifyInput(double[] perceptronInput, double[][] weights){ /
public static int classifyInput(double[] perceptronInput, double[][] weights){ //Create a new 1D array for output. There is one output for each output node, //and the number of ou…
public static int compareTo( String digitSequenceO, String digitSequencel) First
public static int compareTo( String digitSequenceO, String digitSequencel) First, if either digitSequenceO or digitSequencel is a bogus digitSequence, complain and die. (Of course…
public static int daysPassed(int month, int day, int year){ int daysPassed = 0;
public static int daysPassed(int month, int day, int year){ int daysPassed = 0; if(month == 1){ daysPassed = day; } if(month == 2){ daysPassed = 31 + day; } if(month == 3){ if(…
public static int numOfCoins(int[] coinsList, int value){ /** Write your code he
public static int numOfCoins(int[] coinsList, int value){ /** Write your code here to find out minimum number of coins required to provide the change for a given value. This metho…
public static int secret(int x) { int i , j i = 2 * x; if (i > 10) j = x / 2; el
public static int secret(int x) { int i , j i = 2 * x; if (i > 10) j = x / 2; else j = x / 3; return j; } public static int another(int a, int b) { int j; j = 0; for (int i = a…
public static int twoSum(int[] arr) – returns the number of pairs of unique valu
public static int twoSum(int[] arr) – returns the number of pairs of unique values whose sum equals zero. Assume that the input array is sorted in ascending order and the values s…
public static int[] BucketSort(int[] array, int numBuckets){ //TODO: implement b
public static int[] BucketSort(int[] array, int numBuckets){ //TODO: implement bucket sort as described at any of the following links: //http://www.pe…
public static int[] histogram (int[] ages) This method should count up how many
public static int[] histogram (int[] ages) This method should count up how many times each integer occurs within the input array, and return a new array with these counts. The new…
public static int[] make1DArray(int [][] anArray) : The method creates a one-dim
public static int[] make1DArray(int [][] anArray): The method creates a one-dimensional array out of a two-dimensional array. It does so by copying everything in a row-by-row fash…
public static int[] rotateLeft(int[] a, int n) { int[] temp = new int[a.length];
public static int[] rotateLeft(int[] a, int n) { int[] temp = new int[a.length]; return temp; } Complete this method Java Array This method takes in a reference to an integer a…
public static int[][] enter2DPosArray() : The method enters a two-dimensional in
public static int[][] enter2DPosArray(): The method enters a two-dimensional integer array from the user. It forces the user to enter positive (> 0) values for the number of ro…
public static long terribleFibonacci (int n) if (n 1) return n; return terribleF
public static long terribleFibonacci (int n) if (n 1) return n; return terribleFibonacci (n -1) + terribleFibonacci (n -2); x * * PROBLEM 4: The impLementation of terribleFibonacc…
public static void Display(GirlScoutscout) { Console.WriteLine(\"{0}{1} {2}\", s
public static void Display(GirlScoutscout) { Console.WriteLine("{0}{1} {2}", scout.ScoutName, scout.TroopNum,scout.DuesOwed.ToString("C")); } } class G…
public static void insertNode(String state, String team, String fName, int num)
public static void insertNode(String state, String team, String fName, int num) { Node mb = new Node(); mb.state = state; mb.team = team; mb.fName =…
public static void main (String[] args) throws Exception { // ALWAYS TEST FIRST
public static void main (String[] args) throws Exception { // ALWAYS TEST FIRST TO VERIFY USER PUT REQUIRED INPUT FILE NAME ON THE COMMAND LINE if (args.length < 1 ) { System.o…
public static void main (String[] args) throws Exception { final int ARRAY_MAX =
public static void main (String[] args) throws Exception { final int ARRAY_MAX = 30; // "args" is the list of tokens you put after "java Project3" on command line if (args.length …
public static void main (String[] args) throws FileNotFoundException { PrintWrit
public static void main (String[] args) throws FileNotFoundException { PrintWriter outFile = new PrintWriter("info.out"); //declare variables double fedTax = .15; double stateTax …