803 views
0 0 votes

Q.  We are given 10 tasks. The execution of task requires 1 unit of time. Each task Ti has profit pi and deadline di. Profit pi is earned if task Ti is completed before dith unit of time.

Task

T1

T2

T3

T4

T5

T6

T7

T8

T9

T10

Profit

15

22

x

18

25

12

24

18

20

15

Deadline

1

2

2

3

4

5

3

6

1

5

Suppose maximum total profit earned by scheduling above task is 129, then profit ‘x’ assigned to T3 is __________________.

Please log in or register to answer this question.

Position:
Show:

Related questions

5 5 votes
1 1 answer
1.2k
1.2k views
4 4 votes
3 3 answers
970
970 views
kallu singh asked Jan 20, 2018
970 views
A certain problem is having an algorithm with the following recurrence relation.\[T(n)=2 \cdot T(\sqrt{n})+n\]How much time would the algorithm take to solve the problem?
2 2 votes
0 0 answers
607
607 views
kallu singh asked Dec 16, 2017
607 views
0 0 votes
0 0 answers
529
529 views
kallu singh asked Dec 15, 2017
529 views