Skip to main content

Section 9.17 Assessment: Arrays 2

Subsection 9.17.1 Subgoals for Evaluating Arrays

  1. Set up array from 0 to size-1

  2. Evaluate data type of statements against array

  3. Trace statements, updating slots as you go

    1. Remember assignment subgoals

Exercises 9.17.2 Exercises

1.

    Q1: The following code segments are supposed to find the maximum value in an array of integers. Assuming that the array arr has been declared and contains valid integer values, which of the following code segments will correctly assign the maximum value in the array to the variable max?

    Figure 9.17.1.
  • I only

  • II only

  • III only

  • II and III

  • I, II, and III

2.

    Q2: The following code is intended to store the largest value in the integer array arr in the variable maxVal. Which of the following best describes the conditions under which the code will not work as intended?

    int maxVal = 0;
    for (int val : arr) {
       if (val > maxVal)
          maxVal = val;
    }
    
  • The largest value in arr occurs only once and is in arr[0].

  • The largest value in arr occurs only once and is in arr[arr.length-1].

  • The largest value in arr is negative.

  • The largest value in arr is 0.

  • The largest value in arr occurs more than once.

3.

    Q3: The following code is intended to store the sum of all the values in the integer array arr in the variable total. Which of the following code segments can be used to replace /* missing code */ so that the code works as intended?

    int total = 0;
    /* missing code */
    System.out.println(total);
    
    Figure 9.17.2.
  • I only

  • II only

  • III only

  • I and III only

  • II and III only

4.

    Q4: Assuming that nums has been declared and initialized as an array of integer values, which of the following best describes what this code does?

    int index = 0;
    int count = 0;
    int m = -1;
    for (int outer = 0; outer < nums.length; outer++) {
       count = 0;
       for (int inner = outer + 1; inner < nums.length; inner++) {
          if (nums[outer] == nums[inner])
             count++;
       }
       if (count > m) {
          index = outer;
          m = count;
       }
    } // end outer for
    System.out.println(index);
    
  • Prints the maximum value that occurs in the array nums

  • Prints the index of the maximum value that occurs in the array nums

  • Prints the number of times that the maximum value occurs in the array nums

  • Prints the value that occurs most often in the array nums

  • Prints the index of the value that occurs the most often in the array nums

You have attempted of activities on this page.