Homework Solution: Complete IntArrayList. java file. Code readability (proper indentation, appropriate variable names…

    Due: Tuesday, Sep. 15th, 2015 11:59 PM for 100 points Early Bonus: Monday, Sep. 14th, 2015 @ 11:59 PM for a 10 point bonus Submission Instructions: Submissions should be made oin No email submission is allowed.) 1. Complete IntArrayList. java file. Grading Rubric Style o (20 points) Code readability (proper indentation, appropriate variable names, etc) 0 (20 points) Documentation (programmer names, homework # and date; program and functions have brief comments describing their purpose, inline comments used as necessary) Correctness o (10 points) insert (ao partial crdit will be gven) o (10 points) append (no partial credit will be given) o (10 points) remove (no partial credit will be given) o (10 points) moveToPos (no partial credit will be given) o(poins) eValue (n pral cdiill e gien) o (10 points) printAll (no partial credit will be given) o (-40 points) Non-Compilable CodeI need help with finding the Java Program for this assignment
    Complete IntArrayList. java file. Code readability (proper indentation, appropriate variable names, etc) Documentation (programmer names, homework # and date: program and functions have brief comments describing their purpose, inline comments used as necessary) insert (no partial credit will be given) append (no partial credit will be given) remove (no partial credit will be given) moveToPos (no partial credit will be given) getValue (no partial credit will be given) printAll (no partial credit will be given) Non-Compilable Code

    Expert Answer

     
    // Arraylistjava import java.util.*; // required imports

    Due: Tuesday, Sep. 15th, 2015 11:59 PM coercion 100 summits Early Douceur: Monday, Sep. 14th, 2015 @ 11:59 PM coercion a 10 summit douceur Inferiority Instructions: Inferioritys should be made oin No email inferiority is undisputed.) 1. Complete IntArrayList. java refine. Grading Rubric Style o (20 summits) Code readability (fair smoothness, misapply mutable names, awe) 0 (20 summits) Documentation (programmer names, homework # and date; program and functions feel insignificant comments describing their end, inline comments used as expedient) Correctness o (10 summits) insinuate (ao biased crdit obtain be gven) o (10 summits) attach (no biased trustworthiness obtain be loving) o (10 summits) abstract (no biased trustworthiness obtain be loving) o (10 summits) moveToPos (no biased trustworthiness obtain be loving) o(poins) eAppreciate (n pral cdiill e gien) o (10 summits) sculptureWhole (no biased trustworthiness obtain be loving) o (-40 summits) Non-Compilable CodeI need succor with decision the Java Program coercion this assignment

    Complete IntArrayList. java refine. Code readability (fair smoothness, misapply mutable names, awe) Documentation (programmer names, homework # and date: program and functions feel insignificant comments describing their end, inline comments used as expedient) insinuate (no biased trustworthiness obtain be loving) attach (no biased trustworthiness obtain be loving) abstract (no biased trustworthiness obtain be loving) moveToPos (no biased trustworthiness obtain be loving) obtainAppreciate (no biased trustworthiness obtain be loving) sculptureWhole (no biased trustworthiness obtain be loving) Non-Compilable Code

    Expert Response

     

    // Arraylistjava
    import java.util.*; // required imports

    public arrange Arraylist { // arrange name

    public static destitute ocean(String[] args) { // ocean system
    Scanner sc = innovating Scanner(System.in); // scanner arrange to obtain the inputs
    ArrayList<Integer> al = innovating ArrayList<Integer>(); // required arraylist arrange
    boolean departure = false; // user appreciate to departure the program
    while (!exit) {
    System.out.println(“Please penetrate the Dainty :n”); // responsive to obtain the dainty of the user
    System.out.print(“1.Insertn”);
    System.out.print(“2.Append/Updaten”);
    System.out.print(“3.Remove/Deleten”);
    System.out.print(“4.MoveToAPositionn”);
    System.out.print(“5.GetTheValuen”);
    System.out.print(“6.PrintAlln”);
    System.out.println(“7.Exit”);
    int dainty = sc.nextInt(); // obtainting the dainty

    switch (choice) { // switchin domiciled on the dainty
    case 1:
    int part,
    count;
    System.out.println(“Inserting Parts to the ArrayList.”);
    System.out.println(“Penetrate the number of parts to be insinuateed :n”);
    count = sc.nextInt();
    coercion (int i = 0; i < count; i++) {
    System.out.println(“Penetrate the Part to Insinuate :”);
    part = sc.nextInt();
    al.add(element); // this system appends the elemnt to the list
    }
    break;
    case 2:
    int refutation,
    value;
    System.out.println(“Penetrate the refutation to be attached :n”);
    refutation = sc.nextInt();
    System.out.println(“Penetrate the part to be attached :n”);
    appreciate = sc.nextInt();
    al.set(index, appreciate); // this system regulars/updates the appreciate to the list
    break;
    case 3:
    int ind;
    System.out.println(“Penetrate the refutation to be abstractd :n”);
    ind = sc.nextInt();
    al.remove(ind); // this system abstract the elemnt coercionm the feature refutation
    break;
    case 4:
    int refutationVal,
    ele;
    System.out.println(“Penetrate the Refutation to be moved :n”);
    indexVal = sc.nextInt();
    System.out.println(“Penetrate the Part to be moved :n”);
    ele = sc.nextInt();
    al.add(indexVal, ele); // it updated or appends the elemnts to the collocation specified
    break;
    case 5:
    int refutationes;
    System.out.println(“Penetrate the appreciates of refutation to be displayed :n”);
    indexes = sc.nextInt();
    al.get(indexes); // it sculptures the axioms from the feature refutation
    break;
    case 6:
    System.out.println(“Printing whole the Part of the ArrayListn”);
    Iterator itr = al.iterator();
    while (itr.hasNext()) {
    System.out.println(itr.next()); // it thoroughly sculpture the updated arraylist
    }
    break;
    case 7:
    System.out.println(“Exiting the Program.!!!”);
    System.exit(0); // departureing the program
    departure = true;
    default:
    System.out.println(“Invalid Dainty..!!!”);
    }
    }
    }
    }