Cs6515 Study guides, Class notes & Summaries

CS6515 EXAM 3 NEWEST EXAM 2024 WITH ACTUAL QUESTIONS AND CORRECT VERIFIED ANSWERS|ALREADY GRADED A+

How do you tell if a graph has negative edges? - ANSWER-when fitting graph on a table, if the number of moves decreases the w() from edge to edge, then there is a negative edge; check from 1 to n Why are all pairs Dist(y,z) n^2? - ANSWER-Because it builds a two dim table! What is the run time of bellman ford algorithm? How about if you had to do it for all edges? - ANSWER-O(nm) O(n^2m) Floyd-Warshall run time? - ANSWER-O(n^3) What is the base case for the bellman ford algorithm? - ANSWE...

CS6515 Exam 2 QUESTIONS AND ANSWERS 2024

CS6515 - Algorithms- Exam 1 | Questions and Verified Answers | Latest Update 2024/2025 | Graded A+ 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...

CS6515 Exam 2 with complete solution

Weak Duality Theorem Feasible x <= Feasible y where c^(zT) x <= b^(T) y. Here c^(T) means transpose and same for b^(T). Weak Duality Theorem Corollary 1 If Feasible x = Feasible y, they are optimums c^(T) x^(asterisk) = b^(T) y^(asterisk) . Weak Duality Theorem Corollary 2 If Primal/Dual is unbounded, then Dual/Primal is infeasible Strong Duality Theorem Primal is feasible and bounded IFF <=> Dual is feasible and bounded. Primal has a optimum x^(asterisk) iff dual has optimu...

Basic Properties of Trees - ANSWER-Tree's are undirected, connected and acyclic that connect all nodes. 1. Tree on n vertices has (n-1) edges -> would have a cycle otherwise (more than n-1 edges means cycle) 2. In tree exactly one path between every pair of vertices (otherwise it's not connected) - More than 1 path implies cycle - less than 1 path implies not connected 3. Any connected G(V, E) with |E| = |V| - 1 is a tree Kruskal's Algorithm - ANSWER-1. Sort E by increasing weigt ...

CS6515 Exam 2 | Questions and Correct Answers | Latest Update 2024/2025 | Graded A+ Basic Properties of Trees - Answer -Tree's are undirected, connected and acyclic that connect all nodes. 1. Tree on n vertices has (n-1) edges -> would have a cycle otherwise (more than n-1 edges means cycle) 2. In tree exactly one path between every pair of vertices (otherwise it's not connected) - More than 1 path implies cycle - less than 1 path implies not connected 3. Any connected G(V, E) wi...

Knapsack without repetition - ANSWER-k(0) = 0 for w = 1 to W: if w_j >w: k(w,j) = k(w, j - 1) else: K(w,j) = max{K(w, j -1),K(w - w_j, j -1) + v_i} knapsack with repetition - ANSWER-knapsack repeat(w_i....w_n, w_i... w_n, B) k(0) = 0 for i = 1 to n if w_i <= b & k(b) <v_i + K(b-w_i) then k(b) = v_i + K(b-w_i) Longest Increasing Subsequence - ANSWER-LIS(a_1.... a_n) for i = 1 to n L(i) = 1 for j = 1 to n -1 if a_j < a_i & L(i) < 1 + L(j) L(i) = 1 + L(j) max = 1 for ...