This preview shows page 1. Sign up to view the full content.
Unformatted text preview: CSC 3102: Final Exam
December 8, Monday 3:00 PM to 5:00 PM 213 Tureaud CSC 3102 0.1 B.B. Karki, LSU Algorithm Design Techniques Brute force Divideandconquer Decreaseandconquer Transformandconquer Spaceandtime tradeoffs Dynamic programming Greedy techniques More on algorithms (not used for the exam) CSC 3102 0.2 B.B. Karki, LSU Topics Brute force Selection sort Bruteforce string matching Convex hull problem Exhaustive search Traveling salesman, knapsack and assignment problems Divideandconquer Master theorem Mergesort Quicksort Quickhull CSC 3102 0.3 B.B. Karki, LSU Topics Decreaseandconquer Insertion sort Permutations Minimal change approach JohnsonTrotter algorithm Fakecoin problem Ternary search Computing a median Transformandconquer Gaussian elimination Heaps and heapsort Problem reduction CSC 3102 0.4 B.B. Karki, LSU Topics Spaceandtime tradeoffs Horspool's algorithm for string matching BoyerMoore algorithm for string matching Dynamic programming Warshall's algorithm for transitive closure Floyd's algorithms for allpairs shortest paths Greedy techniques Prim's algorithm for the MST problem Kruskal's algorithm for the MST problem Disjoint subsets and unionfind algorithm Dijkstra's algorithm for singlesource shortest path problem Huffman tree and code. CSC 3102 0.5 B.B. Karki, LSU Sample Questions: Type 1 The partitionbased algorithm to find the median of a list of integers adopts a divideandconquer approach. True or false? The time efficiency of the Gaussian Elimination algorithm is in (n3). True or false? Warshall's algorithm constructs the transitive closure of a directed graph using dynamic programming technique. True or false? Exhaustive search is a bruteforce approach to combinatorial problems. True or false? Any weighted connected graph with distinct weights has exactly one minimum spanning tree. True or false? It is always true that the bottomup and topdown algorithms yield the same heap for the same input. True or false?
0.6 CSC 3102 B.B. Karki, LSU Sample Questions: Type 2 Apply Kruskal's algorithm to find a minimum spanning tree of the following graph. Calculate the total weight of the tree. Can this graph have more than one MST? Justify your answer. Generate the badsymbol and goodsuffix tables for a 7bit long pattern 1000000. Construct a Huffman code for the following data: character A B C D probability 0.4 0.1 0.2 0.15 0.15 Encode the text ABACABAD using the above code. Decode the text whose encoding is 100010111001010 using the above code. Construct a heap for the list 1, 8, 6, 5, 3, 7, 4 using either the bottomup algorithm or the topdown algorithm. Use Master Theorem to find the order of growth of the following recurrence: T(n) = 4T(n/2) + n3 for n > 0, T(1) = 1. CSC 3102 0.7 B.B. Karki, LSU ...
View
Full
Document
This note was uploaded on 10/06/2009 for the course CSC 3102 taught by Professor Kraft,d during the Fall '08 term at LSU.
 Fall '08
 Kraft,D
 C Programming

Click to edit the document details