This note covers the following topics: Design and
analysis of algorithms, Growth of Functions, Recurrences, Solution
of Recurrences by substitution, Recursion tree method, Master
Method, Worst case analysis of merge sort, quick sort and binary
search, Design and analysis of Divide and Conquer Algorithms, Heaps
and Heap sort, Priority Queue, Lower Bounds for Sorting, Dynamic
Programming algorithms, Matrix Chain Multiplication, Elements of
Dynamic Programming, Longest Common Subsequence, Greedy Algorithms,
Activity Selection Problem, Elements of Greedy Strategy, Fractional
Knapsack Problem, Huffman Codes, Graph Algorithm - BFS and DFS,
Minimum Spanning Trees, Kruskal algorithm, Prim's Algorithm, Fourier
transforms and Rabin-Karp Algorithm.
The field of approximation algorithms has
developed in response to the difficulty in solving a good many optimization
problems exactly. This note will present general techniques that underly these
In computer science, an
algorithm is a self-contained step-by-step set of operations to be performed.
Topics covered includes: Algorithmic Primitives for Graphs, Greedy Algorithms,
Divide and Conquer, Dynamic Programming, Network Flow, NP and Computational
Intractability, PSPACE, Approximation Algorithms, Local Search, Randomized
This note covers the following
topics: Introduction to Algorithms, Asymptotic Notation, Modeling or Logarithms,
Elementary Data Structures, Dictionary data structures, Sorting, Heapsort or
Priority Queues, Recurrence Relations, Introduction to NP-completeness,
Reductions, Cook's Theorem or Harder Reduction, NP-completeness challenge,
Approximation Algorithms and Heuristic Methods.
note covers the following topics related to Algorithm Analysis and Design: Model
and Analysis, Warm up problems, Brute force and Greedy strategy, Dynamic
Programming, Searching, Multidimensional Searching and Geometric algorithms,
Fast Fourier Transform and Applictions, String matching and finger printing,
Graph Algorithms, NP Completeness and Approximation Algorithms.
This thesis presents efficient algorithms for internal and
external parallel sorting and remote data update. Topics covered includes: Internal Parallel
Sorting, External Parallel Sorting, The rsync algorithm, rsync
enhancements and optimizations and Further applications for rsync.