1. Assignment 2: Due Week 11, Friday
Question 1: For the weighted interval scheduling problem, there are eight jobs with starting time and finish time as follows: j1=(0, 6), j2=(2, 3), j3=(3, 5), j4=(5, 9), j5=(8, 12), j6=(9, 11), j7=(10, 13) and j8=(11, 16). The weight for each job is as follows: v1=3.8, v2=2.0, v3=3.0, v4=3.0, v5=6.5, v6=2.5, v7=13.0, and v8=6.0.
Find a maximum weight subset of mutually compatible jobs. (Backtracking process is required.) (You have to compute p()’s. The process of computing p()’s is NOT required.)
Question 2: Let X=aabbacab and Y=baabcbb. Find the longest common subsequence for X and Y. (Backtracking process is required.)
Question 3. Let X=aabbacab and Y=baabcbb. Find the shortest common supsequence for X and Y. (Backtracking process is required.)
2019/2/5
chapter25