Skip to main content
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
  • Basic Search,Traversal techniques and Backtracking
  • Basic Search,Traversal techniques and Backtracking

    Basic Search,Traversal techniques and Backtracking

    • BFS and DFS BFS and DFS
    • general method in backtracking general method in backtracking
    • 8 queens problem using backtracking 8 queens problem using backtracking
    • sum of subset problem using backtracking sum of subset problem using backtracking
    • graph coloring using backtracking graph coloring using backtracking
    • hamiltonian cycle backtracking algorithm hamiltonian cycle backtracking algorithm
    • Basic traversal techniques Basic traversal techniques
    • backtracking backtracking
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
You are currently using guest access (Log in)
Home

Dayanand Science College, Latur

  • http://dsclatur.org/
  • daya_scin1@rediffmail.com
  • +91 (02382)222121
    http://dsclatur.org/
Data retention summary
Get the mobile app