Cs 6515 final - Study guides, Class notes & Summaries

CS 6515 FINAL EXAM ACTUAL COMPLETE 90 QUESTIONS AND CORRECT DETAILED ANSWERS (VERIFIED ANSWERS) WITH RATIONALES |ALREADY GRADED A+||BRAND NEW VERSION!!.

Kite Reduction Prove Kite is in np by verifying that - check for the clique - O(n^2) - check for the tail of degree <= 2 nodes O(n) - check for that the tail is connected to the clique with Explore (O(n) Reduce Clique to kite by adding a tail of length g to each vertex in graph G O(n^2) Transform back to Clique by removing all vertexs of degree <= 2 (prune the tails) If there is no solution to kite then there is no clique in G If there is a solution to kite, removin...

Quick Sort Runtime O(n^2) O(nlogn) with median of medians Merge Sort Runtime O(nlogn) Quick Select Runtime O(n^2) O(n) with median of medians (Fast select) Dijkstra's algorithm An algorithm for finding the shortest paths between nodes in a weighted graph. For a given source node in the graph, the algorithm finds the shortest path between that node and every other. It can also be used for finding the shortest paths from a single node to a single destination node by stoppin...

D&C Steps 1. Figure out your Black Box if needed. ○ Sorted = Binary Search (usually) ○ Unsorted = Merge sort (usually) ○ Polynomials, convolution, multiplication = FFT(usually) 2. State the Modification if needed. You may use the blackbox as is. ○ Which part of the black box you are changing. ○ What are your inputs and outputs to the black box. 3. State the steps of your algorithm. ○ NO PSEUDOCODE - use words ○ Must include base case(s) if needed. ○ Always r...