Quiz Sorting

A Java method may have at most one vararg parameter and it must be the last one.

True

Insert Sort has a best case cost bounds given by O(n), namely some_constant*(n)

True

getopt command line parameters supports parsing groups of one character options starting with a dash

True

== check on arrays only succeeds if an array is checked against itself, as only addresses are compared.

True

The row i of a 2D ragged array of integers can be emptied with row\[i\] = new int\[0\]

True

Bubble Sort has a best case cost bounds given by O(n), namely some_constant*(n)

True

Recursive Fibonacci series are always implemented with two recursion calls in its body

False

charAt(0) is the first character of a string

True

The maximum number of dimensions that a Java array can have is theoretically unlimited (practically 225).

True

Variable declaration is the process of instructing the compiler on allocating space for a variable

True

Insert Sort has a worst case cost bounds given by O(n^2), namely some_constant*(n^2)

True

Bubble Sort has a worst case cost bounds given by O(n^2), namely some_constant*(n^2)

True

0< is used to redirect the standard input of a program from a file.

True

Bubble Sort can be implemented recursively

True

A for loop update section containing an “i++” behaves differently from one containing only a “++i”.

False

int\[\] A; A\[0\]=0; //does not create an array with the first element set to 0;

True

Insert Sort can be implemented recursively, in each recursion reducing the unsorted array by one value, which is added to the already sorted values.

True

equals() is a method used to test equality for class types

True

Bubble Sort best case is when the array is almost sorted already and only a few elements are before their sorted position in the array (in the direction of the bubbling).

True

The worst case costs of Insert Sort and Bubble Sort scale similarly with size, up to a constant ratio depending on machine 

True

Unidirectional Bubble Sort best case is  whenever the array is almost sorted already

False

The best case costs of Selection Sort, Insert Sort and Bubble Sort does scale similarly with size, up to some constant ratios that depend on machine and implementation.

False

Insert Sort best case is when the array is almost sorted already.

True