Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .

1.1 Origin of word: Algorithm
1.2 Algorithm: Informal Deﬁnition
1.3 Algorithms, Programming
1.4 Implementation Issues
1.5 Course in Review
1.6 Analyzing Algorithms
1.7 Model of Computation
1.8 Example: 2-dimension maxima
1.9. BRUTE-FORCE ALGORITHM 11
1.9 Brute-Force Algorithm
1.10. RUNNING TIME ANALYSIS 13
1.10 Running Time Analysis
1.10.1 Analysis of the brute-force maxima algorithm
1.11 Analysis: A Harder Example
1.11.1 2-dimension Maxima Revisited
1.11.2 Plane-sweep Algorithm
1.11.3 Analysis of Plane-sweep Algorithm
1.11.4 Comparison of Brute-force and Plane sweep algorithms
3.1 Merge Sort
3.1.1 Analysis of Merge Sort
3.1.2 The Iteration Method for Solving Recurrence Relations
3.1.3 Visualizing Recurrences Using the Recursion Tree
3.1.4 A Messier Example
3.2 Selection Problem
3.2.1 Sieve Technique
3.2.2 Applying the Sieve to Selection
3.2.3 Selection Algorithm
3.2.4 Analysis of Selection
Sorting
4.1 Slow Sorting Algorithms
4.2.2 Heapsort Algorithm
4.2.3 Heapify Procedure
4.2.4 Analysis of Heapify
4.2.5 BuildHeap
4.2.6 Analysis of BuildHeap
4.2.7 Analysis of Heapsort
4.3 Quicksort
4.3.1 Partition Algorithm
4.3.2 Quick Sort Example
4.3.3 Analysis of Quicksort
4.3.4 Worst Case Analysis of Quick Sort
4.3.5 Average-case Analysis of Quicksort
4.4 In-place, Stable Sorting
4.5 Lower Bounds for Sorting
Linear Time Sorting
5.1 Counting Sort
5.2 Bucket or Bin Sort
Dynamic Programming
6.1 Fibonacci Sequence
6.2 Dynamic Programming
6.3 Edit Distance
6.3.1 Edit Distance: Applications
6.3.2 Edit Distance Algorithm
6.3.3 Edit Distance: Dynamic Programming Algorithm
6.3.4 Analysis of DP Edit Distance
6.4 Chain Matrix Multiply
6.4.1 Chain Matrix Multiplication-Dynamic Programming Formulation
6.5 0/1 Knapsack Problem
6.5.1 0/1 Knapsack Problem: Dynamic Programming Approach
Greedy Algorithms
7.1 Example: Counting Money
7.1.1 Making Change: Dynamic Programming Solution
7.2. GREEDY ALGORITHM: HUFFMAN ENCODING 99
7.1.2 Complexity of Coin Change Algorithm
7.2 Greedy Algorithm: Huffman Encoding
7.2.1 Huffman Encoding Algorithm
7.2.2 Huffman Encoding: Correctness
7.3 Activity Selection
7.3.1 Correctness of Greedy Activity Selection
7.4. FRACTIONAL KNAPSACK PROBLEM 109
7.4 Fractional Knapsack Problem
8.1 Graph Traversal
8.1.2 Depth-ﬁrst Search
8.1.3 Generic Graph Traversal Algorithm
8.1.4 DFS - Timestamp Structure
8.1.5 DFS - Cycles
8.2. PRECEDENCE CONSTRAINT GRAPH 131
8.2 Precedence Constraint Graph
8.3 Topological Sort
8.4 Strong Components
8.4.1 Strong Components and DFS
8.5 Minimum Spanning Trees
8.5.1 Computing MST: Generic Approach
8.5.2 Greedy MST
8.5.3 Kruskal’s Algorithm
8.5.4 Prim’s Algorithm
8.6 Shortest Paths
8.6.1 Dijkstra’s Algorithm
8.6.2 Correctness of Dijkstra’s Algorithm
8.6.3 Bellman-Ford Algorithm
8.6.4 Correctness of Bellman-Ford
8.6.5 Floyd-Warshall Algorithm
Complexity Theory
9.1 Decision Problems
9.2 Complexity Classes
9.3 Polynomial Time Veriﬁcation
9.4 The Class NP
9.5 Reductions
9.6. POLYNOMIAL TIME REDUCTION 177
9.6 Polynomial Time Reduction
9.7 NP-Completeness
9.8 Boolean Satisﬁability Problem: Cook’s Theorem
9.9 Coping with NP-Completeness
0 of .
Results for:
P. 1
CS502_all

# CS502_all

Ratings:
(0)
|Views: 6,653|Likes:

Published by: rung_baaz on Mar 13, 2011

### Availability:

Read on Scribd mobile: iPhone, iPad and Android.
See more
See less

06/07/2013

pdf

text

original

You're Reading a Free Preview
Pages 4 to 39 are not shown in this preview.
You're Reading a Free Preview
Pages 42 to 184 are not shown in this preview.

## Activity (38)

You've already reviewed this. Edit your review.