Exam 3: Recursion: the Mirrors
Exam 1: Review of Java Fundamentals60 Questions
Exam 2: Principles of Programming and Software Engineering60 Questions
Exam 3: Recursion: the Mirrors60 Questions
Exam 4: Data Abstraction: The Walls60 Questions
Exam 5: Linked Lists60 Questions
Exam 6: Problem Solving With Abstract Data Types60 Questions
Exam 7: Stacks60 Questions
Exam 8: Queues60 Questions
Exam 9: Advanced Java Topics60 Questions
Exam 10: Algorithm Efficiency and Sorting60 Questions
Exam 11: Trees60 Questions
Exam 12: Tables and Priority Queues60 Questions
Exam 13: Advanced Implementations of Tables60 Questions
Exam 14: Graphs60 Questions
Exam 15: External Methods30 Questions
Select questions type
A ______ is a mathematical formula that generates the terms in a sequence from previous terms.
(Multiple Choice)
4.9/5
(38)
A recursive solution that finds the factorial of n always reduces the problem size by ______ at each recursive call.
(Multiple Choice)
4.9/5
(33)
In a sorted array,the kth smallest item is given by ______.
(Multiple Choice)
4.8/5
(36)
A binary search starts at the beginning of the collection of items.
(True/False)
4.8/5
(34)
In the box trace for a recursive method,a new box is created each time ______.
(Multiple Choice)
4.9/5
(36)
A recursive solution solves a problem by solving a smaller instance of the same problem.
(True/False)
4.8/5
(39)
Write a recursive method that takes 3 parameters: an integer array a,and two integers first and last.The method will find the largest value in a between indices first and last,inclusive.That is,it will return the largest value in the part of the array a[first..last] .You may assume that first last.
(Essay)
4.8/5
(30)
What would happen if a negative value is passed to a method that returns the factorial of the value passed to it?
(Multiple Choice)
4.8/5
(43)
In the recursive solution to the Towers of Hanoi problem,the number of disks to move ______ at each recursive call.
(Multiple Choice)
4.8/5
(41)
For anArray = <2,3,5,6,9,13,16,19>,what is the value returned by a recursive binary search algorithm if the value being searched for is 10?
(Multiple Choice)
4.9/5
(31)
For anArray = <2,3,5,6,9,13,16,19>,what is the value returned by a recursive binary search algorithm if the value being searched for is 6?
(Multiple Choice)
4.7/5
(41)
A recursive solution that finds the factorial of n generates ______ recursive calls.
(Multiple Choice)
5.0/5
(38)
In a recursive method that writes a string of characters in reverse order,the base case is ______.
(Multiple Choice)
4.8/5
(37)
Showing 21 - 40 of 60
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)