Browse P
Alphabetical listing with fast deep pagination.
81033 items • Page 1611 / 1621
public class Lab8_Driver { public static void main(String[] args) { // test gift
public class Lab8_Driver { public static void main(String[] args) { // test gift card System.out.println("Test GiftCard Class "); GiftCard giftCard = new G…
public class Lecturer { private String firstName ; private String familyName ; p
public class Lecturer { private String firstName ; private String familyName ; private int phoneNo ; private String title ; public Lecturer (String firstNameIn, String familyNameI…
public class Letter{ // Attributes are given to you, now complete the following
public class Letter{ // Attributes are given to you, now complete the following methods. private char letter; private int number; //Constructors public Letter() { // your …
public class LibrariesLecture3{ // 5 points static int Q1(String word1, String w
public class LibrariesLecture3{ // 5 points static int Q1(String word1, String word2) { // return the number of rhyming syllables between the two input words. We w…
public class LinkedList { // Defined Node class private class Node { private Obj
public class LinkedList { // Defined Node class private class Node { private Object Data = null; private Node Next = null; public Node() { Data = null; Next = null; } public Node(…
public class LinkedList { // Defined Node class private class Node { private Obj
public class LinkedList { // Defined Node class private class Node { private Object Data = null; private Node Next = null; public Node() { Data = null; Next = null; } pub…
public class LinkedList { // Defined Node class private class Node { private Obj
public class LinkedList { // Defined Node class private class Node { private Object Data = null; private Node Next = null; public Node() { Data = null; Next = null; } pub…
public class LinkedList { private Node front; //private int count; //private Nod
public class LinkedList { private Node front; //private int count; //private Node end; public LinkedList(Node f ) { front = f; } public LinkedList() { fro…
public class LinkedList { private Node front; //private int count; //private Nod
public class LinkedList { private Node front; //private int count; //private Node end; public LinkedList(Node f) { front = f; } public LinkedList() { f…
public class LinkedList { private class Node { private
public class LinkedList<T extends Comparable<T>> { private class Node { private T data; private Node next, thread; private Node(T data) { this…
public class ListUtility{ public List findUnion(List list1, List lis
public class ListUtility<T>{ public List<T> findUnion(List<T> list1, List<T> list2) { List<T> newList = new ArrayList<>(); …
public class Location { public static final Location JMU = new Location(38.43542
public class Location { public static final Location JMU = new Location(38.435427, - 78.872942); public static final Location ISAT = new Location(38.434663, - 78.863732); private …
public class LotsOfMethods { public static void main(String [] args) { // Sample
public class LotsOfMethods { public static void main(String [] args) { // Sample method getting called. Just reports the String sent to the method // by printing "Received: " foll…
public class Lottery { private int [] ticket; public final int size = 8; public
public class Lottery { private int[] ticket; public final int size = 8; public void generateTicket() { /* * this method will generate r…
public class Main f public static ? = list.get(0); //loopin through remaining ob
public class Main f public static ? = list.get(0); //loopin through remaining objects and combining them for (int i l; i ) stringCombinations.add (new StringCombination ("one")) s…
public class Main { public enum StateOfWater {SOLID,LIQUID, GAS} public static v
public class Main { public enum StateOfWater {SOLID,LIQUID, GAS} public static void main(String[] args) { // TODO Auto-generated method stub StateOfWater result; …
public class Main { public static void main(String[] args) { // Feel free to add
public class Main { public static void main(String[] args) { // Feel free to add more to this to test things out. // You will be graded by the automatic tests you get from "Run Te…
public class Main { public static void main(String[] args) { Scannerinputs = new
public class Main { public static void main(String[] args) { Scannerinputs = new Scanner(System.in); Stringch, sch, sc; doublesal; …
public class MainBank { /** * @param args the command line arguments */ public s
public class MainBank { /** * @param args the command line arguments */ public static void main(String[] args) { Bank [] banks = {new Bank("Toronto Dominion", 3), new Bank("Ban…
public class Mall { private final int NUM_STORES = 2; private String name; Store
public class Mall { private final int NUM_STORES = 2; private String name; Store[] storeList; public Mall() { storeList = new Store[NUM_STORES]; } //TODO 01: create a setter for n…
public class Mall { private final int NUM_STORES = 2; private String name; Store
public class Mall { private final int NUM_STORES = 2; private String name; Store[] storeList; public Mall() { storeList = new Store[NUM_STORES]; } //TODO 01: create a setter for n…
public class Map { int Position; int[][] Grid = new int [16][16]; void Map() { f
public class Map { int Position; int[][] Grid = new int [16][16]; void Map() { for (int i=0; i<16; i++) { Grid[i] = new ; IVE GOT A RED LINE HERE WHAT DO I PUT IN IT } } // ALL…
public class Map { int Position; int[][] Grid = new int [16][16]; void Map() { f
public class Map { int Position; int[][] Grid = new int [16][16]; void Map() { for (int i=0; i<16; i++) { Grid[i] = new ; IVE GOT A RED LINE HERE WHAT DO I PUT IN IT } } // ALL…
public class MathToolbox { /** This method should return true if and only if the
public class MathToolbox { /** This method should return true if and only if the input i is a positive * prime number. A prime is a number which is only divisible by 1 and * itsel…
public class Matrix { private int nRow, nCol; private double[] data; // must sto
public class Matrix { private int nRow, nCol; private double[] data; // must store as linear array unless 0 //getter for NRow - do not modify public int getNRow() { return nRow; }…
public class Matrix { private int nRow, nCol; private double[] data; // must sto
public class Matrix { private int nRow, nCol; private double[] data; // must store as linear array unless 0 //getter for NRow - do not modify public int getNRow() { return nRow; }…
public class Matrix { private int[][] matrix; /** * default constructor -- * Cre
public class Matrix { private int[][] matrix; /** * default constructor -- * Creates an matrix that has 2 rows and 2 columns */ public Matrix(int [][] m) { boolean valid = tr…
public class MaxPQ { private static int DEFAULT_CAP
public class MaxPQ<Key extends Comparable<Key>> { private static int DEFAULT_CAPCITY=10; // heap-ordered complete binary tree // in pq[1..N] with pq[0] unused private …
public class MaxSumMain { public static void main (String[] args) { int[] toTest
public class MaxSumMain { public static void main (String[] args) { int[] toTest = new int[] { 1, -1, 2, -1, -1, -1, -1, -1, -1 }; System.out.print("["); for (int i : toTest) Syst…
public class MaxTemp{ /** t1 and t2 are considered close enough if Math.abs(t1-t
public class MaxTemp{ /** t1 and t2 are considered close enough if Math.abs(t1-t2) < EPSILON */ public static final double EPSILON = 0.01; /* add attributes as you need */ /* -…
public class Median { /* partition - helper method for your recursive median-fin
public class Median { /* partition - helper method for your recursive median-finding method */ private static int partition(int[] arr, int first, int last) { int pivot = arr[(firs…
public class Median { /* partition - helper method for your recursive median-fin
public class Median { /* partition - helper method for your recursive median-finding method */ private static int partition(int[] arr, int first, int last) { int pivot = arr[(firs…
public class Median { /* partition - helper method for your recursive median-fin
public class Median { /* partition - helper method for your recursive median-finding method */ private static int partition(int[] arr, int first, int last) { int pivot = arr[(firs…
public class Median { /* partition - helper method for your recursive median-fin
public class Median { /* partition - helper method for your recursive median-finding method */ private static int partition(int[] arr, int first, int last) { int pivot = arr[(firs…
public class Median { /* partition - helper method for your recursive median-fin
public class Median { /* partition - helper method for your recursive median-finding method */ private static int partition(int[] arr, int first, int last) { int pivot = arr[(firs…
public class Median { /* partition - helper method for your recursive median-fin
public class Median { /* partition - helper method for your recursive median-finding method */ private static int partition(int[] arr, int first, int last) { int pivot = arr[(firs…
public class Median { /* partition - helper method for your recursive median-fin
public class Median { /* partition - helper method for your recursive median-finding method */ private static int partition(int[] arr, int first, int last) { int pivot = arr[(firs…
public class Median { /* partition - helper method for your recursive median-fin
public class Median { /* partition - helper method for your recursive median-finding method */ private static int partition(int[] arr, int first, int last) { int pivot = arr[(firs…
public class Median { /* partition - helper method for your recursive median-fin
public class Median { /* partition - helper method for your recursive median-finding method */ private static int partition(int[] arr, int first, int last) { int pivot = arr[(firs…
public class Member { private T id; public Member(T id) { this.id = id; } public
public class Member { private T id; public Member(T id) { this.id = id; } public T getId() { return id; } public void setId(T id) { this.id = id; } public < T > void printId…
public class MergeSort { // The method for sorting the numbers public static voi
public class MergeSort { // The method for sorting the numbers public static void mergeSort(int[] list) { if (list.length > 1) { // Merge sort the first half int[]…
public class Minefield { // An m x n minefiled is modeled as a 2D array of boole
public class Minefield { // An m x n minefiled is modeled as a 2D array of booleans, with "true" // representing a mine cell and "false" representing an empty cell. // SUGGESTION:…
public class MonteCarlo { public static void main(String args[]) { final int N =
public class MonteCarlo { public static void main(String args[]) { final int N = 5000; int numInside = 0; double X, Y, radius, mypi; for (int i=0; i<N; i++) { /* make a throw: …
public class Month { private int monthNum; public Month() { this.monthNum = 1; }
public class Month { private int monthNum; public Month() { this.monthNum = 1; } Month(int month) throws InvalidMonthException { if(month >= 1 && month <= 12) thi…
public class MonthlyPaycheck { public static void main (String[] args) throws Fi
public class MonthlyPaycheck { public static void main (String[] args) throws FileNotFoundException { PrintWriter outFile = new PrintWriter("info.out"); //declare variables double…
public class MultiSplit { // TODO - write your code below this comment. // You w
public class MultiSplit { // TODO - write your code below this comment. // You will need to write two methods: // // 1.) A method named multiSplit which will take an // array of s…
public class MultipleChoice{ String question = (\"\"), answerText = (\"\"), ques
public class MultipleChoice{ String question = (""), answerText = (""), questionText = (""), answer_a = "", answer_b = "", answer_c = "", answer_d = "", answer_e = ""; boole…
public class MyDateTime { static int hr,min,sec,year,day,month; public MyDateTim
public class MyDateTime { static int hr,min,sec,year,day,month; public MyDateTime() { hr=0; min=0; sec=0; year=0; day=0; month=0; } public MyDateTime(int m,int d,int y,int h,int m…
public class MyGraph implements Graph{ private ArrayList
public class MyGraph implements Graph<Integer,Double>{ private ArrayList<MyVertex> vertices = new ArrayList<MyVertex>(); // list of vertices idexed by the vertex…
public class MyIntSET { private Node root; private static class Node { public fi
public class MyIntSET { private Node root; private static class Node { public final int key; public Node left, right; public Node(int key) { this.key = key; } } public void printL…