CS300-14_Wrap_Up - Boyer-Moore Algorithm NP-complete...

Info iconThis preview shows pages 1–13. Sign up to view the full content.

View Full Document Right Arrow Icon
Wrap-up Algorithm Analysis (3w) Algorithm Design (3w) Sorting (1.5w) Graphs and Digraphs (3w) String Matching (.5w) NP-Completeness (2.5w) Parallel Algorithms (1w)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Algorithm Analysis (3w) Time complexity upper bounds lower bounds optimality Algebraic Decision trees Lower bound via transformability Asymptotic growth rates
Background image of page 2
Algorithm Design (3w) Divide and conquer Dynamic programming Greedy search Backtracking / Branch and bound Local search
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Sorting (1.5w) How to break inversions Stability and in-place Insertion sort Quick sort Merge sort Heap sort Shell sort Radix sort
Background image of page 4
Selection and Adversary Argument (.5w) How to manipulate data consistently Finding Max. and Min. Finding the 2 nd largest key Selection problem Lower bound for finding the median
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Graphs and Digraphs (3w) Graph representations Minimum spanning trees Shortest paths DFS / BFS Biconnected components Strongly-connected components
Background image of page 6
String Matching (.5w) KMP Algorithm
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 12
Background image of page 13
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Boyer-Moore Algorithm NP-complete Problems (2.5w) P vs NP Turing machines Polynomial transformability NP-completeness Satisfiability problem (Cooks Theorem) Parallel Algorithms (1w) Parallel Computers PRAM Parallel Algorithms Final Exam. Time : 10:00 AM 12:30 PM ( 150 min. ) Date : Dec. 19 ( Friday ) Place : Room 1101 NP-completeness : 2 problems- Polynomial transformability- Cooks Theorem Parallel Algorithms : 1 problem Lecture notes Homeworks Others : 2 problems Emphasis on topics taught after the mid-term exam but at least one problem from the other topics. Final Exam. 3 problems 8 problems Sun Mon Tues Wedn Thur Fri Sat 14 15 16 17 18 19 20 available available only in the morning or after 4:00 PM * * Final Exam Attention You do not need to take the final exam if you have missed , or been late in, classes more than nine times ....
View Full Document

This note was uploaded on 02/04/2010 for the course COMPUTER S cs300 taught by Professor Unkown during the Spring '08 term at Korea Advanced Institute of Science and Technology.

Page1 / 13

CS300-14_Wrap_Up - Boyer-Moore Algorithm NP-complete...

This preview shows document pages 1 - 13. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online