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

04/11/2022 is added

Browse source
This commit is contained in:
Marco Realacci 2022-11-06 17:27:39 +01:00
parent 5c00a2f16a
commit 01c9360b01
207 changed files with 2082 additions and 245 deletions
Download patch file Download diff file Expand all files Collapse all files

1
Ingegneria del Software/1122_49/correct.txt Normal file
View file

@ -0,0 +1 @@
Transition coverage: 75%

12
Ingegneria del Software/1122_49/quest.txt Normal file
View file

@ -0,0 +1,12 @@
img=https://i.imgur.com/rZnqUL9.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: act1 act0 act2 act0 act0 act0 act2 act1 act1 act0 act2 act0 act2 act2 act1 act1 act0 act2 act2 act2 act1 act1 act2 act0 act1 act0 act1 act2
Test case 2: act1 act0 act0 act0 act2 act2 act2 act2 act2 act1 act1 act0 act0 act0 act2 act2 act2 act0 act1 act1 act1 act0 act2 act0 act0 act0 act1 act1 act2 act0 act1 act0 act0 act0 act2 act0 act1 act2 act2 act2 act0 act1 act2 act0 act1 act0 act1 act2
Test case 3: act1 act0 act0 act1 act1 act1 act1 act2 act2 act0 act1 act2
Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?

1
Ingegneria del Software/1122_49/wrong 1.txt Normal file
View file

@ -0,0 +1 @@
Transition coverage: 100%

1
Ingegneria del Software/1122_49/wrong 2.txt Normal file
View file

@ -0,0 +1 @@
Transition coverage: 50%