Main Page → Problems → Solve a Problem
Exercise 12.1: starString
Keywords:
recursion
Write a method starString that accepts an integer parameter n and returns a string of stars (asterisks) 2n long (i.e., 2 to the nth power). For example:
| Call | Output | Reason |
|---|---|---|
starString(0); |
"*" |
20 = 1 |
starString(1); |
"**" |
21 = 2 |
starString(2); |
"****" |
22 = 4 |
starString(3); |
"********" |
23 = 8 |
starString(4); |
"****************" |
24 = 16 |
You should throw an IllegalArgumentException if passed a value less than 0.
If you do not understand how to solve a problem or why your solution code doesn't work, please contact your TA or instructor.
If something seems wrong with the Practice-It system itself (errors, slow performance, incorrect problem descriptions/tests, etc.), please
contact us.
Is there a problem?
Contact a Practice-It administrator.
Practice-It! web application and problems are copyright © Marty Stepp unless otherwise specified.
Problems from Building Java Programs textbook are copyright © Pearson.
Any non-educational usage of the content on this site is expressly forbidden without written permission.
All rights reserved.
Show/Hide Description
Re-indent