MindStudy - MindStudy

Question:

Published on: 23 February, 2025

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

Database Management System Computer Graphics and Multimedia Software Engineering Mobile computing Data Structures & Algorithm Compiler Design

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].

23 February, 2025

Given weight vector {15,25,35,45,55} and the profit vector {10,20,30,40,50} and a knapsack of capacity 100, find atleast three feasible solutions including optimal one for the knapsack problem of 5 items.

23 February, 2025

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

23 February, 2025

What do you mean by dynamic programming? Write the algorithm of chain matrix multiplication.

23 February, 2025

Write short notes on