img
Question:
Published on: 12 October, 2024

Using greedy strategy, schedule the following jobs with deadline so as to maximize the profit.

Answer:

Deadlines and profits are mentioned as follows:

 

Job i

1

2

3

4

Deadline di

3

2

3

1

Profit gi

9

7

7

2

Subjects
Mobile computing Software Engineering Design and Analysis of Algorithm Database Management System Compiler Design Data Structures & Algorithm
Trending

Write quick sort algorithm. Analyze the best case and worst case time complexities of your algorithm. Perform the PARTITION operation once(one time) on the following array as per the requirement of the quicksort algorithm, assuming the last element of the array to be the pivot element. Clearly mention the steps. Arr=[2,8,7,1,3,5,6,4].
View : 761
12 October, 2024

State the Max-flow min cut theorem for network flow analysis. Trace the execution of Ford-Fulkerson algorithm for finding the maximum flow in the graph.