Page 377 - AP Computer Science A, 7th edition

I
int max = stuArr[0].getIdNum(); for (Student student : stuArr)
if (student.getIdNum() > max) {
max = student.getIdNum();
return student; }
return stuArr[0];
Student highestSoFar = stuArr[0]; int max = stuArr[0].getIdNum(); for (Student student : stuArr)
if(student.getIdNum() > max) II {
max = student.getIdNum();
highestSoFar = student; }
return highestSoFar;
int maxPos = 0;
for(int i = 1; i < stuArr.length; i++)
(A) I only
(B) II only
(C) III only
(D) I and III only (E) II and III only
Questions 13–15 refer to the Ticket and Transaction classes below .
public class Ticket {
private String row; private int seat; private double price;
if(stuArr[i].getIdNum() > stuArr[maxPos].getIdNum())
III
return stuArr[maxPos];
maxPos = i;