Created: Sat 14 Nov 2009
Wed 2 Dec 2009
Wed 09 Dec 2009
- Please review the course syllabus and make sure that you understand the course policies for grading, late homework, and academic honesty.
- On the first page of your solution write-up,
you must make explicit which problems are to be graded for
"regular credit", which problems are to be graded for "extra credit",
and which problems you did not attempt.
Please use a table something like the following
where "RC" is "regular credit", "EC" is "extra credit", and "NA"
is "not applicable" (not attempted). Failure to do so will result
in an arbitrary set of problems being graded for regular
credit, no problems being graded for extra credit, and a five percent
- You must also write down with whom you worked on the assignment. If this
changes from problem to problem, then you should write down this
information separately with each problem.
Required: problem 1; one of problems 2 and 3; one of problems 4 and 5; one of problems 6 and 7; one of problems 8 and 9
Points: Problems are worth 20 points each.
Unless otherwise indicated, problems are from Algorithms by Dasgupta, Papadimitriou, and Vazirani.
(Hint: Let L(i,j) the length of the longest palindromic subsequence of string x[i, ... , j].)
- 6.17, 6.18
(Hint: It helps to think of T as a rooted tree with subtrees as subproblems.)
College of Computer Science, Northeastern University
360 Huntington Avenue #340 WVH,
Boston, MA 02115
Phone: (617) 373-2198 / Fax: (617) 373-5121
The URL for this document is: