OPEN EDUCATIONAL RESOURCE

Course Code: CSE408

Course Title: DESIGN AND ANALYSIS OF ALGORITHMS

L.T.P: 3.0.0 Credit: 3

Course Code Course Unit Broad OER Title of *%age Source URL
Title mapped topic/Sub Type OER unit
Topic mapped
with
OER
(approx)
. Unit 1 Analysis of online Modules https://www.coursera
Coursera and content .org/learn/analysis-of-
algorithm:
Portal will be algorithms
History and made
CSE408:DESIGN AND Motivation, A available
ANALYSIS OF https://www.coursera.
Scientific through the
ALGORITHMS online org/learn/data-
Approach,
Coursera structures
Example:
Portal,
Quicksort. enabling
individuals
Introductions to attain a
to "big-oh" heightened
notation and clarity on
algorithmic
asymptotic
concept
analysis.Recur
rence relations
: Computing
Values,
Telescoping,
Types of
Recurrences,
Mergesort ,
Master
Theorem .
 Overview of
generating
functions:
Ordinary
Generating
Functions,
Counting with
Generating
Functions,
Catalan
Numbers,
Solving
Recurrences,
Exponential
Generating
Functions.
Asymptotics:
Standard
Scale,
Manipulating
Expansions,
Asymptotics
of Finite
Sums,
Asymptotics
of Finite
Sums. . Trees:
Trees and
Forests,
Binary Search
Trees, Path
Length, Other
Types of
Trees.

Unit 2 Strings and online Modules https://www.coursera

Coursera and content .org/learn/analysis-of-
Tries:
Portal will be algorithms
Bitstrings with made
Restrictions , available
Languages, through the
Tries , Trie online
Coursera
Parameters
Portal,
Key pattern enabling
 matching individuals
to attain a
concepts:
heightened
Suffix Tree, clarity on
Burrow algorithmic
wheeler concept
transform and
Suffix Array,
Knuth-Morris-
Pratt
algorithm .

Unit 3 Divide-and- online Modules https://www.coursera

conquer Coursera and content .org/learn/algorithms-
basics; the Portal will be divide-
made conquer?specializatio
master method available
for analyzing n=algorithms
through the
divide and online
conquer Coursera
algorithms, Portal,
enabling
O(n log n) individuals
Algorithm for to attain a
Counting heightened
Inversions I, clarity on
O(n log n) algorithmic
concept
Algorithm for
Counting
Inversions II,
Strassen's Sub
cubic Matrix
Multiplication
Algorithm ,
O(n log n)
Algorithm for
Closest Pair I ,
O(n log n)
Algorithm for
Closest Pair II,
Motivation,
Formal
Statement,
Interpretation
 of the 3 Cases,
The QuickSort
algorithm and
its analysis;
probability
review.
Linear-time
selection;
graphs, cuts,
and the
contraction
algorithm.

Unit 4 Introduction to online Modules https://www.coursera

dynamic Coursera and content .org/learn/algorithms-
Portal will be greedy?specialization
programming
made =algorithms
and available
uffmanCodes . through the
Advanced online
dynamic CourseraPo
programming: rtal,
enabling
the knapsack individuals
problem, to attain a
sequence heightened
alignment, and clarity on
optimal binary algorithmic
concept
search trees.
introduction to
greedy
algorithms; a
scheduling
application;
Prim's MST
algorithm.
Kruskal's MST
algorithm.

Unit 5 Introduction to online Modules Approximation

Approximatio Coursera and content Algorithms and Linear
n Algorithms,: Portal will be Programming |
Introduction to made Coursera
Job shop available
Scheduling through the
and Algorithm online
Design, Coursera
Analysis of Portal,
Job shop enabling
Scheduling, individuals
Approximatio to attain a
n Algorithms heightened
for Vertex clarity on
Cover and algorithmic
their Analysis, concept
Approximatio
n Algorithms
for the
Maximum
Satisfiability
Problem,
Travelling
Salesman
Problem and
Approximatio
n Scemes:
Introduction to
TSP and its
applications,
NP-Hardness
of TSPs,
Hardness of
Approximatin
g General
TSPs, Held
and Karp's
Dynamic
Programming
Algorithm,
Integer Linear
Programming
Formulation,
Subtours and
Subtour
Elimination
Formulation,
Metric TSP
and
Shortcutting,
Eulerian
Walks for
approximating
TSPs,
Christofides
Algorithm and
its Analysis,
 Heuristics for
TSPs, Full
Polynomial
Time
Approximatio
n Scheme and
Knapsack.

Unit 6 Polynomial- online Modules https://www.coursera

Time Solvable Couirsera and content .org/learn/algorithms-
Problems, Portal will be npcomplete?specializa
Reductions made tion=algorithms
and available
through the
Completeness
online
, Definition Coursera
and Portal,
Interpretation enabling
of NP- individuals
Completeness to attain a
, Definition heightened
and clarity on
algorithmic
Interpretation
concept
of NP-
Completeness
, The P vs. NP
Question,
Algorithmic
Approaches to
NP-Complete
Problems, The
Vertex Cover
Problem,
Smarter
Search for
Vertex Cover I,
Smarter
Search for
Vertex Cover
II, The
Traveling
Salesman
Problem, A
Dynamic
Programming
Algorithm for
TSP, A Greedy
Knapsack
Heuristic,
Analysis of a
Greedy
Knapsack
Heuristic I,
Analysis of a
Greedy
Knapsack
Heuristic II, A
Dynamic
Programming
Heuristic for
Knapsack,
Knapsack via
Dynamic
Programming,
Revisited,
Analysis of
Dynamic
Programming
Heuristic