Cs6515 Study guides, Class notes & Summaries

CS6515 Exam 2 Questions And Answers

CS6515 Exam 2 Material Questions And 100% Correct Answers

Cs6515 Exam 3 with complete solution

CS6515 Exam 2 Questions and answers If graph G has more than |V | − 1 edges, and there is a unique heaviest edge, then this edge cannot be part of a minimum spanning tree - ANSWER-False, because the unique heaviest edge may not be part of a cycle If G has a cycle with a unique heaviest edge e, then e cannot be part of any MST. - ANSWER-True, if the unique heaviest edge is part of a cycle then it will be removed first. Let e be any edge of minimum weight in G. Then e must be part of some...

What is the running time for Longest Increasing Subsequence (LIS) - ANSWER-O(n^2) What is the recurrence for Longest Increasing Subsequence (LIS)? - ANSWER-L(i) = 1 + max{ L(j) | xj < xi} This reads as the answer to index I is 1 + the maximum over all j's between 1 and i where xj is less than xi What is the recurrence for Longest Common Subsequence (LCS) - ANSWER-L(i,j) = 1 + L(i-1, j-1) if xi = yj L(i,j) = max(L(i-1,j),L(i,j-1)) otherwise What is the running time for Longest Common...

CS6515 Exam 3 Study Guide questions and answers

CS6515 Exam 3 Questions And Correct Solutions

CS6515 Graph Algorithms with complete solution

Steps to solve a Dynamic Programming Problem - ANSWER-1. Define the Input and Output. 2. Define entries in table, i.e. T(i) or T(i, j) is... 3. Define a Recurrence relationship - Based on a subproblem to the main problem. (hint: use a prefix of the original input 1 < i < n). 4. Define the Pseudocode. 5. Define the Runtime of the algorithm. Use Time Function notation here => T(n) = T(n/2) + 1... DP: Types of Subproblems (4) - ANSWER-Input = x1, x2, ..., xn 1) Subproblem = x1, x2...

CS6515 Exam 2 Questions and answers .