Write a Java program segment to find the average of the elements of an integer array a of size n.

How many comparisons does binary search need in the worst case to find an element in a sorted array of 1,024 elements?

What happens in Java if a program accesses a[10] in an array declared as int a[] = new int[10]?

Write a Java program segment to find the largest element of a one-dimensional integer array a of size n.

State two differences between linear search and binary search.

Explain the ternary operator in Java and rewrite "if (a > b) max = a; else max = b;" using it.

What is the output of: String s = "Examination"; System.out.println(s.length() + " " + s.substring(0, 4) + " " + s.toUpperCase().charAt(2));