Polygon examination

Содержание и основные понятия

Back to the table of contents
Alterna · Chapter 24 · page 24.5
Polygon examination
Final check on the deep graphs: quest + test + open task.
Three modes:
Quest
800 XP,
10 min test
,
Open task
.
GEF
EGE No. 1
He's got a little bit of depth.
01
♪ Quest
0 / 800 XP
0/8
02
EEG No. 22 - Parallel processes
A list of computing processes with duration and dependence is given. Independent processes are run in parallel. Find a minimum time to complete all processes.
Formula:
f(B) = dur(B), + max(f(A) for all A on which B depends
💻
EGE 22 task manager
Goal 1 / 10
Correct: 0 / 0
03
EEG No. 22 - Cooler of parallel processes
Enter the process in the same format as the task. The tool will calculate f(i) for each process and show a critical path, a chain that determines the minimum total time.
🔢
F(i) calculator — stepwise review
Add processes: indicate ID, time of implementation, and on which processes the independents depend; leave the addictions empty.
ID
Time (ms)
Depends on (in decimal place)
EGE Formula No. 22
f(A) = dur(A)
If there's no addiction.
f(B) = dur(B) + max(f(A))
For all A on which B depends. Response = max of all f(i).