Using examples of your own, write short notes to explain how ArrayList and LinkedList work in Java. please give me a code example how to do that?

How exactly can one determine how successful an ArrayList really is?

Write program in java

We were given the following code to solve a Pentomino puzzle, several methods might need to be added or editted to solve the problem. The program should take in an input of 3 4 5 6 for 3x20 4x15 5x12 6x10 grids. Then output the number of correct solutions for them (respectively its 2, 368, 1010, and 2339) import java.util.ArrayList;import java.util.LinkedList;import java.util.List; public class DLX {    class DataNode {        DataNode L, R, U, D;        ColumnNode C;                public DataNode() {            L = R = U = D = this;        }         public DataNode(ColumnNode c) {            this();            C = c;        }        DataNode linkDown(DataNode node) {            node.D = this.D;            node.D.U = node;            node.U = this;            this.D = node;            return node;        }        DataNode linkRight(DataNode node) {            node.R = this.R;            node.R.L = node;            node.L = this;            this.R = node;            return node;…

Java ArrayLists can only be filled with reference type data, so you cannot fill them with primitive type data. How can you work around this with integers? (How can you have an ArrayList filled with integers?)

Java

Sorting an array of batting averages would be useful only if you sort another array in the same sequence in Java. Explain.

In Java, multidimensional arrays:   Group of answer choices are not directly supported. are implemented as arrays of arrays. are often used to represent tables of values. All of the above..

JavaTimer.java: import java.util.Arrays;import java.util.Random; public class JavaTimer { // Please expand method main() to meet the requirements.// You have the following sorting methods available:// insertionSort(int[] a);// selectionSort(int[] a);// mergeSort(int[] a);// quickSort(int[] a);// The array will be in sorted order after the routines are called!// Be sure to re-randomize the array after each sort.public static void main(String[] args) {// Create and initialize arraysint[] a = {1, 3, 5}, b, c, d;// Check the time to sort array along startTime = System.nanoTime();quickSort(a);long endTime = System.nanoTime();long duration = (endTime - startTime) / 1000l;// Output resultsSystem.out.println("Working on an array of length " + a.length + ".");System.out.println("Quick sort: " + duration + "us.");}// Thanks to https://www.javatpoint.com/insertion-sort-in-javapublic static void insertionSort(int array[]) {int n = array.length;for (int j = 1; j < n; j++) {int key = array[j];int…

I need help with this Java problem to output as it's explained in this image below: import java.util.Scanner;import java.util.ArrayList;import java.util.Collections;public class LabProgram {    static public int recursions = 0;    static public int comparisons = 0;    private static ArrayList<Integer> readNums(Scanner scnr) {        int size = scnr.nextInt();                        ArrayList<Integer> nums = new ArrayList<Integer>();        for (int i = 0; i < size; ++i) {                  nums.add(scnr.nextInt());      }      return nums;    }        static public int binarySearch(int target, ArrayList<Integer>   integers, int lower, int upper) {        recursions+=1;        int index = (lower+upper)/2;        comparisons+=1;         if(target == integers.get(index)){            return index;        }         if(lower == upper){            comparisons+=1;             if(target == integers.get(lower)){                return lower;            }            else{…