$\backslash$table$[[$Key Terms,$\frac{\text{M}\text{a}\text{t}\text{c}\text{h}}{1}=,$Definition$],[1,$Project Network,A$,\backslash$table$[[$An activity that has more than one activity immediately$],[$preceding it $($more than one dependency arrow flowing to$],[$it$).]]],[2,$Activity,$2=,$B$,$The path with the longest duration through the network.$],[3,$Burst Activity,$3=,$C$,$The attempt by a planner to return to an earlier activity$],[4,$Merge Activity,$4=,$D$,\backslash$table$[[$This pass starts with the last project activity$($ies$)$ on the$],[$network$,$ and traces backwards on each path, subtracting$],[$activity times to find the late start $($LS$)$ and Late finish $($LF$)],[$times for each activity. $->$ Latest Time$]]],[5,$Path,$5=,$E$,\backslash$table$[[$The amount of time an activity can be delayed without$],[$delaying any immediately following $($successor$)$ activity.$],[$Note: This number can never be negative$]]],[6,$Critical Path,$6=,F,\backslash$table$[[$An element of the project that requires time but may not$],[$require resources. It may be made up of one or more work$],[$packages $($WPs$).]]],[7,$Forward Pass,$7=,$G$,\backslash$table$[[$The minimum amount of time a dependent activity must$],[$be delayed to begin or end.$]]],[8,$Forward Pass Computation $=,8=,H,$LF$-$ Duration $=$ LS$],[9,$Backward Pass,$9=,1,\backslash$table$[[$Tells us the amount of time an activity can be delayed and$],[$not delay the project.$]]],[10,$Backward Pass Computation $=,10=,$J$,\backslash$table$[[$Reflects the likelihood the original critical path$($s$)$ will$],[$change once the project is initiated.$]]],[11,$Total Slack,$11=,$K$,$A sequence of connected dependent activities$],[12,$Free Slack,$12=,L,\backslash$table$[[$A graphic flow chart depicting the project activities that$],[$must be completed, the logical sequences, the$],[$interdependencies of the activities to be completed, and$],[$the times for the activities to start and finish along with the$],[$longest path$($s$)$ through the network$-$the critical path.$]]],[13,$Network Sensitivity,$13=,$M$,\backslash$table$[[$An activity that has more than one activity immediately$],[$following it $($more that one dependency arrow flowing$],[$from it$).]]],[14,$Looping,$14=,N,\backslash$table$[[$This pass starts with the first project activity$($ies$)$ and traces$],[$each path $($chain of sequential activities$)$ through the$],[$network to the last project activity$($ies$),$ Earliest Time$]]],[15,$Lag,$15=,0,ES+$ Duration $=EF$