Answer:
Errors.
Explanation:
Angelika should focus on fixing the errors so that her ads can be shown. Because of the errors the code will not compile fully either be it run time error or compile time error or syntax error or any other error.
Warnings shows the potential problems but the code will run even if there are warnings and the notifications are not to worry about.
Answer:
The code to this question can be given as:
Code:
//define code.
//conditional statements.
if (Character.isLetter(passCode.charAt(0))) //if block
{
System.out.println("Alphabetic at 0"); //print message.
}
if (Character.isLetter(passCode.charAt(1))) //if block
{
System.out.println("Alphabetic at 1"); //print message.
}
Explanation:
In this code, we define conditional statement and we use two if blocks. In both if blocks we use isLetter() function and charAt() function. The isLetter() function checks the inserted value is letter or not inside this function we use charAt() function that checks inserted value index 1 and 2 is the character or not.
- In first if block we pass the user input value and check the condition that if the inserted value is a character and its index is 0 so, it will print Alphabetic at 0.
- In second if block we pass the user input value and check the condition that if the inserted value is a character and its index is 1 so, it will print Alphabetic at 1.
The speed of a moving body is the distance travelled by it in unit time. If the distance is in km and time is in hours, then the speed is km/hr. If the distance is in m and the time is in seconds, then the speed is m/sec.
Sort array is the same for all size. It matter is which sort algorithm u use for efficiency.
I suggest quick sort for efficent and alot of place you can find the tutorial for your programming language. this is the pusodcode i found from http://www.geeksforgeeks.org/
<span>/* low --> Starting index, high --> Ending index */
quickSort(arr[], low, high)
{
if (low < high)
{
/* pi is partitioning index, arr[p] is now
at right place */
pi = partition(arr, low, high);
quickSort(arr, low, pi - 1); // Before pi
quickSort(arr, pi + 1, high); // After pi
}
}</span>