Scribd
Upload
320 views3 pages

Standard Greedy Algorithms PDF

This document outlines greedy algorithms applied to standard problems, graphs, arrays, and operating systems. It discusses greedy approaches to problems like activity selection, Egyptian fractions, job sequencing, Huffman coding, minimum spanning trees, shortest paths, memory management, and job scheduling. A total of 25 problems involving greedy algorithms on arrays are also presented.

Uploaded by

kaushik ghosh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
320 views3 pages

Standard Greedy Algorithms PDF

This document outlines greedy algorithms applied to standard problems, graphs, arrays, and operating systems. It discusses greedy approaches to problems like activity selection, Egyptian fractions, job sequencing, Huffman coding, minimum spanning trees, shortest paths, memory management, and job scheduling. A total of 25 problems involving greedy algorithms on arrays are also presented.

Uploaded by

kaushik ghosh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Standard Greedy Algorithms :

1. Activity Selection Problem


2. Egyptian Fraction

3. Job Sequencing Problem


4. Job Sequencing Problem (Using Disjoint Set)
5. Job Sequencing Problem – Loss Minimization
6. Job Selection Problem – Loss Minimization Strategy | Set 2

7. Huffman Coding
8. Efficient Huffman Coding for sorted input
9. Huffman Decoding
10. Water Connection Problem
11. Policemen catch thieves
12. Minimum Swaps for Bracket Balancing
13. Fitting Shelves Problem
14. Assign Mice to Holes

Greedy Algorithms in Graphs :


1. Kruskal’s Minimum Spanning Tree
2. Prim’s Minimum Spanning Tree
3. Boruvka’s Minimum Spanning Tree
4. Reverse delete algorithm for MST
5. Problem Solving for Minimum Spanning Trees (Kruskal’s and Prim’s)

6. Dijkastra’s Shortest Path Algorithm


7. Dial’s Algorithm
8. Dijkstra’s Algorithm for Adjacency List Representation
9. Prim’s MST for adjacency list representation

10. Correctness of Greedy Algorithms


11. Minimum cost to connect all cities
12. Max Flow Problem Introduction
13. Number of single cycle components in an undirected graph
Greedy Algorithms in Arrays :
1. Minimum product subset of an array
2. Maximum product subset of an array

3. Maximize array sum after k-negations | Set 1


4. Maximize array sum after k-negations | Set 2
5. Maximize the sum of arr[i]*i
6. Maximum sum of increasing order elements from n arrays

7. Maximum sum of absolute difference of an array


8. Maximize sum of consecutive differences in a circular array
9. Maximum height pyramid from the given array of objects
10. Partition into two subarrays of lengths k and (N – k) such
that the difference of sums is maximum
11. Minimum sum of product of two arrays
12. Minimum sum by choosing minimum of pairs from array
13. Minimum sum of absolute difference of pairs of two arrays
14. Minimum operations to make GCD of array a multiple of k
15. Minimum sum of absolute difference of pairs of two arrays
16. Minimum sum of two numbers formed from digits of an array
17. Minimum increment/decrement to make array non-Increasing
18. Making elements of two arrays same with minimum
increment/decrement

19. Minimize sum of product of two arrays with permutation allowed


20. Sorting array with reverse around middle
21. Sum of Areas of Rectangles possible for an array
22. Array element moved by k using single moves
23. Find if k bookings possible with given arrival and departure
times

24. Lexicographically smallest array after at-most K consecutive


swaps
25. Largest lexicographic array with at-most K consecutive swaps
Greedy Algorithms in Operating Systems :
1. First Fit algorithm in Memory Management
2. Best Fit algorithm in Memory Management
3. Worst Fit algorithm in Memory Management
4. Operating System | Program for Next Fit algorithm in Memory
Management
5. Shortest Job First Scheduling

6. Program for Shortest Job First (SJF) scheduling | Set 2 (Preemptive)


7. Schedule jobs so that each server gets equal load
8. Job Scheduling with two jobs allowed at a time
9. Scheduling priority tasks in limited time and minimizing loss

10. Program for Optimal Page Replacement Algorithm


11. Program for Page Replacement Algorithms | Set 1 ( LRU)
12. Program for Page Replacement Algorithms | Set 2 (FIFO)

You might also like