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
  • Divide and conquer
  • Divide and conquer

    Divide and conquer

    • Introduction to DAndC Introduction to DAndC
    • binary search algorithm binary search algorithm
    • merge sort algorithm merge sort algorithm
    • quick sort algorithm quick sort algorithm
    • strassen's matrix multiplication strassen's matrix multiplication
    • Chapter-2 Chapter-2
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