This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 473 Homework 2 (due February 10, 2009) Spring 2009 CS 473: Undergraduate Algorithms, Spring 2009 Homework 2 Written solutions due Tuesday, February 10, 2009 at 11:59:59pm. Roughly 1 / 3 of the students will give oral presentations of their solutions to the TAs. Please check Compass to check whether you are supposed give an oral presentation for this homework. Please see the course web page for further details. Groups of up to three students may submit a common solution. Please clearly write every group members name and NetID on every page of your submission. Please start your solution to each numbered problem on a new sheet of paper. Please dont staple solutions for different problems together. For this homework only: These homework problems ask you to describe recursive backtracking algorithms for various problems. Dont use memoization or dynamic programming to make your algorithms more efficient; youll get to do that on HW3. Dont analyze the running times of your...
View Full Document
This note was uploaded on 10/14/2011 for the course ECON 101 taught by Professor Smith during the Spring '11 term at West Virginia University Institute of Technology.
- Spring '11