![]() ![]() Greedy Technique - Container loading problem - Prim?s algorithm and Kruskal?s Algorithm - 0/1 Knapsack problem, Optimal Merge pattern - Huffman Trees. UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUEĭynamic programming - Principle of optimality - Coin changing problem, Computing a Binomial Coefficient - Floyd?s algorithm - Multi stage graph - Optimal Binary Search Trees - Knapsack Problem and Memory functions. Divide and Conquer Methodology - Binary Search - Merge sort - Quick sort - Heap Sort - Multiplication of Large Integers - Closest-Pair and Convex - Hull Problems. Analysis Framework - Empirical analysis - Mathematical analysis for Recursive and Non-recursive algorithms - Visualization UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUERīrute Force - Computing an - String Matching - Closest-Pair and Convex-Hull Problems - Exhaustive Search - Travelling Salesman Problem - Knapsack Problem - Assignment problem. Notion of an Algorithm - Fundamentals of Algorithmic Problem Solving - Important Problem Types - Fundamentals of the Analysis of Algorithmic Efficiency –Asymptotic Notations and their properties. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |