Recursion in CodingBat Lab

Introduction

The goal of today’s lab is to practice writing recursive methods by competing as many CodingBat recursion exercises as possible in 50 minutes.

Creating an Account

1. Navigate to the CodingBat web-site
2. If you already have an account, log in. Otherwise, use the “create account” link on the upper right portion of the page to create a new account. (This account will be used for grading the lab so you need to use your real name.)
3. Once your account is created, click on the prefs link and enter the email address of you instructor in the Share To box at the bottom of the page. (e.g. mayfiecs@jmu.edu, stewarmc@jmu.edu, or weikleda@jmu.edu)
4. In principle, it should be possible to grade your work through the sharing mechanism from the previous step. Just in case that doesn’t work you should save copies of your solutions to a text file.

Advice

1. Several of the exercises below involve string manipulation. Here are some helpful String methods:
   • someString.length() returns the number of characters in a string.
   • someString.substring(0, 1) returns the the first letter of someString.
   • someString.substring(1) returns everything after the first letter. This will return the empty string ("") if the string only has one letter.
2. Other methods involve processing integers one digit at a time. Here we can use the / and % operators:

   int num = 745;
   int last = num % 10;   // evaluates to 5, the last digit of 745.
   int rest = num / 10;   // evaluates to 74, all of the digits except the last.
   

   Copy

Start Programming

You are not required to work on these in order, but they do build on each other to some extent. If the exercises from Group 1 seem too easy, feel free to skip ahead to Group 2. To receive credit for the lab you must finish at least four exercises beyond “bunnyEars”.

Don’t use the “next” button to move between exercises: after you have completed an exercise come back to this page and select the next one.

Group 1

1. bunnyEars (Includes hints and solution)
2. count7
3. sumDigits
4. array6
5. countX
6. changeXY
7. endX
8. nestParen
9. parenBit

Group 2

1. groupSum
2. groupSum6