10.3 Multiple Choice Questions
3 min read•december 26, 2021
AP Computer Science A 💻
130 resourcesSee Units
Multiple Choice Practice for Recursion
Welcome to Unit 10 AP Computer Science A Multiple Choice Questions! Grab some paper and a pencil 📄 to record your answers as you go. You can see how you did on the Unit 10 Practice Questions Answers and Review sheet once you're done. Don't worry, we have tons of resources available if you get stumped 😕 on a question. And if solo study is not your thing, join a group in Hours!
Not ready to take a quiz yet? Start studying unit 10 Here: Intro to Unit 10
Image From Wikipedia.
Facts about the test: The AP Computer Science A exam has 40 multiple choice questions and you will be given 90 minutes to complete the section. That means it should take you around 34 minutes to complete 15 questions.
*The following questions were not written by CollegeBoard and although they cover information outlined in the AP Computer Science A Course and Exam Description the formatting on the exam may be different.
1. What are the main aspects of a recursive method?
A. I
B. II
C. I, II
D. II, III
2. Which of these is the correct way a recursive method should call itself (Given the code below)?
A.
B.
C.
D.
3. Which method is not recursive?
A.
B.
C.
D.
4. Given the recursive method below, what will be printed out if the method is called: printing(492); ?
A. 492
B. 984
C. 984984
D. 9849849
5. Given the recursive method below, what will be returned out if the method is called in findNumberX("xjxfeixx"); ?
A. 0
B. 3
C. 4
D. 5
6. How does binary search work?
A. Binary search sorts an array by dividing the given list in half, and repeating that process until it finds the target value.
B. Binary search sorts an array by checking every value in the list until it reaches the target value.
C. Binary search sorts an array by comparing a value to the already sored values and shifting it to fit it in where it belongs.
D. Binary search sorts an array by moving items in an unsorted list into a sorted list one at a time and swapping numbers one at a time with elements in the sorted list.
7. Which type of sort is usually the quickest?
A. Selection Sort
B. Merge Sort
C. Insertion Sort
D. Linear Search
8. Which of these recursion methods results in an infinite recursion if the value of a passed in to all of them is -1?
A.
B.
C.
D.
9. Where is the recursive call?
A. 3
B. 5
C. 6
D. 7
10. Given the recursive method below, if the value passed in is 4444, what is printed out by the method?
A. 4444
B. 88884444
C. 8888444422221111
D. Infinite Recursion
11. Given the recursive method below, how will the method return a boolean value of true?
A. The String str has to start with at least 3 of the same characters in a row.
B. The String str has to contain at least 3 of the same characters in a row.
C. The String str has to end with at least 3 of the same characters in a row.
D. The String str has to contain at least 3 of the same characters.
12. Given the recursive method below, what will be returned if the method is called: remainder(18); ?
A. 0
B. 1
C. 2
D. 3
13. If given the following, n = 3, what is the answer?
A. 0
B. 1
C. 2
D. 3
14. What common error can recursive methods cause (not limited to recursive methods)?
A. StackOverflowError
B. IndexOutOfBoundsError
C. InterruptedException
D. RuntimeException
15. To simulate the Fibonacci sequence or factorials, what is typically used?
A. Iteration
B. Recursion
C. Loops
D. None of the Above
Time to Check Your Answers on Unit 10 Practice Questions Answers and Review! 🙌
Browse Study Guides By Unit
➕Unit 1 – Primitive Types
📱Unit 2 – Using Objects
🖥Unit 3 – Boolean Expressions & if Statements
🕹Unit 4 – Iteration
⚙️Unit 5 – Writing Classes
⌚️Unit 6 – Array
💾Unit 7 – ArrayList
💻Unit 8 – 2D Array
🖲Unit 9 – Inheritance
🖱Unit 10 – Recursion
🙏Exam Reviews
© 2023 Fiveable Inc. All rights reserved.