Scribd
Upload
3 views1 page

Comprehensive Guide to Algorithm Techniques

Uploaded by

hdshb786
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
3 views1 page

Comprehensive Guide to Algorithm Techniques

Uploaded by

hdshb786
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

Relevant

Percentage
Modu Chapters in
Title Topics Covered of Syllabus
le Sartaj Sahni's
Covered
Book
Algorithm analysis,
time and space
complexity, O, Ω, Θ
Chapter 1
notations, recursive
(Algorithm
Modu and non-recursive
Introduction Analysis), Chapter 100%
le I analysis, divide &
3 (Divide and
conquer methods
Conquer)
like Binary Search,
Quick Sort, and
Merge Sort
General method, job
sequencing with
deadlines, knapsack
Modu Greedy Chapter 4 (The
problem, minimum 100%
le II Method Greedy Method)
cost spanning trees,
single-source
shortest path
General method,
matrix chain
multiplication,
Dynamic optimal binary Chapter 5
Modu
Programmin search trees, 0/1 (Dynamic 100%
le III
g knapsack problem, Programming)
all-pairs shortest
path, TSP, reliability
design
General method, n-
queen problem, sum
Chapter 6
of subsets, graph
Modu Backtrackin (Backtracking),
coloring, 100%
le IV g Chapter 7 (Branch
Hamiltonian cycles,
and Bound)
Branch and Bound
(TSP, 0/1 knapsack)
Basic concepts, non-
NP-Hard deterministic Chapter 11 (NP-
Modu and NP- algorithms, NP- Hard and NP-
100%
le V Complete Hard and NP- Complete
Problems Complete classes, Problems)
Cook’s theorem

You might also like