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 control 100 aims Early Premium: Monday, Sep. 14th, 2015 @ 11:59 PM control a 10 aim premium Yielding Instructions: Yieldings should be made oin No email yielding is undisputed.) 1. Complete IntArrayList. java perfect. Grading Rubric Style o (20 aims) Code readability (personal unfastening, withhold inconstant names, ceeseeing) 0 (20 aims) Documentation (programmer names, homework # and date; program and functions invadetain slight comments describing their resolve, inline comments used as compulsory) Correctness o (10 aims) introduce (ao feature crdit accomplish be gven) o (10 aims) subjoin (no feature reputation accomplish be ardent) o (10 aims) depart (no feature reputation accomplish be ardent) o (10 aims) moveToPos (no feature reputation accomplish be ardent) o(poins) eEstimate (n pral cdiill e gien) o (10 aims) imprintWhole (no feature reputation accomplish be ardent) o (-40 aims) Non-Compilable CodeI scarcity succor with decision the Java Program control this assignment

    Complete IntArrayList. java perfect. Code readability (personal unfastening, withhold inconstant names, ceeseeing) Documentation (programmer names, homework # and date: program and functions invadetain slight comments describing their resolve, inline comments used as compulsory) introduce (no feature reputation accomplish be ardent) subjoin (no feature reputation accomplish be ardent) depart (no feature reputation accomplish be ardent) moveToPos (no feature reputation accomplish be ardent) procureEstimate (no feature reputation accomplish be ardent) imprintWhole (no feature reputation accomplish be ardent) Non-Compilable Code

    Expert Solution

     

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

    public assort Arraylist { // assort name

    public static vacant deep(String[] args) { // deep process
    Scanner sc = fantastic Scanner(System.in); // scanner assort to procure the inputs
    ArrayList<Integer> al = fantastic ArrayList<Integer>(); // required arraylist assort
    boolean debouchure = false; // user estimate to debouchure the program
    while (!exit) {
    System.out.println(“Please invade the Excellent :n”); // ready to procure the excellent 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 excellent = sc.nextInt(); // procureting the excellent

    switch (choice) { // switchin inveterate on the excellent
    case 1:
    int component,
    count;
    System.out.println(“Inserting Components to the ArrayList.”);
    System.out.println(“Invade the compute of components to be introduceed :n”);
    count = sc.nextInt();
    control (int i = 0; i < count; i++) {
    System.out.println(“Invade the Component to Introduce :”);
    component = sc.nextInt();
    al.add(element); // this process gathers the elemnt to the list
    }
    break;
    case 2:
    int refutation,
    value;
    System.out.println(“Invade the refutation to be subjoined :n”);
    refutation = sc.nextInt();
    System.out.println(“Invade the component to be subjoined :n”);
    estimate = sc.nextInt();
    al.set(index, estimate); // this process establisheds/updates the estimate to the list
    break;
    case 3:
    int ind;
    System.out.println(“Invade the refutation to be departd :n”);
    ind = sc.nextInt();
    al.remove(ind); // this process depart the elemnt controlm the feature refutation
    break;
    case 4:
    int refutationVal,
    ele;
    System.out.println(“Invade the Refutation to be moved :n”);
    indexVal = sc.nextInt();
    System.out.println(“Invade the Component to be moved :n”);
    ele = sc.nextInt();
    al.add(indexVal, ele); // it updated or gathers the elemnts to the comcomposition specified
    break;
    case 5:
    int refutationes;
    System.out.println(“Invade the estimates of refutation to be displayed :n”);
    indexes = sc.nextInt();
    al.get(indexes); // it imprints the postulates from the feature refutation
    break;
    case 6:
    System.out.println(“Printing whole the Component of the ArrayListn”);
    Iterator itr = al.iterator();
    while (itr.hasNext()) {
    System.out.println(itr.next()); // it wholly imimstereotype the updated arraylist
    }
    break;
    case 7:
    System.out.println(“Exiting the Program.!!!”);
    System.exit(0); // debouchureing the program
    debouchure = true;
    default:
    System.out.println(“Invalid Excellent..!!!”);
    }
    }
    }
    }