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

Info icon This 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) Selection & Adversary Argument (.5w) Graphs and Digraphs (3w) String Matching (.5w) NP-Completeness (2.5w) Parallel Algorithms (1w)
Image of page 1

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

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

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

View Full Document Right 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
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
Image of page 5

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

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

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

View Full Document Right Arrow Icon
Image of page 8
Image of page 9

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

View Full Document Right Arrow Icon
Image of page 10
Image of page 11

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

View Full Document Right Arrow Icon
Image of page 12
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 (Cook’s 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- Cook’s 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

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern