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
  • Greedy Method
  • Greedy Method

    Greedy Method

    • general method in greedy method general method in greedy method
    • knapsack problem using greedy method knapsack problem using greedy method
    • optimal storage on tapes using greedy method optimal storage on tapes using greedy method
    • job sequencing with deadlines using greedy method job sequencing with deadlines using greedy method
    • optimal merge pattern using greedy method optimal merge pattern using greedy method
    • kruskal's algorithm for minimum spanning trees kruskal's algorithm for minimum spanning trees
    • dijkstra algorithm using greedy method dijkstra algorithm using greedy method
    • Chapter-3 Chapter-3
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