import java.util.Comparator; import java.util.PriorityQueue; class StringLengthComparator implements Comparator { public int compare(String 01, String 02) { } if(01.length()<02.length()){ return -1; //means here we swap it }else if(01.length()>02.length()){ }else{ } } return 1; } class StringLengthComparator1 implements Comparator { return 0; public int compare(String 01, String 02) { } if(01.length()<02.length()){ return 1; }else if(01.length()>02.length()){ return -1;//means here we swap it }else{ } return 0; public class StringLength { public static void main(String[] args) { String arr[] = {"this", "at", "a", "their", "queues"}; StringLengthComparator stringComparator = new StringLengthComparator(); StringLengthComparator1 stringComparator1 = new StringLength Comparator1(0); PriorityQueue pq = new PriorityQueue<>(stringComparator);

Please help fast

What is wrong with my Java code?     public static void main(String[] args) {        class IncrementClass<T>    {      T value;    }        IncrementClass<String> i = new IncrementClass<>();           int[] intArray = new int[10];    for(i.value = 0; i.value<intArray.length;i.value++){      intArray[i.value]=i.value;      System.out.print(intArray[i.value]);    }      }

Correct my codes in java // Arraysimport java.util.Scanner;public class Assignment1 {public static void main (String args[]){Scanner sc=new Scanner (System.in);System.out.println("Enter mark of student");int n=sc.nextInt();int a[]=new int [n];int i;for(i=0;i<n;i++){System.out.println("Total marks of student in smster");a[i]=sc.nextInt();}int sum=0;for(i=0;i<n;i++){sum=sum+a[i];}System.out.println("Total marks is :");for (i=0;i<n;i++);{System.out.println(a[i]);}System.out.println();}}

public class arrayOutput ( public static void main (String [] args) { final int NUM ELEMENTS = 3; int[] userVals = new int [NUM_ELEMENTS]; int i; } Type the program's output userVals [0] = 2; userVals [1] = 6; userVals [2] = 8; for (i = userVals.length - 1; i >= 0; −−1) { System.out.println(userVals [1]); } C.C. ? ? ??

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…

Consider the following Java method. void modifyDNA ( String dna) { int [] frequency = { 0, 0, 0, 0, 0 }; for (int i = 0; i < dna. length (); i++) { switch (dna.charAt (i)) { case 'A': frequency [0]++; ngular Snip break ; case 'T': frequency [1]]++; case 'C': frequency [2]++; break ; case 'G': frequency [3]++; default : frequency [4]++; } // HERE } If the method is called as follows, what is the expected values of the array elements when the execution reaches the comment line // HERE , when the method is executed with the parameter value "ATCGGT" ? O [1,2,1,2,2] O [1,2,3,2,2] O [1,2,3,2,0] O None of the above

import java.util.Scanner; public class LabProgram {    public static void main(String[] args) {        Scanner scnr = new Scanner(System.in);         int n = scnr.nextInt();        int[] arr = new int[n];         for (int i = 0; i < n; i++) {            arr[i] = scnr.nextInt();        }         for (int i = n - 1; i >= 0; i--) {            System.out.print(arr[i]);             if (i > 0) {                System.out.print(",");            }        }    }}

import java.util.*;import java.io.*; public class HuffmanCode {     private Queue<HuffmanNode> queue;        private HuffmanNode overallRoot;                 public HuffmanCode(int[] frequencies) {                queue = new PriorityQueue<HuffmanNode>();                                for (int i = 0; i < frequencies.length; i++) {                        if (frequencies[i] > 0) {                                HuffmanNode node = new HuffmanNode(frequencies[i]);                                node.ascii = i;                                queue.add(node);                        }                }                overallRoot = buildTree();              }                 public HuffmanCode(Scanner input) {                overallRoot = new HuffmanNode(-1);                while (input.hasNext()) {                        int asciiValue = Integer.parseInt(input.nextLine());                        String code = input.nextLine();                        overallRoot =…