Based on Java's precedence rules, what is the result of the expression "1 + 5 * 10 / 21 % 6 + 2"?

The following code is in Java,find the error in the following: int[] table = new int[10]; for (int x = 1; x <= 10; x++)    table[x] = 99;1) What is the problem? 2)How would you fix it?

Java - Write a program that removes all non alpha characters from the given input.

Describe how polymorphism enables you to program "in the general" rather than "in the specific"? Give some examples, not the ones used in the book (C++ How to Program by Paul J. Deitel, Harvey Deitel Tenth Edition).

What will the final values of count1 and count2 be in terms of n? assume that n is a power of 2 of the form 2^r.

Write a java class named First_Last_Recursive_Merge_Sort that implements the recursive algorithm for Merge Sort. You can use the structure below for your implementation. public class First_Last_Recursive_Merge_Sort { //This can be used to test your implementation. public static void main(String[] args) { final String[] items = {"Zeke", "Bob", "Ali", "John", "Jody", "Jamie", "Bill", "Rob", "Zeke", "Clayton"}; display(items, items.length - 1); mergeSort(items, 0, items.length - 1); display(items, items.length - 1); } private static <T extends Comparable<? super T>> void mergeSort(T[] a, int first, int last) { //<Your implementation of the recursive algorithm for Merge Sort should go here> } // end mergeSort private static <T extends Comparable<? super T>> void merge(T[] a, T[] tempArray, int first, int mid, int last) { //<Your implementation of the merge algorithm should go here> } // end merge //Just a quick method to display the whole array. public…

#include<bits/stdc++.h> using namespace std; void bubbleSort(int arr[], int n) {     for (int i = 0; i < n - 1; i++) {         for (int j = 0; j < n - i - 1; j++) {             if (arr[j] > arr[j + 1]) {                 int temp = arr[j];                 arr[j] = arr[j + 1];                 arr[j + 1] = temp;             }         }     } } int binarySearch(int arr[], int l, int r, int x, int& comp) {     comp++;     if (r >= l) {         int mid = l + (r - l) / 2;         if (arr[mid] == x) {             return mid;         }         if (arr[mid] > x) {             return binarySearch(arr, l, mid - 1, x, comp);         }         return binarySearch(arr, mid + 1, r, x, comp);     }     return -1; } int main() {     int Num[8192];     srand(time(NULL));     for (int i = 0; i < 8192; i++) {         Num[i] = rand() % 10001;     }         clock_t starting_time = clock();     bubbleSort(Num, 8192);     clock_t ending_time = clock();     clock_t result =…

19- java. Which of the following is a drawback of using recursion?     It may be less efficient than an iterative version.     It may have fewer lines of code than an iterative version.     It uses lesser memory stack than an iterative version.     It runs faster than an iterative version.

40. Question is in java, thanks

JAVA Language:  Transpose Rotate.  Question:  Modify Transpose.encode() so that it uses a rotation instead of a reversal. That is, a word like “hello” should be encoded as “ohell” with a rotation of one character. (Hint: use a loop to append the letters into a new string)         import java.util.*;            public class TestTranspose {        public static void main(String[] args) {          String plain = "this is the secret message";   // Here's the message           Transpose transpose = new Transpose();          String secret = transpose.encrypt(plain);          System.out.println("\n ********* Transpose Cipher Encryption *********");          System.out.println("PlainText: " + plain);    // Display the results          System.out.println("Encrypted: " + secret);          System.out.println("Decrypted: " + transpose.decrypt(secret));// Decrypt        }      }            abstract class Cipher {        public String encrypt(String s) {          StringBuffer result = new…