marcorealacci/so-un-bot
1
0
Fork 0
mirror of https://github.com/appinfosapienza/so-un-bot.git synced 2025-05-06 20:19:38 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

ingsw: Add 09-22

Browse source
This commit is contained in:
Marco Realacci 2023-01-02 03:39:02 +01:00
parent fb2aa7120e
commit 1b1633659c
64 changed files with 1312 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

1
Ingegneria del Software/0922_12/correct.txt Normal file
View file

@ -0,0 +1 @@
90%

17
Ingegneria del Software/0922_12/quest.txt Normal file
View file

@ -0,0 +1,17 @@
img=https://i.imgur.com/rWKWcCt.png
La transition coverage di un insieme di test cases (cioè sequenze di inputs) per uno state diagram è la percentuale di transizioni (archi nel grafo dello state diagram) percorsi almeno una volta.
Si consideri lo state diagram in figura
ed il seguente insieme di test cases:
Test case 1: act2 act0 act2 act2 act0 act1 act1 act0 act0 act2 act0 act2 act2 act2 act1 act2 act2 act0 act0 act2 act1 act0 act0 act2 act2 act2 act0 act2 act2 act0 act2 act0 act1 act2 act1 act1 act1 act1 act0 act1 act0 act1 act2 act1 act2 act0
Test case 2: act0
Test case 3: act2 act0 act2 act2 act0 act2 act0 act2 act2 act2 act0 act0 act1 act2 act0 act2 act2 act0 act2 act2 act0 act2 act0 act2 act2 act2 act0 act1 act1 act1 act0 act0 act1 act1 act2 act0 act0 act2 act1 act0 act2 act2 act0 act2 act2 act0 act0 act2 act0 act1 act0
Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?

1
Ingegneria del Software/0922_12/wrong 1.txt Normal file
View file

@ -0,0 +1 @@
100%

1
Ingegneria del Software/0922_12/wrong 2.txt Normal file
View file

@ -0,0 +1 @@
50%