The document discusses a student's real-life problem of managing multiple tasks amid approaching exams, leading to a desire to prioritize more profitable work. It outlines an algorithm based on dynamic programming to determine which tasks to accept for maximum earnings and minimal days required. The solution involves creating a table to assess days and earnings for each task and identifying the most profitable tasks to complete.

1. A Real-life
A Real-life
problem-solve
problem-solve
with algorithm
with algorithm
10/08/2021
CSE 214

2. Student of PC-E section
ID: 201-15-3303
MD SAIMUR
RAHMAN
SWARNAB

3. What will be
the
problem?

4. I've got 4 works to do in the Fiver. My semester final exam is ahead. It is not possible
for me to do so much work now. So I want to leave the ones that are more profitable
and reject the rest.This is my problem.
Problem

5. The working
details

6. Now What will
Now What will
be the
be the
algorithm of
algorithm of
this problem!!
this problem!!

7. Algorithm
1
First, take the day array and the
value
2
Starting from N = Serial no,
T = Days.
5
6
will take that job in the least
number of days
Firstly, filled with the basis of
dynamic programming: Line 0
includes all zeros
3
4
Using recursive formulas, use
line 0 to calculate line 1, use line
1 to calculate line 2, etc. ... until
all lines are calculated.
If the next line element is
greater than the previous line
element then print the value
otherwise print the previous one

8. Solution

9. Solve Table
Item: 1 2 3 4
1 0 0 1

10. In3rdrowtotal7days
earningwillbe150$
whichisin2ndand4rd
work
MainThingsfrom
theslovetable
In4throwtotal6days
earningwillbe150$
whichisin1stand4th
work
That'swhy,the4throws
workwillbesomuch
profitable

11. That's all
about Real life
Algorithm
problem