The document outlines the syllabus for BCS 503, focusing on the Design and Analysis of Algorithms. It covers the Divide and Conquer method with examples like Sorting and Matrix Multiplication, as well as Greedy Methods including the Knapsack problem and Minimum Spanning Trees. Key algorithms discussed include Prim's, Kruskal's, Dijkstra's, and Bellman-Ford.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
6 views1 page
Designn and Analysis of Algorithm Unit-III
The document outlines the syllabus for BCS 503, focusing on the Design and Analysis of Algorithms. It covers the Divide and Conquer method with examples like Sorting and Matrix Multiplication, as well as Greedy Methods including the Knapsack problem and Minimum Spanning Trees. Key algorithms discussed include Prim's, Kruskal's, Dijkstra's, and Bellman-Ford.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
You are on page 1/ 1
BCS 503
DESIGN AND ANALYSIS OF ALGORITHM
UNIT 3 Divide and Conquer &
Greedy Method
SYLLABUS
Divide and Conquer with Examples Such as Sorting, Matrix
Multiplication, Convex Hull and Searching. Greedy Methods with Examples Such as Optimal Reliability Allocation, Knapsack, Minimum Spanning Trees – Prim’s and Kruskal’s Algorithms, Single Source Shortest Paths - Dijkstra’s and Bellman Ford Algorithms.