Skip to main content
Side panel
Dayanand Science College, Latur
You are currently using guest access (
Log in
)
Design and Analysis of Algorithms
Home
Courses
Masters of Science (M.Sc)
M.Sc. - Computer Science
M.Sc. - Computer Science : Semester- II
Design and Analysis of Algorithms
Dynamic Programming
multistage graph using dynamic programming
multistage graph using dynamic programming
multistage graph using dynamic programming
Design and Analysis of Algorithms
syallabus
Introduction to data structure
Divide and conquer
Greedy Method
Dynamic Programming
Basic Search,Traversal techniques and Backtracking
Animated navigation off
Data preference
Home
Calendar
◄ The general method of dynamic programming
Jump to...
Jump to...
Announcements
Syallabus
Chapter-1
Introduction to DAndC
binary search algorithm
merge sort algorithm
quick sort algorithm
strassen's matrix multiplication
Chapter-2
general method in greedy method
knapsack problem using greedy method
optimal storage on tapes using greedy method
job sequencing with deadlines using greedy method
optimal merge pattern using greedy method
kruskal's algorithm for minimum spanning trees
dijkstra algorithm using greedy method
Chapter-3
The general method of dynamic programming
optimal binary search tree using dynamic programming
reliability design
travelling salesman problem dynamic programming
Chapter-4
BFS and DFS
general method in backtracking
8 queens problem using backtracking
sum of subset problem using backtracking
graph coloring using backtracking
hamiltonian cycle backtracking algorithm
Basic traversal techniques
backtracking
optimal binary search tree using dynamic programming ►