Lab session 06 greedy algorithm part 2 date of the

LAB SESSION 06: GREEDY ALGORITHM PART 2
Date of the Session: ___/___/___ Time of the Session: _____to______
Pre-Lab:
1) Explain why 0-1 Knapsack problems cannot be solved using greedy method unlike fractional
knapsack.

20CI2206R DESIGN & ANALYSIS OF ALGORITHMS
46
2) Categorize the Following as single source or multiple source shortest path algorithms.
Floyd-Warshall algorithm
Dijkstra’s algorithm –
Bellman-Ford algorithm –
Solution:
3) List down various shortest path greedy algorithms.
Solution:

20CI2206R DESIGN & ANALYSIS OF ALGORITHMS
47
In-Lab:
1) Given an array of size n that has the following specifications:
a. Each element in the array contains either a police officer or a thief.
b. Each police officer can catch only one thief.
c. A police officer cannot catch a thief who is more than K units away from the police officer.
We need to find the maximum number of thieves that can be caught.
Input
arr [] = {'P', 'T', 'T', 'P', 'T'},
k = 1.
Output
2
Here maximum 2 thieves can be caught; first police officer catches first thief and second police
officer can catch either second or third thief.
Solution:

20CI2206R DESIGN & ANALYSIS OF ALGORITHMS
2) Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n
vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines,
which, together with the x-axis forms a container, such that the container contains the most water.
Notice that you may not slant the container.
Input
height = [1,8,6,2,5,4,8,3,7]
Output
48
Solution:

20CI2206R DESIGN & ANALYSIS OF ALGORITHMS
49
Post-Lab:
1) Given an array of jobs where every job has a deadline and associated profit if the job is finished
before the deadline. It is also given that every job takes a single unit of time, so the minimum
possible deadline for any job is 1. How to maximize total profit if only one job can be scheduled at
a time.