SoftwareTechnik Ex 02 Annotated
SoftwareTechnik Ex 02 Annotated
May 1, 2024
1
Mehmet Kaan Isik, Maher Brahim Submission SS 2024
Entry
24
25
26
28
30 51
52
37 38
53
40 41
54
47
43
Exit
46
44
1.2) v(Glef t ) = 4 − 4 + 2 = 2
v(Gright ) = 3 − 3 + 2 = 2
From the example graph 2 we can see that v(Glef t ) = v(Gright ). This is due to the fact that adding a
node also adds an edge so that they cancel each other out at the end.
2
Mehmet Kaan Isik, Maher Brahim Submission SS 2024
Entry Entry
1
1 Without auxiliary nodes
2 3
2 3
Exit Exit
Figure 2: A control flow graph example with (left) and without (right) auxiliary node.
2.2) Using the Delphi Method, the KLOCpars can be estimated in the following 3 steps:
step 1: First estimations
- Game Mechanics and Logic: 11-12 KLOC
- System Integration: 3-4 KLOC
- Graphics Rendering and Interface: 4 KLOC (for 2D) or 7 KLOC (for 3D)
- Network and Multiplayer Handling: 6 KOLC
- Sound Management: 5 KLOC
step 2: second estimations
- The Kloc number ranges between 6 and 10 KLOC in the second estimation round.
step 3: final estimation:
- The final estimate is determined by calculating the median and thus amounts to KLOCpars = 8
KLOC.
2.3) Nominal Reliability: Failure of the Software can lead to failing a class, which can be repeated
afterwards, which can be recovered just by taking the class again.
Low Database Size:
High Control Operations: As a Game has many moving parts, usage of nested structures with
compound predicates may be needed for certain implementations. Stack Control is also needed for, at
least in our case, for visualization.
3
Mehmet Kaan Isik, Maher Brahim Submission SS 2024