1 / 10

Course Contents: T1

Learn about Greedy Algorithms including Knapsack, Prims, Job Sequencing, and more. Understand the basic principles, algorithms, complexity calculations with numerical examples. Enhance your problem-solving skills and algorithmic thinking. Practical applications and methodologies provided.

groganj
Download Presentation

Course Contents: T1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Course Contents: T1 • Greedy Algorithm • Divide & Conquer • Dynamic Programming • Three questions 10 marks each [30 marks] • Time 1.5 hrs [Paper on Sunday] • No extra answer sheet • Presentation of solution will be counted

  2. Unit-3:Part-1 • UNIT-III:  Part-IGreedy Algorithms: ContentsIntroduction to Greedy algorithm and basic principleExamples:Knapsack problem: Principle, numerical example, algorithm, complexity calculation, Minimum Cost Spanning Tree:Prims Algorithm, Reverse Delete AlgorithmSingle source shortest path algorithm: DijkastraAlgorithm, Job Sequencing Problem: [Assignment on case study]Maximum Flow Problem: Theory, numerical, example and application, Methodology to compute complexity of algorithm with each topic

  3. Prepare • Knapsack Algorithm • Basic Idea • Numerical • Algorithm and time complexity [Capacity rule] • Various applications of Knapsack Algorithm Example: n=7 Capacity:12: All three methods/Best method

  4. Prepare • Prims Algorithm • Graph – Cost matrix • Start with minimum [Function to find minimum] • Role of intermediate data structures [near array] • Representation of output [Three tuple form] • Examples • Algorithm • Heap structure and its advantage

  5. Prepare: Same graphs for reverse delete algorithm • Example

  6. Reverse Delete Algorithm • Data structure used in implementation • Additional storage required • How to find alternate path to reach a vertex • Suggested questions:? • Check graph and solve.

  7. Prepare • Single Source Shortest path • Distance formula, parent array, • Vertex selected array • Steps: intermediate process. • Distance tree • What will happen if cycle and negative edges are permitted

  8. Single Source Shortest Path

  9. Prepare • Maximum Flow Network • Terminology • Applications • Examples

  10. Job Sequencing problem • Principle • Applications • Example: Snippet/Snapshot • Mathematical formulation • Scheduling with deadline/without deadline

More Related