The PDF covers the following
topics related to Computer Algorithms : Discrete Algorithms, Minimum
Spanning Trees, Arborescences: Directed Spanning Trees, Dynamic
Algorithms for Graph Connectivity, Shortest Paths in Graphs,
Low-Stretch Spanning Trees, Graph Matchings I: Combinatorial
Algorithms, Graph Matchings II: Weighted Matchings, Graph Matchings
III: Algebraic Algorithms, The Curse of Dimensionality, and
Dimension Reduction, Dimension Reduction and the JL Lemma, Streaming
Algorithms, Dimension Reduction: Singular Value Decompositions, From
Discrete to Continuous Algorithms, Online Learning: Experts and
Bandits, Solving Linear Programs using Experts, Approximate
Max-Flows using Experts, The Gradient Descent Framework, Mirror
Descent, The Centroid and Ellipsoid Algorithms, Interior-Point
Methods, Combating Intractability, Approximation Algorithms via SDPs,
Online Algorithms, Additional Topics, Prophets and Secretaries.
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.
explains the following topics: Stable Matchings, Algrithm Design by Induction,
Graphs, Trees or BFS, Connected Comps/Bipartite Graphs, DFS or Topological
Ordering, Interval Scheduling, Interval Partitioning, MST, MST, Union find,
Closest Points, Master Theorem, Integer Multiplication, Median, Vertex Cover or
Set Cover, Network Connectivity, Image Segmentation, Reductions,
NP-Completeness, Linear Programming.
This note explains the
following topics related to Algorithm Analysis and Design:
Introduction to Design and analysis of algorithms, Growth of
Functions, Recurrences, Solution of Recurrences by
substitution,Recursion tree method, Master Method, Design and
analysis of Divide and Conquer Algorithms, Worst case analysis of
merge sort, quick sort and binary search, Heaps and Heap sort,
Priority Queue, Lower Bounds for Sorting.
Author(s): Mr. S.K.
Sathua, Dr. M.R. Kabat and Dr. R. Mohanty
note will examine various data structures for storing and accessing information
together with relationships between the items being stored, and algorithms for efficiently
finding solutions to various problems, both relative to the data structures and
queries and operations based on the relationships between the items stored.
Topics covered includes: Algorithm analysis, List, stacks and queues, Trees and
hierarchical orders, Ordered trees, Search trees, Priority queues, Sorting
algorithms, Hash functions and hash tables, Equivalence relations and disjoint
sets, Graph algorithms, Algorithm design and Theory of computation.
The material of this book is aimed at advanced
undergraduate information (or computer) science students,
postgraduate library science students, and research workers in the
field of IR. Some of the chapters, particular chapter 6, make simple
use of a little advanced mathematics.