Scribd
Upload
27 views2 pages

2 DP

This document outlines an assignment on dynamic programming with 8 questions worth a total of 100 points. The questions are drawn from various sources and cover topics like cutting cloth, dance sequences, palindromes, geometry, bitmaps, scheduling problems, and solitaire. Students must show complete and reasoned answers for all questions. The pre-submission deadline is November 1, 2014.

Uploaded by

dash spider
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
27 views2 pages

2 DP

This document outlines an assignment on dynamic programming with 8 questions worth a total of 100 points. The questions are drawn from various sources and cover topics like cutting cloth, dance sequences, palindromes, geometry, bitmaps, scheduling problems, and solitaire. Students must show complete and reasoned answers for all questions. The pre-submission deadline is November 1, 2014.

Uploaded by

dash spider
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CS 6150: Dynamic Programming

Pre-submission deadline: Nov 1, 2014

This assignment has 8 questions, for a total of 100 points. Unless otherwise specified,
complete and reasoned arguments will be expected for all answers.

Question Points Score


Cutting Cloth 121/2
Dance, dance ! 121/2
Palindromes 121/2
Time for geometry 121/2
Bitmaps 121/2
Thirsty Students 121/2
Nadira 121/2
Solitaire 121/2
Total: 100

1
Question 1: Cutting Cloth . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [121/2]
This is from Dasgupta/Papadimitriou/Vazirani, Exercise 6.14
You’re given a rectangle piece of cloth with dimensions X × Y (X, Y are positive integers), and a list of
n products that can be made using the cloth. For each product i ∈ [1 . . . n] you need a piece of cloth of
dimension ai × bi and the final value of this product is ci . Assume that all ai , bi , ci are positive integers.
You have a machine that can take a rectangular piece of cloth and cut it into two pieces either horizontally
or vertically. Design a strategy to maximize the return for cutting the cloth: i.e a strategy to cut the
cloth into pieces so that the sum of values of the pieces is maximized. It’s fine to duplicate a product
(and sell many copies of it).
The next seven questions are from Erickson (http://web.engr.illinois.edu/~jeffe/teaching/algorithms/
notes/05-dynprog.pdf)
Question 2: Dance, dance ! . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [121/2]
Problem #4
Question 3: Palindromes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [121/2]
Problem #5

Question 4: Time for geometry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [121/2]


Problem #7
Question 5: Bitmaps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [121/2]
Problem #8 (only parts (a) and (b))

Question 6: Thirsty Students . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [121/2]


Problem #9
Question 7: Nadira . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [121/2]
Problem #10

Question 8: Solitaire . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [121/2]


Problem #12

Page 2

You might also like