Computer Science 252
Problem Solving with Java

Spring 2016, The College of Saint Rose

Lecture 17: Recursive Methods and Recursive Structures as Collections
Date: Tuesday, March 29, 2016


Lecture 17 Assignment

Due at the start of class, Thursday, March 31.

Please submit answers to these questions either as a hard copy (typeset or handwritten are OK) or by email to terescoj AT by the start of class. Please use a clear subject line when submitting by email (e.g., CSC 252 Lecture 17 Assignment, Mary Smith). We will discuss these questions at the start of class, so no late submissions are accepted.

For this lecture assignment, you will be writing a Java application - a program that is not in a WindowController class but instead has a main method that does its work. It will be similar in structure to the Powers example. Write your program in As in that example, you will need to create a keyboard Scanner to read in a number from the terminal and use System.out.println to issue a prompt and report your answer.

The problem we are going to solve is that of computing factorials. From math, you know that the factorial of a positive integer n, denoted n!, is the product of all the numbers from 1 up to n.