CS 261 University of Puget Sound Spring, 2020
 
Computer Science II
Abstract Data Types and their Implementations, Some Basic Algorithms,
Object-oriented Problem Solving, and Efficiency
 

Warning: This course is under development. Although the basic structure of this course is largely established, nothing on this Web site should be considered official or even possibly correct.
DO NOT MAKE PLANS BASED ON THE CONTENTS OF THIS SITE UNTIL JANUARY, 2020.

Recursion and Backtracking

After reading Sections 5.5-5.6 in Koffman and Wolfgang's text, do one or more of the following problems (for extra lab credit).

  1. K & W, page 254, Programming Project 9.

  2. K & W, page 254, Programming Project 10.

  3. Given a number n, write a method that determines all factorizations of n in some order. (In this problem, it is acceptable for some factorizations to be repeated.)

created 2 February 2020
revised 2 February 2020 		Valid HTML 4.01! Valid CSS!
For more information, please contact Henry M. Walker at walker@cs.grinnell.edu.