JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.
Compsci 101, Recursive Bagels
This exercise is for collaborative work during class. Do not fill out early!
Sign in to Google
to save your progress.
Learn more
* Indicates required question
Consider the Bagels APT.
Given a list of N numbers, which of the following could likely be passed as the smaller problem in recursion in solving this problem?
*
The list of N numbers
The list of N numbers minus the first element
The list of N numbers minus the last element
The list of the first N/2 elements
Required
Consider four possible ways to solve the Bagel problem recursively
Which of the following is a correct Recursive Solution to Bagels?
A
B
C
D
Which of the following about recursion are likely true?
Recursive solutions are always faster than non-recursive solutions
Recursive solutions will have shorter code than non-recursive solutions
Recursive solutions are always better to do than non-recursive solutions
A recursive solution can crash because you run out of memory.
Recursion has iteration in it
Names and Netids below
Names (comma separated)
*
Your answer
netid
*
Your answer
netid (partner)
Your answer
netid (partner)
Your answer
netid (partner)
Your answer
Submit
Clear form
Never submit passwords through Google Forms.
This content is neither created nor endorsed by Google.
Report Abuse
-
Terms of Service
-
Privacy Policy
Forms
