Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more ➡
Standard view
Full view
of .
Add note
Save to My Library
Sync to mobile
Look up keyword or section
Like this

Table Of Contents

1.1 Computing Fibonacci numbers
1.2 Fast Multiplication
1.3 Model of Computation
1.4.1 External memory model
1.4.2 Parallel Model
2.1 Euclid’s algorithm for GCD
2.2.1 Choosing a random splitter
2.2.2 Median of medians
2.3 Sorting words
2.4 Mergeable heaps
3.1 Heuristic search approaches
3.2.1 Maximal Spanning Tree
3.2.2 A Scheduling Problem
3.3.1 A simple data structure for union-find
3.3.2 A faster scheme
3.3.3 The slowest growing function ?
3.3.4 Putting things together
3.3.5 Path compression only
4.2.3 Function approximation
4.2.4 Viterbi’s algorithm for Expectation Maximization
5.1.1 Construction of Skip-lists
5.1.2 Analysis
5.2 Treaps : Randomized Search Trees
5.3 Universal Hashing
5.4 Perfect Hash function
5.5 A loglogN priority queue
6.1 Interval Trees and Range Trees
6.2 k-d trees
6.3 Priority Search Trees
6.4.1 Jarvis March
6.4.2 Graham’s Scan
6.4.3 Sorting and Convex hulls
6.5.1 Analysis
6.5.2 Expected running time ∗
6.6 Point location using persistent data structure
7.1 Polynomial evaluation and interpolation
7.2 Cooley-Tukey algorithm
7.4 Schonage and Strassen’s fast multiplication
8.1 Rabin Karp fingerprinting
8.2.1 Potential method and amortized analysis
8.2.2 Analysis of the KMP algorithm
8.2.3 Pattern Analysis
8.3 Generalized String matching
9.1.1 Strongly Connected Components (SCC)
9.1.2 Finding Biconnected Components (BCC)
9.2.1 Bellman Ford SSSP Algorithm
9.2.2 Dijkstra’s SSSP algorithm
9.2.3 Floyd-Warshall APSP algorithm
9.3.1 Max Flow Min Cut
9.3.2 Ford and Fulkerson method
9.3.3 Edmond Karp augmentation strategy
9.3.4 Monotonicity Lemma and bounding the iterations
9.4.1 The contraction algorithm
9.4.2 Probability of mincut
10.1 Classes and reducibility
10.2 Cook Levin theorem
10.3 Common NP complete problems
10.4.1 Equal partition
10.4.2 Greedy set cover
10.4.3 The metric TSP problem
10.4.4 Three colouring
10.4.5 Maxcut
0 of .
Results for:
No results containing your search query
P. 1
ADA notes

ADA notes

Ratings: (0)|Views: 3,706|Likes:
Published by thilak369369

More info:

Published by: thilak369369 on Sep 13, 2010
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See More
See less





You're Reading a Free Preview
Pages 4 to 37 are not shown in this preview.
You're Reading a Free Preview
Pages 41 to 69 are not shown in this preview.
You're Reading a Free Preview
Pages 73 to 119 are not shown in this preview.

Activity (7)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
akbisoi1 liked this
adddata liked this
neha986 liked this
Aakash Tyagi liked this
deepakgupta1983 liked this

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->