Assume that a program contains the following declarations

CLICK HERE TO DOWNLOAD THIS ANSWER INSTANTLY $18 ONLY

  1. Assume that a program contains the following declarations:

    char c = ’\1’; short s = 2; int i = -3; long m = 5; float f = 6.5f; double d = 7.5;

Give the value and the type of each expression listed below.

(a) c * i (b) s + m (c) f / c (d) d / s (e) f – d (f) (int) f

2. The Hogwarts School was so happy with your math helper program that they referred you to a security firm! This security firm creates pin code door lockers like you see in the movies. They now need help to design an algorithm that will power the authentication system. The algorithm they want to validate codes is pretty weak, but it should work in the following way:

• It first checks if the pin code entered is four digits. If not, the code is invalid.

• It then checks if each digit within the four-digit pin is odd. If not, the code is invalid.

• If five consecutive invalid pins are entered, the system locks out and reports an intruder.

Therefore, codes 1234 and 357 are invalid because the former has even numbers (i.e., 2 and 4), and the latter is less than four digits. A valid pin code could be 1357 because it has exactly four digits. In addition, all of its four digits (i.e., 1, 3, 5, and 7) are odd.

(a) After creating a flowchart for the algorithm, save it as “l7 pin code.rap” and attach it to your online submission. The following shows an example of running the flowchart.

Enter pin code (attempt 1): 12 Code 12 is invalid!

Enter pin code (attempt 2): 1234 Code 1234 is invalid!

Enter pin code (attempt 3): 1375 Code 1375 is success!

The following shows another example:

Enter pin code (attempt 1): 12 Code 12 is invalid!

Enter pin code (attempt 2): 0999 Code 999 is invalid!

Enter pin code (attempt 3): 1278 Code 1278 is invalid!

Enter pin code (attempt 4): 1274 Code 1274 is invalid!

Enter pin code (attempt 5): 1272 Code 1272 is invalid!

Intruder alert!

Suggestion: Add a subchart CheckCode to help improving the readability of the flowchart.