CSCI 385 Fall 2015
Advanced Data Structures and Algorithms
Archived Class
Charles Cusack
Computer Science
Hope College
Main
Schedule
Grading
Gradebook

Policies
College
    Policies
Advice

Notes
Programs
Tutorials

CSCI 125
CSCI 255
MATH 131 (01 and 02)
Others

Admin

Homework 7

Details

Redo Project 4 (Homework 5) from the Brickficiency handout. Improve your algorithm by incorporating what you have learned about backtracking and/or branch-and-bound. Optimize it in other ways as well, if possible.

Make sure you commit your code to your SVN repository before the deadline. Also submit a description of your final algorithm along with a discussion of various things you tried along the way that either worked or didn't. Be as specific as possible. Finally, grade yourself out of 20 points with a justification of why you should get that grade. Include how your algorithm performs relative to mine. Since backtracking and branch-and-bound are tricky to analyze, you do not need to submit an analysis of your algorithm.