AP comp sci test #7

The following table shows the value of expression based on the values of input1 and input2. Which of the following expressions are equivalent to the value of expression as shown in the table?

• (NOT input1) OR (NOT input2)

• (NOT input1) AND (NOT input2)

• NOT (input1 OR input2)

• NOT (input1 AND input2)

The following question uses a robot in a grid of squares. The robot is represented by a triangle, which is initially facing toward the top of the grid. Which of the following code segments will move the robot to the gray square along the path indicated by the

arrows?

• 
• 
• 
• 

A student’s overall course grade in a certain class is based on the student’s scores on individual assignments. The course

grade is calculated by dropping the student’s lowest individual assignment score and averaging the remaining scores.

For example, if a particular student has individual assignment scores of 85, 75, 90, and 95, the lowest score (75) is

dropped. The calculated course grade is . A programmer is writing a program to calculate a student’s course grade using the process described. The

programmer has the following procedures available. The student’s individual assignment scores are stored in the list scores. Which of the following can be used to calculate a student’s course grade and store the result in the variable finalGrade?

• finalGrade <--- Sum (scores) / LENGTH (scores)

  finalGrade <--- finalGrade - Min (scores)

• finalGrade <--- Sum (scores) / (LENGTH (scores) - 1)

  finalGrade <--- finalGrade - Min (scores)

• finalGrade <--- Sum (scores) - Min (scores)

  finalGrade <--- finalGrade / LENGTH (scores)

• finalGrade <--- Sum (scores) - Min (scores)

  finalGrade <--- finalGrade / (LENGTH (scores) - 1)

The following question uses a robot in a grid of squares. The robot is represented by a triangle, which is initially facing right. Consider the procedures below. Which of the following code segments will move the robot to the gray square?

• 
• 
• 
• 

Grades in a computer science course are based on total points earned on a midterm exam and a final exam. The teacher provides a way for students to improve their course grades if they receive high scores on the final exam: if a student’s final exam score is greater than the student’s midterm exam score, the final exam score replaces the midterm exam score in the calculation of total points. The table below shows two students’ scores on the midterm and final exams and the calculated total points each student earns.

• Khalil does better on the midterm exam than on the final exam, so his original midterm and final exam scores are added to compute his total points.

• Josefina does better on the final exam than on the midterm exam, so her final exam score replaces her midterm exam score in the total points calculation.

A programmer is writing a procedure to calculate a student’s final grade in the course using the score replacement policy described. The student’s exam scores are stored in the variables and . The procedure returns the larger of and . Which of the following could be used in the procedure to calculate a student’s total points earned in the course and store the result in the variable ?

• 
• 
• 
• 

The following code segment is intended to draw the figure.

startX <--- 2

startY <--- 6

endX <--- 8

endY <--- 8

REPEAT 4 TIMES

{

<MISSING CODE>

Which of the following can be used to replace <MISSING CODE> so that the figure is drawn correctly?

• DrawLine (startX, startY, endX, endY)

  endY <--- endY - 2

• DrawLine (startX, startY, endX, endY)

  endX <--- endX - 2

  endY <--- endY - 2

• endY <--- endY - 2

  DrawLine (startX, startY, endX, endY)

• endX <--- endX - 2

  endY <--- endY - 2

  DrawLine (startX, startY, endX, endY)

A list of numbers is considered increasing if each value after the first is greater than or equal to the preceding value.

The following procedure is intended to return true if numberList is increasing and return false

otherwise. Assume that numberList contains at least two elements.

Line 1: PROCEDURE isIncreasing(numberList)

Line 2: {

Line 3: count 2

Line 4: REPEAT UNTIL(count > LENGTH(numberList))

Line 5: {

Line 6: IF(numberList[count] < numberList[count - 1])

Line 7: {

Line 8: RETURN(true)

Line 9: }

Line 10: count count + 1

Line 11: }

Line 12: RETURN(false)

Line 13: }

Which of the following changes is needed for the program to work as intended?

• In line 3, 2 should be changed to 1.

• In line 6, < should be changed to ≥.

• Lines 8 and 12 should be interchanged.

• Lines 10 and 11 should be interchanged.

An application program interface (API) provides a procedure Max, which returns the greater of its two integer arguments. A programmer would like to find the greatest of three integer values , , and . Which of the following

expressions will produce the desired result in every case?

• 
• 
• 
• 

A program contains the following procedures for string manipulation.

Which of the following expressions can be used to generate the string "Happy" ?

• 
• 
• 
• 

Consider two lists of numbers called list1 and list2. A programmer wants to determine how many different

values appear in both lists. For example, if list1 contains [10, 10, 20, 30, 40, 50, 60] and

list2 contains [20, 20, 40, 60, 80], then there are three different values that appear in both lists (20,

40, and 60).

The programmer has the following procedures available. Which of the following can be used to assign the intended value to count ?

• bothList <--- Combine (list1, list2)

  uniqueList <--- RemoveAllDups (bothList)

  count <--- LENGTH (bothList) - LENGTH (uniqueList)

• newList1 <--- RemoveAllDups (list1)

  newList2 <--- RemoveAllDups (list2)

  bothList <--- Combine (newList1, newList2)

  count <--- LENGTH (list1) + LENGTH (list2) - LENGTH (bothList)

• newList1 <--- RemoveAllDups (list1)

  newList2 <--- RemoveAllDups (list2)

  bothList <--- Combine (newList1, newList2)

  count <--- LENGTH (newList1) + LENGTH (newList2) - LENGTH (bothList)

• newList1 <--- RemoveAllDups (list1)

  newList2 <--- RemoveAllDups (list2)

  bothList <--- Combine (newList1, newList2)

  uniqueList <--- RemoveAllDups (bothList)

  count <--- LENGTH (bothList) - LENGTH (uniqueList)