DOC PREVIEW
Berkeley CS 61A - RecursionPracticeProblems

This preview shows page 1 out of 2 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Note: All of these problems will require you to first import the “List Utilities” and “Words,sentences” libraries.1. Given a word as input, find the number of characters in the word2. A palindrome is a word that is spelled the same way forwards and backwards(example: racecar). Given a word as input, report whether or not the word is apalindrome.Hint: you should first create a block that if given a word, a minimum number and amaximum number, reports the substring of the word from the minimum to themaximum (this helper block should not require recursion).3. Given a list as input, report the reverse of the list4. Given a list, a minimum number and maximum number as input, reverse the order ofthe list, but only for items with indices in the range of minimum to maximum.Original List: List after call to above block:


View Full Document

Berkeley CS 61A - RecursionPracticeProblems

Download RecursionPracticeProblems
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view RecursionPracticeProblems and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view RecursionPracticeProblems 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?