25 January, 2014

CS502 Current Midterm Paper Fall 2013 File 12



Q: How can Edit Distance algorithm help for Plagiarism Detection?
Q: Quick Sort such that sort the array into non-increasing order.
Q: What is the necessary assumption for average case analysis of Quick Sort?
Q: What is the method of multiplying a series of matrices and how it works?
Q: Apply 2 steps of Redix sort on following values (5 values were given):
Value
Step1
Step2
321


211


144


200


324



Q: Using final Chain Matrix multiplication fill in the missing values for given matrices (6 different matrices were given):
Final cost matrix:
0
Some value
Some value
Some value
Some value
?

0
Some value
Some value
Some value
Some value


0
Some value
Some value
Some value



0
Some value
Some value




0
Some value





0

M entries calculation matrix:
0
Some value
Some value
Some value
Some value
?

0
Some value
Some value
Some value
Some value


0
Some value
Some value
Some value



0
Some value
Some value




0
Some value





0

(I don’t remember the given matrices and values.)

No comments:

Post a Comment