MCS-031: Design and Analysis of Algorithms

New Revised Syllabus of MCS-031: Design and Analysis of Algorithms From IGNOU

MCS-031: Design and Analysis of Algorithms ::4 Credits

Syllabus
Elementary Algorithmics, Problem and Instances, The Efficiency of algorithms, Average and worst case analyses, Some Examples, asymptotic notation , analysis of algorithms, Greedy algorithms, general characteristics of greedy algorithms, Graphs: Minimum spanning trees, Kruskal�s algorithms, Prim�s algorithms, Graphs: Shortest paths, The knapsack problem, Scheduling, Minimizing time in the system, Scheduling with deadlines, Divide and Conquer, Dynamic programming, Exploring graphs, Graphs and Games, Traversing trees, Depth-first search: Undirected graphs, Articulation points, Depth-first search: Directed graphs, Acyclic graphs: Topological sorting, Breadth-first search, Backtracking, The knapsack problem, Computational Complexity, Information-theoretic argument, Adversary argument, Linear reductions, Introduction to NP-completeness.

Comment for MCS-031: Design and Analysis of Algorithms
—————————————————————————————–
Algorithm
matix chain multiplication and paranthisization of minimaum solution
—————————————————————————————–
algorithims design and anlysis question paper
please send question set of ADA OF IGNOU mca,bca
—————————————————————————————–

Home > MCA Revised New Syllabus > MCS-031: Design and Analysis of Algorithms
Comments are closed.