Assessment: ArrayLists 2

Section 13.21 Assessment: ArrayLists 2

Subgoals for Evaluating ArrayLists.

Declaring and initialization of an ArrayList
🔗
1. Set up a one-dimensional dynamic list (initially empty or with a specified initial capacity)
  🔗
  
  🔗
2. Upon instantiation, an ArrayList contains zero elements initially, but elements can be added dynamically using add(). Elements not yet added do not exist until explicitly inserted.
  🔗
  
  🔗
🔗
🔗
Determine access or change of element, or action on entire ArrayList object, and update elements as needed (remembering assignment subgoals)
🔗

🔗
Accessing an ArrayList element
🔗
1. Evaluate expression within get(index) which will be the index for the element to be accessed
  🔗
  
  🔗
2. arrayListName.get(index) returns the value stored at that index
  🔗
  
  🔗
3. index must be between 0 and arrayListName.size() - 1, inclusive; otherwise IndexOutOfBoundsException occurs
  🔗
  
  🔗
🔗
🔗
Changing value of an ArrayList element
🔗
1. Evaluate expression within set(index, value) which will be the index for the element to be replaced
  🔗
  
  🔗
2. arrayListName.set(index, value) replaces the element at index with the specified value
  🔗
  
  🔗
3. (remember the assignment subgoals for verifying data types and evaluating expressions)
  🔗
  
  🔗
4. (remember rules for index values)
  🔗
  
  🔗
🔗
🔗
Whole ArrayList actions
🔗
1. Passing as argument - a copy of the reference to the instantiated ArrayList is passed to the method. This means that any changes made to the elements inside the method persist outside the method. The exception is if the argument is assigned to reference a different ArrayList inside the method.
  🔗
  
  🔗
2. Assignment - changes the reference to point to the ArrayList on the right-hand side of the assignment operator.
  🔗
  
  🔗
🔗
🔗

Exercises Exercises

1.

Q1: The following code is intended to store the sum of all the values in the integer ArrayList list 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);

Options:

🔗

I.  for (int pos = 0; pos < list.size(); pos++)
        total += list.get(pos);

II. for (int pos = list.size(); pos > 0; pos--)
        total += list.get(pos);

III. int pos = 0;
     while (pos < list.size()) {
         total += list.get(pos);
         pos++;
     }

I only
🔗
II only
🔗
III only
🔗
I and III only
🔗
II and III only
🔗

🔗

2.

Q2: Assuming that nums has been declared and initialized as an ArrayList 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.size(); outer++) {
   count = 0;
   for (int inner = outer + 1; inner < nums.size(); inner++) {
      if (nums.get(outer).equals(nums.get(inner)))
         count++;
   }
   if (count > m) {
      index = outer;
      m = count;
   }
} // end outer for
System.out.println(index);

Prints the maximum value that occurs in the ArrayList nums
🔗
Prints the index of the maximum value that occurs in the ArrayList nums
🔗
Prints the number of times that the maximum value occurs in the ArrayList nums
🔗
Prints the value that occurs most often in the ArrayList nums
🔗
Prints the first index of the value that occurs the most often in the ArrayList nums
🔗

🔗

3.

Q3: The following code is intended to store the largest value in the integer ArrayList list 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 : list) {
   if (val > maxVal)
      maxVal = val;
}

The largest value in list occurs only once and is at index 0.
🔗
The largest value in list occurs only once and is at the last index.
🔗
The largest value in list is negative.
🔗
The largest value in list is 0.
🔗
The largest value in list occurs more than once.
🔗

🔗

4.

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

🔗

Options:

🔗

I.  int max = Integer.MIN_VALUE;
    for (int value : list) {
        if (max < value)
            max = value;
    }

II. int max = 0;
    boolean first = true;
    for (int value : list) {
        if (first) {
            max = value;
            first = false;
        }
        else if (max < value)
            max = value;
    }

III. int max = list.get(0);
     for (int k = 1; k < list.size(); k++) {
         if (max < list.get(k))
             max = list.get(k);
     }

I only
🔗
II only
🔗
III only
🔗
II and III
🔗
I, II, and III
🔗

🔗

5.

Q5: The following method is intended to return the index of the first occurrence of the value val beyond the position start in the ArrayList list.

🔗

// returns index of first occurrence of val in list after
// position start;
// returns list.size() if val is not found
public int findNext (ArrayList<Integer> list, int val, int start) {
   int pos = start + 1;
   while ( /* condition */)
      pos++;
   return pos;
}

For example, the execution of the following code segment should result in the value 4 being printed:

🔗

ArrayList<Integer> list = new ArrayList<>();
list.add(11); list.add(22); list.add(100); list.add(33); 
list.add(100); list.add(11); list.add(44); list.add(100);
System.out.println(findNext(list, 100, 2));

Which of the following expressions could be used to replace /* condition */ so that findNext will work as intended?

🔗

(pos < list.size()) && (list.get(pos) != val)
🔗
(list.get(pos) != val) && (pos < list.size())
🔗
(pos < list.size()) || (list.get(pos) != val)
🔗
(list.get(pos) == val) && (pos < list.size())
🔗
(pos < list.size()) || (list.get(pos) == val)
🔗

🔗

You have attempted 1 of 2 activities on this page.

🔗

Prev Top Next