Algorithms
THERE IS COMPLETE SLIDES BY WHICH YOU CAN UNDERSTAND ALGORITHMS. CLICK DOWNLOAD SLIDE AND GET SLIDE IN PDF FORMAT.
1) Introduction to Algorithms
DOWNLOAD SLIDESDOWNLOAD SLIDES
2) Asymptotic Notation
DOWNLOAD SLIDESDOWNLOAD SLIDES
3) Modeling / Logarithms
DOWNLOAD SLIDESDOWNLOAD SLIDES
4) Elementary Data Structures
DOWNLOAD SLIDESDOWNLOAD SLIDES
5) Dictionary data structures / Trees
DOWNLOAD SLIDESDOWNLOAD SLIDES
6) Sorting
DOWNLOAD SLIDESDOWNLOAD SLIDES
7) Heapsort /Priority Queues
DOWNLOAD SLIDES8) Quicksort
DOWNLOAD SLIDESDOWNLOAD SLIDES
9) Linear Sorting
DOWNLOAD SLIDESDOWNLOAD SLIDES
10) Graph Data Structures
DOWNLOAD SLIDESDOWNLOAD SLIDES
11) Breadth/Depth-First Search
DOWNLOAD SLIDESDOWNLOAD SLIDES
12) Topological Sort / Connectivity
DOWNLOAD SLIDESDOWNLOAD SLIDES
13) Minimum Spanning Trees
DOWNLOAD SLIDESDOWNLOAD SLIDES
14) Shortest Path
DOWNLOAD SLIDESDOWNLOAD SLIDES
15) All-Pairs Shortest Paths
DOWNLOAD SLIDESDOWNLOAD SLIDES
16) Combinatorial Search
DOWNLOAD SLIDESDOWNLOAD SLIDES
17) Program optimization
DOWNLOAD SLIDES18) Introduction to Dynamic Programming
DOWNLOAD SLIDESDOWNLOAD SLIDES
19) Examples of Dynamic Programming
DOWNLOAD SLIDESDOWNLOAD SLIDES
20) More Examples of Dynamic Programming
DOWNLOAD SLIDES21) Divide and Conquer
DOWNLOAD SLIDES22) Recurrence Relations
DOWNLOAD SLIDES23) Introduction to NP-completeness
DOWNLOAD SLIDESDOWNLOAD SLIDES
24) Reductions
DOWNLOAD SLIDESDOWNLOAD SLIDES
25) More Reductions
DOWNLOAD SLIDESDOWNLOAD SLIDES
26) Cook's Theorem / Harder Reduction
DOWNLOAD SLIDESDOWNLOAD SLIDES
27) The NP-completeness challenge
DOWNLOAD SLIDES28) Approximation Algorithms
DOWNLOAD SLIDESDOWNLOAD SLIDES
29) Heuristic Methods
DOWNLOAD SLIDESDOWNLOAD SLIDES
0 comments:
Post a Comment