",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "19.\tAssumiamo di compilare un file .c nei seguenti modi\ngcc file.c -o file1.o\ngcc -g file.c -o file2.o\n
\nperché le dimensioni di file2.o sono diverse da quelle di file1.o?",
+ "answers": [
+ {
+ "answer": "perché file2.o è stato ottimizzato, per occupare meno spazio in memoria, rispetto a file1.o",
+ "image": ""
+ },
+ {
+ "answer": "perché file2.o contiene informazioni aggiuntive rispetto a file1.o utili per il debug",
+ "image": ""
+ },
+ {
+ "answer": "non è vero che i due comandi di compilazione producono file di dimensioni diverse",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "20.\tAssuma di avere due shell aperte, etichettate come shell_1 e shell_2 e supponga di eseguire la sequenza di comandi che segue\n(shell_i: cmd indica che cmd è eseguitto nella shell_i, i=1,2).\nshell_1: xterm\nshell_2: ps -C xterm\n#restituisce xtermPID\nshell_2: kill -s SIGSTOP xtermPID\nshell_2: kill -s SIGCONT xtermPID
\nQuale è il loro effetto su processo xterm?\n\n(NOTA BENE: la risposta 3 viene data come corretta all'esame, anche se errata)\n
",
+ "answers": [
+ {
+ "answer": "Il processo xterm viene prima mandato in esecuzione in background e poi riportato in foreground",
+ "image": ""
+ },
+ {
+ "answer": "Il processo xterm viene mandato in esecuzione in background ",
+ "image": ""
+ },
+ {
+ "answer": "Il processo xterm viene prima portato nello stato stopped (T) e poi mandato in esecuzione in foreground",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "21.\tSi assuma di avere due shell aperte, etichettate come shell_1 e shell_2 e si consideri la seguente sequenza di comandi\n(shell_i:cmd indica che cmd è eseguitto nella shell i, i=1,2)\nshell_1: xterm\nshell_2: ps -C xterm\n#restituisce xtermPID\nshell_2: kill -s SIGSTOP xtermPID
\nQuale è il loro effetto?",
+ "answers": [
+ {
+ "answer": "Il processo xterm viene terminato con segnale SIGSTOP",
+ "image": ""
+ },
+ {
+ "answer": "Il processo xterm viene mandato in esecuzione in background",
+ "image": ""
+ },
+ {
+ "answer": "Il processo xterm viene messo in stato stopped (T)",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "22.\tSupponga di avere 2 file hw1.c e hw2.c contenenti il seguente codice(uscita 2 volte)\nhw1.c:\n#include \n#include \"hw2.c\"\nint f(int argc, char *args[]) {\n printf(\"Hello World!\\n\");\n return 256;\n}\n
\nhw2.c:\nint f(int argc, char *args[]);\nint main(int argc, char *args[]) {\n return f(argc, args);\n}\n
\nQuale dei seguenti comandi di compilazione genera errore?",
+ "answers": [
+ {
+ "answer": "gcc -Wall hw1.c -o hw.out",
+ "image": ""
+ },
+ {
+ "answer": "gcc -Wall hw1.c hw2.c -o hw.out",
+ "image": ""
+ },
+ {
+ "answer": "gcc hw1.c",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "23.\tSupponiamo di avere il file eseguibile (ottenuto dalla compilazione di una programma C) mioprogramma\nQuesti due modi di invocare il programma sono equivalenti?\n$ ./mioprogramma A B C
\n$ ./mioprogramma < input.txt
\ndove input.txt contiene A B C",
+ "answers": [
+ {
+ "answer": "no, nel primo caso A B C vengono caricati in argv, nel secondo caso vengono inviati sullo stdin",
+ "image": ""
+ },
+ {
+ "answer": "dipende dalla logica del codice",
+ "image": ""
+ },
+ {
+ "answer": "si sono equivalenti",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "24.\tQuale è la differenza tra thread posix e processo linux (uscito 2 volte)",
+ "answers": [
+ {
+ "answer": "Thread concorrenti condividono codice, segmento dati e file; i processi concorrenti pure",
+ "image": ""
+ },
+ {
+ "answer": "Thread concorrenti condividono lo stack; i processi concorrenti anche",
+ "image": ""
+ },
+ {
+ "answer": "Thread concorrenti condividono codice, segmento dati e file; i processi concorrenti no",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "25.\tPer mostare il pid dei job in esecuzione in backgroud quali di questi comandi è corretto?",
+ "answers": [
+ {
+ "answer": "jobs -p",
+ "image": ""
+ },
+ {
+ "answer": "ps -p -u",
+ "image": ""
+ },
+ {
+ "answer": "jobs",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "26. Quale di queste stringhe non è valida come identificatore in C?",
+ "answers": [
+ {
+ "answer": "_voltage",
+ "image": ""
+ },
+ {
+ "answer": "rerun",
+ "image": ""
+ },
+ {
+ "answer": "x-axis",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "27. Quale di queste stringe è valida come identificatore in C?",
+ "answers": [
+ {
+ "answer": "_voltage",
+ "image": ""
+ },
+ {
+ "answer": "x-ray",
+ "image": ""
+ },
+ {
+ "answer": "return",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "28. Si consideri la seguente funzione f\nchar *f(char *a, const char *b, size_t n) {\n size_t i;\n for (i = 0; i < n && b[i] != '\\0'; i++)\n a[i] = b[i];\n for ( ; i < n; i++)\n a[i] = '\\0';\n return a;\n}
\nCosa produce come risultato quando eseguita?",
+ "answers": [
+ {
+ "answer": "Copia esattamente n caratteri della stringa b nella stringa a e restituisce a",
+ "image": ""
+ },
+ {
+ "answer": "Concatena al piò n caratteri della stringa b alla stringa a e restituisce a",
+ "image": ""
+ },
+ {
+ "answer": "Copia al piò n caratteri della stringa b nella stringa a e restituisce a",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "29. Si consideri la seguente funzione f\nchar *f(char *a, const char *b, size_t n) {\n size_t l = strlen(a);\n size_t i;\n for (i = 0 ; i < n && b[i] != '\\0' ; i++)\n a[l + i] = b[i];\n a[l + i] = '\\0';\nreturn a;\n}
\nCosa produce come risultato quando eseguita?",
+ "answers": [
+ {
+ "answer": "Copia al piò n caratteri della stringa b in a e restituisce a",
+ "image": ""
+ },
+ {
+ "answer": "Copia esattamente n caratteri della stringa b nella stringa a e restituisce a",
+ "image": ""
+ },
+ {
+ "answer": "Concatena i primi n caratteri della stringa b alla stringa a e restituisce a",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "30. Si consideri la seguente dichiarazione di struttura\nstruct point2D {\n double x; // coordinata x\n double y; // coordinata y\n} pA={0, 0}, pB={1, 5};
\nQuale delle seguenti assegnazioni è corretta?",
+ "answers": [
+ {
+ "answer": "pA -> x = pB -> x; pA -> y = pB -> y;",
+ "image": ""
+ },
+ {
+ "answer": "pA = &pB",
+ "image": ""
+ },
+ {
+ "answer": "pA = pB;",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "31. Si consideri il seguente ciclo for\nint scoreCount, a;\nfor(scoreCount=0; scanf(\"%d\",&a)==1; scoreCount++);
\nCosa produrebbe come risultato, se eseguito?",
+ "answers": [
+ {
+ "answer": "Legge una sola volta da stdin e poi termina, qualunque sia l'input",
+ "image": ""
+ },
+ {
+ "answer": "Legge da stdin senza mai terminare",
+ "image": ""
+ },
+ {
+ "answer": "Legge ripetutamente numeri interi da stdin fintanto che è fornito un input di tipo diverso (ad esempio un carattere)",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "32. Consideri il seguente frammento di codice\nint *ptr = malloc(sizeof(int));\nptr = ptr+1;
\nassumendo la malloc assegni a ptr la locazione di memoria 0x55c2b1268420 cosa contiene ptr dopo l’incremento?",
+ "answers": [
+ {
+ "answer": "0x55c2b1268421
",
+ "image": ""
+ },
+ {
+ "answer": "l'incremento della variabile prt genera un errore di segmentazione in fase di esecuzione",
+ "image": ""
+ },
+ {
+ "answer": "0x55c2b1268424
",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "33. Cosa stampa su stdout la seguente chiamata a printf? \nprintf(\"aaaaa\\nbbbbb\\f\\rccccc\\r\\fddddd\\reeeee\\n\");
",
+ "answers": [
+ {
+ "answer": "aaaaa bbbbb ccccc eeeee",
+ "image": ""
+ },
+ {
+ "answer": "aaaaa bbbbb ccccc ddddd",
+ "image": ""
+ },
+ {
+ "answer": "aaaaa bbbbb ccccc ddddd eeeee",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "34. Si consideri il seguente frammento di codice\nchar **mptr, **mptr1, *ptr1;\nint i;\nmptr = calloc(10,sizeof(char *));\nmptr1 = mptr;\nfor(i=0;i<10;i++){\n mptr[i]=(char *)malloc(10); \n}
\nPer de-allocare tutta la memoria allocata, quale delle seguenti opzioni è coretta?",
+ "answers": [
+ {
+ "answer": "for(i=0;i<10;i++) free(mptr1[i]);",
+ "image": ""
+ },
+ {
+ "answer": "for(i=0;i<10;i++) free(mptr1[i]); free(mptr1);",
+ "image": ""
+ },
+ {
+ "answer": "free(mptr1);",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "35. Si consideri il seguente frammento di codice\nchar **mptr, *ptr1;\nint i;\nmptr = calloc(10,sizeof(char *));\nfor(i=0;i<10;i++){\n mptr[i]=(char *)malloc(10); \n}
\nQuale delle seguenti strategie di de-allocazione crea un memory leakage?",
+ "answers": [
+ {
+ "answer": "free(mptr);",
+ "image": ""
+ },
+ {
+ "answer": "for(i=0;i<10;i++) free(mptr[i]);",
+ "image": ""
+ },
+ {
+ "answer": "entrambe, ovvero sia (1) che (2)",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "36. Si consideri un file contenente un programma in linguaggio C. Si assuma che è stata inserita la direttiva #include \"stdio.h\" . perché la compilazione potrebbe generare errori?",
+ "answers": [
+ {
+ "answer": "perché cerca il file \"stdio.h\" nella directory corrente",
+ "image": ""
+ },
+ {
+ "answer": "La compilazione non genera errori a meno che il file non esista nel filesystem",
+ "image": ""
+ },
+ {
+ "answer": "perché il file stdio.h potrebbe non esistere",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "37. Quale delle seguenti dichiarazioni di variabile inizializza una stringa?",
+ "answers": [
+ {
+ "answer": "char r[10] = {`L´,`9´,` ´,`4´,`a´,`p`,`r´};
",
+ "image": ""
+ },
+ {
+ "answer": "char r[] = ``L9 4apr´´;
",
+ "image": ""
+ },
+ {
+ "answer": "char r[] = {`L´,`9´,` ´,`4´,`a´,`p`,`r´};
",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "39. Si consideri il seguente frammento di codice\n\nFILE * pFile;\npFile = open(\"myfile.txt\",\"rw+\");\nfprintf(pFile, \"%f %s\", 3.1416, \"PI\");\n
\nAssumendo che myfile.txt non esiste, quale delle seguenti affermazioni è vera?",
+ "answers": [
+ {
+ "answer": "Il programma genera un errore in fase di esecuzione",
+ "image": ""
+ },
+ {
+ "answer": "Il programma genera errore in fase di compilazione",
+ "image": ""
+ },
+ {
+ "answer": "Il programma scrive sul file myfile.txt la stringa 3.1416 PI",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "40. Cosa fa il seguente segmento di codice se eseguito?\nscanf(“%d\",&num); \ndo; {\nprintf(“%d\\n\",num); \nscanf(“%d\",&num);\n} while(num!=0);
",
+ "answers": [
+ {
+ "answer": "Stampa il valore di num almeno una volta",
+ "image": ""
+ },
+ {
+ "answer": "Cicla infinitamente se num è diverso da 0",
+ "image": ""
+ },
+ {
+ "answer": "Popipopi S.p.A. > CD Click s.r.l.",
+ "image": ""
+ },
+ {
+ "answer": "Genera errore in fase di compilazione",
+ "image": ""
+ }
+ ],
+ "correct": 3,
+ "image": ""
+ },
+ {
+ "quest": "41. Si consideri il frammento di codice\ni=0; c=0; p=1;\nwhile (i++ < 10)\nc=c+1;\np--;
\nche valore conterrà p al termine dell'esecuzione del frammento di codice?",
+ "answers": [
+ {
+ "answer": "0",
+ "image": ""
+ },
+ {
+ "answer": "-10",
+ "image": ""
+ },
+ {
+ "answer": "-9",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "42. Supponiamo di eseguire separatamente i seguenti frammenti di codice\nFrammento_1\nclose(2);\nif (fopen(\".\",\"r\")) {\n perror(\"main\");\n}
\nFrammento_2\nclose(2);\nif (fopen(\".\",\"r\")) {\n printf(\"main: %s \\n\", strerror(errno));\n}
\nQuale delle seguenti affermazioni è falsa?",
+ "answers": [
+ {
+ "answer": "Il frammento_1 non produce alcun output sul terminale",
+ "image": ""
+ },
+ {
+ "answer": "La loro esecuzione produce sul terminale due stringhe identiche",
+ "image": ""
+ },
+ {
+ "answer": "Il frammento_2 produce un output sullo stdout",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "43. Consideriamo queste due line di codice\n1. printf(\"main:%s\\n\",strerror(errno));
\n2. perror(\"main\");
\nQuali delle seguenti affermazioni è corretta?\n\n(NOTA BENE: la risposta 1 viene data come corretta all'esame, anche se in realtà differiscono di uno spazio)\n
",
+ "answers": [
+ {
+ "answer": "Producono stringhe diverse e la prima la invia su stdout mentre la seconda su stderr.",
+ "image": ""
+ },
+ {
+ "answer": "Inviano la stessa stringa su stdout",
+ "image": ""
+ },
+ {
+ "answer": "producono la stessa stringa ma la 1 la invia su stdout, mentre la 2 su stderr ",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "44. Quale delle seguenti funzioni di libreria alloca memoria nello stack?",
+ "answers": [
+ {
+ "answer": "void *calloc( size_t nmemb, size_t size );",
+ "image": ""
+ },
+ {
+ "answer": "void *alloca( size_t size );",
+ "image": ""
+ },
+ {
+ "answer": "void *malloc( size_t size );",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "45. Un processo può allocare memoria nello stack?",
+ "answers": [
+ {
+ "answer": "no un processo può allocare memoria sono nell'heap",
+ "image": ""
+ },
+ {
+ "answer": "si mediante la funziona di libreria malloc(3)",
+ "image": ""
+ },
+ {
+ "answer": "si mediante la funzione di libreria alloca(3) ",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "46. Quale è la differenza tra la system call _exit(2) e la funzione di libreria exit(3)? (uscita 2 volte) ",
+ "answers": [
+ {
+ "answer": "_exit(2) chiude tutti i file descriptor mentre exit(3) no",
+ "image": ""
+ },
+ {
+ "answer": "_exit(2) non invoca gli handler registrati con atexit e on_exit mentre exit(3) li invoca",
+ "image": ""
+ },
+ {
+ "answer": "_exit(2) invoca gli handler registrati con atexit e on_exit mentre exit(3) non li invoca",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "47. Quale attributi di un processo sono ereditati dal processo figlio?",
+ "answers": [
+ {
+ "answer": "parent pid, timer, contatori risorse ",
+ "image": ""
+ },
+ {
+ "answer": "working directory, descrittori dei file, memoria condivisa",
+ "image": ""
+ },
+ {
+ "answer": "timer, lock, coda dei segnali",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "48. Si consideri il seguente frammento di codice\npid_t pID = fork();\nif (pID == 0) {\n Blocco_1\n} else if (pID < 0) {\n Blocco_2\n} else {\n Blocco_3\n}
\nQuale blocco di codice (tra Bloccco_1, Blocco_2 e Blocco_3) verrà eseguito dal processo figlio?",
+ "answers": [
+ {
+ "answer": "Blocco_3",
+ "image": ""
+ },
+ {
+ "answer": "Blocco_1",
+ "image": ""
+ },
+ {
+ "answer": "Blocco_2",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "49. Si consideri il seguente frammento di codice\npid_t pID = fork();\nif (pID == 0) {\n Blocco_1\n} else if (pID < 0) {\n Blocco_2\n} else {\n Blocco_3\n}
\nQuale blocco di codice (tra Bloccco_1, Blocco_2 e Blocco_3) verrà eseguito dal processo padre?",
+ "answers": [
+ {
+ "answer": "Blocco_3",
+ "image": ""
+ },
+ {
+ "answer": "Blocco_1",
+ "image": ""
+ },
+ {
+ "answer": "Blocco_2",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "50. Supponiamo che la system call\npid_t waitpid(pid_t pid, int *status, int options);
\nsia invocata con valore di pid uguale a 0. Quale è il suo comportamento?\nScegli un'alternativa:",
+ "answers": [
+ {
+ "answer": "attende la terminazione di qualunque processo figlio il cui gruppo ID del processo sia diverso da quello del processo chiamante",
+ "image": ""
+ },
+ {
+ "answer": "attende la terminazione di qualunque processo figlio il cui gruppo ID sia uguale a quello del processo chiamante (ovvero il processo padre)",
+ "image": ""
+ },
+ {
+ "answer": "attende la terminazione di qualunque processo figlio",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "51. Si consideri il seguente frammento di codice (i numeri a lato sono i numeri di riga delle istruzioni)(uscita 2 volte)\n1. Pthread_t tid;\n2. pthread_create(&tid, ... )\n3. pthread_create(&tid, ...)\n4. pthread_join(tid, ...);\n5. printf(\"joined\");
\nquale delle seguenti affermazioni è falsa?",
+ "answers": [
+ {
+ "answer": "la stringa \"joined\" è inviata su stdout solo quando il thread creato a riga 3 è terminato",
+ "image": ""
+ },
+ {
+ "answer": "la stringa \"joined\" è inviata su stdout quando entrambi i thread sono terminati",
+ "image": ""
+ },
+ {
+ "answer": "la chiamata pthread_join(...) attende la terminazione del thread con identificatore tid",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "52. Si considerino i seguenti frammenti di codice (R1 e R2)\nR1: strPtr=(char *) calloc(SIZE_OF_ARRAY, sizeof(char) );\nR2: strPtr=(char *) malloc(SIZE_OF_ARRAY);\n memset(strPtr, ´\\0´, SIZE_OF_ARRAY);
",
+ "answers": [
+ {
+ "answer": "R1 e R2 producono lo stesso risultato",
+ "image": ""
+ },
+ {
+ "answer": "R2 dopo aver allocato la memoria la inizializza, mentre R1 no",
+ "image": ""
+ },
+ {
+ "answer": "R1 alloca nell’heap, e quindi dopo è consigliabile “pulire\" la memoria; mentre R2 alloca nello stack e quindi non c’è bisogno di “pulire\" la memoria.",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "53. Consideriamo la seguente invocazione della funzione realloc\nstrptr1=(char *) realloc(strptr, 10 * SIZE_OF_ARRAY);
\nstrptr1 può essere diverso da strptr?",
+ "answers": [
+ {
+ "answer": "si, la realloc modifica sempre l'indirizzo di partenza dell'area di memoria ridimensionata",
+ "image": ""
+ },
+ {
+ "answer": "no, strptr1 è sempre uguale a strptr",
+ "image": ""
+ },
+ {
+ "answer": "sì se a seguito del ridimensionamento della memoria allocata non è possibile trovare un numero sufficiente di locazioni contigue a partire dal strptr ",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "54. Supponiamo di voler modificare il comportamento di default di un processo quando esso riceve un segnale. Ovvero vogliamo modificare il gestore (handler) di un segnale.\nQuale, tra le system call, o combinazione di system call di seguito riportate è possibile utilizzare?",
+ "answers": [
+ {
+ "answer": "sigaction(2)",
+ "image": ""
+ },
+ {
+ "answer": "sigaction(2) seguita da una fork(2) che esegue l’handler del segnale",
+ "image": ""
+ },
+ {
+ "answer": "signal(2) seguita da una fork(2) che esegue l’handler del segnale",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "55. Assumiamo di voler settare i permessi di accesso 0600 al file filename mediante l'uso della system call open(2). Quale delle seguenti chiamate è corretta?",
+ "answers": [
+ {
+ "answer": "open( \"filename\", O_RDWR | O_CREAT | S_IRUSR | S_IWUSR);",
+ "image": ""
+ },
+ {
+ "answer": "open(\"filename\",O_RDWR | O_CREAT, S_IRUSR & S_IWUSR);",
+ "image": ""
+ },
+ {
+ "answer": "open( \"filename\", O_RDWR | O_CREAT, S_IRUSR | S_IWUSR);",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "56. Si consideri la system call\nint open(const char *pathname, int flags);\nnel caso venga invocata con il flag impostato a\nO_CREAT | O_EXCL | O_RDONLY
\nQuale è il comportamento atteso?",
+ "answers": [
+ {
+ "answer": "Se il file non esiste viene creato ed aperto in lettura, se invece esiste ritorna errore",
+ "image": ""
+ },
+ {
+ "answer": "Se il file non esiste lo crea e lo apre in lettura, altrimenti lo apre in lettura",
+ "image": ""
+ },
+ {
+ "answer": "Se il file non esiste viene creato con i permessi di esecuzione (x) ed aperto in lettura. Se esiste vengono aggiunti i permessi di esecuzione se già non settati ed il file è aperto in lettura",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "57. Si consideri il seguente frammento di codice\nchar* file = argv[1];\nint fd;\nstruct flock lock;\nfd = open (file, O_WRONLY);\nmemset (&lock, 0, sizeof(lock));\nlock.l_type = F_WRLCK;\nfcntl (fd, F_SETLKW, &lock);\n....
\nQuale è il suo comportamento?",
+ "answers": [
+ {
+ "answer": "mette un lock mandatory in scrittura sul file file",
+ "image": ""
+ },
+ {
+ "answer": "mette un lock advisory in scrittura sul file file",
+ "image": ""
+ },
+ {
+ "answer": "mette un lock bloccante in scrittura sul file file.",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "58. Quale è la differenza tra i seguenti frammenti di codice?\nC1: int fd, fd1;\n fd=open(“filename\", O_RDWR);\n fd1=fd;\n
\nC2: int fd,fd1;\n fd=open(“filename\", O_RDWR);\n fd1=dup(fd);
",
+ "answers": [
+ {
+ "answer": "Dopo l’esecuzione di C1 e C2 fd1 contiene lo stesso valore",
+ "image": ""
+ },
+ {
+ "answer": "Dopo l’esecuzione di C1 i due file descriptor puntano allo stesso file, mentre dopo l’esecuzione di C2 il file filename viene duplicato",
+ "image": ""
+ },
+ {
+ "answer": "Dopo l’eseccuzione di C1 fd1 contiene lo stesso valore di fd; mentre dopo l’esecuzione di C2 fd1 contiene il valore del piu’ piccolo file descriptor disponibile",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "59. Si consideri il seguente frammento di codice\nint fd,fd1;\nstruct stat buf,\nbuf1;\nfd=open(“filename\", O_RDWR);\nfd1=dup(fd); \nfstat(fd,&buf);\nfstat(fd1,&buf1);
",
+ "answers": [
+ {
+ "answer": "buf.st_ino è uguale a buf1.st_ino",
+ "image": ""
+ },
+ {
+ "answer": "buf.st_ino è diverso da buf1.st_ino",
+ "image": ""
+ },
+ {
+ "answer": "st_ino non è membro della struttura stat",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "60. Supponiamo di avere il seguente frammento di codice\nstruct dirent *dentry; //directory stream\n char *filename;\n DIR *dstr=opendir(“mydir\");\n while ((dentry=readdir(dstr)) != NULL) {\n /* Memorizzai nome file nella directory in filename */\n }
\nQuale delle seguenti istruzioni deve essere posta all’interno del ciclo while per memorizzare in filename il nome dei file contenuti all’interno della directory mydir ?",
+ "answers": [
+ {
+ "answer": "filename = dentry --> d_name;",
+ "image": ""
+ },
+ {
+ "answer": "filename = dentry.filename;",
+ "image": ""
+ },
+ {
+ "answer": "filename = dentry --> filename;",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "61. Quali attributi di processo sono preservati dalla system call execve(2)?",
+ "answers": [
+ {
+ "answer": "Memory locks",
+ "image": ""
+ },
+ {
+ "answer": "Timer",
+ "image": ""
+ },
+ {
+ "answer": "Umask",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "62. Si consideri la system call execve(2). Quale delle seguenti affermazioni è corretta?",
+ "answers": [
+ {
+ "answer": "la execve(2) permette di generare un proccesso figlio del processo chiamante senza utilizzare una fork ma semplicemente eseguendo un immagine contenuta in un file (execve esegue implicitamente la fork)",
+ "image": ""
+ },
+ {
+ "answer": "la execve(2) permette di sostituire l'immagine di un processo con quella di un file eseguibile o di uno script di shell eseguibile",
+ "image": ""
+ },
+ {
+ "answer": "la execve(2) è una estensione della funzione system(3). Infatti, execve(2) può eseguire un qualsiasi programma, incluso uno script di shell.",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "64. Supponiamo di aver mappato un file in memoria con la system call mmap(2). A cosa serve invocare la msync(2)?",
+ "answers": [
+ {
+ "answer": "Impostando il tipo di mapping a MAP_SHARED la msync(2) permette di scrivere le modifiche su disco prima dell' invocazione di una unmap(2) o prima della chiusura del file descriptor. ",
+ "image": ""
+ },
+ {
+ "answer": "è necessario invocare sempre la msync(2) se non si vogliono perdere le modifiche fatte in memoria.",
+ "image": ""
+ },
+ {
+ "answer": "non serve invocare la mysinc perché quando si chiude il file descriptor tutte le modifiche fatte in memoria vengono scritte su disco",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "65. Quale delle seguenti affermazioni sui processi Linux è falsa?",
+ "answers": [
+ {
+ "answer": "In un determinato istante, non possono esserci 2 processi distinti con lo stesso PID",
+ "image": ""
+ },
+ {
+ "answer": "Per creare i PID dei processi si usano dei numeri interi che crescono sempre",
+ "image": ""
+ },
+ {
+ "answer": "In istanti diversi, possono esserci 2 processi distinti con lo stesso PID",
+ "image": ""
+ },
+ {
+ "answer": "Ogni processo può conoscere il suo PID",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "66. Quale delle seguenti affermazioni sui processi Linux è vera?",
+ "answers": [
+ {
+ "answer": "Normalmente, il processo figlio, una volta terminata la sua computazione, attende, con una chiamata alla syscall wait, che il padre termini e gli restituisca il suo exit status",
+ "image": ""
+ },
+ {
+ "answer": "Un processo diventa zombie se termina prima di almeno uno dei processi che abbia eventualmente creato",
+ "image": ""
+ },
+ {
+ "answer": "Ogni processo può conoscere il proprio PID, ma non quello del processo che l'ha creato",
+ "image": ""
+ },
+ {
+ "answer": "Con l'eccezione del primo processo, tutti i processi sono creati con una fork",
+ "image": ""
+ }
+ ],
+ "correct": 3,
+ "image": ""
+ },
+ {
+ "quest": "67. Quale delle seguenti affermazioni sui processi Linux è falsa?",
+ "answers": [
+ {
+ "answer": "Digitare un comando sulla shell genera sempre un nuovo processo",
+ "image": ""
+ },
+ {
+ "answer": "Esistono file che non possono essere eseguiti per diventare processi",
+ "image": ""
+ },
+ {
+ "answer": "Affinché un file possa diventare un processo è necessario che abbia i permessi di esecuzione",
+ "image": ""
+ },
+ {
+ "answer": "Qualsiasi computazione eseguita dal sistema operativo è contenuta dentro un qualche processo",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "68. Quale delle seguenti affermazioni sui processi Linux è vera?",
+ "answers": [
+ {
+ "answer": "Eseguendo k volte un file eseguibile, si generano k diversi processi",
+ "image": ""
+ },
+ {
+ "answer": "Per poter lanciare un file eseguibile, è prima necessario aspettare che il comando precedente sia terminato",
+ "image": ""
+ },
+ {
+ "answer": "Tutti i processi sono sempre in stato di RUNNING",
+ "image": ""
+ },
+ {
+ "answer": "Un processo è sempre un'istanza di uno script bash",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "69. Un programma scritto in linguaggio C:",
+ "answers": [
+ {
+ "answer": "Rappresenta le stringhe ESCLUSIVAMENTE come array di caratteri terminate dal carattere ‘\\n’",
+ "image": ""
+ },
+ {
+ "answer": "Rappresenta le stringhe ESCLUSIVAMENTE come array di caratteri terminate dal carattere ‘^M’",
+ "image": ""
+ },
+ {
+ "answer": "Rappresenta le stringhe ESCLUSIVAMENTE come array di caratteri terminate dal carattere ‘0’",
+ "image": ""
+ },
+ {
+ "answer": "Rappresenta le stringhe come array di caratteri terminate dal carattere ‘\\0’",
+ "image": ""
+ }
+ ],
+ "correct": 3,
+ "image": ""
+ },
+ {
+ "quest": "70. Quale delle seguenti affermazioni è vera?",
+ "answers": [
+ {
+ "answer": "Linus Torvalds ha riscritto i pacchetti di Unix, creando i pacchetti GNU",
+ "image": ""
+ },
+ {
+ "answer": "Tutte le opzioni sono false",
+ "image": ""
+ },
+ {
+ "answer": "Linus Torvalds ha scritto il primo kernel di Linux all'inizio degli anni '80",
+ "image": ""
+ },
+ {
+ "answer": "Richard Stallman ha descritto per primo la licenza GPL",
+ "image": ""
+ }
+ ],
+ "correct": 3,
+ "image": ""
+ },
+ {
+ "quest": "71. Quali delle seguenti affermazioni è vera?",
+ "answers": [
+ {
+ "answer": "A. Nessuna delle opzioni è vera",
+ "image": ""
+ },
+ {
+ "answer": "È possibile montare un filesystem solo se è dichiarato nel file /etc/fstab",
+ "image": ""
+ },
+ {
+ "answer": "È possibile montare un filesystem solo se è dichiarato nel file /etc/mtab",
+ "image": ""
+ },
+ {
+ "answer": "D. Ad ogni filesystem corrisponde un disco fisico o parte di esso (partizione)",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "72. Si supponga di avere il seguente frammento di codice:\nFILE *stream = fopen(NOMEFILE, \"w\");
\nQuale dei seguenti frammenti di codice ha lo stesso effetto?",
+ "answers": [
+ {
+ "answer": "int fd = open(NOMEFILE, O_WRONLY | O_CREAT, 0666);
",
+ "image": ""
+ },
+ {
+ "answer": "int fd = open(NOMEFILE, O_WRONLY | O_TRUNC);
",
+ "image": ""
+ },
+ {
+ "answer": "int fd = open(NOMEFILE, O_WRONLY);
",
+ "image": ""
+ },
+ {
+ "answer": "int fd = open(NOMEFILE, O_WRONLY | O_CREAT | O_TRUNC, 0666);
",
+ "image": ""
+ }
+ ],
+ "correct": 3,
+ "image": ""
+ },
+ {
+ "quest": "73. 10. (questa domanda ha una crisi d'identità) Quale delle seguenti affermazioni sulle syscall di Linux che riguardano i files è falsa?",
+ "answers": [
+ {
+ "answer": "Chiamando la syscall select, è possibile monitorare un insieme di file descriptor, ed essere notificati non appena ce n'è uno che è diventato disponibile per un'operazione di lettura o scrittura",
+ "image": ""
+ },
+ {
+ "answer": "Per richiedere un lock su un file (o su una porzione di esso), occorre chiamare la syscall ioctl",
+ "image": ""
+ },
+ {
+ "answer": "È possibile usare la syscall select sia in modo bloccante che in modo non bloccante",
+ "image": ""
+ },
+ {
+ "answer": "Le syscall ioctl e fcntl ammettono 2 o 3 argomenti, a seconda dell'operazione",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "74. 11. (☢ UNSAFE, segnalate a @notherealmarco se è corretta o meno 🙏) Quale delle seguenti affermazioni sui segnali Linux è vera?",
+ "answers": [
+ {
+ "answer": "Tutti i segnali, se non opportunamente catturati, provocano la terminazione del processo, con l'eccezione del segnale STOP",
+ "image": ""
+ },
+ {
+ "answer": "Per un processo è sempre possibile ridefinire il comportamento di un qualsiasi segnale",
+ "image": ""
+ },
+ {
+ "answer": "È possibile per un qualunque processo inviare un segnale ad un qualsiasi altro processo dello stesso utente",
+ "image": ""
+ },
+ {
+ "answer": "Nessuna delle altre affermazioni è vera",
+ "image": ""
+ }
+ ],
+ "correct": 3,
+ "image": ""
+ },
+ {
+ "quest": "75. 12. Quale delle seguenti affermazioni sugli errori delle syscall di Linux è vera?",
+ "answers": [
+ {
+ "answer": "Per stampare su stderr la spiegazione di un errore verificatosi in una syscall, il cui nome sia contenuto nella variabile syscall_name (di tipo char *), si può effettuare la seguente chiamata: perror(\"Si è verificato il seguente errore nella chiamata a %s\", syscall_name);",
+ "image": ""
+ },
+ {
+ "answer": "Per stampare su stdout la spiegazione di un errore verificatosi in una syscall si può effettuare la seguente chiamata: printf(\"%s\\n\", strerror(errno));",
+ "image": ""
+ },
+ {
+ "answer": "Per stampare su stdout la spiegazione di un errore verificatosi in una syscall è sufficiente chiamare perror",
+ "image": ""
+ },
+ {
+ "answer": "Per stampare su stdout la spiegazione di un errore verificatosi in una syscall è necessario scrivere uno switch sulla variabile globale errno",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "76. Si supponga di avere il seguente frammento di codice:\nFILE *stream = fopen(\"file_esistente.txt\", \"r\");\nfseek(stream, -100, SEEK_END);\nlong pos = ftell(stream);\nQuale dei seguenti frammenti di codice ha lo stesso effetto?\na.\nint fd = open(\"file_esistente.txt\", O_RDONLY);\nlseek(fd, -100, SEEK_END);\nlong pos = lseek(fd, 0, SEEK_END);\n
\nb.\nint fd = open(\"file_esistente.txt\", O_RDONLY);\nlseek(fd, -100, SEEK_END);\nlong pos = lseek(fd, 0, SEEK_CUR);\n
\nc.\nint fd = open(\"file_esistente.txt\", O_RDONLY);\nlseek(fd, -100, SEEK_END);\nlong pos = lseek(fd, -100, SEEK_END);\n
\nd.\nint fd = open(\"file_esistente.txt\", O_RDONLY);\nlseek(fd, -100, SEEK_END);\nlong pos = ltell(fd);\n
",
+ "answers": [
+ {
+ "answer": "a",
+ "image": ""
+ },
+ {
+ "answer": "b",
+ "image": ""
+ },
+ {
+ "answer": "c",
+ "image": ""
+ },
+ {
+ "answer": "d",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "76. Si consideri la seguente funzione f
\n\nchar *f(char *dest, const char *src, size_t n) {\n size_t i;\n for (i = 0; i < n && src[i] != '\\0'; i++)\n dest[i] = src[i];\nfor ( ; i < n; i++)\ndest[i] = '\\0';\nreturn dest;\n}\n
\nCosa produce come risultato quando eseguita?",
+ "answers": [
+ {
+ "answer": "Genera sempre errore in fase di esecuzione perché non c'è alcun controllo sulla dimensione delle stringhe",
+ "image": ""
+ },
+ {
+ "answer": "Concatena la stringa src a dest e restituisce dest",
+ "image": ""
+ },
+ {
+ "answer": "Copia la stringa src in dest e restituisce dest",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "77. Si consideri il seguente frammento di codice\n\nsigset_t set, oset, pset;\n...\nsigemptyset( &set );\nsigaddset( &set, SIGINT );\nsigaddset( &set, SIGUSR1 );\nsigprocmask( SIG_BLOCK, &set, &oset );\n...\n
",
+ "answers": [
+ {
+ "answer": "Prepara una sezione critica (ovvero dopo la sigprocmask può inizare la sezione critica)",
+ "image": ""
+ },
+ {
+ "answer": "Disabilita tutti i segnali tranne SIGINT e SIGUSR1",
+ "image": ""
+ },
+ {
+ "answer": "Termina una sezione critica precedentemente iniziata",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "78. Sia mylink un hard link al file myfile (ln myfile mylink
).\nQuale di queste afferrmazioni è vera?",
+ "answers": [
+ {
+ "answer": "myfile e mylink hanno dimensione diversa",
+ "image": ""
+ },
+ {
+ "answer": "myfile e mylink hanno lo stesso numero di inode",
+ "image": ""
+ },
+ {
+ "answer": "myfile e mylink hanno un diverso numero di inode",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "79. Supponendo di essere \"loggato\" in una shell come utente1.\nQuali dei seguenti è un path assoluto?",
+ "answers": [
+ {
+ "answer": "dir1/dir11/dir112/filename",
+ "image": ""
+ },
+ {
+ "answer": "~/utente1/dir1/dir11/dir112/filename oppure ~/dir1/dir11/dir112/filename
",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "80. Si supponga che nel sistema esiste un gruppo \"studente\".\nSi supponga di voler creare \"utente1\" e di volerlo aggiungere al gruppo studente.\nQuale dei seguenti comandi è corrretto?",
+ "answers": [
+ {
+ "answer": "adduser utente1; adduser utente1 studente
",
+ "image": ""
+ },
+ {
+ "answer": "adduser utente1 utente1 studente
",
+ "image": ""
+ },
+ {
+ "answer": "adduser utente1 studente
",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "81. Si considerino le seguenti dichiarazioni di variabili:\n\nint vect[10];\nint *ptr = NULL;\n
\nQuale delle seguneti assegnazioni è corretta per far sì che ptr contanga il puntatore al vettore vect?",
+ "answers": [
+ {
+ "answer": "ptr = vect;",
+ "image": ""
+ },
+ {
+ "answer": "ptr = &vect",
+ "image": ""
+ },
+ {
+ "answer": "ptr = vect[1];",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "82. Si supponda di avere 2 file hw1.c e hw2.c contenenti il seguente codice\n\nhw1.c:\n#include \n#include \"hw.2.c\"\nint f(int argc, char *args[]) {\nprintf(\"Hello World!\\n\");\nreturn 256;\n}\n
\n\nhw2.c:\nint f(int argc, char *args[]);\nint main(int argc, char *args[]) {\nreturn f(argc, args);\n}\n
\nQuale dei seguneti comandi di compilazione non genera errore?",
+ "answers": [
+ {
+ "answer": "gcc -Wall hw1.c hw2.c -o hw.out
oppure gcc -Wall hw1.c -o hw.out
",
+ "image": ""
+ },
+ {
+ "answer": "gcc -Wall hw2.c -o hw.out
",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "83. Si consideri il seguente frammento di codice\n\npid_t pID = fork();\nif (pID == 0) {\n Blocco_1\n} else if (pID < 0) {\n Blocco_2\n} else {\n Blocco_3\n}\n
\nQuale blocco di codice (tra Bloccco_1, Blocco_2 e Blocco_3) verrà eseguito nel caso in cui la fork non vada a buon fine?",
+ "answers": [
+ {
+ "answer": "Blocco_1",
+ "image": ""
+ },
+ {
+ "answer": "Blocco_3",
+ "image": ""
+ },
+ {
+ "answer": "Blocco_2",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "84. Si consideri il seguente frammento di codice\n\nfor (i=0;((i\nquando termina il ciclo for?",
+ "answers": [
+ {
+ "answer": "Termina solo se n1 è uguale a n2",
+ "image": ""
+ },
+ {
+ "answer": "Quando si raggiunge il più grande tra n1 e n2",
+ "image": ""
+ },
+ {
+ "answer": "Quando si raggiunge il più piccolo tra n1 e n2",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "85. A seguito di una chiamata a fork(2), quale dei seguenti attributi del processo padre non è ereditato dal processo figlio?",
+ "answers": [
+ {
+ "answer": "groups id",
+ "image": ""
+ },
+ {
+ "answer": "coda dei segnali",
+ "image": ""
+ },
+ {
+ "answer": "descrittori dei file",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "86. Si consideri il seguente frammento di codice\n\nstruct stat *s;\nfd=open(“filename\");\nfchmod(fd,00744);\nfstat(fd,s);\n
\nPer visualizzare su sdtout i permessi di accesso a \"filename\", quale tra le seguenti opzioni è la più appropriata?",
+ "answers": [
+ {
+ "answer": "printf(\"New File mode %x\\n\", s.st_mode);
",
+ "image": ""
+ },
+ {
+ "answer": "printf(\"New File mode %o\\n\", s.st_mode);
",
+ "image": ""
+ },
+ {
+ "answer": "printf(\"New File mode %s\\n\", s.st_mode);
",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "87. Si consideri il seguente frammento di codice\n\nint n=2;\nint r=2 * (n++);\n
\n\nint n=2;\nint r1=2 * (++n);\n
\nQuale valori assumeranno le variabili r e r1 dopo l'esecuzione?",
+ "answers": [
+ {
+ "answer": "r = r1 = 4",
+ "image": ""
+ },
+ {
+ "answer": "r=6 e r1=4",
+ "image": ""
+ },
+ {
+ "answer": "r=4 e r1=6",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "88. Supponiamo di avere la seguenti variabili\nint x=1, y=7;
\nQuale delle seguneti espressioni è falsa?",
+ "answers": [
+ {
+ "answer": "(x & y) == 7
",
+ "image": ""
+ },
+ {
+ "answer": "(x | y) == 7
",
+ "image": ""
+ },
+ {
+ "answer": "(x || y) == (x & y)
",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "89. Per visualizzare l’atime di un file quale dei seguenti comandi è corretto?",
+ "answers": [
+ {
+ "answer": "ls -lc nomefile
",
+ "image": ""
+ },
+ {
+ "answer": "ls -lu nomefile
",
+ "image": ""
+ },
+ {
+ "answer": "ls -la nomefile
",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "90. Quali attributi del processo sono preservati dalla funzione di libreria execve()?",
+ "answers": [
+ {
+ "answer": "Memory locks",
+ "image": ""
+ },
+ {
+ "answer": "Timer",
+ "image": ""
+ },
+ {
+ "answer": "Umask",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "91. I permessi di accesso del file eseguibile /usr/bin/passwd
sono 4755/-rwsr-xr-x
\nCosa significa?",
+ "answers": [
+ {
+ "answer": "Il bit SetUid non è settato",
+ "image": ""
+ },
+ {
+ "answer": "Lo sticky bit è settato",
+ "image": ""
+ },
+ {
+ "answer": "Il bit SetUid è settato",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "92. Si assuma di avere due shell aperte, etichettate come shell_1 e shell_2 e si consideri la seguente sequenza di comandi\n(shell_i:cmd indica che cmd è eseguitto nella shell i, i=1,2).\n\nshell_1: xterm\nshell_2: ps -C xterm\n#restituisce xtermPID\nshell_2: kill -s SIGINT xtermPID\n
\nQuale è il loro effetto?",
+ "answers": [
+ {
+ "answer": "Il processo xterm viene messo nello stato stopped (T)",
+ "image": ""
+ },
+ {
+ "answer": "Il processo xterm viene terminato con segnale SIGINT",
+ "image": ""
+ },
+ {
+ "answer": "Il processo xterm viene messo in background",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "93. Supponiamo di aver dichiarato ed inizializzato le seguenti variabili\nint x = 1, y = 7;
\nQuale delle seguenti espressioni è vera (true)?",
+ "answers": [
+ {
+ "answer": "(x & y) == (x && y)",
+ "image": ""
+ },
+ {
+ "answer": "(x && y) == 7",
+ "image": ""
+ },
+ {
+ "answer": "(x & y) == (x | y)",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "94. Si consideri la seguente funzione fa\n\nchar *f(char *dest, const char *src, size_t n) {\n size_t dest_len = strlen(dest);\n size_t i;\n for (i = 0; i < n && src[i] != '\\0'; i++)\n dest[dest_len + i] = src[i];\n dest[dest_len + i] = '\\0';\nreturn dest;\n}\n
",
+ "answers": [
+ {
+ "answer": "Copia la stringa src in dest e restituisce dest",
+ "image": ""
+ },
+ {
+ "answer": "Concatena la stringa src a dest e restituisce dest",
+ "image": ""
+ },
+ {
+ "answer": "Genera sempre errore in fase di esecuzione perché non c'è alcun controllo sulla dimensione delle stringhe",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "95. Si supponga di avere un file di testo (filein) e di voler copiare in un altro file (fileout) 100 caratteri a partire dal decimo.\nQuale di questi comandi è corretto?",
+ "answers": [
+ {
+ "answer": "cp -n10 -i100 filein fileout
",
+ "image": ""
+ },
+ {
+ "answer": "dd if=filein of=fileout bs=1 skip=10 count=100
",
+ "image": ""
+ },
+ {
+ "answer": "dd if=filein of=fileout bs=100 skip=10 count = 1
",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "96. Sia mylink un soft link al file myfile (ln -s myfile mylink
).\nQuale di queste affermazioni è vera?",
+ "answers": [
+ {
+ "answer": "myfile e mylink hanno un diverso numero di inode",
+ "image": ""
+ },
+ {
+ "answer": "myfile e mylink hanno lo stesso numero di inode",
+ "image": ""
+ },
+ {
+ "answer": "myfile e mylink hanno la stessa dimensione",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "97. Si consideri il codice\n\nstruct stat *s;\nfd = open(\"filename\");\nfstat(fs, s);\n
\nCome faccio a sapere se il file \"filename\" è un link?",
+ "answers": [
+ {
+ "answer": "Se S_ISLINK(s) == 1",
+ "image": ""
+ },
+ {
+ "answer": "Se s.st_size == 0",
+ "image": ""
+ },
+ {
+ "answer": "Se s_st_nlink == 1",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "98. Quale tra i seguenti comandi è il modo più corretto per verificare a quali gruppi appartiene un utente?",
+ "answers": [
+ {
+ "answer": "groups nomeutente
",
+ "image": ""
+ },
+ {
+ "answer": "cat /etc/groups | grep nomeutente
",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "99. Cosa fa sto ciclo?\nfor(scoreCount = 0; scanf(\"%d\", &a) == 1; scoreCount++);
",
+ "answers": [
+ {
+ "answer": "Legge ripetutamente numeri interi da stdin",
+ "image": ""
+ },
+ {
+ "answer": "Legge una sola volta da stdin e poi termina",
+ "image": ""
+ },
+ {
+ "answer": "Legge da stdin senza mai terminare",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "100. Quale delle seguenti funzioni di libreria non alloca nell'heap?",
+ "answers": [
+ {
+ "answer": "calloc",
+ "image": ""
+ },
+ {
+ "answer": "malloc",
+ "image": ""
+ },
+ {
+ "answer": "alloca",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "101. Si consideri il seguente frammento di codice\n\nsigset_t set, oset, pset;\n...\nsigemptyset( &set );\nsigaddset( &set, SIGINT );\nsigaddset( &set, SIGUSR1 );\nsigprocmask( SIG_BLOCK, &set, &oset );\n...\n
",
+ "answers": [
+ {
+ "answer": "Termina una sezione critica precedentemente iniziata",
+ "image": ""
+ },
+ {
+ "answer": "Disabilita tutti i segnali tranne SIGINT e SIGUSR1",
+ "image": ""
+ },
+ {
+ "answer": "Disabilita i segnali SIGINT e SIGUSR1",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "102. Per visualizzare contemporaneamente l'access time e status change time di un file, quale dei seguenti comandi è corretto?",
+ "answers": [
+ {
+ "answer": "stat nomefile",
+ "image": ""
+ },
+ {
+ "answer": "ls -la nomefile",
+ "image": ""
+ },
+ {
+ "answer": "ls -lac nomefile",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "103. Consideri il seguente frammento di codice\nint *ptr = malloc(sizeof(int));\nptr = ptr+1;
\nassumendo la malloc assegni a ptr la locazione di memoria 0x55c2b1268420 cosa contiene ptr dopo l’incremento?",
+ "answers": [
+ {
+ "answer": "0x55c2b1268421
",
+ "image": ""
+ },
+ {
+ "answer": "0x55c2b1268428
",
+ "image": ""
+ },
+ {
+ "answer": "0x55c2b1268424
",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "104. Che cosa si intende per sudoer nel gergo Linux?",
+ "answers": [
+ {
+ "answer": "Un comando per essere aggiunti al gruppo sudo",
+ "image": ""
+ },
+ {
+ "answer": "Un gruppo che permette ai suoi membri di eseguire comandi come super-utente",
+ "image": ""
+ },
+ {
+ "answer": "Un utente che appartiene al gruppo di utenti sudo",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "105. Assumiamo che quando viene creata una directory i suoi permessi di accesso sono 0644.\nQuale sarà la umask?",
+ "answers": [
+ {
+ "answer": "0644",
+ "image": ""
+ },
+ {
+ "answer": "0022",
+ "image": ""
+ },
+ {
+ "answer": "0133",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "106. Se una directory ha i permessi di accesso settati come 0222, quali operazioni è possibile fare su di essa?",
+ "answers": [
+ {
+ "answer": "Nessuna operazione",
+ "image": ""
+ },
+ {
+ "answer": "Operazioni di scrittura ed e possibile visualizzarne il contenuto senza vedere gli attributi dei file",
+ "image": ""
+ },
+ {
+ "answer": "Operazioni di scrittura",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "107. Assumete di voler visualizzare il numero di inode di un file, quale dei seguenti comandi è più corretto usare?",
+ "answers": [
+ {
+ "answer": "ls -l -n nomefile",
+ "image": ""
+ },
+ {
+ "answer": "stat -f nomefile",
+ "image": ""
+ },
+ {
+ "answer": "ls -1 -i nomefile",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "108. Quando si esegue il comando ls -l viene mostrato, come prima informazione, il totale (vedi figura, ma non sul bot :p)\nQuale è il significato di questo campo?",
+ "answers": [
+ {
+ "answer": "Dimensione della directory espressa in numero di blocchi su disco",
+ "image": ""
+ },
+ {
+ "answer": "Dimensione della directory espressa in numero di file contenuti in essa e in tutte le sotto-directory",
+ "image": ""
+ },
+ {
+ "answer": "Numero totale di sotto directory",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "109. Si consideri il seguente frammento di codice:\n\nint num = 5;\nint *numPtr;\nnumPtr = #\n*numPtr = 10;\n
\nDopo la sua esecuzione, quale sara' il valore contenuto il num ?",
+ "answers": [
+ {
+ "answer": "5",
+ "image": ""
+ },
+ {
+ "answer": "10",
+ "image": ""
+ },
+ {
+ "answer": "0x123AF345 (indirizzo di memoria)",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "110. Si consideri il seguente frammento di codice:\n\nint n= 2;\nint r= 2*(n++); // r = 2 * 2, n = 3\nint r1= 2*(++n); // n = 3 + 1, r1 = 2 * 4\n
\nQuale delle seguenti espressioni sarà vera (true) una volta eseguito il codice?",
+ "answers": [
+ {
+ "answer": "r < r1",
+ "image": ""
+ },
+ {
+ "answer": "r > r1",
+ "image": ""
+ },
+ {
+ "answer": "r == r1",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "112. Si consideri il comando\ngcc -c file.c -o file.o
\nQuali delle seguenti affermazioni perché falsa?",
+ "answers": [
+ {
+ "answer": "Il comando produce un file oggetto a partire da un file precompilato",
+ "image": ""
+ },
+ {
+ "answer": "Il comando produce un file oggetto",
+ "image": ""
+ },
+ {
+ "answer": "Il comando produce un file eseguibile",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "113. Cosa produce il seguente comando?\ngcc file.o file2.o file3.o
",
+ "answers": [
+ {
+ "answer": "Un file eseguibile a.out",
+ "image": ""
+ },
+ {
+ "answer": "Nulla, la sintassi è sbagliata",
+ "image": ""
+ },
+ {
+ "answer": "Fa il linking dei file oggetto ma non produce nessun risultato finché non si specifica l'output",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "114. Si consideri il seguente frammento di codice. Cosa fa una volta eseguito?\n\nscanf(\"%d\",&num);\nwhile(num!=0); {\n printf(\"%d\\n\",num);\n scanf(\"%d\",&num);\n}\n
",
+ "answers": [
+ {
+ "answer": "stampa il valore di num almeno una volta",
+ "image": ""
+ },
+ {
+ "answer": "cicla infinitamente se num != 0",
+ "image": ""
+ },
+ {
+ "answer": "stampa il valore di num se num != 0",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "115. Cosa produce il seguente comando come risultato?\ncat /etc/group | grep nomeutente
",
+ "answers": [
+ {
+ "answer": "Visualizza su stdout tutti i gruppi a cui appartiene l'utente \"nomeutente\", incluso il gruppo \"nomeutente\" (se esiste)",
+ "image": ""
+ },
+ {
+ "answer": "Visualizza su stdout la lista dei gruppi a cui appartiene il gruppo \"nomeutente\" (se esiste)",
+ "image": ""
+ },
+ {
+ "answer": "Genera un errore in quanto il file /etc/group non esiste",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "116. Nel caso in cui la system call pid_t waitpid(pid_t pid, int *status, int options);
\nsia invocata con valore di pid uguale a -1. Quale è il suo comportamento?",
+ "answers": [
+ {
+ "answer": "Attende la terminazione di qualunque processo figlio il cui gruppo ID del processo sia diverso da quello del processo chiamante",
+ "image": ""
+ },
+ {
+ "answer": "Attende la terminazione di un qualunque processo figlio",
+ "image": ""
+ },
+ {
+ "answer": "Attende la terminazione di qualunque processo figlio il cui gruppo ID del processo sia uguale a quello del processo chiamante",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "117. Quali dei seguenti comandi permette di creare un intero path di directory?",
+ "answers": [
+ {
+ "answer": "mkdir /dir1/dir2/dir3",
+ "image": ""
+ },
+ {
+ "answer": "mkdir -p /dir1/dir2/dir3",
+ "image": ""
+ },
+ {
+ "answer": "mkdir -m /dir1/dir2/dir3",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "118. Supponiamo di avere un file di nome filename e di creare un link a filename con il comando\nln filename link1
\nquale delle seguenti affermazioni è vera?",
+ "answers": [
+ {
+ "answer": "filename e link1 hanno lo stesso inode",
+ "image": ""
+ },
+ {
+ "answer": "link1 occupa zero blocchi su disco anche se filename ne occupa un numero diverso da 0",
+ "image": ""
+ },
+ {
+ "answer": "filename e link1 hanno inode diverso",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "119. Quali dei seguenti comandi change dir usa un path assoluto? (# indica il prompt di sistema)",
+ "answers": [
+ {
+ "answer": "# cd ../studente/download",
+ "image": ""
+ },
+ {
+ "answer": "# cd Immagini/../Immagini/faces/",
+ "image": ""
+ },
+ {
+ "answer": "# cd ~/Lezione1/esempi/filesystem",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "120. Quali sono i permessi MINIMI che devono essere assegnati ad una directory affinchperché sia possibile:\n- leggere il contenuto della directory inclusi gli attributi dei file;\n- impostare la directory come cwd;\n- attraversare la directory.",
+ "answers": [
+ {
+ "answer": "rwx",
+ "image": ""
+ },
+ {
+ "answer": "r-x",
+ "image": ""
+ },
+ {
+ "answer": "rw-",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "121. Supponiamo di avere il seguente makefile (memorizzato in un file di nome makefile):\n\nmerge_sorted_lists: merge_sorted_lists.c\n gcc -Wall -Wextra -O3 merge_sorted_lists.c \\\n -o merge_sorted_lists\nsort_file_int: sort_file_int.c\n gcc -Wall -Wextra -O3 sort_file_int.c \\\n -o sort_file_int\n.PHONY: clean\nclean:\n rm -f *.o merge_sorted_lists\n
\nIn quali condizioni viene eseguito il target sort_file_int? ",
+ "answers": [
+ {
+ "answer": "Sempre, se invochiamo il comando make sort_file_int
",
+ "image": ""
+ },
+ {
+ "answer": "Se invochiamo il comando make sort_file_int
. e se sort_file_int.c perché stato modificato dopo la data di creazione di sort_file_int.o",
+ "image": ""
+ },
+ {
+ "answer": "Il target sort_file_int non verrà mai eseguito",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "122. SI consideri il seguente frammento di codice:\n\nint x, y, nread;\nfloat xx, yy;\nnread=scanf(\"%d %d\",&x, &y);\nprintf(\"x=%d, y=%d, nread=%d \\n\",x,y,nread);\nprintf(\"xx=%f, yy=%f, nread=%d \\n\",xx,yy,nread);\nnread=scanf(\"%f %f\",&xx, &yy);\n
\nAssumiamo che, in fase di esecuzione, la prima scanf legge su stdin la sequenza\n1 w\nQuale sara' il valore di nread dopo l'esecuzione della seconda scanf?",
+ "answers": [
+ {
+ "answer": "0",
+ "image": ""
+ },
+ {
+ "answer": "2",
+ "image": ""
+ },
+ {
+ "answer": "dipende dall'input letto su stdin dalla seconda scanf",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "123. Si consideri il seguente frammento di codice\n\n 1: #include \n 2: ....\n 3: \n 4: char str [80];\n 5: float f;\n 6: FILE * pFile;\n 7:\n 8: pFile = fopen (\"myfile.txt\",\"w+\");\n 9: fprintf (pFile, \"%f %s\\n\", 3.1416, \"PI\");\n 10: close(pFile);\n 11: rewind (pFile);\n 12: fscanf (pFile, \"%f\", &f);\n 13: fscanf (pFile, \"%s\", str);\n
\nLe chiamate di funzione a riga 10, 11, 12 e 13 vengono eseguite tutte?",
+ "answers": [
+ {
+ "answer": "Sì",
+ "image": ""
+ },
+ {
+ "answer": "Viene eseguita solo riga 10 poi genera errore ed il programma termina",
+ "image": ""
+ },
+ {
+ "answer": "No, nessuna",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "124. Cosa fa il seguente segmento di codice?\n\nscanf(“%d”,&num); \ndo {\nprintf(“%d\\n”,num); \nscanf(“%d”,&num);\n} while(num!=0);\n
",
+ "answers": [
+ {
+ "answer": "stampa il valore di num se num è diverso da 0",
+ "image": ""
+ },
+ {
+ "answer": "Il ciclo do-while entra in un loop infinito",
+ "image": ""
+ },
+ {
+ "answer": "stampa il valore di num almeno una volta",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "125. Supponiamo di aver inizializzato un puntatore ad una variabile intera in questo modo\n\nint num=5, *ptrnum;\nptrnum=#\n
",
+ "answers": [
+ {
+ "answer": "ptrnum = (int *) 10;",
+ "image": ""
+ },
+ {
+ "answer": "ptrnum = 10;",
+ "image": ""
+ },
+ {
+ "answer": "*ptrnum = 10;",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "126. Quale dei seguenti dichiarazioni di variabile perché non valida, generando quindi un errore di compilazione?",
+ "answers": [
+ {
+ "answer": "int goto=1;",
+ "image": ""
+ },
+ {
+ "answer": "int goTo=1;",
+ "image": ""
+ },
+ {
+ "answer": "int go_to=1;",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "127. Si consideri il seguente frammento di codice\n\nint scoreCount, a; \nfor(scoreCount=0; scanf(\"%d\",&a)==1; scoreCount++);\n
\nSe la sequenza letta in input dall scanf è\n\n1 3 7 2 12 w\n
\nQuale valore assumerà scoreCount al termine del ciclo?",
+ "answers": [
+ {
+ "answer": "Il ciclo non termina. La scanf va in errore quando viene letta la w",
+ "image": ""
+ },
+ {
+ "answer": "5",
+ "image": ""
+ },
+ {
+ "answer": "6",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "128. Si consideri il frammento di codice\n\n int K=10, c=0, p=1;\n while (++K > 10)\n c=c+1;\n p--;\n
\nche valore conterrà la variabile K al termine dell'esecuzione del frammento di codice?",
+ "answers": [
+ {
+ "answer": "11",
+ "image": ""
+ },
+ {
+ "answer": "L'esecuziuone del frammento di codice non termina perché Il ciclo entra in un loop infinito",
+ "image": ""
+ },
+ {
+ "answer": "10",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "129. In quale situazione le system call dup(2) e dup2(2) hanno lo stesso comportamento?",
+ "answers": [
+ {
+ "answer": "Nel caso in cui gli passiamo gli stessi parametri",
+ "image": ""
+ },
+ {
+ "answer": "Nel casa in cui invochiamo la dup2(2) settando a NULL il valore del nuovo file descriptor",
+ "image": ""
+ },
+ {
+ "answer": "Nel caso in cui la dup2(2) venga invocata specificando che il nuovo file descriptor deve essere il file descriptor disponibile con il numero più piccolo",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "130. Quali dei seguenti attributi di un processo non perché preservato a seguito di una chiamata alla funzione di libreria execve()?",
+ "answers": [
+ {
+ "answer": "Groups id",
+ "image": ""
+ },
+ {
+ "answer": "Memory mapping",
+ "image": ""
+ },
+ {
+ "answer": "File locks",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "131. Quale attributi di un processo non sono ereditati dal processo figlio?",
+ "answers": [
+ {
+ "answer": "Descrittori dei file; terminale di controllo; memoria condivisa",
+ "image": ""
+ },
+ {
+ "answer": "I timer, i record lock e i memory lock; i contatori delle risorse ",
+ "image": ""
+ },
+ {
+ "answer": "Real ed effective user e group ID; working directory; ambiente del processo",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "132. Si consideri il seguente frammento di codice\n\nchar* file = argv[1];\n int fd;\n struct flock lock;\n fd = open (file, O_WRONLY);\n memset (&lock, 0, sizeof(lock));\n lock.l_type = F_WRLCK; \n fcntl (fd, F_GETLK, &lock);\n
\nQuale è il comportamento della system call fcntl?",
+ "answers": [
+ {
+ "answer": "Verifica se sul file file perché gia' presente un lock descritto dalla struttura lock. Nel caso in cui nessun processo detiene un lock su file piazza il lock",
+ "image": ""
+ },
+ {
+ "answer": "Verifica se sul file file perché gia' presente un lock descritto dalla struttura lock. Nel caso in cui nessun processo detiene un lock su file restituisce F_UNLOCK nel campo l_type di lock",
+ "image": ""
+ },
+ {
+ "answer": "Verifica se sul file file perché gia' presente un lock descritto dalla struttura lock. In caso affermativo il lock viene rimosso ed il lock richiesto dal processo in esecuzione viene piazzato",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "133. Un processo puo' allocare memoria solo nell'heap?",
+ "answers": [
+ {
+ "answer": "Sì, mediante la funziona di libreria malloc(3) e calloc(3)",
+ "image": ""
+ },
+ {
+ "answer": "Sì, mediante le funzioni di libreria malloc(3), calloc(3) e alloca(3)",
+ "image": ""
+ },
+ {
+ "answer": "No. Può allocare anche memoria nello stack mediante la funzione di libreria alloca(3)",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "134. Supponiamo di aver utilizzato, nella nostra funzione C, la funzione di libreria alloca(3) per allocare un'area di memoria.\nÈ necessario liberare tale area di memoria mediante una free(3) prima della terminazione della funzione?",
+ "answers": [
+ {
+ "answer": "No. l'area di memoria allocata nello stack viene liberata automaticamente",
+ "image": ""
+ },
+ {
+ "answer": "Sì, ma mediante la chiamata di funzione dealloca(3) e non mediante la free(3) ",
+ "image": ""
+ },
+ {
+ "answer": "Sì, bisogna sempre liberare la memoria per evitare dei memory leak",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "135. Si consideri la variabile globale errno.\nSe una system call termina con successo, e immediatamente dopo la sua terminazione ispezioniamo il contenuto di errno, cosa otteniamo?",
+ "answers": [
+ {
+ "answer": "Il valore zero essendo la system call terminata con successo",
+ "image": ""
+ },
+ {
+ "answer": "Il codice di terminazione (con successo) in quanto non c'è una effettiva differenza tra codice di errore o di terminazione con successo",
+ "image": ""
+ },
+ {
+ "answer": "Il codice di errore generato dall'ultima system call o funzione di libreria la cui esecuzione è terminata con errore",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "136. Si consideri la system call\n\nint open(const char *pathname, int flags);\n
\nnel caso venga invocata con il flag impostato a\n\nO_CREAT | O_EXCL | O_WRONLY\n
\nQuale è il comportamento atteso?",
+ "answers": [
+ {
+ "answer": "Se il file non esiste viene creato ed aperto in scrittura, se invece esiste ritorna errore",
+ "image": ""
+ },
+ {
+ "answer": "Se il file non esiste viene creato con i permessi di esecuzione (x) ed aperto in scrittura. Se esiste vengono aggiunti i permessi di esecuzione se già non settati ed il file è aperto in scrittura",
+ "image": ""
+ },
+ {
+ "answer": "Se il file non esiste lo crea e lo apre in scrittura, altrimenti lo apre in lettura",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "137. Assumete di voler visualizzare il numero di inode di un file, quale dei seguenti comandi non produce l'output desiderato?",
+ "answers": [
+ {
+ "answer": "stat -f nomefile",
+ "image": ""
+ },
+ {
+ "answer": "ls -l -i nomefile",
+ "image": ""
+ },
+ {
+ "answer": "stat nomefile",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "138. Supponiamo di avere un file nomefile memorizzato nel nostro filesystem.\nQuale perché il risultato del comando touch nomefile?",
+ "answers": [
+ {
+ "answer": "Aggiorna, al tempo corrente, gli atttributi atime e mtime di nomefile ",
+ "image": ""
+ },
+ {
+ "answer": "Crea un file vuoto con nome nomefile in sostituzione dell'esistente",
+ "image": ""
+ },
+ {
+ "answer": "Crea un file vuoto con nome nomefile in sostituzione dell'esistente e valore del ctime aggiornato al tempo corrente",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "139. Si consideri un file contenente un programma in linguaggio C. Si assuma che è stata inserita la direttiva #include \"stdio.h\" . perché la compilazione potrebbe generare errori?",
+ "answers": [
+ {
+ "answer": "Perché la direttiva dice di cercare il file stdio.h nella directory corrente, mentre tale header file è solitamente memorizzato in un altra directory del filesystem",
+ "image": ""
+ },
+ {
+ "answer": "perché il file stdio.h potrebbe non esistere nella directory /usr/include, dove la direttiva dice di cercarlo",
+ "image": ""
+ },
+ {
+ "answer": "L'inserimento della direttiva non genererà mai errori",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "140. Dopo aver esegguito il comando\ncpp helloworld.c > hw\n
\ncosa conterrà il file hw?",
+ "answers": [
+ {
+ "answer": "Un file identico a helloworld.c",
+ "image": ""
+ },
+ {
+ "answer": "L'input per il debugger relativo al file helloworld.c",
+ "image": ""
+ },
+ {
+ "answer": "Il precompilato di helloworld.c",
+ "image": ""
+ }
+ ],
+ "correct": 2,
+ "image": ""
+ },
+ {
+ "quest": "141. Quale perché il modo corretto per controllare che due stringhe str1 e str2 sono uguali?",
+ "answers": [
+ {
+ "answer": "if (s1==s2) { printf(\"stringhe uguali\") }
",
+ "image": ""
+ },
+ {
+ "answer": "if strcmp(s1,s2) == 0 { printf(\"stringhe uguali\") }
",
+ "image": ""
+ },
+ {
+ "answer": "if strcmp(s1,s2) { printf(\"stringhe uguali\") }
",
+ "image": ""
+ }
+ ],
+ "correct": 1,
+ "image": ""
+ },
+ {
+ "quest": "142. Si consideri il seguente frammento di codice\n\nint i, n1=10, n2=100;\t\nfor (i=0;((i\nquando termina il ciclo for?",
+ "answers": [
+ {
+ "answer": "Quando il valore di i è uguale a n1",
+ "image": ""
+ },
+ {
+ "answer": "Quando il valore di i è uguale a n2",
+ "image": ""
+ },
+ {
+ "answer": "Non termina perché n1 è diverso da n2",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "143. Supponiamo di eseguire separatamente i seguenti frammenti di codice\nFrammento_1\nclose(2);\nif (fopen(\".\",\"r\")) {\n perror(\"main\");\n}
\nFrammento_2\nclose(2);\nif (fopen(\".\",\"r\")) {\n printf(\"main: %s \\n\", strerror(errno));\n}
\nQuale delle seguenti affermazioni è vera?",
+ "answers": [
+ {
+ "answer": "Il frammento_1 non produce alcun output sul terminale",
+ "image": ""
+ },
+ {
+ "answer": "La loro esecuzione produce sul terminale due stringhe identiche",
+ "image": ""
+ },
+ {
+ "answer": "La loro esecuzione produce sul terminale due stringhe diverse",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ },
+ {
+ "quest": "51. Si consideri il seguente frammento di codice (i numeri a lato sono i numeri di riga delle istruzioni)(uscita 2 volte)\n1. Pthread_t tid;\n2. pthread_create(&tid, ... )\n3. pthread_create(&tid, ...)\n4. pthread_join(tid, ...);\n5. printf(\"joined\");
\nquale delle seguenti affermazioni è vera?",
+ "answers": [
+ {
+ "answer": "la stringa \"joined\" è inviata su stdout solo quando il thread creato a riga 3 è terminato",
+ "image": ""
+ },
+ {
+ "answer": "la stringa \"joined\" è inviata su stdout quando entrambi i thread sono terminati",
+ "image": ""
+ },
+ {
+ "answer": "la stringa \"joined\" è inviata su stdout quando uno dei due thread (non importa quale) è terminato",
+ "image": ""
+ }
+ ],
+ "correct": 0,
+ "image": ""
+ }
+]
\ No newline at end of file
diff --git a/Bot/AccessControl/AccessManager.cs b/legacy/Bot/AccessControl/AccessManager.cs
similarity index 100%
rename from Bot/AccessControl/AccessManager.cs
rename to legacy/Bot/AccessControl/AccessManager.cs
diff --git a/Bot/ModuleLoader/IModule.cs b/legacy/Bot/ModuleLoader/IModule.cs
similarity index 100%
rename from Bot/ModuleLoader/IModule.cs
rename to legacy/Bot/ModuleLoader/IModule.cs
diff --git a/Bot/ModuleLoader/ModuleLoader.cs b/legacy/Bot/ModuleLoader/ModuleLoader.cs
similarity index 100%
rename from Bot/ModuleLoader/ModuleLoader.cs
rename to legacy/Bot/ModuleLoader/ModuleLoader.cs
diff --git a/Bot/Modules/OttoLinux/BotGame.cs b/legacy/Bot/Modules/OttoLinux/BotGame.cs
similarity index 100%
rename from Bot/Modules/OttoLinux/BotGame.cs
rename to legacy/Bot/Modules/OttoLinux/BotGame.cs
diff --git a/Bot/Modules/OttoLinux/OttoReverse.cs b/legacy/Bot/Modules/OttoLinux/OttoReverse.cs
similarity index 100%
rename from Bot/Modules/OttoLinux/OttoReverse.cs
rename to legacy/Bot/Modules/OttoLinux/OttoReverse.cs
diff --git a/Bot/Modules/OttoLinux/OttoScore.cs b/legacy/Bot/Modules/OttoLinux/OttoScore.cs
similarity index 100%
rename from Bot/Modules/OttoLinux/OttoScore.cs
rename to legacy/Bot/Modules/OttoLinux/OttoScore.cs
diff --git a/Bot/Modules/OttoLinux/PhotoServer.cs b/legacy/Bot/Modules/OttoLinux/PhotoServer.cs
similarity index 100%
rename from Bot/Modules/OttoLinux/PhotoServer.cs
rename to legacy/Bot/Modules/OttoLinux/PhotoServer.cs
diff --git a/Bot/Modules/OttoLinux/Question.cs b/legacy/Bot/Modules/OttoLinux/Question.cs
similarity index 100%
rename from Bot/Modules/OttoLinux/Question.cs
rename to legacy/Bot/Modules/OttoLinux/Question.cs
diff --git a/Bot/Modules/OttoLinux/WebReverse.cs b/legacy/Bot/Modules/OttoLinux/WebReverse.cs
similarity index 100%
rename from Bot/Modules/OttoLinux/WebReverse.cs
rename to legacy/Bot/Modules/OttoLinux/WebReverse.cs
diff --git a/Bot/Program.cs b/legacy/Bot/Program.cs
similarity index 100%
rename from Bot/Program.cs
rename to legacy/Bot/Program.cs
diff --git a/Bot/SoUnBot.csproj b/legacy/Bot/SoUnBot.csproj
similarity index 100%
rename from Bot/SoUnBot.csproj
rename to legacy/Bot/SoUnBot.csproj
diff --git a/Bot/Telegram/TelegramBot.cs b/legacy/Bot/Telegram/TelegramBot.cs
similarity index 100%
rename from Bot/Telegram/TelegramBot.cs
rename to legacy/Bot/Telegram/TelegramBot.cs
diff --git a/legacy/Bot/bin/Debug/net8.0/JetBrains.Annotations.dll b/legacy/Bot/bin/Debug/net8.0/JetBrains.Annotations.dll
new file mode 100755
index 0000000..6361fca
Binary files /dev/null and b/legacy/Bot/bin/Debug/net8.0/JetBrains.Annotations.dll differ
diff --git a/legacy/Bot/bin/Debug/net8.0/Newtonsoft.Json.dll b/legacy/Bot/bin/Debug/net8.0/Newtonsoft.Json.dll
new file mode 100755
index 0000000..1ffeabe
Binary files /dev/null and b/legacy/Bot/bin/Debug/net8.0/Newtonsoft.Json.dll differ
diff --git a/legacy/Bot/bin/Debug/net8.0/SoUnBot b/legacy/Bot/bin/Debug/net8.0/SoUnBot
new file mode 100755
index 0000000..7a3aa7b
Binary files /dev/null and b/legacy/Bot/bin/Debug/net8.0/SoUnBot differ
diff --git a/legacy/Bot/bin/Debug/net8.0/SoUnBot.deps.json b/legacy/Bot/bin/Debug/net8.0/SoUnBot.deps.json
new file mode 100644
index 0000000..7582c96
--- /dev/null
+++ b/legacy/Bot/bin/Debug/net8.0/SoUnBot.deps.json
@@ -0,0 +1,104 @@
+{
+ "runtimeTarget": {
+ "name": ".NETCoreApp,Version=v8.0",
+ "signature": ""
+ },
+ "compilationOptions": {},
+ "targets": {
+ ".NETCoreApp,Version=v8.0": {
+ "SoUnBot/1.0.0": {
+ "dependencies": {
+ "Newtonsoft.Json": "13.0.1",
+ "Telegram.Bot": "17.0.0",
+ "Telegram.Bot.Extensions.Polling": "1.0.0"
+ },
+ "runtime": {
+ "SoUnBot.dll": {}
+ }
+ },
+ "JetBrains.Annotations/2021.3.0": {
+ "runtime": {
+ "lib/netstandard2.0/JetBrains.Annotations.dll": {
+ "assemblyVersion": "2021.3.0.0",
+ "fileVersion": "2021.3.0.0"
+ }
+ }
+ },
+ "Newtonsoft.Json/13.0.1": {
+ "runtime": {
+ "lib/netstandard2.0/Newtonsoft.Json.dll": {
+ "assemblyVersion": "13.0.0.0",
+ "fileVersion": "13.0.1.25517"
+ }
+ }
+ },
+ "System.Threading.Channels/6.0.0": {},
+ "Telegram.Bot/17.0.0": {
+ "dependencies": {
+ "Newtonsoft.Json": "13.0.1"
+ },
+ "runtime": {
+ "lib/netcoreapp3.1/Telegram.Bot.dll": {
+ "assemblyVersion": "17.0.0.0",
+ "fileVersion": "17.0.0.0"
+ }
+ }
+ },
+ "Telegram.Bot.Extensions.Polling/1.0.0": {
+ "dependencies": {
+ "JetBrains.Annotations": "2021.3.0",
+ "System.Threading.Channels": "6.0.0",
+ "Telegram.Bot": "17.0.0"
+ },
+ "runtime": {
+ "lib/netcoreapp3.1/Telegram.Bot.Extensions.Polling.dll": {
+ "assemblyVersion": "1.0.0.0",
+ "fileVersion": "1.0.0.0"
+ }
+ }
+ }
+ }
+ },
+ "libraries": {
+ "SoUnBot/1.0.0": {
+ "type": "project",
+ "serviceable": false,
+ "sha512": ""
+ },
+ "JetBrains.Annotations/2021.3.0": {
+ "type": "package",
+ "serviceable": true,
+ "sha512": "sha512-Ddxjs5RRjf+c8m9m++WvhW1lz1bqNhsTjWvCLbQN9bvKbkJeR9MhtfNwKgBRRdG2yLHcXFr5Lf7fsvvkiPaDRg==",
+ "path": "jetbrains.annotations/2021.3.0",
+ "hashPath": "jetbrains.annotations.2021.3.0.nupkg.sha512"
+ },
+ "Newtonsoft.Json/13.0.1": {
+ "type": "package",
+ "serviceable": true,
+ "sha512": "sha512-ppPFpBcvxdsfUonNcvITKqLl3bqxWbDCZIzDWHzjpdAHRFfZe0Dw9HmA0+za13IdyrgJwpkDTDA9fHaxOrt20A==",
+ "path": "newtonsoft.json/13.0.1",
+ "hashPath": "newtonsoft.json.13.0.1.nupkg.sha512"
+ },
+ "System.Threading.Channels/6.0.0": {
+ "type": "package",
+ "serviceable": true,
+ "sha512": "sha512-TY8/9+tI0mNaUMgntOxxaq2ndTkdXqLSxvPmas7XEqOlv9lQtB7wLjYGd756lOaO7Dvb5r/WXhluM+0Xe87v5Q==",
+ "path": "system.threading.channels/6.0.0",
+ "hashPath": "system.threading.channels.6.0.0.nupkg.sha512"
+ },
+ "Telegram.Bot/17.0.0": {
+ "type": "package",
+ "serviceable": true,
+ "sha512": "sha512-YvQ9lqEt1bTafu6BJPTbYWDHxyHP+TK8PtjTjNV/6VQw3XxVcZnGwYkJ1CdYW3lJHmHjYxzhBlhhOGNtqJ3U7g==",
+ "path": "telegram.bot/17.0.0",
+ "hashPath": "telegram.bot.17.0.0.nupkg.sha512"
+ },
+ "Telegram.Bot.Extensions.Polling/1.0.0": {
+ "type": "package",
+ "serviceable": true,
+ "sha512": "sha512-OsUbHdHIMmldevoRYzArh5uJDVs1fzlpj+T3mddeP/ELhhhHLmcjon0ZEypgf1KFEj6QWbuZHkijauIW1LZlqg==",
+ "path": "telegram.bot.extensions.polling/1.0.0",
+ "hashPath": "telegram.bot.extensions.polling.1.0.0.nupkg.sha512"
+ }
+ }
+}
\ No newline at end of file
diff --git a/legacy/Bot/bin/Debug/net8.0/SoUnBot.dll b/legacy/Bot/bin/Debug/net8.0/SoUnBot.dll
new file mode 100644
index 0000000..0b65b96
Binary files /dev/null and b/legacy/Bot/bin/Debug/net8.0/SoUnBot.dll differ
diff --git a/legacy/Bot/bin/Debug/net8.0/SoUnBot.pdb b/legacy/Bot/bin/Debug/net8.0/SoUnBot.pdb
new file mode 100644
index 0000000..8281c26
Binary files /dev/null and b/legacy/Bot/bin/Debug/net8.0/SoUnBot.pdb differ
diff --git a/legacy/Bot/bin/Debug/net8.0/SoUnBot.runtimeconfig.json b/legacy/Bot/bin/Debug/net8.0/SoUnBot.runtimeconfig.json
new file mode 100644
index 0000000..becfaea
--- /dev/null
+++ b/legacy/Bot/bin/Debug/net8.0/SoUnBot.runtimeconfig.json
@@ -0,0 +1,12 @@
+{
+ "runtimeOptions": {
+ "tfm": "net8.0",
+ "framework": {
+ "name": "Microsoft.NETCore.App",
+ "version": "8.0.0"
+ },
+ "configProperties": {
+ "System.Runtime.Serialization.EnableUnsafeBinaryFormatterSerialization": false
+ }
+ }
+}
\ No newline at end of file
diff --git a/legacy/Bot/bin/Debug/net8.0/Telegram.Bot.Extensions.Polling.dll b/legacy/Bot/bin/Debug/net8.0/Telegram.Bot.Extensions.Polling.dll
new file mode 100755
index 0000000..67e11a1
Binary files /dev/null and b/legacy/Bot/bin/Debug/net8.0/Telegram.Bot.Extensions.Polling.dll differ
diff --git a/legacy/Bot/bin/Debug/net8.0/Telegram.Bot.dll b/legacy/Bot/bin/Debug/net8.0/Telegram.Bot.dll
new file mode 100755
index 0000000..3e19fe1
Binary files /dev/null and b/legacy/Bot/bin/Debug/net8.0/Telegram.Bot.dll differ
diff --git a/legacy/Bot/obj/Debug/net8.0/.NETCoreApp,Version=v8.0.AssemblyAttributes.cs b/legacy/Bot/obj/Debug/net8.0/.NETCoreApp,Version=v8.0.AssemblyAttributes.cs
new file mode 100644
index 0000000..2217181
--- /dev/null
+++ b/legacy/Bot/obj/Debug/net8.0/.NETCoreApp,Version=v8.0.AssemblyAttributes.cs
@@ -0,0 +1,4 @@
+//
+using System;
+using System.Reflection;
+[assembly: global::System.Runtime.Versioning.TargetFrameworkAttribute(".NETCoreApp,Version=v8.0", FrameworkDisplayName = ".NET 8.0")]
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.AssemblyInfo.cs b/legacy/Bot/obj/Debug/net8.0/SoUnBot.AssemblyInfo.cs
new file mode 100644
index 0000000..7ef4872
--- /dev/null
+++ b/legacy/Bot/obj/Debug/net8.0/SoUnBot.AssemblyInfo.cs
@@ -0,0 +1,22 @@
+//------------------------------------------------------------------------------
+//
+// This code was generated by a tool.
+//
+// Changes to this file may cause incorrect behavior and will be lost if
+// the code is regenerated.
+//
+//------------------------------------------------------------------------------
+
+using System;
+using System.Reflection;
+
+[assembly: System.Reflection.AssemblyCompanyAttribute("SoUnBot")]
+[assembly: System.Reflection.AssemblyConfigurationAttribute("Debug")]
+[assembly: System.Reflection.AssemblyFileVersionAttribute("1.0.0.0")]
+[assembly: System.Reflection.AssemblyInformationalVersionAttribute("1.0.0+72f6cd30d09e169dfba57519c055fbf65c07a93c")]
+[assembly: System.Reflection.AssemblyProductAttribute("SoUnBot")]
+[assembly: System.Reflection.AssemblyTitleAttribute("SoUnBot")]
+[assembly: System.Reflection.AssemblyVersionAttribute("1.0.0.0")]
+
+// Generato dalla classe WriteCodeFragment di MSBuild.
+
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.AssemblyInfoInputs.cache b/legacy/Bot/obj/Debug/net8.0/SoUnBot.AssemblyInfoInputs.cache
new file mode 100644
index 0000000..2cfa414
--- /dev/null
+++ b/legacy/Bot/obj/Debug/net8.0/SoUnBot.AssemblyInfoInputs.cache
@@ -0,0 +1 @@
+3680e5812d66c6777eb08b0e2862f4230324a1c5273b0801b0700e9dd5595131
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.GeneratedMSBuildEditorConfig.editorconfig b/legacy/Bot/obj/Debug/net8.0/SoUnBot.GeneratedMSBuildEditorConfig.editorconfig
new file mode 100644
index 0000000..fe34a67
--- /dev/null
+++ b/legacy/Bot/obj/Debug/net8.0/SoUnBot.GeneratedMSBuildEditorConfig.editorconfig
@@ -0,0 +1,13 @@
+is_global = true
+build_property.TargetFramework = net8.0
+build_property.TargetPlatformMinVersion =
+build_property.UsingMicrosoftNETSdkWeb =
+build_property.ProjectTypeGuids =
+build_property.InvariantGlobalization =
+build_property.PlatformNeutralAssembly =
+build_property.EnforceExtendedAnalyzerRules =
+build_property._SupportedPlatformList = Linux,macOS,Windows
+build_property.RootNamespace = SoUnBot
+build_property.ProjectDir = /home/marco/RiderProjects/so-un-bot/Bot/
+build_property.EnableComHosting =
+build_property.EnableGeneratedComInterfaceComImportInterop =
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.GlobalUsings.g.cs b/legacy/Bot/obj/Debug/net8.0/SoUnBot.GlobalUsings.g.cs
new file mode 100644
index 0000000..8578f3d
--- /dev/null
+++ b/legacy/Bot/obj/Debug/net8.0/SoUnBot.GlobalUsings.g.cs
@@ -0,0 +1,8 @@
+//
+global using global::System;
+global using global::System.Collections.Generic;
+global using global::System.IO;
+global using global::System.Linq;
+global using global::System.Net.Http;
+global using global::System.Threading;
+global using global::System.Threading.Tasks;
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.assets.cache b/legacy/Bot/obj/Debug/net8.0/SoUnBot.assets.cache
new file mode 100644
index 0000000..b28c592
Binary files /dev/null and b/legacy/Bot/obj/Debug/net8.0/SoUnBot.assets.cache differ
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.AssemblyReference.cache b/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.AssemblyReference.cache
new file mode 100644
index 0000000..72ef4e6
Binary files /dev/null and b/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.AssemblyReference.cache differ
diff --git a/Data/Questions/ingsw/0120_22/wrong1.txt b/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.CopyComplete
similarity index 100%
rename from Data/Questions/ingsw/0120_22/wrong1.txt
rename to legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.CopyComplete
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.CoreCompileInputs.cache b/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.CoreCompileInputs.cache
new file mode 100644
index 0000000..d8d035c
--- /dev/null
+++ b/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.CoreCompileInputs.cache
@@ -0,0 +1 @@
+982238a87ff881b98e1723d06960a74addf8ab5fd20a247d9811e87171da4117
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.FileListAbsolute.txt b/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.FileListAbsolute.txt
new file mode 100644
index 0000000..1c743c7
--- /dev/null
+++ b/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.FileListAbsolute.txt
@@ -0,0 +1,21 @@
+/home/marco/RiderProjects/so-un-bot/Bot/bin/Debug/net8.0/SoUnBot
+/home/marco/RiderProjects/so-un-bot/Bot/bin/Debug/net8.0/SoUnBot.deps.json
+/home/marco/RiderProjects/so-un-bot/Bot/bin/Debug/net8.0/SoUnBot.runtimeconfig.json
+/home/marco/RiderProjects/so-un-bot/Bot/bin/Debug/net8.0/SoUnBot.dll
+/home/marco/RiderProjects/so-un-bot/Bot/bin/Debug/net8.0/SoUnBot.pdb
+/home/marco/RiderProjects/so-un-bot/Bot/bin/Debug/net8.0/JetBrains.Annotations.dll
+/home/marco/RiderProjects/so-un-bot/Bot/bin/Debug/net8.0/Newtonsoft.Json.dll
+/home/marco/RiderProjects/so-un-bot/Bot/bin/Debug/net8.0/Telegram.Bot.dll
+/home/marco/RiderProjects/so-un-bot/Bot/bin/Debug/net8.0/Telegram.Bot.Extensions.Polling.dll
+/home/marco/RiderProjects/so-un-bot/Bot/obj/Debug/net8.0/SoUnBot.csproj.AssemblyReference.cache
+/home/marco/RiderProjects/so-un-bot/Bot/obj/Debug/net8.0/SoUnBot.GeneratedMSBuildEditorConfig.editorconfig
+/home/marco/RiderProjects/so-un-bot/Bot/obj/Debug/net8.0/SoUnBot.AssemblyInfoInputs.cache
+/home/marco/RiderProjects/so-un-bot/Bot/obj/Debug/net8.0/SoUnBot.AssemblyInfo.cs
+/home/marco/RiderProjects/so-un-bot/Bot/obj/Debug/net8.0/SoUnBot.csproj.CoreCompileInputs.cache
+/home/marco/RiderProjects/so-un-bot/Bot/obj/Debug/net8.0/SoUnBot.sourcelink.json
+/home/marco/RiderProjects/so-un-bot/Bot/obj/Debug/net8.0/SoUnBot.csproj.CopyComplete
+/home/marco/RiderProjects/so-un-bot/Bot/obj/Debug/net8.0/SoUnBot.dll
+/home/marco/RiderProjects/so-un-bot/Bot/obj/Debug/net8.0/refint/SoUnBot.dll
+/home/marco/RiderProjects/so-un-bot/Bot/obj/Debug/net8.0/SoUnBot.pdb
+/home/marco/RiderProjects/so-un-bot/Bot/obj/Debug/net8.0/SoUnBot.genruntimeconfig.cache
+/home/marco/RiderProjects/so-un-bot/Bot/obj/Debug/net8.0/ref/SoUnBot.dll
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.dll b/legacy/Bot/obj/Debug/net8.0/SoUnBot.dll
new file mode 100644
index 0000000..0b65b96
Binary files /dev/null and b/legacy/Bot/obj/Debug/net8.0/SoUnBot.dll differ
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.genruntimeconfig.cache b/legacy/Bot/obj/Debug/net8.0/SoUnBot.genruntimeconfig.cache
new file mode 100644
index 0000000..c5c3993
--- /dev/null
+++ b/legacy/Bot/obj/Debug/net8.0/SoUnBot.genruntimeconfig.cache
@@ -0,0 +1 @@
+7855311d295825590d1f2d744602bb1f5d081ad75841f435f06048bdf5846452
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.pdb b/legacy/Bot/obj/Debug/net8.0/SoUnBot.pdb
new file mode 100644
index 0000000..8281c26
Binary files /dev/null and b/legacy/Bot/obj/Debug/net8.0/SoUnBot.pdb differ
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.sourcelink.json b/legacy/Bot/obj/Debug/net8.0/SoUnBot.sourcelink.json
new file mode 100644
index 0000000..75ffa21
--- /dev/null
+++ b/legacy/Bot/obj/Debug/net8.0/SoUnBot.sourcelink.json
@@ -0,0 +1 @@
+{"documents":{"/home/marco/RiderProjects/so-un-bot/*":"https://raw.githubusercontent.com/appinfosapienza/so-un-bot/72f6cd30d09e169dfba57519c055fbf65c07a93c/*"}}
\ No newline at end of file
diff --git a/legacy/Bot/obj/Debug/net8.0/apphost b/legacy/Bot/obj/Debug/net8.0/apphost
new file mode 100755
index 0000000..7a3aa7b
Binary files /dev/null and b/legacy/Bot/obj/Debug/net8.0/apphost differ
diff --git a/legacy/Bot/obj/Debug/net8.0/ref/SoUnBot.dll b/legacy/Bot/obj/Debug/net8.0/ref/SoUnBot.dll
new file mode 100644
index 0000000..e575ec3
Binary files /dev/null and b/legacy/Bot/obj/Debug/net8.0/ref/SoUnBot.dll differ
diff --git a/legacy/Bot/obj/Debug/net8.0/refint/SoUnBot.dll b/legacy/Bot/obj/Debug/net8.0/refint/SoUnBot.dll
new file mode 100644
index 0000000..e575ec3
Binary files /dev/null and b/legacy/Bot/obj/Debug/net8.0/refint/SoUnBot.dll differ
diff --git a/legacy/Bot/obj/SoUnBot.csproj.nuget.dgspec.json b/legacy/Bot/obj/SoUnBot.csproj.nuget.dgspec.json
new file mode 100644
index 0000000..244f051
--- /dev/null
+++ b/legacy/Bot/obj/SoUnBot.csproj.nuget.dgspec.json
@@ -0,0 +1,81 @@
+{
+ "format": 1,
+ "restore": {
+ "/home/marco/RiderProjects/so-un-bot/Bot/SoUnBot.csproj": {}
+ },
+ "projects": {
+ "/home/marco/RiderProjects/so-un-bot/Bot/SoUnBot.csproj": {
+ "version": "1.0.0",
+ "restore": {
+ "projectUniqueName": "/home/marco/RiderProjects/so-un-bot/Bot/SoUnBot.csproj",
+ "projectName": "SoUnBot",
+ "projectPath": "/home/marco/RiderProjects/so-un-bot/Bot/SoUnBot.csproj",
+ "packagesPath": "/home/marco/.nuget/packages/",
+ "outputPath": "/home/marco/RiderProjects/so-un-bot/Bot/obj/",
+ "projectStyle": "PackageReference",
+ "configFilePaths": [
+ "/home/marco/.nuget/NuGet/NuGet.Config"
+ ],
+ "originalTargetFrameworks": [
+ "net8.0"
+ ],
+ "sources": {
+ "https://api.nuget.org/v3/index.json": {}
+ },
+ "frameworks": {
+ "net8.0": {
+ "targetAlias": "net8.0",
+ "projectReferences": {}
+ }
+ },
+ "warningProperties": {
+ "warnAsError": [
+ "NU1605"
+ ]
+ }
+ },
+ "frameworks": {
+ "net8.0": {
+ "targetAlias": "net8.0",
+ "dependencies": {
+ "Newtonsoft.Json": {
+ "target": "Package",
+ "version": "[13.0.1, )"
+ },
+ "Telegram.Bot": {
+ "target": "Package",
+ "version": "[17.0.0, )"
+ },
+ "Telegram.Bot.Extensions.Polling": {
+ "target": "Package",
+ "version": "[1.0.0, )"
+ }
+ },
+ "imports": [
+ "net461",
+ "net462",
+ "net47",
+ "net471",
+ "net472",
+ "net48",
+ "net481"
+ ],
+ "assetTargetFallback": true,
+ "warn": true,
+ "downloadDependencies": [
+ {
+ "name": "Microsoft.AspNetCore.App.Ref",
+ "version": "[8.0.3, 8.0.3]"
+ }
+ ],
+ "frameworkReferences": {
+ "Microsoft.NETCore.App": {
+ "privateAssets": "all"
+ }
+ },
+ "runtimeIdentifierGraphPath": "/usr/share/dotnet/sdk/8.0.103/PortableRuntimeIdentifierGraph.json"
+ }
+ }
+ }
+ }
+}
\ No newline at end of file
diff --git a/legacy/Bot/obj/SoUnBot.csproj.nuget.g.props b/legacy/Bot/obj/SoUnBot.csproj.nuget.g.props
new file mode 100644
index 0000000..311e8bb
--- /dev/null
+++ b/legacy/Bot/obj/SoUnBot.csproj.nuget.g.props
@@ -0,0 +1,15 @@
+
+
+
+ True
+ NuGet
+ $(MSBuildThisFileDirectory)project.assets.json
+ /home/marco/.nuget/packages/
+ /home/marco/.nuget/packages/
+ PackageReference
+ 6.9.1
+
+
+
+
+
\ No newline at end of file
diff --git a/legacy/Bot/obj/SoUnBot.csproj.nuget.g.targets b/legacy/Bot/obj/SoUnBot.csproj.nuget.g.targets
new file mode 100644
index 0000000..3dc06ef
--- /dev/null
+++ b/legacy/Bot/obj/SoUnBot.csproj.nuget.g.targets
@@ -0,0 +1,2 @@
+
+
\ No newline at end of file
diff --git a/legacy/Bot/obj/project.assets.json b/legacy/Bot/obj/project.assets.json
new file mode 100644
index 0000000..c6e325b
--- /dev/null
+++ b/legacy/Bot/obj/project.assets.json
@@ -0,0 +1,280 @@
+{
+ "version": 3,
+ "targets": {
+ "net8.0": {
+ "JetBrains.Annotations/2021.3.0": {
+ "type": "package",
+ "compile": {
+ "lib/netstandard2.0/JetBrains.Annotations.dll": {
+ "related": ".deps.json;.xml"
+ }
+ },
+ "runtime": {
+ "lib/netstandard2.0/JetBrains.Annotations.dll": {
+ "related": ".deps.json;.xml"
+ }
+ }
+ },
+ "Newtonsoft.Json/13.0.1": {
+ "type": "package",
+ "compile": {
+ "lib/netstandard2.0/Newtonsoft.Json.dll": {
+ "related": ".xml"
+ }
+ },
+ "runtime": {
+ "lib/netstandard2.0/Newtonsoft.Json.dll": {
+ "related": ".xml"
+ }
+ }
+ },
+ "System.Threading.Channels/6.0.0": {
+ "type": "package",
+ "compile": {
+ "lib/net6.0/System.Threading.Channels.dll": {
+ "related": ".xml"
+ }
+ },
+ "runtime": {
+ "lib/net6.0/System.Threading.Channels.dll": {
+ "related": ".xml"
+ }
+ },
+ "build": {
+ "buildTransitive/netcoreapp3.1/_._": {}
+ }
+ },
+ "Telegram.Bot/17.0.0": {
+ "type": "package",
+ "dependencies": {
+ "Newtonsoft.Json": "12.0.2"
+ },
+ "compile": {
+ "lib/netcoreapp3.1/Telegram.Bot.dll": {
+ "related": ".pdb;.xml"
+ }
+ },
+ "runtime": {
+ "lib/netcoreapp3.1/Telegram.Bot.dll": {
+ "related": ".pdb;.xml"
+ }
+ }
+ },
+ "Telegram.Bot.Extensions.Polling/1.0.0": {
+ "type": "package",
+ "dependencies": {
+ "JetBrains.Annotations": "2021.3.0",
+ "System.Threading.Channels": "6.0.0",
+ "Telegram.Bot": "17.0.0"
+ },
+ "compile": {
+ "lib/netcoreapp3.1/Telegram.Bot.Extensions.Polling.dll": {
+ "related": ".pdb;.xml"
+ }
+ },
+ "runtime": {
+ "lib/netcoreapp3.1/Telegram.Bot.Extensions.Polling.dll": {
+ "related": ".pdb;.xml"
+ }
+ }
+ }
+ }
+ },
+ "libraries": {
+ "JetBrains.Annotations/2021.3.0": {
+ "sha512": "Ddxjs5RRjf+c8m9m++WvhW1lz1bqNhsTjWvCLbQN9bvKbkJeR9MhtfNwKgBRRdG2yLHcXFr5Lf7fsvvkiPaDRg==",
+ "type": "package",
+ "path": "jetbrains.annotations/2021.3.0",
+ "files": [
+ ".nupkg.metadata",
+ ".signature.p7s",
+ "icon.png",
+ "jetbrains.annotations.2021.3.0.nupkg.sha512",
+ "jetbrains.annotations.nuspec",
+ "lib/net20/JetBrains.Annotations.dll",
+ "lib/net20/JetBrains.Annotations.xml",
+ "lib/netstandard1.0/JetBrains.Annotations.deps.json",
+ "lib/netstandard1.0/JetBrains.Annotations.dll",
+ "lib/netstandard1.0/JetBrains.Annotations.xml",
+ "lib/netstandard2.0/JetBrains.Annotations.deps.json",
+ "lib/netstandard2.0/JetBrains.Annotations.dll",
+ "lib/netstandard2.0/JetBrains.Annotations.xml",
+ "lib/portable40-net40+sl5+win8+wp8+wpa81/JetBrains.Annotations.dll",
+ "lib/portable40-net40+sl5+win8+wp8+wpa81/JetBrains.Annotations.xml"
+ ]
+ },
+ "Newtonsoft.Json/13.0.1": {
+ "sha512": "ppPFpBcvxdsfUonNcvITKqLl3bqxWbDCZIzDWHzjpdAHRFfZe0Dw9HmA0+za13IdyrgJwpkDTDA9fHaxOrt20A==",
+ "type": "package",
+ "path": "newtonsoft.json/13.0.1",
+ "files": [
+ ".nupkg.metadata",
+ ".signature.p7s",
+ "LICENSE.md",
+ "lib/net20/Newtonsoft.Json.dll",
+ "lib/net20/Newtonsoft.Json.xml",
+ "lib/net35/Newtonsoft.Json.dll",
+ "lib/net35/Newtonsoft.Json.xml",
+ "lib/net40/Newtonsoft.Json.dll",
+ "lib/net40/Newtonsoft.Json.xml",
+ "lib/net45/Newtonsoft.Json.dll",
+ "lib/net45/Newtonsoft.Json.xml",
+ "lib/netstandard1.0/Newtonsoft.Json.dll",
+ "lib/netstandard1.0/Newtonsoft.Json.xml",
+ "lib/netstandard1.3/Newtonsoft.Json.dll",
+ "lib/netstandard1.3/Newtonsoft.Json.xml",
+ "lib/netstandard2.0/Newtonsoft.Json.dll",
+ "lib/netstandard2.0/Newtonsoft.Json.xml",
+ "newtonsoft.json.13.0.1.nupkg.sha512",
+ "newtonsoft.json.nuspec",
+ "packageIcon.png"
+ ]
+ },
+ "System.Threading.Channels/6.0.0": {
+ "sha512": "TY8/9+tI0mNaUMgntOxxaq2ndTkdXqLSxvPmas7XEqOlv9lQtB7wLjYGd756lOaO7Dvb5r/WXhluM+0Xe87v5Q==",
+ "type": "package",
+ "path": "system.threading.channels/6.0.0",
+ "files": [
+ ".nupkg.metadata",
+ ".signature.p7s",
+ "Icon.png",
+ "LICENSE.TXT",
+ "THIRD-PARTY-NOTICES.TXT",
+ "buildTransitive/netcoreapp2.0/System.Threading.Channels.targets",
+ "buildTransitive/netcoreapp3.1/_._",
+ "lib/net461/System.Threading.Channels.dll",
+ "lib/net461/System.Threading.Channels.xml",
+ "lib/net6.0/System.Threading.Channels.dll",
+ "lib/net6.0/System.Threading.Channels.xml",
+ "lib/netcoreapp3.1/System.Threading.Channels.dll",
+ "lib/netcoreapp3.1/System.Threading.Channels.xml",
+ "lib/netstandard2.0/System.Threading.Channels.dll",
+ "lib/netstandard2.0/System.Threading.Channels.xml",
+ "lib/netstandard2.1/System.Threading.Channels.dll",
+ "lib/netstandard2.1/System.Threading.Channels.xml",
+ "system.threading.channels.6.0.0.nupkg.sha512",
+ "system.threading.channels.nuspec",
+ "useSharedDesignerContext.txt"
+ ]
+ },
+ "Telegram.Bot/17.0.0": {
+ "sha512": "YvQ9lqEt1bTafu6BJPTbYWDHxyHP+TK8PtjTjNV/6VQw3XxVcZnGwYkJ1CdYW3lJHmHjYxzhBlhhOGNtqJ3U7g==",
+ "type": "package",
+ "path": "telegram.bot/17.0.0",
+ "files": [
+ ".nupkg.metadata",
+ ".signature.p7s",
+ "lib/netcoreapp3.1/Telegram.Bot.dll",
+ "lib/netcoreapp3.1/Telegram.Bot.pdb",
+ "lib/netcoreapp3.1/Telegram.Bot.xml",
+ "lib/netstandard2.0/Telegram.Bot.dll",
+ "lib/netstandard2.0/Telegram.Bot.pdb",
+ "lib/netstandard2.0/Telegram.Bot.xml",
+ "package-icon.png",
+ "telegram.bot.17.0.0.nupkg.sha512",
+ "telegram.bot.nuspec"
+ ]
+ },
+ "Telegram.Bot.Extensions.Polling/1.0.0": {
+ "sha512": "OsUbHdHIMmldevoRYzArh5uJDVs1fzlpj+T3mddeP/ELhhhHLmcjon0ZEypgf1KFEj6QWbuZHkijauIW1LZlqg==",
+ "type": "package",
+ "path": "telegram.bot.extensions.polling/1.0.0",
+ "files": [
+ ".nupkg.metadata",
+ ".signature.p7s",
+ "lib/netcoreapp3.1/Telegram.Bot.Extensions.Polling.dll",
+ "lib/netcoreapp3.1/Telegram.Bot.Extensions.Polling.pdb",
+ "lib/netcoreapp3.1/Telegram.Bot.Extensions.Polling.xml",
+ "lib/netstandard2.0/Telegram.Bot.Extensions.Polling.dll",
+ "lib/netstandard2.0/Telegram.Bot.Extensions.Polling.pdb",
+ "lib/netstandard2.0/Telegram.Bot.Extensions.Polling.xml",
+ "package-icon.png",
+ "telegram.bot.extensions.polling.1.0.0.nupkg.sha512",
+ "telegram.bot.extensions.polling.nuspec"
+ ]
+ }
+ },
+ "projectFileDependencyGroups": {
+ "net8.0": [
+ "Newtonsoft.Json >= 13.0.1",
+ "Telegram.Bot >= 17.0.0",
+ "Telegram.Bot.Extensions.Polling >= 1.0.0"
+ ]
+ },
+ "packageFolders": {
+ "/home/marco/.nuget/packages/": {}
+ },
+ "project": {
+ "version": "1.0.0",
+ "restore": {
+ "projectUniqueName": "/home/marco/RiderProjects/so-un-bot/Bot/SoUnBot.csproj",
+ "projectName": "SoUnBot",
+ "projectPath": "/home/marco/RiderProjects/so-un-bot/Bot/SoUnBot.csproj",
+ "packagesPath": "/home/marco/.nuget/packages/",
+ "outputPath": "/home/marco/RiderProjects/so-un-bot/Bot/obj/",
+ "projectStyle": "PackageReference",
+ "configFilePaths": [
+ "/home/marco/.nuget/NuGet/NuGet.Config"
+ ],
+ "originalTargetFrameworks": [
+ "net8.0"
+ ],
+ "sources": {
+ "https://api.nuget.org/v3/index.json": {}
+ },
+ "frameworks": {
+ "net8.0": {
+ "targetAlias": "net8.0",
+ "projectReferences": {}
+ }
+ },
+ "warningProperties": {
+ "warnAsError": [
+ "NU1605"
+ ]
+ }
+ },
+ "frameworks": {
+ "net8.0": {
+ "targetAlias": "net8.0",
+ "dependencies": {
+ "Newtonsoft.Json": {
+ "target": "Package",
+ "version": "[13.0.1, )"
+ },
+ "Telegram.Bot": {
+ "target": "Package",
+ "version": "[17.0.0, )"
+ },
+ "Telegram.Bot.Extensions.Polling": {
+ "target": "Package",
+ "version": "[1.0.0, )"
+ }
+ },
+ "imports": [
+ "net461",
+ "net462",
+ "net47",
+ "net471",
+ "net472",
+ "net48",
+ "net481"
+ ],
+ "assetTargetFallback": true,
+ "warn": true,
+ "downloadDependencies": [
+ {
+ "name": "Microsoft.AspNetCore.App.Ref",
+ "version": "[8.0.3, 8.0.3]"
+ }
+ ],
+ "frameworkReferences": {
+ "Microsoft.NETCore.App": {
+ "privateAssets": "all"
+ }
+ },
+ "runtimeIdentifierGraphPath": "/usr/share/dotnet/sdk/8.0.103/PortableRuntimeIdentifierGraph.json"
+ }
+ }
+ }
+}
\ No newline at end of file
diff --git a/legacy/Bot/obj/project.nuget.cache b/legacy/Bot/obj/project.nuget.cache
new file mode 100644
index 0000000..5f88de5
--- /dev/null
+++ b/legacy/Bot/obj/project.nuget.cache
@@ -0,0 +1,15 @@
+{
+ "version": 2,
+ "dgSpecHash": "SEGQ12m9AW+QER7Y2rV+jE8A1HXwy7fhpFirLSBhBNS7WqVkdPM2naTyYcFc+MOC1gyeO3WdP0+uVYxDWUvDRA==",
+ "success": true,
+ "projectFilePath": "/home/marco/RiderProjects/so-un-bot/Bot/SoUnBot.csproj",
+ "expectedPackageFiles": [
+ "/home/marco/.nuget/packages/jetbrains.annotations/2021.3.0/jetbrains.annotations.2021.3.0.nupkg.sha512",
+ "/home/marco/.nuget/packages/newtonsoft.json/13.0.1/newtonsoft.json.13.0.1.nupkg.sha512",
+ "/home/marco/.nuget/packages/system.threading.channels/6.0.0/system.threading.channels.6.0.0.nupkg.sha512",
+ "/home/marco/.nuget/packages/telegram.bot/17.0.0/telegram.bot.17.0.0.nupkg.sha512",
+ "/home/marco/.nuget/packages/telegram.bot.extensions.polling/1.0.0/telegram.bot.extensions.polling.1.0.0.nupkg.sha512",
+ "/home/marco/.nuget/packages/microsoft.aspnetcore.app.ref/8.0.3/microsoft.aspnetcore.app.ref.8.0.3.nupkg.sha512"
+ ],
+ "logs": []
+}
\ No newline at end of file
diff --git a/legacy/Bot/obj/project.packagespec.json b/legacy/Bot/obj/project.packagespec.json
new file mode 100644
index 0000000..fe4ca64
--- /dev/null
+++ b/legacy/Bot/obj/project.packagespec.json
@@ -0,0 +1 @@
+"restore":{"projectUniqueName":"/home/marco/RiderProjects/so-un-bot/Bot/SoUnBot.csproj","projectName":"SoUnBot","projectPath":"/home/marco/RiderProjects/so-un-bot/Bot/SoUnBot.csproj","outputPath":"/home/marco/RiderProjects/so-un-bot/Bot/obj/","projectStyle":"PackageReference","originalTargetFrameworks":["net8.0"],"sources":{"https://api.nuget.org/v3/index.json":{}},"frameworks":{"net8.0":{"targetAlias":"net8.0","projectReferences":{}}},"warningProperties":{"warnAsError":["NU1605"]}}"frameworks":{"net8.0":{"targetAlias":"net8.0","dependencies":{"Newtonsoft.Json":{"target":"Package","version":"[13.0.1, )"},"Telegram.Bot":{"target":"Package","version":"[17.0.0, )"},"Telegram.Bot.Extensions.Polling":{"target":"Package","version":"[1.0.0, )"}},"imports":["net461","net462","net47","net471","net472","net48","net481"],"assetTargetFallback":true,"warn":true,"downloadDependencies":[{"name":"Microsoft.AspNetCore.App.Ref","version":"[8.0.3, 8.0.3]"}],"frameworkReferences":{"Microsoft.NETCore.App":{"privateAssets":"all"}},"runtimeIdentifierGraphPath":"/usr/share/dotnet/sdk/8.0.103/PortableRuntimeIdentifierGraph.json"}}
\ No newline at end of file
diff --git a/legacy/Bot/obj/rider.project.model.nuget.info b/legacy/Bot/obj/rider.project.model.nuget.info
new file mode 100644
index 0000000..d8bcafa
--- /dev/null
+++ b/legacy/Bot/obj/rider.project.model.nuget.info
@@ -0,0 +1 @@
+17116412128528733
\ No newline at end of file
diff --git a/legacy/Bot/obj/rider.project.restore.info b/legacy/Bot/obj/rider.project.restore.info
new file mode 100644
index 0000000..d8bcafa
--- /dev/null
+++ b/legacy/Bot/obj/rider.project.restore.info
@@ -0,0 +1 @@
+17116412128528733
\ No newline at end of file
diff --git a/Bot/run.sh b/legacy/Bot/run.sh
similarity index 100%
rename from Bot/run.sh
rename to legacy/Bot/run.sh
diff --git a/Data/Images/25.png b/legacy/Data/Images/25.png
similarity index 100%
rename from Data/Images/25.png
rename to legacy/Data/Images/25.png
diff --git a/Data/Images/26.png b/legacy/Data/Images/26.png
similarity index 100%
rename from Data/Images/26.png
rename to legacy/Data/Images/26.png
diff --git a/Data/Images/27.png b/legacy/Data/Images/27.png
similarity index 100%
rename from Data/Images/27.png
rename to legacy/Data/Images/27.png
diff --git a/Data/Images/35.png b/legacy/Data/Images/35.png
similarity index 100%
rename from Data/Images/35.png
rename to legacy/Data/Images/35.png
diff --git a/Data/Images/36.png b/legacy/Data/Images/36.png
similarity index 100%
rename from Data/Images/36.png
rename to legacy/Data/Images/36.png
diff --git a/Data/Images/37.png b/legacy/Data/Images/37.png
similarity index 100%
rename from Data/Images/37.png
rename to legacy/Data/Images/37.png
diff --git a/Data/Images/38.png b/legacy/Data/Images/38.png
similarity index 100%
rename from Data/Images/38.png
rename to legacy/Data/Images/38.png
diff --git a/Data/Images/39.png b/legacy/Data/Images/39.png
similarity index 100%
rename from Data/Images/39.png
rename to legacy/Data/Images/39.png
diff --git a/Data/Images/40.png b/legacy/Data/Images/40.png
similarity index 100%
rename from Data/Images/40.png
rename to legacy/Data/Images/40.png
diff --git a/Data/Images/56.png b/legacy/Data/Images/56.png
similarity index 100%
rename from Data/Images/56.png
rename to legacy/Data/Images/56.png
diff --git a/Data/Images/57.png b/legacy/Data/Images/57.png
similarity index 100%
rename from Data/Images/57.png
rename to legacy/Data/Images/57.png
diff --git a/Data/Images/58.png b/legacy/Data/Images/58.png
similarity index 100%
rename from Data/Images/58.png
rename to legacy/Data/Images/58.png
diff --git a/Data/Images/59.png b/legacy/Data/Images/59.png
similarity index 100%
rename from Data/Images/59.png
rename to legacy/Data/Images/59.png
diff --git a/Data/Images/60.png b/legacy/Data/Images/60.png
similarity index 100%
rename from Data/Images/60.png
rename to legacy/Data/Images/60.png
diff --git a/Data/Images/61.png b/legacy/Data/Images/61.png
similarity index 100%
rename from Data/Images/61.png
rename to legacy/Data/Images/61.png
diff --git a/Data/Images/62.png b/legacy/Data/Images/62.png
similarity index 100%
rename from Data/Images/62.png
rename to legacy/Data/Images/62.png
diff --git a/Data/Images/FDS/1positive0negative.png b/legacy/Data/Images/FDS/1positive0negative.png
similarity index 100%
rename from Data/Images/FDS/1positive0negative.png
rename to legacy/Data/Images/FDS/1positive0negative.png
diff --git a/Data/Images/FDS/accuracy80.png b/legacy/Data/Images/FDS/accuracy80.png
similarity index 100%
rename from Data/Images/FDS/accuracy80.png
rename to legacy/Data/Images/FDS/accuracy80.png
diff --git a/Data/Images/FDS/matrixwhatcanwesay.png b/legacy/Data/Images/FDS/matrixwhatcanwesay.png
similarity index 100%
rename from Data/Images/FDS/matrixwhatcanwesay.png
rename to legacy/Data/Images/FDS/matrixwhatcanwesay.png
diff --git a/Data/Questions/Domande Sicurezza.old b/legacy/Data/Questions/Domande Sicurezza.old
similarity index 100%
rename from Data/Questions/Domande Sicurezza.old
rename to legacy/Data/Questions/Domande Sicurezza.old
diff --git a/Data/Questions/diritto_unive_inf.txt b/legacy/Data/Questions/diritto_unive_inf.txt
similarity index 100%
rename from Data/Questions/diritto_unive_inf.txt
rename to legacy/Data/Questions/diritto_unive_inf.txt
diff --git a/Data/Questions/ingsw/0000_102/correct.txt b/legacy/Data/Questions/ingsw/0000_102/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_102/correct.txt
rename to legacy/Data/Questions/ingsw/0000_102/correct.txt
diff --git a/Data/Questions/ingsw/0000_102/quest.txt b/legacy/Data/Questions/ingsw/0000_102/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_102/quest.txt
rename to legacy/Data/Questions/ingsw/0000_102/quest.txt
diff --git a/Data/Questions/ingsw/0000_102/wrong1.txt b/legacy/Data/Questions/ingsw/0000_102/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_102/wrong1.txt
rename to legacy/Data/Questions/ingsw/0000_102/wrong1.txt
diff --git a/Data/Questions/ingsw/0000_102/wrong2.txt b/legacy/Data/Questions/ingsw/0000_102/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_102/wrong2.txt
rename to legacy/Data/Questions/ingsw/0000_102/wrong2.txt
diff --git a/Data/Questions/ingsw/0000_2/correct.txt b/legacy/Data/Questions/ingsw/0000_2/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_2/correct.txt
rename to legacy/Data/Questions/ingsw/0000_2/correct.txt
diff --git a/Data/Questions/ingsw/0000_2/quest.txt b/legacy/Data/Questions/ingsw/0000_2/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_2/quest.txt
rename to legacy/Data/Questions/ingsw/0000_2/quest.txt
diff --git a/Data/Questions/ingsw/0000_2/wrong1.txt b/legacy/Data/Questions/ingsw/0000_2/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_2/wrong1.txt
rename to legacy/Data/Questions/ingsw/0000_2/wrong1.txt
diff --git a/Data/Questions/ingsw/0000_2/wrong2.txt b/legacy/Data/Questions/ingsw/0000_2/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_2/wrong2.txt
rename to legacy/Data/Questions/ingsw/0000_2/wrong2.txt
diff --git a/Data/Questions/ingsw/0000_3/correct.txt b/legacy/Data/Questions/ingsw/0000_3/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_3/correct.txt
rename to legacy/Data/Questions/ingsw/0000_3/correct.txt
diff --git a/Data/Questions/ingsw/0000_3/quest.txt b/legacy/Data/Questions/ingsw/0000_3/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_3/quest.txt
rename to legacy/Data/Questions/ingsw/0000_3/quest.txt
diff --git a/Data/Questions/ingsw/0000_3/wrong1.txt b/legacy/Data/Questions/ingsw/0000_3/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_3/wrong1.txt
rename to legacy/Data/Questions/ingsw/0000_3/wrong1.txt
diff --git a/Data/Questions/ingsw/0000_3/wrong2.txt b/legacy/Data/Questions/ingsw/0000_3/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_3/wrong2.txt
rename to legacy/Data/Questions/ingsw/0000_3/wrong2.txt
diff --git a/Data/Questions/ingsw/0000_32/correct.txt b/legacy/Data/Questions/ingsw/0000_32/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_32/correct.txt
rename to legacy/Data/Questions/ingsw/0000_32/correct.txt
diff --git a/Data/Questions/ingsw/0000_32/quest.txt b/legacy/Data/Questions/ingsw/0000_32/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_32/quest.txt
rename to legacy/Data/Questions/ingsw/0000_32/quest.txt
diff --git a/Data/Questions/ingsw/0000_32/wrong1.txt b/legacy/Data/Questions/ingsw/0000_32/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_32/wrong1.txt
rename to legacy/Data/Questions/ingsw/0000_32/wrong1.txt
diff --git a/Data/Questions/ingsw/0000_32/wrong2.txt b/legacy/Data/Questions/ingsw/0000_32/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_32/wrong2.txt
rename to legacy/Data/Questions/ingsw/0000_32/wrong2.txt
diff --git a/Data/Questions/ingsw/0000_4/correct.txt b/legacy/Data/Questions/ingsw/0000_4/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_4/correct.txt
rename to legacy/Data/Questions/ingsw/0000_4/correct.txt
diff --git a/Data/Questions/ingsw/0000_4/quest.txt b/legacy/Data/Questions/ingsw/0000_4/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_4/quest.txt
rename to legacy/Data/Questions/ingsw/0000_4/quest.txt
diff --git a/Data/Questions/ingsw/0000_4/wrong1.txt b/legacy/Data/Questions/ingsw/0000_4/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_4/wrong1.txt
rename to legacy/Data/Questions/ingsw/0000_4/wrong1.txt
diff --git a/Data/Questions/ingsw/0000_4/wrong2.txt b/legacy/Data/Questions/ingsw/0000_4/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_4/wrong2.txt
rename to legacy/Data/Questions/ingsw/0000_4/wrong2.txt
diff --git a/Data/Questions/ingsw/0000_7/correct.txt b/legacy/Data/Questions/ingsw/0000_7/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_7/correct.txt
rename to legacy/Data/Questions/ingsw/0000_7/correct.txt
diff --git a/Data/Questions/ingsw/0000_7/quest.txt b/legacy/Data/Questions/ingsw/0000_7/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_7/quest.txt
rename to legacy/Data/Questions/ingsw/0000_7/quest.txt
diff --git a/Data/Questions/ingsw/0000_7/wrong1.txt b/legacy/Data/Questions/ingsw/0000_7/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_7/wrong1.txt
rename to legacy/Data/Questions/ingsw/0000_7/wrong1.txt
diff --git a/Data/Questions/ingsw/0000_7/wrong2.txt b/legacy/Data/Questions/ingsw/0000_7/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_7/wrong2.txt
rename to legacy/Data/Questions/ingsw/0000_7/wrong2.txt
diff --git a/Data/Questions/ingsw/0000_8/correct.txt b/legacy/Data/Questions/ingsw/0000_8/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_8/correct.txt
rename to legacy/Data/Questions/ingsw/0000_8/correct.txt
diff --git a/Data/Questions/ingsw/0000_8/quest.txt b/legacy/Data/Questions/ingsw/0000_8/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_8/quest.txt
rename to legacy/Data/Questions/ingsw/0000_8/quest.txt
diff --git a/Data/Questions/ingsw/0000_8/wrong1.txt b/legacy/Data/Questions/ingsw/0000_8/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_8/wrong1.txt
rename to legacy/Data/Questions/ingsw/0000_8/wrong1.txt
diff --git a/Data/Questions/ingsw/0000_8/wrong2.txt b/legacy/Data/Questions/ingsw/0000_8/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0000_8/wrong2.txt
rename to legacy/Data/Questions/ingsw/0000_8/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_0/correct.txt b/legacy/Data/Questions/ingsw/0120_0/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_0/correct.txt
rename to legacy/Data/Questions/ingsw/0120_0/correct.txt
diff --git a/Data/Questions/ingsw/0120_0/quest.txt b/legacy/Data/Questions/ingsw/0120_0/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_0/quest.txt
rename to legacy/Data/Questions/ingsw/0120_0/quest.txt
diff --git a/Data/Questions/ingsw/0120_0/wrong1.txt b/legacy/Data/Questions/ingsw/0120_0/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_0/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_0/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_0/wrong2.txt b/legacy/Data/Questions/ingsw/0120_0/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_0/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_0/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_1/correct.txt b/legacy/Data/Questions/ingsw/0120_1/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_1/correct.txt
rename to legacy/Data/Questions/ingsw/0120_1/correct.txt
diff --git a/Data/Questions/ingsw/0120_1/quest.txt b/legacy/Data/Questions/ingsw/0120_1/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_1/quest.txt
rename to legacy/Data/Questions/ingsw/0120_1/quest.txt
diff --git a/Data/Questions/ingsw/0120_1/wrong1.txt b/legacy/Data/Questions/ingsw/0120_1/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_1/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_1/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_1/wrong2.txt b/legacy/Data/Questions/ingsw/0120_1/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_1/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_1/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_10/correct.txt b/legacy/Data/Questions/ingsw/0120_10/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_10/correct.txt
rename to legacy/Data/Questions/ingsw/0120_10/correct.txt
diff --git a/Data/Questions/ingsw/0120_10/quest.txt b/legacy/Data/Questions/ingsw/0120_10/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_10/quest.txt
rename to legacy/Data/Questions/ingsw/0120_10/quest.txt
diff --git a/Data/Questions/ingsw/0120_10/wrong1.txt b/legacy/Data/Questions/ingsw/0120_10/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_10/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_10/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_10/wrong2.txt b/legacy/Data/Questions/ingsw/0120_10/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_10/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_10/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_11/correct.txt b/legacy/Data/Questions/ingsw/0120_11/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_11/correct.txt
rename to legacy/Data/Questions/ingsw/0120_11/correct.txt
diff --git a/Data/Questions/ingsw/0120_11/quest.txt b/legacy/Data/Questions/ingsw/0120_11/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_11/quest.txt
rename to legacy/Data/Questions/ingsw/0120_11/quest.txt
diff --git a/Data/Questions/ingsw/0120_11/wrong1.txt b/legacy/Data/Questions/ingsw/0120_11/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_11/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_11/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_11/wrong2.txt b/legacy/Data/Questions/ingsw/0120_11/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_11/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_11/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_12/correct.txt b/legacy/Data/Questions/ingsw/0120_12/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_12/correct.txt
rename to legacy/Data/Questions/ingsw/0120_12/correct.txt
diff --git a/Data/Questions/ingsw/0120_12/quest.txt b/legacy/Data/Questions/ingsw/0120_12/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_12/quest.txt
rename to legacy/Data/Questions/ingsw/0120_12/quest.txt
diff --git a/Data/Questions/ingsw/0120_12/wrong1.txt b/legacy/Data/Questions/ingsw/0120_12/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_12/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_12/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_12/wrong2.txt b/legacy/Data/Questions/ingsw/0120_12/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_12/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_12/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_13/correct.txt b/legacy/Data/Questions/ingsw/0120_13/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_13/correct.txt
rename to legacy/Data/Questions/ingsw/0120_13/correct.txt
diff --git a/Data/Questions/ingsw/0120_13/quest.txt b/legacy/Data/Questions/ingsw/0120_13/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_13/quest.txt
rename to legacy/Data/Questions/ingsw/0120_13/quest.txt
diff --git a/Data/Questions/ingsw/0120_13/wrong1.txt b/legacy/Data/Questions/ingsw/0120_13/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_13/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_13/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_13/wrong2.txt b/legacy/Data/Questions/ingsw/0120_13/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_13/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_13/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_14/correct.txt b/legacy/Data/Questions/ingsw/0120_14/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_14/correct.txt
rename to legacy/Data/Questions/ingsw/0120_14/correct.txt
diff --git a/Data/Questions/ingsw/0120_14/quest.txt b/legacy/Data/Questions/ingsw/0120_14/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_14/quest.txt
rename to legacy/Data/Questions/ingsw/0120_14/quest.txt
diff --git a/Data/Questions/ingsw/0120_14/wrong1.txt b/legacy/Data/Questions/ingsw/0120_14/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_14/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_14/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_14/wrong2.txt b/legacy/Data/Questions/ingsw/0120_14/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_14/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_14/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_15/correct.txt b/legacy/Data/Questions/ingsw/0120_15/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_15/correct.txt
rename to legacy/Data/Questions/ingsw/0120_15/correct.txt
diff --git a/Data/Questions/ingsw/0120_15/quest.txt b/legacy/Data/Questions/ingsw/0120_15/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_15/quest.txt
rename to legacy/Data/Questions/ingsw/0120_15/quest.txt
diff --git a/Data/Questions/ingsw/0120_15/wrong1.txt b/legacy/Data/Questions/ingsw/0120_15/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_15/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_15/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_15/wrong2.txt b/legacy/Data/Questions/ingsw/0120_15/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_15/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_15/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_16/correct.txt b/legacy/Data/Questions/ingsw/0120_16/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_16/correct.txt
rename to legacy/Data/Questions/ingsw/0120_16/correct.txt
diff --git a/Data/Questions/ingsw/0120_16/quest.txt b/legacy/Data/Questions/ingsw/0120_16/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_16/quest.txt
rename to legacy/Data/Questions/ingsw/0120_16/quest.txt
diff --git a/Data/Questions/ingsw/0120_16/wrong1.txt b/legacy/Data/Questions/ingsw/0120_16/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_16/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_16/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_16/wrong2.txt b/legacy/Data/Questions/ingsw/0120_16/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_16/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_16/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_17/correct.txt b/legacy/Data/Questions/ingsw/0120_17/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_17/correct.txt
rename to legacy/Data/Questions/ingsw/0120_17/correct.txt
diff --git a/Data/Questions/ingsw/0120_17/quest.txt b/legacy/Data/Questions/ingsw/0120_17/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_17/quest.txt
rename to legacy/Data/Questions/ingsw/0120_17/quest.txt
diff --git a/Data/Questions/ingsw/0120_17/wrong1.txt b/legacy/Data/Questions/ingsw/0120_17/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_17/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_17/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_17/wrong2.txt b/legacy/Data/Questions/ingsw/0120_17/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_17/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_17/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_18/correct.txt b/legacy/Data/Questions/ingsw/0120_18/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_18/correct.txt
rename to legacy/Data/Questions/ingsw/0120_18/correct.txt
diff --git a/Data/Questions/ingsw/0120_18/quest.txt b/legacy/Data/Questions/ingsw/0120_18/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_18/quest.txt
rename to legacy/Data/Questions/ingsw/0120_18/quest.txt
diff --git a/Data/Questions/ingsw/0120_18/wrong1.txt b/legacy/Data/Questions/ingsw/0120_18/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_18/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_18/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_18/wrong2.txt b/legacy/Data/Questions/ingsw/0120_18/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_18/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_18/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_19/correct.txt b/legacy/Data/Questions/ingsw/0120_19/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_19/correct.txt
rename to legacy/Data/Questions/ingsw/0120_19/correct.txt
diff --git a/Data/Questions/ingsw/0120_19/quest.txt b/legacy/Data/Questions/ingsw/0120_19/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_19/quest.txt
rename to legacy/Data/Questions/ingsw/0120_19/quest.txt
diff --git a/Data/Questions/ingsw/0120_19/wrong1.txt b/legacy/Data/Questions/ingsw/0120_19/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_19/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_19/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_19/wrong2.txt b/legacy/Data/Questions/ingsw/0120_19/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_19/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_19/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_2/correct.txt b/legacy/Data/Questions/ingsw/0120_2/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_2/correct.txt
rename to legacy/Data/Questions/ingsw/0120_2/correct.txt
diff --git a/Data/Questions/ingsw/0120_2/quest.txt b/legacy/Data/Questions/ingsw/0120_2/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_2/quest.txt
rename to legacy/Data/Questions/ingsw/0120_2/quest.txt
diff --git a/Data/Questions/ingsw/0120_2/wrong1.txt b/legacy/Data/Questions/ingsw/0120_2/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_2/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_2/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_2/wrong2.txt b/legacy/Data/Questions/ingsw/0120_2/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_2/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_2/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_20/correct.txt b/legacy/Data/Questions/ingsw/0120_20/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_20/correct.txt
rename to legacy/Data/Questions/ingsw/0120_20/correct.txt
diff --git a/Data/Questions/ingsw/0120_20/quest.txt b/legacy/Data/Questions/ingsw/0120_20/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_20/quest.txt
rename to legacy/Data/Questions/ingsw/0120_20/quest.txt
diff --git a/Data/Questions/ingsw/0120_20/wrong1.txt b/legacy/Data/Questions/ingsw/0120_20/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_20/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_20/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_20/wrong2.txt b/legacy/Data/Questions/ingsw/0120_20/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_20/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_20/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_21/correct.txt b/legacy/Data/Questions/ingsw/0120_21/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_21/correct.txt
rename to legacy/Data/Questions/ingsw/0120_21/correct.txt
diff --git a/Data/Questions/ingsw/0120_21/quest.txt b/legacy/Data/Questions/ingsw/0120_21/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_21/quest.txt
rename to legacy/Data/Questions/ingsw/0120_21/quest.txt
diff --git a/Data/Questions/ingsw/0120_21/wrong1.txt b/legacy/Data/Questions/ingsw/0120_21/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_21/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_21/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_21/wrong2.txt b/legacy/Data/Questions/ingsw/0120_21/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_21/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_21/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_22/quest.txt b/legacy/Data/Questions/ingsw/0120_22/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_22/quest.txt
rename to legacy/Data/Questions/ingsw/0120_22/quest.txt
diff --git a/Data/Questions/ingsw/0120_25/wrong1.txt b/legacy/Data/Questions/ingsw/0120_22/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_25/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_22/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_22/wrong2.txt b/legacy/Data/Questions/ingsw/0120_22/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_22/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_22/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_22/wrong3.txt b/legacy/Data/Questions/ingsw/0120_22/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_22/wrong3.txt
rename to legacy/Data/Questions/ingsw/0120_22/wrong3.txt
diff --git a/Data/Questions/ingsw/0120_23/correct.txt b/legacy/Data/Questions/ingsw/0120_23/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_23/correct.txt
rename to legacy/Data/Questions/ingsw/0120_23/correct.txt
diff --git a/Data/Questions/ingsw/0120_23/quest.txt b/legacy/Data/Questions/ingsw/0120_23/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_23/quest.txt
rename to legacy/Data/Questions/ingsw/0120_23/quest.txt
diff --git a/Data/Questions/ingsw/0120_23/wrong1.txt b/legacy/Data/Questions/ingsw/0120_23/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_23/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_23/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_23/wrong2.txt b/legacy/Data/Questions/ingsw/0120_23/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_23/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_23/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_24/correct.txt b/legacy/Data/Questions/ingsw/0120_24/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_24/correct.txt
rename to legacy/Data/Questions/ingsw/0120_24/correct.txt
diff --git a/Data/Questions/ingsw/0120_24/quest.txt b/legacy/Data/Questions/ingsw/0120_24/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_24/quest.txt
rename to legacy/Data/Questions/ingsw/0120_24/quest.txt
diff --git a/Data/Questions/ingsw/0120_24/wrong1.txt b/legacy/Data/Questions/ingsw/0120_24/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_24/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_24/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_24/wrong2.txt b/legacy/Data/Questions/ingsw/0120_24/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_24/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_24/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_25/quest.txt b/legacy/Data/Questions/ingsw/0120_25/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_25/quest.txt
rename to legacy/Data/Questions/ingsw/0120_25/quest.txt
diff --git a/Data/Questions/ingsw/0120_39/wrong1.txt b/legacy/Data/Questions/ingsw/0120_25/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_39/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_25/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_25/wrong2.txt b/legacy/Data/Questions/ingsw/0120_25/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_25/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_25/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_25/wrong3.txt b/legacy/Data/Questions/ingsw/0120_25/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_25/wrong3.txt
rename to legacy/Data/Questions/ingsw/0120_25/wrong3.txt
diff --git a/Data/Questions/ingsw/0120_26/correct.txt b/legacy/Data/Questions/ingsw/0120_26/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_26/correct.txt
rename to legacy/Data/Questions/ingsw/0120_26/correct.txt
diff --git a/Data/Questions/ingsw/0120_26/quest.txt b/legacy/Data/Questions/ingsw/0120_26/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_26/quest.txt
rename to legacy/Data/Questions/ingsw/0120_26/quest.txt
diff --git a/Data/Questions/ingsw/0120_26/wrong1.txt b/legacy/Data/Questions/ingsw/0120_26/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_26/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_26/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_26/wrong2.txt b/legacy/Data/Questions/ingsw/0120_26/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_26/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_26/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_27/correct.txt b/legacy/Data/Questions/ingsw/0120_27/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_27/correct.txt
rename to legacy/Data/Questions/ingsw/0120_27/correct.txt
diff --git a/Data/Questions/ingsw/0120_27/quest.txt b/legacy/Data/Questions/ingsw/0120_27/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_27/quest.txt
rename to legacy/Data/Questions/ingsw/0120_27/quest.txt
diff --git a/Data/Questions/ingsw/0120_27/wrong1.txt b/legacy/Data/Questions/ingsw/0120_27/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_27/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_27/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_27/wrong2.txt b/legacy/Data/Questions/ingsw/0120_27/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_27/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_27/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_28/quest.txt b/legacy/Data/Questions/ingsw/0120_28/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_28/quest.txt
rename to legacy/Data/Questions/ingsw/0120_28/quest.txt
diff --git a/Data/Questions/ingsw/0120_28/wrong1.txt b/legacy/Data/Questions/ingsw/0120_28/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_28/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_28/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_28/wrong2.txt b/legacy/Data/Questions/ingsw/0120_28/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_28/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_28/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_28/wrong3.txt b/legacy/Data/Questions/ingsw/0120_28/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_28/wrong3.txt
rename to legacy/Data/Questions/ingsw/0120_28/wrong3.txt
diff --git a/Data/Questions/ingsw/0120_29/correct.txt b/legacy/Data/Questions/ingsw/0120_29/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_29/correct.txt
rename to legacy/Data/Questions/ingsw/0120_29/correct.txt
diff --git a/Data/Questions/ingsw/0120_29/quest.txt b/legacy/Data/Questions/ingsw/0120_29/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_29/quest.txt
rename to legacy/Data/Questions/ingsw/0120_29/quest.txt
diff --git a/Data/Questions/ingsw/0120_29/wrong1.txt b/legacy/Data/Questions/ingsw/0120_29/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_29/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_29/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_29/wrong2.txt b/legacy/Data/Questions/ingsw/0120_29/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_29/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_29/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_3/correct.txt b/legacy/Data/Questions/ingsw/0120_3/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_3/correct.txt
rename to legacy/Data/Questions/ingsw/0120_3/correct.txt
diff --git a/Data/Questions/ingsw/0120_3/quest.txt b/legacy/Data/Questions/ingsw/0120_3/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_3/quest.txt
rename to legacy/Data/Questions/ingsw/0120_3/quest.txt
diff --git a/Data/Questions/ingsw/0120_3/wrong1.txt b/legacy/Data/Questions/ingsw/0120_3/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_3/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_3/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_3/wrong2.txt b/legacy/Data/Questions/ingsw/0120_3/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_3/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_3/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_30/correct.txt b/legacy/Data/Questions/ingsw/0120_30/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_30/correct.txt
rename to legacy/Data/Questions/ingsw/0120_30/correct.txt
diff --git a/Data/Questions/ingsw/0120_30/quest.txt b/legacy/Data/Questions/ingsw/0120_30/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_30/quest.txt
rename to legacy/Data/Questions/ingsw/0120_30/quest.txt
diff --git a/Data/Questions/ingsw/0120_30/wrong1.txt b/legacy/Data/Questions/ingsw/0120_30/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_30/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_30/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_30/wrong2.txt b/legacy/Data/Questions/ingsw/0120_30/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_30/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_30/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_31/correct.txt b/legacy/Data/Questions/ingsw/0120_31/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_31/correct.txt
rename to legacy/Data/Questions/ingsw/0120_31/correct.txt
diff --git a/Data/Questions/ingsw/0120_31/quest.txt b/legacy/Data/Questions/ingsw/0120_31/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_31/quest.txt
rename to legacy/Data/Questions/ingsw/0120_31/quest.txt
diff --git a/Data/Questions/ingsw/0120_31/wrong1.txt b/legacy/Data/Questions/ingsw/0120_31/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_31/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_31/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_31/wrong2.txt b/legacy/Data/Questions/ingsw/0120_31/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_31/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_31/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_32/correct.txt b/legacy/Data/Questions/ingsw/0120_32/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_32/correct.txt
rename to legacy/Data/Questions/ingsw/0120_32/correct.txt
diff --git a/Data/Questions/ingsw/0120_32/quest.txt b/legacy/Data/Questions/ingsw/0120_32/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_32/quest.txt
rename to legacy/Data/Questions/ingsw/0120_32/quest.txt
diff --git a/Data/Questions/ingsw/0120_32/wrong1.txt b/legacy/Data/Questions/ingsw/0120_32/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_32/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_32/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_32/wrong2.txt b/legacy/Data/Questions/ingsw/0120_32/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_32/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_32/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_33/correct.txt b/legacy/Data/Questions/ingsw/0120_33/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_33/correct.txt
rename to legacy/Data/Questions/ingsw/0120_33/correct.txt
diff --git a/Data/Questions/ingsw/0120_33/quest.txt b/legacy/Data/Questions/ingsw/0120_33/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_33/quest.txt
rename to legacy/Data/Questions/ingsw/0120_33/quest.txt
diff --git a/Data/Questions/ingsw/0120_33/wrong1.txt b/legacy/Data/Questions/ingsw/0120_33/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_33/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_33/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_33/wrong2.txt b/legacy/Data/Questions/ingsw/0120_33/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_33/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_33/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_34/quest.txt b/legacy/Data/Questions/ingsw/0120_34/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_34/quest.txt
rename to legacy/Data/Questions/ingsw/0120_34/quest.txt
diff --git a/Data/Questions/ingsw/0120_34/wrong1.txt b/legacy/Data/Questions/ingsw/0120_34/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_34/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_34/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_34/wrong2.txt b/legacy/Data/Questions/ingsw/0120_34/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_34/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_34/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_34/wrong3.txt b/legacy/Data/Questions/ingsw/0120_34/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_34/wrong3.txt
rename to legacy/Data/Questions/ingsw/0120_34/wrong3.txt
diff --git a/Data/Questions/ingsw/0120_35/quest.txt b/legacy/Data/Questions/ingsw/0120_35/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_35/quest.txt
rename to legacy/Data/Questions/ingsw/0120_35/quest.txt
diff --git a/Data/Questions/ingsw/0120_35/wrong1.txt b/legacy/Data/Questions/ingsw/0120_35/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_35/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_35/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_35/wrong2.txt b/legacy/Data/Questions/ingsw/0120_35/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_35/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_35/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_35/wrong3.txt b/legacy/Data/Questions/ingsw/0120_35/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_35/wrong3.txt
rename to legacy/Data/Questions/ingsw/0120_35/wrong3.txt
diff --git a/Data/Questions/ingsw/0120_36/correct.txt b/legacy/Data/Questions/ingsw/0120_36/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_36/correct.txt
rename to legacy/Data/Questions/ingsw/0120_36/correct.txt
diff --git a/Data/Questions/ingsw/0120_36/quest.txt b/legacy/Data/Questions/ingsw/0120_36/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_36/quest.txt
rename to legacy/Data/Questions/ingsw/0120_36/quest.txt
diff --git a/Data/Questions/ingsw/0120_36/wrong1.txt b/legacy/Data/Questions/ingsw/0120_36/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_36/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_36/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_36/wrong2.txt b/legacy/Data/Questions/ingsw/0120_36/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_36/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_36/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_37/correct.txt b/legacy/Data/Questions/ingsw/0120_37/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_37/correct.txt
rename to legacy/Data/Questions/ingsw/0120_37/correct.txt
diff --git a/Data/Questions/ingsw/0120_37/quest.txt b/legacy/Data/Questions/ingsw/0120_37/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_37/quest.txt
rename to legacy/Data/Questions/ingsw/0120_37/quest.txt
diff --git a/Data/Questions/ingsw/0120_37/wrong1.txt b/legacy/Data/Questions/ingsw/0120_37/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_37/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_37/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_37/wrong2.txt b/legacy/Data/Questions/ingsw/0120_37/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_37/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_37/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_38/correct.txt b/legacy/Data/Questions/ingsw/0120_38/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_38/correct.txt
rename to legacy/Data/Questions/ingsw/0120_38/correct.txt
diff --git a/Data/Questions/ingsw/0120_38/quest.txt b/legacy/Data/Questions/ingsw/0120_38/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_38/quest.txt
rename to legacy/Data/Questions/ingsw/0120_38/quest.txt
diff --git a/Data/Questions/ingsw/0120_38/wrong1.txt b/legacy/Data/Questions/ingsw/0120_38/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_38/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_38/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_38/wrong2.txt b/legacy/Data/Questions/ingsw/0120_38/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_38/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_38/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_39/quest.txt b/legacy/Data/Questions/ingsw/0120_39/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_39/quest.txt
rename to legacy/Data/Questions/ingsw/0120_39/quest.txt
diff --git a/Data/Questions/ingsw/0120_45/wrong1.txt b/legacy/Data/Questions/ingsw/0120_39/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_45/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_39/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_39/wrong2.txt b/legacy/Data/Questions/ingsw/0120_39/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_39/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_39/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_39/wrong3.txt b/legacy/Data/Questions/ingsw/0120_39/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_39/wrong3.txt
rename to legacy/Data/Questions/ingsw/0120_39/wrong3.txt
diff --git a/Data/Questions/ingsw/0120_4/correct.txt b/legacy/Data/Questions/ingsw/0120_4/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_4/correct.txt
rename to legacy/Data/Questions/ingsw/0120_4/correct.txt
diff --git a/Data/Questions/ingsw/0120_4/quest.txt b/legacy/Data/Questions/ingsw/0120_4/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_4/quest.txt
rename to legacy/Data/Questions/ingsw/0120_4/quest.txt
diff --git a/Data/Questions/ingsw/0120_4/wrong1.txt b/legacy/Data/Questions/ingsw/0120_4/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_4/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_4/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_4/wrong2.txt b/legacy/Data/Questions/ingsw/0120_4/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_4/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_4/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_40/correct.txt b/legacy/Data/Questions/ingsw/0120_40/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_40/correct.txt
rename to legacy/Data/Questions/ingsw/0120_40/correct.txt
diff --git a/Data/Questions/ingsw/0120_40/quest.txt b/legacy/Data/Questions/ingsw/0120_40/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_40/quest.txt
rename to legacy/Data/Questions/ingsw/0120_40/quest.txt
diff --git a/Data/Questions/ingsw/0120_40/wrong1.txt b/legacy/Data/Questions/ingsw/0120_40/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_40/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_40/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_40/wrong2.txt b/legacy/Data/Questions/ingsw/0120_40/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_40/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_40/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_41/correct.txt b/legacy/Data/Questions/ingsw/0120_41/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_41/correct.txt
rename to legacy/Data/Questions/ingsw/0120_41/correct.txt
diff --git a/Data/Questions/ingsw/0120_41/quest.txt b/legacy/Data/Questions/ingsw/0120_41/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_41/quest.txt
rename to legacy/Data/Questions/ingsw/0120_41/quest.txt
diff --git a/Data/Questions/ingsw/0120_41/wrong1.txt b/legacy/Data/Questions/ingsw/0120_41/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_41/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_41/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_41/wrong2.txt b/legacy/Data/Questions/ingsw/0120_41/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_41/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_41/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_42/correct.txt b/legacy/Data/Questions/ingsw/0120_42/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_42/correct.txt
rename to legacy/Data/Questions/ingsw/0120_42/correct.txt
diff --git a/Data/Questions/ingsw/0120_42/quest.txt b/legacy/Data/Questions/ingsw/0120_42/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_42/quest.txt
rename to legacy/Data/Questions/ingsw/0120_42/quest.txt
diff --git a/Data/Questions/ingsw/0120_42/wrong1.txt b/legacy/Data/Questions/ingsw/0120_42/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_42/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_42/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_42/wrong2.txt b/legacy/Data/Questions/ingsw/0120_42/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_42/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_42/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_43/quest.txt b/legacy/Data/Questions/ingsw/0120_43/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_43/quest.txt
rename to legacy/Data/Questions/ingsw/0120_43/quest.txt
diff --git a/Data/Questions/ingsw/0120_43/wrong1.txt b/legacy/Data/Questions/ingsw/0120_43/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_43/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_43/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_43/wrong2.txt b/legacy/Data/Questions/ingsw/0120_43/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_43/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_43/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_43/wrong3.txt b/legacy/Data/Questions/ingsw/0120_43/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_43/wrong3.txt
rename to legacy/Data/Questions/ingsw/0120_43/wrong3.txt
diff --git a/Data/Questions/ingsw/0120_44/correct.txt b/legacy/Data/Questions/ingsw/0120_44/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_44/correct.txt
rename to legacy/Data/Questions/ingsw/0120_44/correct.txt
diff --git a/Data/Questions/ingsw/0120_44/quest.txt b/legacy/Data/Questions/ingsw/0120_44/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_44/quest.txt
rename to legacy/Data/Questions/ingsw/0120_44/quest.txt
diff --git a/Data/Questions/ingsw/0120_44/wrong1.txt b/legacy/Data/Questions/ingsw/0120_44/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_44/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_44/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_44/wrong2.txt b/legacy/Data/Questions/ingsw/0120_44/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_44/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_44/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_45/quest.txt b/legacy/Data/Questions/ingsw/0120_45/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_45/quest.txt
rename to legacy/Data/Questions/ingsw/0120_45/quest.txt
diff --git a/Data/Questions/ingsw/0210_2/wrong1.txt b/legacy/Data/Questions/ingsw/0120_45/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_2/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_45/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_45/wrong2.txt b/legacy/Data/Questions/ingsw/0120_45/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_45/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_45/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_45/wrong3.txt b/legacy/Data/Questions/ingsw/0120_45/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_45/wrong3.txt
rename to legacy/Data/Questions/ingsw/0120_45/wrong3.txt
diff --git a/Data/Questions/ingsw/0120_46/correct.txt b/legacy/Data/Questions/ingsw/0120_46/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_46/correct.txt
rename to legacy/Data/Questions/ingsw/0120_46/correct.txt
diff --git a/Data/Questions/ingsw/0120_46/quest.txt b/legacy/Data/Questions/ingsw/0120_46/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_46/quest.txt
rename to legacy/Data/Questions/ingsw/0120_46/quest.txt
diff --git a/Data/Questions/ingsw/0120_46/wrong1.txt b/legacy/Data/Questions/ingsw/0120_46/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_46/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_46/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_46/wrong2.txt b/legacy/Data/Questions/ingsw/0120_46/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_46/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_46/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_47/correct.txt b/legacy/Data/Questions/ingsw/0120_47/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_47/correct.txt
rename to legacy/Data/Questions/ingsw/0120_47/correct.txt
diff --git a/Data/Questions/ingsw/0120_47/quest.txt b/legacy/Data/Questions/ingsw/0120_47/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_47/quest.txt
rename to legacy/Data/Questions/ingsw/0120_47/quest.txt
diff --git a/Data/Questions/ingsw/0120_47/wrong1.txt b/legacy/Data/Questions/ingsw/0120_47/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_47/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_47/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_47/wrong2.txt b/legacy/Data/Questions/ingsw/0120_47/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_47/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_47/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_48/correct.txt b/legacy/Data/Questions/ingsw/0120_48/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_48/correct.txt
rename to legacy/Data/Questions/ingsw/0120_48/correct.txt
diff --git a/Data/Questions/ingsw/0120_48/quest.txt b/legacy/Data/Questions/ingsw/0120_48/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_48/quest.txt
rename to legacy/Data/Questions/ingsw/0120_48/quest.txt
diff --git a/Data/Questions/ingsw/0120_48/wrong1.txt b/legacy/Data/Questions/ingsw/0120_48/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_48/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_48/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_48/wrong2.txt b/legacy/Data/Questions/ingsw/0120_48/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_48/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_48/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_49/correct.txt b/legacy/Data/Questions/ingsw/0120_49/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_49/correct.txt
rename to legacy/Data/Questions/ingsw/0120_49/correct.txt
diff --git a/Data/Questions/ingsw/0120_49/quest.txt b/legacy/Data/Questions/ingsw/0120_49/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_49/quest.txt
rename to legacy/Data/Questions/ingsw/0120_49/quest.txt
diff --git a/Data/Questions/ingsw/0120_49/wrong1.txt b/legacy/Data/Questions/ingsw/0120_49/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_49/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_49/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_49/wrong2.txt b/legacy/Data/Questions/ingsw/0120_49/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_49/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_49/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_5/quest.txt b/legacy/Data/Questions/ingsw/0120_5/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_5/quest.txt
rename to legacy/Data/Questions/ingsw/0120_5/quest.txt
diff --git a/Data/Questions/ingsw/0120_5/wrong1.txt b/legacy/Data/Questions/ingsw/0120_5/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_5/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_5/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_5/wrong2.txt b/legacy/Data/Questions/ingsw/0120_5/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_5/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_5/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_5/wrong3.txt b/legacy/Data/Questions/ingsw/0120_5/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_5/wrong3.txt
rename to legacy/Data/Questions/ingsw/0120_5/wrong3.txt
diff --git a/Data/Questions/ingsw/0120_6/correct.txt b/legacy/Data/Questions/ingsw/0120_6/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_6/correct.txt
rename to legacy/Data/Questions/ingsw/0120_6/correct.txt
diff --git a/Data/Questions/ingsw/0120_6/quest.txt b/legacy/Data/Questions/ingsw/0120_6/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_6/quest.txt
rename to legacy/Data/Questions/ingsw/0120_6/quest.txt
diff --git a/Data/Questions/ingsw/0120_6/wrong1.txt b/legacy/Data/Questions/ingsw/0120_6/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_6/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_6/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_6/wrong2.txt b/legacy/Data/Questions/ingsw/0120_6/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_6/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_6/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_7/correct.txt b/legacy/Data/Questions/ingsw/0120_7/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_7/correct.txt
rename to legacy/Data/Questions/ingsw/0120_7/correct.txt
diff --git a/Data/Questions/ingsw/0120_7/quest.txt b/legacy/Data/Questions/ingsw/0120_7/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_7/quest.txt
rename to legacy/Data/Questions/ingsw/0120_7/quest.txt
diff --git a/Data/Questions/ingsw/0120_7/wrong1.txt b/legacy/Data/Questions/ingsw/0120_7/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_7/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_7/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_7/wrong2.txt b/legacy/Data/Questions/ingsw/0120_7/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_7/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_7/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_8/correct.txt b/legacy/Data/Questions/ingsw/0120_8/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_8/correct.txt
rename to legacy/Data/Questions/ingsw/0120_8/correct.txt
diff --git a/Data/Questions/ingsw/0120_8/quest.txt b/legacy/Data/Questions/ingsw/0120_8/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_8/quest.txt
rename to legacy/Data/Questions/ingsw/0120_8/quest.txt
diff --git a/Data/Questions/ingsw/0120_8/wrong1.txt b/legacy/Data/Questions/ingsw/0120_8/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_8/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_8/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_8/wrong2.txt b/legacy/Data/Questions/ingsw/0120_8/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_8/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_8/wrong2.txt
diff --git a/Data/Questions/ingsw/0120_9/correct.txt b/legacy/Data/Questions/ingsw/0120_9/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_9/correct.txt
rename to legacy/Data/Questions/ingsw/0120_9/correct.txt
diff --git a/Data/Questions/ingsw/0120_9/quest.txt b/legacy/Data/Questions/ingsw/0120_9/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_9/quest.txt
rename to legacy/Data/Questions/ingsw/0120_9/quest.txt
diff --git a/Data/Questions/ingsw/0120_9/wrong1.txt b/legacy/Data/Questions/ingsw/0120_9/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_9/wrong1.txt
rename to legacy/Data/Questions/ingsw/0120_9/wrong1.txt
diff --git a/Data/Questions/ingsw/0120_9/wrong2.txt b/legacy/Data/Questions/ingsw/0120_9/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0120_9/wrong2.txt
rename to legacy/Data/Questions/ingsw/0120_9/wrong2.txt
diff --git a/Data/Questions/ingsw/0121_34/correct.txt b/legacy/Data/Questions/ingsw/0121_34/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0121_34/correct.txt
rename to legacy/Data/Questions/ingsw/0121_34/correct.txt
diff --git a/Data/Questions/ingsw/0121_34/quest.txt b/legacy/Data/Questions/ingsw/0121_34/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0121_34/quest.txt
rename to legacy/Data/Questions/ingsw/0121_34/quest.txt
diff --git a/Data/Questions/ingsw/0121_34/wrong1.txt b/legacy/Data/Questions/ingsw/0121_34/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0121_34/wrong1.txt
rename to legacy/Data/Questions/ingsw/0121_34/wrong1.txt
diff --git a/Data/Questions/ingsw/0121_34/wrong2.txt b/legacy/Data/Questions/ingsw/0121_34/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0121_34/wrong2.txt
rename to legacy/Data/Questions/ingsw/0121_34/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_0/correct.txt b/legacy/Data/Questions/ingsw/0210_0/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_0/correct.txt
rename to legacy/Data/Questions/ingsw/0210_0/correct.txt
diff --git a/Data/Questions/ingsw/0210_0/quest.txt b/legacy/Data/Questions/ingsw/0210_0/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_0/quest.txt
rename to legacy/Data/Questions/ingsw/0210_0/quest.txt
diff --git a/Data/Questions/ingsw/0210_0/wrong1.txt b/legacy/Data/Questions/ingsw/0210_0/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_0/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_0/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_0/wrong2.txt b/legacy/Data/Questions/ingsw/0210_0/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_0/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_0/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_1/quest.txt b/legacy/Data/Questions/ingsw/0210_1/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_1/quest.txt
rename to legacy/Data/Questions/ingsw/0210_1/quest.txt
diff --git a/Data/Questions/ingsw/0210_1/wrong1.txt b/legacy/Data/Questions/ingsw/0210_1/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_1/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_1/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_1/wrong2.txt b/legacy/Data/Questions/ingsw/0210_1/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_1/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_1/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_1/wrong3.txt b/legacy/Data/Questions/ingsw/0210_1/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_1/wrong3.txt
rename to legacy/Data/Questions/ingsw/0210_1/wrong3.txt
diff --git a/Data/Questions/ingsw/0210_10/correct.txt b/legacy/Data/Questions/ingsw/0210_10/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_10/correct.txt
rename to legacy/Data/Questions/ingsw/0210_10/correct.txt
diff --git a/Data/Questions/ingsw/0210_10/quest.txt b/legacy/Data/Questions/ingsw/0210_10/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_10/quest.txt
rename to legacy/Data/Questions/ingsw/0210_10/quest.txt
diff --git a/Data/Questions/ingsw/0210_10/wrong1.txt b/legacy/Data/Questions/ingsw/0210_10/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_10/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_10/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_10/wrong2.txt b/legacy/Data/Questions/ingsw/0210_10/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_10/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_10/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_11/quest.txt b/legacy/Data/Questions/ingsw/0210_11/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_11/quest.txt
rename to legacy/Data/Questions/ingsw/0210_11/quest.txt
diff --git a/Data/Questions/ingsw/0210_11/wrong1.txt b/legacy/Data/Questions/ingsw/0210_11/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_11/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_11/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_11/wrong2.txt b/legacy/Data/Questions/ingsw/0210_11/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_11/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_11/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_11/wrong3.txt b/legacy/Data/Questions/ingsw/0210_11/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_11/wrong3.txt
rename to legacy/Data/Questions/ingsw/0210_11/wrong3.txt
diff --git a/Data/Questions/ingsw/0210_12/quest.txt b/legacy/Data/Questions/ingsw/0210_12/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_12/quest.txt
rename to legacy/Data/Questions/ingsw/0210_12/quest.txt
diff --git a/Data/Questions/ingsw/0210_12/wrong1.txt b/legacy/Data/Questions/ingsw/0210_12/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_12/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_12/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_12/wrong2.txt b/legacy/Data/Questions/ingsw/0210_12/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_12/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_12/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_12/wrong3.txt b/legacy/Data/Questions/ingsw/0210_12/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_12/wrong3.txt
rename to legacy/Data/Questions/ingsw/0210_12/wrong3.txt
diff --git a/Data/Questions/ingsw/0210_13/correct.txt b/legacy/Data/Questions/ingsw/0210_13/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_13/correct.txt
rename to legacy/Data/Questions/ingsw/0210_13/correct.txt
diff --git a/Data/Questions/ingsw/0210_13/quest.txt b/legacy/Data/Questions/ingsw/0210_13/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_13/quest.txt
rename to legacy/Data/Questions/ingsw/0210_13/quest.txt
diff --git a/Data/Questions/ingsw/0210_13/wrong1.txt b/legacy/Data/Questions/ingsw/0210_13/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_13/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_13/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_13/wrong2.txt b/legacy/Data/Questions/ingsw/0210_13/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_13/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_13/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_14/correct.txt b/legacy/Data/Questions/ingsw/0210_14/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_14/correct.txt
rename to legacy/Data/Questions/ingsw/0210_14/correct.txt
diff --git a/Data/Questions/ingsw/0210_14/quest.txt b/legacy/Data/Questions/ingsw/0210_14/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_14/quest.txt
rename to legacy/Data/Questions/ingsw/0210_14/quest.txt
diff --git a/Data/Questions/ingsw/0210_14/wrong1.txt b/legacy/Data/Questions/ingsw/0210_14/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_14/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_14/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_14/wrong2.txt b/legacy/Data/Questions/ingsw/0210_14/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_14/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_14/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_15/correct.txt b/legacy/Data/Questions/ingsw/0210_15/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_15/correct.txt
rename to legacy/Data/Questions/ingsw/0210_15/correct.txt
diff --git a/Data/Questions/ingsw/0210_15/quest.txt b/legacy/Data/Questions/ingsw/0210_15/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_15/quest.txt
rename to legacy/Data/Questions/ingsw/0210_15/quest.txt
diff --git a/Data/Questions/ingsw/0210_15/wrong1.txt b/legacy/Data/Questions/ingsw/0210_15/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_15/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_15/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_15/wrong2.txt b/legacy/Data/Questions/ingsw/0210_15/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_15/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_15/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_16/correct.txt b/legacy/Data/Questions/ingsw/0210_16/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_16/correct.txt
rename to legacy/Data/Questions/ingsw/0210_16/correct.txt
diff --git a/Data/Questions/ingsw/0210_16/quest.txt b/legacy/Data/Questions/ingsw/0210_16/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_16/quest.txt
rename to legacy/Data/Questions/ingsw/0210_16/quest.txt
diff --git a/Data/Questions/ingsw/0210_16/wrong1.txt b/legacy/Data/Questions/ingsw/0210_16/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_16/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_16/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_16/wrong2.txt b/legacy/Data/Questions/ingsw/0210_16/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_16/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_16/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_17/correct.txt b/legacy/Data/Questions/ingsw/0210_17/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_17/correct.txt
rename to legacy/Data/Questions/ingsw/0210_17/correct.txt
diff --git a/Data/Questions/ingsw/0210_17/quest.txt b/legacy/Data/Questions/ingsw/0210_17/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_17/quest.txt
rename to legacy/Data/Questions/ingsw/0210_17/quest.txt
diff --git a/Data/Questions/ingsw/0210_17/wrong1.txt b/legacy/Data/Questions/ingsw/0210_17/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_17/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_17/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_17/wrong2.txt b/legacy/Data/Questions/ingsw/0210_17/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_17/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_17/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_18/correct.txt b/legacy/Data/Questions/ingsw/0210_18/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_18/correct.txt
rename to legacy/Data/Questions/ingsw/0210_18/correct.txt
diff --git a/Data/Questions/ingsw/0210_18/quest.txt b/legacy/Data/Questions/ingsw/0210_18/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_18/quest.txt
rename to legacy/Data/Questions/ingsw/0210_18/quest.txt
diff --git a/Data/Questions/ingsw/0210_18/wrong1.txt b/legacy/Data/Questions/ingsw/0210_18/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_18/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_18/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_18/wrong2.txt b/legacy/Data/Questions/ingsw/0210_18/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_18/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_18/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_19/correct.txt b/legacy/Data/Questions/ingsw/0210_19/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_19/correct.txt
rename to legacy/Data/Questions/ingsw/0210_19/correct.txt
diff --git a/Data/Questions/ingsw/0210_19/quest.txt b/legacy/Data/Questions/ingsw/0210_19/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_19/quest.txt
rename to legacy/Data/Questions/ingsw/0210_19/quest.txt
diff --git a/Data/Questions/ingsw/0210_19/wrong1.txt b/legacy/Data/Questions/ingsw/0210_19/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_19/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_19/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_19/wrong2.txt b/legacy/Data/Questions/ingsw/0210_19/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_19/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_19/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_2/quest.txt b/legacy/Data/Questions/ingsw/0210_2/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_2/quest.txt
rename to legacy/Data/Questions/ingsw/0210_2/quest.txt
diff --git a/Data/Questions/ingsw/0210_28/wrong1.txt b/legacy/Data/Questions/ingsw/0210_2/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_28/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_2/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_2/wrong2.txt b/legacy/Data/Questions/ingsw/0210_2/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_2/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_2/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_2/wrong3.txt b/legacy/Data/Questions/ingsw/0210_2/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_2/wrong3.txt
rename to legacy/Data/Questions/ingsw/0210_2/wrong3.txt
diff --git a/Data/Questions/ingsw/0210_20/correct.txt b/legacy/Data/Questions/ingsw/0210_20/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_20/correct.txt
rename to legacy/Data/Questions/ingsw/0210_20/correct.txt
diff --git a/Data/Questions/ingsw/0210_20/quest.txt b/legacy/Data/Questions/ingsw/0210_20/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_20/quest.txt
rename to legacy/Data/Questions/ingsw/0210_20/quest.txt
diff --git a/Data/Questions/ingsw/0210_20/wrong1.txt b/legacy/Data/Questions/ingsw/0210_20/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_20/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_20/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_20/wrong2.txt b/legacy/Data/Questions/ingsw/0210_20/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_20/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_20/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_21/correct.txt b/legacy/Data/Questions/ingsw/0210_21/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_21/correct.txt
rename to legacy/Data/Questions/ingsw/0210_21/correct.txt
diff --git a/Data/Questions/ingsw/0210_21/quest.txt b/legacy/Data/Questions/ingsw/0210_21/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_21/quest.txt
rename to legacy/Data/Questions/ingsw/0210_21/quest.txt
diff --git a/Data/Questions/ingsw/0210_21/wrong1.txt b/legacy/Data/Questions/ingsw/0210_21/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_21/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_21/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_21/wrong2.txt b/legacy/Data/Questions/ingsw/0210_21/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_21/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_21/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_22/correct.txt b/legacy/Data/Questions/ingsw/0210_22/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_22/correct.txt
rename to legacy/Data/Questions/ingsw/0210_22/correct.txt
diff --git a/Data/Questions/ingsw/0210_22/quest.txt b/legacy/Data/Questions/ingsw/0210_22/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_22/quest.txt
rename to legacy/Data/Questions/ingsw/0210_22/quest.txt
diff --git a/Data/Questions/ingsw/0210_22/wrong1.txt b/legacy/Data/Questions/ingsw/0210_22/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_22/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_22/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_22/wrong2.txt b/legacy/Data/Questions/ingsw/0210_22/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_22/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_22/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_23/correct.txt b/legacy/Data/Questions/ingsw/0210_23/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_23/correct.txt
rename to legacy/Data/Questions/ingsw/0210_23/correct.txt
diff --git a/Data/Questions/ingsw/0210_23/quest.txt b/legacy/Data/Questions/ingsw/0210_23/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_23/quest.txt
rename to legacy/Data/Questions/ingsw/0210_23/quest.txt
diff --git a/Data/Questions/ingsw/0210_23/wrong1.txt b/legacy/Data/Questions/ingsw/0210_23/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_23/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_23/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_23/wrong2.txt b/legacy/Data/Questions/ingsw/0210_23/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_23/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_23/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_24/correct.txt b/legacy/Data/Questions/ingsw/0210_24/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_24/correct.txt
rename to legacy/Data/Questions/ingsw/0210_24/correct.txt
diff --git a/Data/Questions/ingsw/0210_24/quest.txt b/legacy/Data/Questions/ingsw/0210_24/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_24/quest.txt
rename to legacy/Data/Questions/ingsw/0210_24/quest.txt
diff --git a/Data/Questions/ingsw/0210_24/wrong1.txt b/legacy/Data/Questions/ingsw/0210_24/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_24/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_24/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_24/wrong2.txt b/legacy/Data/Questions/ingsw/0210_24/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_24/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_24/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_25/correct.txt b/legacy/Data/Questions/ingsw/0210_25/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_25/correct.txt
rename to legacy/Data/Questions/ingsw/0210_25/correct.txt
diff --git a/Data/Questions/ingsw/0210_25/quest.txt b/legacy/Data/Questions/ingsw/0210_25/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_25/quest.txt
rename to legacy/Data/Questions/ingsw/0210_25/quest.txt
diff --git a/Data/Questions/ingsw/0210_25/wrong1.txt b/legacy/Data/Questions/ingsw/0210_25/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_25/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_25/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_25/wrong2.txt b/legacy/Data/Questions/ingsw/0210_25/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_25/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_25/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_26/correct.txt b/legacy/Data/Questions/ingsw/0210_26/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_26/correct.txt
rename to legacy/Data/Questions/ingsw/0210_26/correct.txt
diff --git a/Data/Questions/ingsw/0210_26/quest.txt b/legacy/Data/Questions/ingsw/0210_26/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_26/quest.txt
rename to legacy/Data/Questions/ingsw/0210_26/quest.txt
diff --git a/Data/Questions/ingsw/0210_26/wrong1.txt b/legacy/Data/Questions/ingsw/0210_26/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_26/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_26/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_26/wrong2.txt b/legacy/Data/Questions/ingsw/0210_26/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_26/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_26/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_27/quest.txt b/legacy/Data/Questions/ingsw/0210_27/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_27/quest.txt
rename to legacy/Data/Questions/ingsw/0210_27/quest.txt
diff --git a/Data/Questions/ingsw/0210_27/wrong1.txt b/legacy/Data/Questions/ingsw/0210_27/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_27/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_27/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_27/wrong2.txt b/legacy/Data/Questions/ingsw/0210_27/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_27/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_27/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_27/wrong3.txt b/legacy/Data/Questions/ingsw/0210_27/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_27/wrong3.txt
rename to legacy/Data/Questions/ingsw/0210_27/wrong3.txt
diff --git a/Data/Questions/ingsw/0210_28/quest.txt b/legacy/Data/Questions/ingsw/0210_28/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_28/quest.txt
rename to legacy/Data/Questions/ingsw/0210_28/quest.txt
diff --git a/Data/Questions/ingsw/0210_34/wrong1.txt b/legacy/Data/Questions/ingsw/0210_28/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_34/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_28/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_28/wrong2.txt b/legacy/Data/Questions/ingsw/0210_28/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_28/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_28/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_28/wrong3.txt b/legacy/Data/Questions/ingsw/0210_28/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_28/wrong3.txt
rename to legacy/Data/Questions/ingsw/0210_28/wrong3.txt
diff --git a/Data/Questions/ingsw/0210_29/correct.txt b/legacy/Data/Questions/ingsw/0210_29/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_29/correct.txt
rename to legacy/Data/Questions/ingsw/0210_29/correct.txt
diff --git a/Data/Questions/ingsw/0210_29/quest.txt b/legacy/Data/Questions/ingsw/0210_29/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_29/quest.txt
rename to legacy/Data/Questions/ingsw/0210_29/quest.txt
diff --git a/Data/Questions/ingsw/0210_29/wrong1.txt b/legacy/Data/Questions/ingsw/0210_29/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_29/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_29/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_29/wrong2.txt b/legacy/Data/Questions/ingsw/0210_29/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_29/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_29/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_3/quest.txt b/legacy/Data/Questions/ingsw/0210_3/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_3/quest.txt
rename to legacy/Data/Questions/ingsw/0210_3/quest.txt
diff --git a/Data/Questions/ingsw/0210_3/wrong1.txt b/legacy/Data/Questions/ingsw/0210_3/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_3/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_3/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_3/wrong2.txt b/legacy/Data/Questions/ingsw/0210_3/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_3/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_3/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_3/wrong3.txt b/legacy/Data/Questions/ingsw/0210_3/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_3/wrong3.txt
rename to legacy/Data/Questions/ingsw/0210_3/wrong3.txt
diff --git a/Data/Questions/ingsw/0210_30/correct.txt b/legacy/Data/Questions/ingsw/0210_30/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_30/correct.txt
rename to legacy/Data/Questions/ingsw/0210_30/correct.txt
diff --git a/Data/Questions/ingsw/0210_30/quest.txt b/legacy/Data/Questions/ingsw/0210_30/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_30/quest.txt
rename to legacy/Data/Questions/ingsw/0210_30/quest.txt
diff --git a/Data/Questions/ingsw/0210_30/wrong1.txt b/legacy/Data/Questions/ingsw/0210_30/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_30/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_30/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_30/wrong2.txt b/legacy/Data/Questions/ingsw/0210_30/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_30/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_30/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_31/correct.txt b/legacy/Data/Questions/ingsw/0210_31/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_31/correct.txt
rename to legacy/Data/Questions/ingsw/0210_31/correct.txt
diff --git a/Data/Questions/ingsw/0210_31/quest.txt b/legacy/Data/Questions/ingsw/0210_31/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_31/quest.txt
rename to legacy/Data/Questions/ingsw/0210_31/quest.txt
diff --git a/Data/Questions/ingsw/0210_31/wrong1.txt b/legacy/Data/Questions/ingsw/0210_31/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_31/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_31/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_31/wrong2.txt b/legacy/Data/Questions/ingsw/0210_31/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_31/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_31/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_32/correct.txt b/legacy/Data/Questions/ingsw/0210_32/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_32/correct.txt
rename to legacy/Data/Questions/ingsw/0210_32/correct.txt
diff --git a/Data/Questions/ingsw/0210_32/quest.txt b/legacy/Data/Questions/ingsw/0210_32/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_32/quest.txt
rename to legacy/Data/Questions/ingsw/0210_32/quest.txt
diff --git a/Data/Questions/ingsw/0210_32/wrong1.txt b/legacy/Data/Questions/ingsw/0210_32/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_32/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_32/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_32/wrong2.txt b/legacy/Data/Questions/ingsw/0210_32/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_32/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_32/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_33/correct.txt b/legacy/Data/Questions/ingsw/0210_33/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_33/correct.txt
rename to legacy/Data/Questions/ingsw/0210_33/correct.txt
diff --git a/Data/Questions/ingsw/0210_33/quest.txt b/legacy/Data/Questions/ingsw/0210_33/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_33/quest.txt
rename to legacy/Data/Questions/ingsw/0210_33/quest.txt
diff --git a/Data/Questions/ingsw/0210_33/wrong1.txt b/legacy/Data/Questions/ingsw/0210_33/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_33/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_33/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_33/wrong2.txt b/legacy/Data/Questions/ingsw/0210_33/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_33/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_33/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_34/quest.txt b/legacy/Data/Questions/ingsw/0210_34/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_34/quest.txt
rename to legacy/Data/Questions/ingsw/0210_34/quest.txt
diff --git a/Data/Questions/ingsw/0210_37/wrong1.txt b/legacy/Data/Questions/ingsw/0210_34/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_37/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_34/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_34/wrong2.txt b/legacy/Data/Questions/ingsw/0210_34/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_34/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_34/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_34/wrong3.txt b/legacy/Data/Questions/ingsw/0210_34/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_34/wrong3.txt
rename to legacy/Data/Questions/ingsw/0210_34/wrong3.txt
diff --git a/Data/Questions/ingsw/0210_35/correct.txt b/legacy/Data/Questions/ingsw/0210_35/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_35/correct.txt
rename to legacy/Data/Questions/ingsw/0210_35/correct.txt
diff --git a/Data/Questions/ingsw/0210_35/quest.txt b/legacy/Data/Questions/ingsw/0210_35/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_35/quest.txt
rename to legacy/Data/Questions/ingsw/0210_35/quest.txt
diff --git a/Data/Questions/ingsw/0210_35/wrong1.txt b/legacy/Data/Questions/ingsw/0210_35/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_35/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_35/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_35/wrong2.txt b/legacy/Data/Questions/ingsw/0210_35/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_35/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_35/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_36/correct.txt b/legacy/Data/Questions/ingsw/0210_36/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_36/correct.txt
rename to legacy/Data/Questions/ingsw/0210_36/correct.txt
diff --git a/Data/Questions/ingsw/0210_36/quest.txt b/legacy/Data/Questions/ingsw/0210_36/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_36/quest.txt
rename to legacy/Data/Questions/ingsw/0210_36/quest.txt
diff --git a/Data/Questions/ingsw/0210_36/wrong1.txt b/legacy/Data/Questions/ingsw/0210_36/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_36/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_36/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_36/wrong2.txt b/legacy/Data/Questions/ingsw/0210_36/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_36/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_36/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_37/quest.txt b/legacy/Data/Questions/ingsw/0210_37/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_37/quest.txt
rename to legacy/Data/Questions/ingsw/0210_37/quest.txt
diff --git a/Data/Questions/ingsw/0324_26/wrong1.txt b/legacy/Data/Questions/ingsw/0210_37/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_26/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_37/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_37/wrong2.txt b/legacy/Data/Questions/ingsw/0210_37/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_37/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_37/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_37/wrong3.txt b/legacy/Data/Questions/ingsw/0210_37/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_37/wrong3.txt
rename to legacy/Data/Questions/ingsw/0210_37/wrong3.txt
diff --git a/Data/Questions/ingsw/0210_38/correct.txt b/legacy/Data/Questions/ingsw/0210_38/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_38/correct.txt
rename to legacy/Data/Questions/ingsw/0210_38/correct.txt
diff --git a/Data/Questions/ingsw/0210_38/quest.txt b/legacy/Data/Questions/ingsw/0210_38/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_38/quest.txt
rename to legacy/Data/Questions/ingsw/0210_38/quest.txt
diff --git a/Data/Questions/ingsw/0210_38/wrong1.txt b/legacy/Data/Questions/ingsw/0210_38/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_38/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_38/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_38/wrong2.txt b/legacy/Data/Questions/ingsw/0210_38/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_38/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_38/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_39/correct.txt b/legacy/Data/Questions/ingsw/0210_39/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_39/correct.txt
rename to legacy/Data/Questions/ingsw/0210_39/correct.txt
diff --git a/Data/Questions/ingsw/0210_39/quest.txt b/legacy/Data/Questions/ingsw/0210_39/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_39/quest.txt
rename to legacy/Data/Questions/ingsw/0210_39/quest.txt
diff --git a/Data/Questions/ingsw/0210_39/wrong1.txt b/legacy/Data/Questions/ingsw/0210_39/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_39/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_39/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_39/wrong2.txt b/legacy/Data/Questions/ingsw/0210_39/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_39/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_39/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_4/correct.txt b/legacy/Data/Questions/ingsw/0210_4/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_4/correct.txt
rename to legacy/Data/Questions/ingsw/0210_4/correct.txt
diff --git a/Data/Questions/ingsw/0210_4/quest.txt b/legacy/Data/Questions/ingsw/0210_4/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_4/quest.txt
rename to legacy/Data/Questions/ingsw/0210_4/quest.txt
diff --git a/Data/Questions/ingsw/0210_4/wrong1.txt b/legacy/Data/Questions/ingsw/0210_4/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_4/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_4/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_4/wrong2.txt b/legacy/Data/Questions/ingsw/0210_4/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_4/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_4/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_40/correct.txt b/legacy/Data/Questions/ingsw/0210_40/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_40/correct.txt
rename to legacy/Data/Questions/ingsw/0210_40/correct.txt
diff --git a/Data/Questions/ingsw/0210_40/quest.txt b/legacy/Data/Questions/ingsw/0210_40/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_40/quest.txt
rename to legacy/Data/Questions/ingsw/0210_40/quest.txt
diff --git a/Data/Questions/ingsw/0210_40/wrong1.txt b/legacy/Data/Questions/ingsw/0210_40/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_40/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_40/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_40/wrong2.txt b/legacy/Data/Questions/ingsw/0210_40/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_40/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_40/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_41/correct.txt b/legacy/Data/Questions/ingsw/0210_41/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_41/correct.txt
rename to legacy/Data/Questions/ingsw/0210_41/correct.txt
diff --git a/Data/Questions/ingsw/0210_41/quest.txt b/legacy/Data/Questions/ingsw/0210_41/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_41/quest.txt
rename to legacy/Data/Questions/ingsw/0210_41/quest.txt
diff --git a/Data/Questions/ingsw/0210_41/wrong1.txt b/legacy/Data/Questions/ingsw/0210_41/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_41/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_41/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_41/wrong2.txt b/legacy/Data/Questions/ingsw/0210_41/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_41/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_41/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_42/quest.txt b/legacy/Data/Questions/ingsw/0210_42/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_42/quest.txt
rename to legacy/Data/Questions/ingsw/0210_42/quest.txt
diff --git a/Data/Questions/ingsw/0210_42/wrong1.txt b/legacy/Data/Questions/ingsw/0210_42/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_42/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_42/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_42/wrong2.txt b/legacy/Data/Questions/ingsw/0210_42/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_42/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_42/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_42/wrong3.txt b/legacy/Data/Questions/ingsw/0210_42/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_42/wrong3.txt
rename to legacy/Data/Questions/ingsw/0210_42/wrong3.txt
diff --git a/Data/Questions/ingsw/0210_43/correct.txt b/legacy/Data/Questions/ingsw/0210_43/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_43/correct.txt
rename to legacy/Data/Questions/ingsw/0210_43/correct.txt
diff --git a/Data/Questions/ingsw/0210_43/quest.txt b/legacy/Data/Questions/ingsw/0210_43/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_43/quest.txt
rename to legacy/Data/Questions/ingsw/0210_43/quest.txt
diff --git a/Data/Questions/ingsw/0210_43/wrong1.txt b/legacy/Data/Questions/ingsw/0210_43/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_43/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_43/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_43/wrong2.txt b/legacy/Data/Questions/ingsw/0210_43/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_43/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_43/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_44/quest.txt b/legacy/Data/Questions/ingsw/0210_44/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_44/quest.txt
rename to legacy/Data/Questions/ingsw/0210_44/quest.txt
diff --git a/Data/Questions/ingsw/0210_44/wrong1.txt b/legacy/Data/Questions/ingsw/0210_44/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_44/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_44/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_44/wrong2.txt b/legacy/Data/Questions/ingsw/0210_44/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_44/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_44/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_44/wrong3.txt b/legacy/Data/Questions/ingsw/0210_44/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_44/wrong3.txt
rename to legacy/Data/Questions/ingsw/0210_44/wrong3.txt
diff --git a/Data/Questions/ingsw/0210_45/correct.txt b/legacy/Data/Questions/ingsw/0210_45/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_45/correct.txt
rename to legacy/Data/Questions/ingsw/0210_45/correct.txt
diff --git a/Data/Questions/ingsw/0210_45/quest.txt b/legacy/Data/Questions/ingsw/0210_45/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_45/quest.txt
rename to legacy/Data/Questions/ingsw/0210_45/quest.txt
diff --git a/Data/Questions/ingsw/0210_45/wrong1.txt b/legacy/Data/Questions/ingsw/0210_45/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_45/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_45/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_45/wrong2.txt b/legacy/Data/Questions/ingsw/0210_45/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_45/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_45/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_46/correct.txt b/legacy/Data/Questions/ingsw/0210_46/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_46/correct.txt
rename to legacy/Data/Questions/ingsw/0210_46/correct.txt
diff --git a/Data/Questions/ingsw/0210_46/quest.txt b/legacy/Data/Questions/ingsw/0210_46/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_46/quest.txt
rename to legacy/Data/Questions/ingsw/0210_46/quest.txt
diff --git a/Data/Questions/ingsw/0210_46/wrong1.txt b/legacy/Data/Questions/ingsw/0210_46/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_46/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_46/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_46/wrong2.txt b/legacy/Data/Questions/ingsw/0210_46/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_46/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_46/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_47/correct.txt b/legacy/Data/Questions/ingsw/0210_47/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_47/correct.txt
rename to legacy/Data/Questions/ingsw/0210_47/correct.txt
diff --git a/Data/Questions/ingsw/0210_47/quest.txt b/legacy/Data/Questions/ingsw/0210_47/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_47/quest.txt
rename to legacy/Data/Questions/ingsw/0210_47/quest.txt
diff --git a/Data/Questions/ingsw/0210_47/wrong1.txt b/legacy/Data/Questions/ingsw/0210_47/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_47/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_47/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_47/wrong2.txt b/legacy/Data/Questions/ingsw/0210_47/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_47/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_47/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_48/correct.txt b/legacy/Data/Questions/ingsw/0210_48/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_48/correct.txt
rename to legacy/Data/Questions/ingsw/0210_48/correct.txt
diff --git a/Data/Questions/ingsw/0210_48/quest.txt b/legacy/Data/Questions/ingsw/0210_48/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_48/quest.txt
rename to legacy/Data/Questions/ingsw/0210_48/quest.txt
diff --git a/Data/Questions/ingsw/0210_48/wrong1.txt b/legacy/Data/Questions/ingsw/0210_48/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_48/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_48/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_48/wrong2.txt b/legacy/Data/Questions/ingsw/0210_48/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_48/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_48/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_49/correct.txt b/legacy/Data/Questions/ingsw/0210_49/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_49/correct.txt
rename to legacy/Data/Questions/ingsw/0210_49/correct.txt
diff --git a/Data/Questions/ingsw/0210_49/quest.txt b/legacy/Data/Questions/ingsw/0210_49/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_49/quest.txt
rename to legacy/Data/Questions/ingsw/0210_49/quest.txt
diff --git a/Data/Questions/ingsw/0210_49/wrong1.txt b/legacy/Data/Questions/ingsw/0210_49/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_49/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_49/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_49/wrong2.txt b/legacy/Data/Questions/ingsw/0210_49/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_49/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_49/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_5/correct.txt b/legacy/Data/Questions/ingsw/0210_5/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_5/correct.txt
rename to legacy/Data/Questions/ingsw/0210_5/correct.txt
diff --git a/Data/Questions/ingsw/0210_5/quest.txt b/legacy/Data/Questions/ingsw/0210_5/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_5/quest.txt
rename to legacy/Data/Questions/ingsw/0210_5/quest.txt
diff --git a/Data/Questions/ingsw/0210_5/wrong1.txt b/legacy/Data/Questions/ingsw/0210_5/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_5/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_5/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_5/wrong2.txt b/legacy/Data/Questions/ingsw/0210_5/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_5/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_5/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_6/correct.txt b/legacy/Data/Questions/ingsw/0210_6/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_6/correct.txt
rename to legacy/Data/Questions/ingsw/0210_6/correct.txt
diff --git a/Data/Questions/ingsw/0210_6/quest.txt b/legacy/Data/Questions/ingsw/0210_6/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_6/quest.txt
rename to legacy/Data/Questions/ingsw/0210_6/quest.txt
diff --git a/Data/Questions/ingsw/0210_6/wrong1.txt b/legacy/Data/Questions/ingsw/0210_6/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_6/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_6/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_6/wrong2.txt b/legacy/Data/Questions/ingsw/0210_6/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_6/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_6/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_7/correct.txt b/legacy/Data/Questions/ingsw/0210_7/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_7/correct.txt
rename to legacy/Data/Questions/ingsw/0210_7/correct.txt
diff --git a/Data/Questions/ingsw/0210_7/quest.txt b/legacy/Data/Questions/ingsw/0210_7/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_7/quest.txt
rename to legacy/Data/Questions/ingsw/0210_7/quest.txt
diff --git a/Data/Questions/ingsw/0210_7/wrong1.txt b/legacy/Data/Questions/ingsw/0210_7/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_7/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_7/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_7/wrong2.txt b/legacy/Data/Questions/ingsw/0210_7/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_7/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_7/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_8/correct.txt b/legacy/Data/Questions/ingsw/0210_8/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_8/correct.txt
rename to legacy/Data/Questions/ingsw/0210_8/correct.txt
diff --git a/Data/Questions/ingsw/0210_8/quest.txt b/legacy/Data/Questions/ingsw/0210_8/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_8/quest.txt
rename to legacy/Data/Questions/ingsw/0210_8/quest.txt
diff --git a/Data/Questions/ingsw/0210_8/wrong1.txt b/legacy/Data/Questions/ingsw/0210_8/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_8/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_8/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_8/wrong2.txt b/legacy/Data/Questions/ingsw/0210_8/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_8/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_8/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_9/quest.txt b/legacy/Data/Questions/ingsw/0210_9/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_9/quest.txt
rename to legacy/Data/Questions/ingsw/0210_9/quest.txt
diff --git a/Data/Questions/ingsw/0210_9/wrong1.txt b/legacy/Data/Questions/ingsw/0210_9/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_9/wrong1.txt
rename to legacy/Data/Questions/ingsw/0210_9/wrong1.txt
diff --git a/Data/Questions/ingsw/0210_9/wrong2.txt b/legacy/Data/Questions/ingsw/0210_9/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_9/wrong2.txt
rename to legacy/Data/Questions/ingsw/0210_9/wrong2.txt
diff --git a/Data/Questions/ingsw/0210_9/wrong3.txt b/legacy/Data/Questions/ingsw/0210_9/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0210_9/wrong3.txt
rename to legacy/Data/Questions/ingsw/0210_9/wrong3.txt
diff --git a/Data/Questions/ingsw/0221_18/correct.txt b/legacy/Data/Questions/ingsw/0221_18/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0221_18/correct.txt
rename to legacy/Data/Questions/ingsw/0221_18/correct.txt
diff --git a/Data/Questions/ingsw/0221_18/quest.txt b/legacy/Data/Questions/ingsw/0221_18/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0221_18/quest.txt
rename to legacy/Data/Questions/ingsw/0221_18/quest.txt
diff --git a/Data/Questions/ingsw/0221_18/wrong1.txt b/legacy/Data/Questions/ingsw/0221_18/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0221_18/wrong1.txt
rename to legacy/Data/Questions/ingsw/0221_18/wrong1.txt
diff --git a/Data/Questions/ingsw/0221_18/wrong2.txt b/legacy/Data/Questions/ingsw/0221_18/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0221_18/wrong2.txt
rename to legacy/Data/Questions/ingsw/0221_18/wrong2.txt
diff --git a/Data/Questions/ingsw/0221_28/correct.txt b/legacy/Data/Questions/ingsw/0221_28/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0221_28/correct.txt
rename to legacy/Data/Questions/ingsw/0221_28/correct.txt
diff --git a/Data/Questions/ingsw/0221_28/quest.txt b/legacy/Data/Questions/ingsw/0221_28/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0221_28/quest.txt
rename to legacy/Data/Questions/ingsw/0221_28/quest.txt
diff --git a/Data/Questions/ingsw/0221_28/wrong1.txt b/legacy/Data/Questions/ingsw/0221_28/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0221_28/wrong1.txt
rename to legacy/Data/Questions/ingsw/0221_28/wrong1.txt
diff --git a/Data/Questions/ingsw/0221_28/wrong2.txt b/legacy/Data/Questions/ingsw/0221_28/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0221_28/wrong2.txt
rename to legacy/Data/Questions/ingsw/0221_28/wrong2.txt
diff --git a/Data/Questions/ingsw/0221_32/correct.txt b/legacy/Data/Questions/ingsw/0221_32/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0221_32/correct.txt
rename to legacy/Data/Questions/ingsw/0221_32/correct.txt
diff --git a/Data/Questions/ingsw/0221_32/quest.txt b/legacy/Data/Questions/ingsw/0221_32/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0221_32/quest.txt
rename to legacy/Data/Questions/ingsw/0221_32/quest.txt
diff --git a/Data/Questions/ingsw/0221_32/wrong1.txt b/legacy/Data/Questions/ingsw/0221_32/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0221_32/wrong1.txt
rename to legacy/Data/Questions/ingsw/0221_32/wrong1.txt
diff --git a/Data/Questions/ingsw/0221_32/wrong2.txt b/legacy/Data/Questions/ingsw/0221_32/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0221_32/wrong2.txt
rename to legacy/Data/Questions/ingsw/0221_32/wrong2.txt
diff --git a/Data/Questions/ingsw/0222_24/correct.txt b/legacy/Data/Questions/ingsw/0222_24/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_24/correct.txt
rename to legacy/Data/Questions/ingsw/0222_24/correct.txt
diff --git a/Data/Questions/ingsw/0222_24/quest.txt b/legacy/Data/Questions/ingsw/0222_24/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_24/quest.txt
rename to legacy/Data/Questions/ingsw/0222_24/quest.txt
diff --git a/Data/Questions/ingsw/0222_24/wrong1.txt b/legacy/Data/Questions/ingsw/0222_24/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_24/wrong1.txt
rename to legacy/Data/Questions/ingsw/0222_24/wrong1.txt
diff --git a/Data/Questions/ingsw/0222_24/wrong2.txt b/legacy/Data/Questions/ingsw/0222_24/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_24/wrong2.txt
rename to legacy/Data/Questions/ingsw/0222_24/wrong2.txt
diff --git a/Data/Questions/ingsw/0222_27/correct.txt b/legacy/Data/Questions/ingsw/0222_27/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_27/correct.txt
rename to legacy/Data/Questions/ingsw/0222_27/correct.txt
diff --git a/Data/Questions/ingsw/0222_27/quest.txt b/legacy/Data/Questions/ingsw/0222_27/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_27/quest.txt
rename to legacy/Data/Questions/ingsw/0222_27/quest.txt
diff --git a/Data/Questions/ingsw/0222_27/wrong1.txt b/legacy/Data/Questions/ingsw/0222_27/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_27/wrong1.txt
rename to legacy/Data/Questions/ingsw/0222_27/wrong1.txt
diff --git a/Data/Questions/ingsw/0222_27/wrong2.txt b/legacy/Data/Questions/ingsw/0222_27/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_27/wrong2.txt
rename to legacy/Data/Questions/ingsw/0222_27/wrong2.txt
diff --git a/Data/Questions/ingsw/0222_33/correct.txt b/legacy/Data/Questions/ingsw/0222_33/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_33/correct.txt
rename to legacy/Data/Questions/ingsw/0222_33/correct.txt
diff --git a/Data/Questions/ingsw/0222_33/quest.txt b/legacy/Data/Questions/ingsw/0222_33/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_33/quest.txt
rename to legacy/Data/Questions/ingsw/0222_33/quest.txt
diff --git a/Data/Questions/ingsw/0222_33/wrong1.txt b/legacy/Data/Questions/ingsw/0222_33/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_33/wrong1.txt
rename to legacy/Data/Questions/ingsw/0222_33/wrong1.txt
diff --git a/Data/Questions/ingsw/0222_33/wrong2.txt b/legacy/Data/Questions/ingsw/0222_33/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_33/wrong2.txt
rename to legacy/Data/Questions/ingsw/0222_33/wrong2.txt
diff --git a/Data/Questions/ingsw/0222_35/correct.txt b/legacy/Data/Questions/ingsw/0222_35/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_35/correct.txt
rename to legacy/Data/Questions/ingsw/0222_35/correct.txt
diff --git a/Data/Questions/ingsw/0222_35/quest.txt b/legacy/Data/Questions/ingsw/0222_35/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_35/quest.txt
rename to legacy/Data/Questions/ingsw/0222_35/quest.txt
diff --git a/Data/Questions/ingsw/0222_35/wrong1.txt b/legacy/Data/Questions/ingsw/0222_35/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_35/wrong1.txt
rename to legacy/Data/Questions/ingsw/0222_35/wrong1.txt
diff --git a/Data/Questions/ingsw/0222_35/wrong2.txt b/legacy/Data/Questions/ingsw/0222_35/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_35/wrong2.txt
rename to legacy/Data/Questions/ingsw/0222_35/wrong2.txt
diff --git a/Data/Questions/ingsw/0222_39/correct.txt b/legacy/Data/Questions/ingsw/0222_39/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_39/correct.txt
rename to legacy/Data/Questions/ingsw/0222_39/correct.txt
diff --git a/Data/Questions/ingsw/0222_39/quest.txt b/legacy/Data/Questions/ingsw/0222_39/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_39/quest.txt
rename to legacy/Data/Questions/ingsw/0222_39/quest.txt
diff --git a/Data/Questions/ingsw/0222_39/wrong1.txt b/legacy/Data/Questions/ingsw/0222_39/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_39/wrong1.txt
rename to legacy/Data/Questions/ingsw/0222_39/wrong1.txt
diff --git a/Data/Questions/ingsw/0222_39/wrong2.txt b/legacy/Data/Questions/ingsw/0222_39/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_39/wrong2.txt
rename to legacy/Data/Questions/ingsw/0222_39/wrong2.txt
diff --git a/Data/Questions/ingsw/0222_41/correct.txt b/legacy/Data/Questions/ingsw/0222_41/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_41/correct.txt
rename to legacy/Data/Questions/ingsw/0222_41/correct.txt
diff --git a/Data/Questions/ingsw/0222_41/quest.txt b/legacy/Data/Questions/ingsw/0222_41/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_41/quest.txt
rename to legacy/Data/Questions/ingsw/0222_41/quest.txt
diff --git a/Data/Questions/ingsw/0222_41/wrong1.txt b/legacy/Data/Questions/ingsw/0222_41/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_41/wrong1.txt
rename to legacy/Data/Questions/ingsw/0222_41/wrong1.txt
diff --git a/Data/Questions/ingsw/0222_41/wrong2.txt b/legacy/Data/Questions/ingsw/0222_41/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_41/wrong2.txt
rename to legacy/Data/Questions/ingsw/0222_41/wrong2.txt
diff --git a/Data/Questions/ingsw/0222_5/correct.txt b/legacy/Data/Questions/ingsw/0222_5/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_5/correct.txt
rename to legacy/Data/Questions/ingsw/0222_5/correct.txt
diff --git a/Data/Questions/ingsw/0222_5/quest.txt b/legacy/Data/Questions/ingsw/0222_5/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_5/quest.txt
rename to legacy/Data/Questions/ingsw/0222_5/quest.txt
diff --git a/Data/Questions/ingsw/0222_5/wrong1.txt b/legacy/Data/Questions/ingsw/0222_5/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_5/wrong1.txt
rename to legacy/Data/Questions/ingsw/0222_5/wrong1.txt
diff --git a/Data/Questions/ingsw/0222_5/wrong2.txt b/legacy/Data/Questions/ingsw/0222_5/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_5/wrong2.txt
rename to legacy/Data/Questions/ingsw/0222_5/wrong2.txt
diff --git a/Data/Questions/ingsw/0222_50/correct.txt b/legacy/Data/Questions/ingsw/0222_50/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_50/correct.txt
rename to legacy/Data/Questions/ingsw/0222_50/correct.txt
diff --git a/Data/Questions/ingsw/0222_50/quest.txt b/legacy/Data/Questions/ingsw/0222_50/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_50/quest.txt
rename to legacy/Data/Questions/ingsw/0222_50/quest.txt
diff --git a/Data/Questions/ingsw/0222_50/wrong1.txt b/legacy/Data/Questions/ingsw/0222_50/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_50/wrong1.txt
rename to legacy/Data/Questions/ingsw/0222_50/wrong1.txt
diff --git a/Data/Questions/ingsw/0222_50/wrong2.txt b/legacy/Data/Questions/ingsw/0222_50/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_50/wrong2.txt
rename to legacy/Data/Questions/ingsw/0222_50/wrong2.txt
diff --git a/Data/Questions/ingsw/0222_7/correct.txt b/legacy/Data/Questions/ingsw/0222_7/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_7/correct.txt
rename to legacy/Data/Questions/ingsw/0222_7/correct.txt
diff --git a/Data/Questions/ingsw/0222_7/quest.txt b/legacy/Data/Questions/ingsw/0222_7/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_7/quest.txt
rename to legacy/Data/Questions/ingsw/0222_7/quest.txt
diff --git a/Data/Questions/ingsw/0222_7/wrong1.txt b/legacy/Data/Questions/ingsw/0222_7/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_7/wrong1.txt
rename to legacy/Data/Questions/ingsw/0222_7/wrong1.txt
diff --git a/Data/Questions/ingsw/0222_7/wrong2.txt b/legacy/Data/Questions/ingsw/0222_7/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0222_7/wrong2.txt
rename to legacy/Data/Questions/ingsw/0222_7/wrong2.txt
diff --git a/Data/Questions/ingsw/0321_1/correct.txt b/legacy/Data/Questions/ingsw/0321_1/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_1/correct.txt
rename to legacy/Data/Questions/ingsw/0321_1/correct.txt
diff --git a/Data/Questions/ingsw/0321_1/quest.txt b/legacy/Data/Questions/ingsw/0321_1/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_1/quest.txt
rename to legacy/Data/Questions/ingsw/0321_1/quest.txt
diff --git a/Data/Questions/ingsw/0321_1/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_1/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_1/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_1/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_1/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_1/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_1/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_1/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_10/correct.txt b/legacy/Data/Questions/ingsw/0321_10/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_10/correct.txt
rename to legacy/Data/Questions/ingsw/0321_10/correct.txt
diff --git a/Data/Questions/ingsw/0321_10/quest.txt b/legacy/Data/Questions/ingsw/0321_10/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_10/quest.txt
rename to legacy/Data/Questions/ingsw/0321_10/quest.txt
diff --git a/Data/Questions/ingsw/0321_10/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_10/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_10/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_10/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_10/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_10/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_10/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_10/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_11/correct.txt b/legacy/Data/Questions/ingsw/0321_11/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_11/correct.txt
rename to legacy/Data/Questions/ingsw/0321_11/correct.txt
diff --git a/Data/Questions/ingsw/0321_11/quest.txt b/legacy/Data/Questions/ingsw/0321_11/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_11/quest.txt
rename to legacy/Data/Questions/ingsw/0321_11/quest.txt
diff --git a/Data/Questions/ingsw/0321_11/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_11/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_11/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_11/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_11/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_11/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_11/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_11/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_12/correct.txt b/legacy/Data/Questions/ingsw/0321_12/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_12/correct.txt
rename to legacy/Data/Questions/ingsw/0321_12/correct.txt
diff --git a/Data/Questions/ingsw/0321_12/quest.txt b/legacy/Data/Questions/ingsw/0321_12/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_12/quest.txt
rename to legacy/Data/Questions/ingsw/0321_12/quest.txt
diff --git a/Data/Questions/ingsw/0321_12/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_12/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_12/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_12/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_12/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_12/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_12/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_12/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_13/correct.txt b/legacy/Data/Questions/ingsw/0321_13/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_13/correct.txt
rename to legacy/Data/Questions/ingsw/0321_13/correct.txt
diff --git a/Data/Questions/ingsw/0321_13/quest.txt b/legacy/Data/Questions/ingsw/0321_13/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_13/quest.txt
rename to legacy/Data/Questions/ingsw/0321_13/quest.txt
diff --git a/Data/Questions/ingsw/0321_13/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_13/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_13/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_13/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_13/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_13/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_13/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_13/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_14/correct.txt b/legacy/Data/Questions/ingsw/0321_14/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_14/correct.txt
rename to legacy/Data/Questions/ingsw/0321_14/correct.txt
diff --git a/Data/Questions/ingsw/0321_14/quest.txt b/legacy/Data/Questions/ingsw/0321_14/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_14/quest.txt
rename to legacy/Data/Questions/ingsw/0321_14/quest.txt
diff --git a/Data/Questions/ingsw/0321_14/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_14/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_14/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_14/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_14/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_14/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_14/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_14/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_15/correct.txt b/legacy/Data/Questions/ingsw/0321_15/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_15/correct.txt
rename to legacy/Data/Questions/ingsw/0321_15/correct.txt
diff --git a/Data/Questions/ingsw/0321_15/quest.txt b/legacy/Data/Questions/ingsw/0321_15/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_15/quest.txt
rename to legacy/Data/Questions/ingsw/0321_15/quest.txt
diff --git a/Data/Questions/ingsw/0321_15/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_15/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_15/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_15/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_15/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_15/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_15/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_15/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_16/correct.txt b/legacy/Data/Questions/ingsw/0321_16/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_16/correct.txt
rename to legacy/Data/Questions/ingsw/0321_16/correct.txt
diff --git a/Data/Questions/ingsw/0321_16/quest.txt b/legacy/Data/Questions/ingsw/0321_16/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_16/quest.txt
rename to legacy/Data/Questions/ingsw/0321_16/quest.txt
diff --git a/Data/Questions/ingsw/0321_16/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_16/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_16/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_16/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_16/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_16/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_16/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_16/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_17/correct.txt b/legacy/Data/Questions/ingsw/0321_17/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_17/correct.txt
rename to legacy/Data/Questions/ingsw/0321_17/correct.txt
diff --git a/Data/Questions/ingsw/0321_17/quest.txt b/legacy/Data/Questions/ingsw/0321_17/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_17/quest.txt
rename to legacy/Data/Questions/ingsw/0321_17/quest.txt
diff --git a/Data/Questions/ingsw/0321_17/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_17/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_17/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_17/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_17/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_17/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_17/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_17/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_18/correct.txt b/legacy/Data/Questions/ingsw/0321_18/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_18/correct.txt
rename to legacy/Data/Questions/ingsw/0321_18/correct.txt
diff --git a/Data/Questions/ingsw/0321_18/quest.txt b/legacy/Data/Questions/ingsw/0321_18/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_18/quest.txt
rename to legacy/Data/Questions/ingsw/0321_18/quest.txt
diff --git a/Data/Questions/ingsw/0321_18/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_18/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_18/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_18/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_18/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_18/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_18/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_18/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_19/correct.txt b/legacy/Data/Questions/ingsw/0321_19/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_19/correct.txt
rename to legacy/Data/Questions/ingsw/0321_19/correct.txt
diff --git a/Data/Questions/ingsw/0321_19/quest.txt b/legacy/Data/Questions/ingsw/0321_19/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_19/quest.txt
rename to legacy/Data/Questions/ingsw/0321_19/quest.txt
diff --git a/Data/Questions/ingsw/0321_19/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_19/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_19/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_19/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_19/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_19/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_19/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_19/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_2/correct.txt b/legacy/Data/Questions/ingsw/0321_2/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_2/correct.txt
rename to legacy/Data/Questions/ingsw/0321_2/correct.txt
diff --git a/Data/Questions/ingsw/0321_2/quest.txt b/legacy/Data/Questions/ingsw/0321_2/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_2/quest.txt
rename to legacy/Data/Questions/ingsw/0321_2/quest.txt
diff --git a/Data/Questions/ingsw/0321_2/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_2/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_2/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_2/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_2/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_2/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_2/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_2/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_20/correct.txt b/legacy/Data/Questions/ingsw/0321_20/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_20/correct.txt
rename to legacy/Data/Questions/ingsw/0321_20/correct.txt
diff --git a/Data/Questions/ingsw/0321_20/quest.txt b/legacy/Data/Questions/ingsw/0321_20/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_20/quest.txt
rename to legacy/Data/Questions/ingsw/0321_20/quest.txt
diff --git a/Data/Questions/ingsw/0321_20/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_20/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_20/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_20/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_20/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_20/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_20/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_20/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_21/correct.txt b/legacy/Data/Questions/ingsw/0321_21/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_21/correct.txt
rename to legacy/Data/Questions/ingsw/0321_21/correct.txt
diff --git a/Data/Questions/ingsw/0321_21/quest.txt b/legacy/Data/Questions/ingsw/0321_21/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_21/quest.txt
rename to legacy/Data/Questions/ingsw/0321_21/quest.txt
diff --git a/Data/Questions/ingsw/0321_21/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_21/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_21/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_21/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_21/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_21/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_21/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_21/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_23/correct.txt b/legacy/Data/Questions/ingsw/0321_23/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_23/correct.txt
rename to legacy/Data/Questions/ingsw/0321_23/correct.txt
diff --git a/Data/Questions/ingsw/0321_23/quest.txt b/legacy/Data/Questions/ingsw/0321_23/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_23/quest.txt
rename to legacy/Data/Questions/ingsw/0321_23/quest.txt
diff --git a/Data/Questions/ingsw/0321_23/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_23/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_23/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_23/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_23/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_23/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_23/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_23/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_24/correct.txt b/legacy/Data/Questions/ingsw/0321_24/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_24/correct.txt
rename to legacy/Data/Questions/ingsw/0321_24/correct.txt
diff --git a/Data/Questions/ingsw/0321_24/quest.txt b/legacy/Data/Questions/ingsw/0321_24/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_24/quest.txt
rename to legacy/Data/Questions/ingsw/0321_24/quest.txt
diff --git a/Data/Questions/ingsw/0321_24/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_24/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_24/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_24/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_24/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_24/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_24/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_24/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_27/correct.txt b/legacy/Data/Questions/ingsw/0321_27/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_27/correct.txt
rename to legacy/Data/Questions/ingsw/0321_27/correct.txt
diff --git a/Data/Questions/ingsw/0321_27/quest.txt b/legacy/Data/Questions/ingsw/0321_27/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_27/quest.txt
rename to legacy/Data/Questions/ingsw/0321_27/quest.txt
diff --git a/Data/Questions/ingsw/0321_27/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_27/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_27/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_27/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_27/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_27/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_27/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_27/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_28/correct.txt b/legacy/Data/Questions/ingsw/0321_28/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_28/correct.txt
rename to legacy/Data/Questions/ingsw/0321_28/correct.txt
diff --git a/Data/Questions/ingsw/0321_28/quest.txt b/legacy/Data/Questions/ingsw/0321_28/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_28/quest.txt
rename to legacy/Data/Questions/ingsw/0321_28/quest.txt
diff --git a/Data/Questions/ingsw/0321_28/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_28/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_28/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_28/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_28/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_28/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_28/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_28/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_29/correct.txt b/legacy/Data/Questions/ingsw/0321_29/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_29/correct.txt
rename to legacy/Data/Questions/ingsw/0321_29/correct.txt
diff --git a/Data/Questions/ingsw/0321_29/quest.txt b/legacy/Data/Questions/ingsw/0321_29/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_29/quest.txt
rename to legacy/Data/Questions/ingsw/0321_29/quest.txt
diff --git a/Data/Questions/ingsw/0321_29/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_29/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_29/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_29/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_29/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_29/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_29/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_29/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_30/correct.txt b/legacy/Data/Questions/ingsw/0321_30/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_30/correct.txt
rename to legacy/Data/Questions/ingsw/0321_30/correct.txt
diff --git a/Data/Questions/ingsw/0321_30/quest.txt b/legacy/Data/Questions/ingsw/0321_30/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_30/quest.txt
rename to legacy/Data/Questions/ingsw/0321_30/quest.txt
diff --git a/Data/Questions/ingsw/0321_30/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_30/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_30/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_30/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_30/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_30/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_30/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_30/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_31/correct.txt b/legacy/Data/Questions/ingsw/0321_31/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_31/correct.txt
rename to legacy/Data/Questions/ingsw/0321_31/correct.txt
diff --git a/Data/Questions/ingsw/0321_31/quest.txt b/legacy/Data/Questions/ingsw/0321_31/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_31/quest.txt
rename to legacy/Data/Questions/ingsw/0321_31/quest.txt
diff --git a/Data/Questions/ingsw/0321_31/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_31/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_31/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_31/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_31/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_31/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_31/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_31/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_32/correct.txt b/legacy/Data/Questions/ingsw/0321_32/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_32/correct.txt
rename to legacy/Data/Questions/ingsw/0321_32/correct.txt
diff --git a/Data/Questions/ingsw/0321_32/quest.txt b/legacy/Data/Questions/ingsw/0321_32/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_32/quest.txt
rename to legacy/Data/Questions/ingsw/0321_32/quest.txt
diff --git a/Data/Questions/ingsw/0321_32/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_32/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_32/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_32/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_32/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_32/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_32/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_32/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_36/correct.txt b/legacy/Data/Questions/ingsw/0321_36/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_36/correct.txt
rename to legacy/Data/Questions/ingsw/0321_36/correct.txt
diff --git a/Data/Questions/ingsw/0321_36/quest.txt b/legacy/Data/Questions/ingsw/0321_36/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_36/quest.txt
rename to legacy/Data/Questions/ingsw/0321_36/quest.txt
diff --git a/Data/Questions/ingsw/0321_36/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_36/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_36/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_36/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_36/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_36/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_36/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_36/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_37/correct.txt b/legacy/Data/Questions/ingsw/0321_37/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_37/correct.txt
rename to legacy/Data/Questions/ingsw/0321_37/correct.txt
diff --git a/Data/Questions/ingsw/0321_37/quest.txt b/legacy/Data/Questions/ingsw/0321_37/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_37/quest.txt
rename to legacy/Data/Questions/ingsw/0321_37/quest.txt
diff --git a/Data/Questions/ingsw/0321_37/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_37/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_37/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_37/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_37/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_37/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_37/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_37/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_38/correct.txt b/legacy/Data/Questions/ingsw/0321_38/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_38/correct.txt
rename to legacy/Data/Questions/ingsw/0321_38/correct.txt
diff --git a/Data/Questions/ingsw/0321_38/quest.txt b/legacy/Data/Questions/ingsw/0321_38/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_38/quest.txt
rename to legacy/Data/Questions/ingsw/0321_38/quest.txt
diff --git a/Data/Questions/ingsw/0321_38/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_38/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_38/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_38/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_38/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_38/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_38/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_38/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_4/correct.txt b/legacy/Data/Questions/ingsw/0321_4/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_4/correct.txt
rename to legacy/Data/Questions/ingsw/0321_4/correct.txt
diff --git a/Data/Questions/ingsw/0321_4/quest.txt b/legacy/Data/Questions/ingsw/0321_4/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_4/quest.txt
rename to legacy/Data/Questions/ingsw/0321_4/quest.txt
diff --git a/Data/Questions/ingsw/0321_4/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_4/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_4/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_4/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_4/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_4/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_4/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_4/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_40/correct.txt b/legacy/Data/Questions/ingsw/0321_40/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_40/correct.txt
rename to legacy/Data/Questions/ingsw/0321_40/correct.txt
diff --git a/Data/Questions/ingsw/0321_40/quest.txt b/legacy/Data/Questions/ingsw/0321_40/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_40/quest.txt
rename to legacy/Data/Questions/ingsw/0321_40/quest.txt
diff --git a/Data/Questions/ingsw/0321_40/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_40/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_40/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_40/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_40/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_40/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_40/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_40/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_8/correct.txt b/legacy/Data/Questions/ingsw/0321_8/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_8/correct.txt
rename to legacy/Data/Questions/ingsw/0321_8/correct.txt
diff --git a/Data/Questions/ingsw/0321_8/quest.txt b/legacy/Data/Questions/ingsw/0321_8/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_8/quest.txt
rename to legacy/Data/Questions/ingsw/0321_8/quest.txt
diff --git a/Data/Questions/ingsw/0321_8/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_8/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_8/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_8/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_8/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_8/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_8/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_8/wrong 2.txt
diff --git a/Data/Questions/ingsw/0321_9/correct.txt b/legacy/Data/Questions/ingsw/0321_9/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_9/correct.txt
rename to legacy/Data/Questions/ingsw/0321_9/correct.txt
diff --git a/Data/Questions/ingsw/0321_9/quest.txt b/legacy/Data/Questions/ingsw/0321_9/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_9/quest.txt
rename to legacy/Data/Questions/ingsw/0321_9/quest.txt
diff --git a/Data/Questions/ingsw/0321_9/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_9/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_9/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0321_9/wrong 1.txt
diff --git a/Data/Questions/ingsw/0321_9/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_9/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0321_9/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0321_9/wrong 2.txt
diff --git a/Data/Questions/ingsw/0324_0/correct.txt b/legacy/Data/Questions/ingsw/0324_0/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_0/correct.txt
rename to legacy/Data/Questions/ingsw/0324_0/correct.txt
diff --git a/Data/Questions/ingsw/0324_0/quest.txt b/legacy/Data/Questions/ingsw/0324_0/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_0/quest.txt
rename to legacy/Data/Questions/ingsw/0324_0/quest.txt
diff --git a/Data/Questions/ingsw/0324_0/wrong1.txt b/legacy/Data/Questions/ingsw/0324_0/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_0/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_0/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_0/wrong2.txt b/legacy/Data/Questions/ingsw/0324_0/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_0/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_0/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_1/quest.txt b/legacy/Data/Questions/ingsw/0324_1/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_1/quest.txt
rename to legacy/Data/Questions/ingsw/0324_1/quest.txt
diff --git a/Data/Questions/ingsw/0324_1/wrong1.txt b/legacy/Data/Questions/ingsw/0324_1/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_1/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_1/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_1/wrong2.txt b/legacy/Data/Questions/ingsw/0324_1/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_1/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_1/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_1/wrong3.txt b/legacy/Data/Questions/ingsw/0324_1/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_1/wrong3.txt
rename to legacy/Data/Questions/ingsw/0324_1/wrong3.txt
diff --git a/Data/Questions/ingsw/0324_10/correct.txt b/legacy/Data/Questions/ingsw/0324_10/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_10/correct.txt
rename to legacy/Data/Questions/ingsw/0324_10/correct.txt
diff --git a/Data/Questions/ingsw/0324_10/quest.txt b/legacy/Data/Questions/ingsw/0324_10/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_10/quest.txt
rename to legacy/Data/Questions/ingsw/0324_10/quest.txt
diff --git a/Data/Questions/ingsw/0324_10/wrong1.txt b/legacy/Data/Questions/ingsw/0324_10/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_10/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_10/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_10/wrong2.txt b/legacy/Data/Questions/ingsw/0324_10/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_10/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_10/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_11/quest.txt b/legacy/Data/Questions/ingsw/0324_11/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_11/quest.txt
rename to legacy/Data/Questions/ingsw/0324_11/quest.txt
diff --git a/Data/Questions/ingsw/0324_11/wrong1.txt b/legacy/Data/Questions/ingsw/0324_11/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_11/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_11/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_11/wrong2.txt b/legacy/Data/Questions/ingsw/0324_11/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_11/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_11/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_11/wrong3.txt b/legacy/Data/Questions/ingsw/0324_11/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_11/wrong3.txt
rename to legacy/Data/Questions/ingsw/0324_11/wrong3.txt
diff --git a/Data/Questions/ingsw/0324_12/correct.txt b/legacy/Data/Questions/ingsw/0324_12/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_12/correct.txt
rename to legacy/Data/Questions/ingsw/0324_12/correct.txt
diff --git a/Data/Questions/ingsw/0324_12/quest.txt b/legacy/Data/Questions/ingsw/0324_12/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_12/quest.txt
rename to legacy/Data/Questions/ingsw/0324_12/quest.txt
diff --git a/Data/Questions/ingsw/0324_12/wrong1.txt b/legacy/Data/Questions/ingsw/0324_12/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_12/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_12/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_12/wrong2.txt b/legacy/Data/Questions/ingsw/0324_12/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_12/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_12/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_13/correct.txt b/legacy/Data/Questions/ingsw/0324_13/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_13/correct.txt
rename to legacy/Data/Questions/ingsw/0324_13/correct.txt
diff --git a/Data/Questions/ingsw/0324_13/quest.txt b/legacy/Data/Questions/ingsw/0324_13/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_13/quest.txt
rename to legacy/Data/Questions/ingsw/0324_13/quest.txt
diff --git a/Data/Questions/ingsw/0324_13/wrong1.txt b/legacy/Data/Questions/ingsw/0324_13/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_13/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_13/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_13/wrong2.txt b/legacy/Data/Questions/ingsw/0324_13/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_13/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_13/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_14/correct.txt b/legacy/Data/Questions/ingsw/0324_14/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_14/correct.txt
rename to legacy/Data/Questions/ingsw/0324_14/correct.txt
diff --git a/Data/Questions/ingsw/0324_14/quest.txt b/legacy/Data/Questions/ingsw/0324_14/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_14/quest.txt
rename to legacy/Data/Questions/ingsw/0324_14/quest.txt
diff --git a/Data/Questions/ingsw/0324_14/wrong1.txt b/legacy/Data/Questions/ingsw/0324_14/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_14/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_14/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_14/wrong2.txt b/legacy/Data/Questions/ingsw/0324_14/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_14/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_14/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_15/correct.txt b/legacy/Data/Questions/ingsw/0324_15/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_15/correct.txt
rename to legacy/Data/Questions/ingsw/0324_15/correct.txt
diff --git a/Data/Questions/ingsw/0324_15/quest.txt b/legacy/Data/Questions/ingsw/0324_15/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_15/quest.txt
rename to legacy/Data/Questions/ingsw/0324_15/quest.txt
diff --git a/Data/Questions/ingsw/0324_15/wrong1.txt b/legacy/Data/Questions/ingsw/0324_15/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_15/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_15/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_15/wrong2.txt b/legacy/Data/Questions/ingsw/0324_15/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_15/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_15/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_16/correct.txt b/legacy/Data/Questions/ingsw/0324_16/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_16/correct.txt
rename to legacy/Data/Questions/ingsw/0324_16/correct.txt
diff --git a/Data/Questions/ingsw/0324_16/quest.txt b/legacy/Data/Questions/ingsw/0324_16/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_16/quest.txt
rename to legacy/Data/Questions/ingsw/0324_16/quest.txt
diff --git a/Data/Questions/ingsw/0324_16/wrong1.txt b/legacy/Data/Questions/ingsw/0324_16/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_16/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_16/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_16/wrong2.txt b/legacy/Data/Questions/ingsw/0324_16/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_16/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_16/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_17/correct.txt b/legacy/Data/Questions/ingsw/0324_17/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_17/correct.txt
rename to legacy/Data/Questions/ingsw/0324_17/correct.txt
diff --git a/Data/Questions/ingsw/0324_17/quest.txt b/legacy/Data/Questions/ingsw/0324_17/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_17/quest.txt
rename to legacy/Data/Questions/ingsw/0324_17/quest.txt
diff --git a/Data/Questions/ingsw/0324_17/wrong1.txt b/legacy/Data/Questions/ingsw/0324_17/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_17/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_17/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_17/wrong2.txt b/legacy/Data/Questions/ingsw/0324_17/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_17/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_17/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_18/correct.txt b/legacy/Data/Questions/ingsw/0324_18/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_18/correct.txt
rename to legacy/Data/Questions/ingsw/0324_18/correct.txt
diff --git a/Data/Questions/ingsw/0324_18/quest.txt b/legacy/Data/Questions/ingsw/0324_18/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_18/quest.txt
rename to legacy/Data/Questions/ingsw/0324_18/quest.txt
diff --git a/Data/Questions/ingsw/0324_18/wrong1.txt b/legacy/Data/Questions/ingsw/0324_18/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_18/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_18/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_18/wrong2.txt b/legacy/Data/Questions/ingsw/0324_18/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_18/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_18/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_19/correct.txt b/legacy/Data/Questions/ingsw/0324_19/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_19/correct.txt
rename to legacy/Data/Questions/ingsw/0324_19/correct.txt
diff --git a/Data/Questions/ingsw/0324_19/quest.txt b/legacy/Data/Questions/ingsw/0324_19/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_19/quest.txt
rename to legacy/Data/Questions/ingsw/0324_19/quest.txt
diff --git a/Data/Questions/ingsw/0324_19/wrong1.txt b/legacy/Data/Questions/ingsw/0324_19/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_19/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_19/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_19/wrong2.txt b/legacy/Data/Questions/ingsw/0324_19/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_19/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_19/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_2/correct.txt b/legacy/Data/Questions/ingsw/0324_2/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_2/correct.txt
rename to legacy/Data/Questions/ingsw/0324_2/correct.txt
diff --git a/Data/Questions/ingsw/0324_2/quest.txt b/legacy/Data/Questions/ingsw/0324_2/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_2/quest.txt
rename to legacy/Data/Questions/ingsw/0324_2/quest.txt
diff --git a/Data/Questions/ingsw/0324_2/wrong1.txt b/legacy/Data/Questions/ingsw/0324_2/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_2/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_2/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_2/wrong2.txt b/legacy/Data/Questions/ingsw/0324_2/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_2/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_2/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_20/correct.txt b/legacy/Data/Questions/ingsw/0324_20/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_20/correct.txt
rename to legacy/Data/Questions/ingsw/0324_20/correct.txt
diff --git a/Data/Questions/ingsw/0324_20/quest.txt b/legacy/Data/Questions/ingsw/0324_20/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_20/quest.txt
rename to legacy/Data/Questions/ingsw/0324_20/quest.txt
diff --git a/Data/Questions/ingsw/0324_20/wrong1.txt b/legacy/Data/Questions/ingsw/0324_20/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_20/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_20/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_20/wrong2.txt b/legacy/Data/Questions/ingsw/0324_20/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_20/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_20/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_21/correct.txt b/legacy/Data/Questions/ingsw/0324_21/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_21/correct.txt
rename to legacy/Data/Questions/ingsw/0324_21/correct.txt
diff --git a/Data/Questions/ingsw/0324_21/quest.txt b/legacy/Data/Questions/ingsw/0324_21/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_21/quest.txt
rename to legacy/Data/Questions/ingsw/0324_21/quest.txt
diff --git a/Data/Questions/ingsw/0324_21/wrong1.txt b/legacy/Data/Questions/ingsw/0324_21/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_21/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_21/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_21/wrong2.txt b/legacy/Data/Questions/ingsw/0324_21/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_21/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_21/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_22/correct.txt b/legacy/Data/Questions/ingsw/0324_22/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_22/correct.txt
rename to legacy/Data/Questions/ingsw/0324_22/correct.txt
diff --git a/Data/Questions/ingsw/0324_22/quest.txt b/legacy/Data/Questions/ingsw/0324_22/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_22/quest.txt
rename to legacy/Data/Questions/ingsw/0324_22/quest.txt
diff --git a/Data/Questions/ingsw/0324_22/wrong1.txt b/legacy/Data/Questions/ingsw/0324_22/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_22/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_22/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_22/wrong2.txt b/legacy/Data/Questions/ingsw/0324_22/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_22/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_22/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_23/correct.txt b/legacy/Data/Questions/ingsw/0324_23/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_23/correct.txt
rename to legacy/Data/Questions/ingsw/0324_23/correct.txt
diff --git a/Data/Questions/ingsw/0324_23/quest.txt b/legacy/Data/Questions/ingsw/0324_23/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_23/quest.txt
rename to legacy/Data/Questions/ingsw/0324_23/quest.txt
diff --git a/Data/Questions/ingsw/0324_23/wrong1.txt b/legacy/Data/Questions/ingsw/0324_23/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_23/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_23/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_23/wrong2.txt b/legacy/Data/Questions/ingsw/0324_23/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_23/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_23/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_24/correct.txt b/legacy/Data/Questions/ingsw/0324_24/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_24/correct.txt
rename to legacy/Data/Questions/ingsw/0324_24/correct.txt
diff --git a/Data/Questions/ingsw/0324_24/quest.txt b/legacy/Data/Questions/ingsw/0324_24/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_24/quest.txt
rename to legacy/Data/Questions/ingsw/0324_24/quest.txt
diff --git a/Data/Questions/ingsw/0324_24/wrong1.txt b/legacy/Data/Questions/ingsw/0324_24/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_24/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_24/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_24/wrong2.txt b/legacy/Data/Questions/ingsw/0324_24/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_24/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_24/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_25/correct.txt b/legacy/Data/Questions/ingsw/0324_25/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_25/correct.txt
rename to legacy/Data/Questions/ingsw/0324_25/correct.txt
diff --git a/Data/Questions/ingsw/0324_25/quest.txt b/legacy/Data/Questions/ingsw/0324_25/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_25/quest.txt
rename to legacy/Data/Questions/ingsw/0324_25/quest.txt
diff --git a/Data/Questions/ingsw/0324_25/wrong1.txt b/legacy/Data/Questions/ingsw/0324_25/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_25/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_25/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_25/wrong2.txt b/legacy/Data/Questions/ingsw/0324_25/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_25/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_25/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_26/quest.txt b/legacy/Data/Questions/ingsw/0324_26/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_26/quest.txt
rename to legacy/Data/Questions/ingsw/0324_26/quest.txt
diff --git a/Data/Questions/ingsw/0324_35/wrong1.txt b/legacy/Data/Questions/ingsw/0324_26/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_35/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_26/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_26/wrong2.txt b/legacy/Data/Questions/ingsw/0324_26/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_26/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_26/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_26/wrong3.txt b/legacy/Data/Questions/ingsw/0324_26/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_26/wrong3.txt
rename to legacy/Data/Questions/ingsw/0324_26/wrong3.txt
diff --git a/Data/Questions/ingsw/0324_27/correct.txt b/legacy/Data/Questions/ingsw/0324_27/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_27/correct.txt
rename to legacy/Data/Questions/ingsw/0324_27/correct.txt
diff --git a/Data/Questions/ingsw/0324_27/quest.txt b/legacy/Data/Questions/ingsw/0324_27/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_27/quest.txt
rename to legacy/Data/Questions/ingsw/0324_27/quest.txt
diff --git a/Data/Questions/ingsw/0324_27/wrong1.txt b/legacy/Data/Questions/ingsw/0324_27/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_27/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_27/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_27/wrong2.txt b/legacy/Data/Questions/ingsw/0324_27/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_27/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_27/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_28/correct.txt b/legacy/Data/Questions/ingsw/0324_28/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_28/correct.txt
rename to legacy/Data/Questions/ingsw/0324_28/correct.txt
diff --git a/Data/Questions/ingsw/0324_28/quest.txt b/legacy/Data/Questions/ingsw/0324_28/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_28/quest.txt
rename to legacy/Data/Questions/ingsw/0324_28/quest.txt
diff --git a/Data/Questions/ingsw/0324_28/wrong1.txt b/legacy/Data/Questions/ingsw/0324_28/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_28/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_28/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_28/wrong2.txt b/legacy/Data/Questions/ingsw/0324_28/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_28/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_28/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_29/correct.txt b/legacy/Data/Questions/ingsw/0324_29/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_29/correct.txt
rename to legacy/Data/Questions/ingsw/0324_29/correct.txt
diff --git a/Data/Questions/ingsw/0324_29/quest.txt b/legacy/Data/Questions/ingsw/0324_29/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_29/quest.txt
rename to legacy/Data/Questions/ingsw/0324_29/quest.txt
diff --git a/Data/Questions/ingsw/0324_29/wrong1.txt b/legacy/Data/Questions/ingsw/0324_29/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_29/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_29/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_29/wrong2.txt b/legacy/Data/Questions/ingsw/0324_29/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_29/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_29/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_3/correct.txt b/legacy/Data/Questions/ingsw/0324_3/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_3/correct.txt
rename to legacy/Data/Questions/ingsw/0324_3/correct.txt
diff --git a/Data/Questions/ingsw/0324_3/quest.txt b/legacy/Data/Questions/ingsw/0324_3/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_3/quest.txt
rename to legacy/Data/Questions/ingsw/0324_3/quest.txt
diff --git a/Data/Questions/ingsw/0324_3/wrong1.txt b/legacy/Data/Questions/ingsw/0324_3/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_3/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_3/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_3/wrong2.txt b/legacy/Data/Questions/ingsw/0324_3/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_3/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_3/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_30/quest.txt b/legacy/Data/Questions/ingsw/0324_30/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_30/quest.txt
rename to legacy/Data/Questions/ingsw/0324_30/quest.txt
diff --git a/Data/Questions/ingsw/0324_30/wrong1.txt b/legacy/Data/Questions/ingsw/0324_30/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_30/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_30/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_30/wrong2.txt b/legacy/Data/Questions/ingsw/0324_30/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_30/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_30/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_30/wrong3.txt b/legacy/Data/Questions/ingsw/0324_30/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_30/wrong3.txt
rename to legacy/Data/Questions/ingsw/0324_30/wrong3.txt
diff --git a/Data/Questions/ingsw/0324_31/correct.txt b/legacy/Data/Questions/ingsw/0324_31/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_31/correct.txt
rename to legacy/Data/Questions/ingsw/0324_31/correct.txt
diff --git a/Data/Questions/ingsw/0324_31/quest.txt b/legacy/Data/Questions/ingsw/0324_31/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_31/quest.txt
rename to legacy/Data/Questions/ingsw/0324_31/quest.txt
diff --git a/Data/Questions/ingsw/0324_31/wrong1.txt b/legacy/Data/Questions/ingsw/0324_31/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_31/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_31/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_31/wrong2.txt b/legacy/Data/Questions/ingsw/0324_31/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_31/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_31/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_32/correct.txt b/legacy/Data/Questions/ingsw/0324_32/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_32/correct.txt
rename to legacy/Data/Questions/ingsw/0324_32/correct.txt
diff --git a/Data/Questions/ingsw/0324_32/quest.txt b/legacy/Data/Questions/ingsw/0324_32/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_32/quest.txt
rename to legacy/Data/Questions/ingsw/0324_32/quest.txt
diff --git a/Data/Questions/ingsw/0324_32/wrong1.txt b/legacy/Data/Questions/ingsw/0324_32/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_32/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_32/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_32/wrong2.txt b/legacy/Data/Questions/ingsw/0324_32/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_32/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_32/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_33/correct.txt b/legacy/Data/Questions/ingsw/0324_33/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_33/correct.txt
rename to legacy/Data/Questions/ingsw/0324_33/correct.txt
diff --git a/Data/Questions/ingsw/0324_33/quest.txt b/legacy/Data/Questions/ingsw/0324_33/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_33/quest.txt
rename to legacy/Data/Questions/ingsw/0324_33/quest.txt
diff --git a/Data/Questions/ingsw/0324_33/wrong1.txt b/legacy/Data/Questions/ingsw/0324_33/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_33/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_33/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_33/wrong2.txt b/legacy/Data/Questions/ingsw/0324_33/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_33/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_33/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_34/correct.txt b/legacy/Data/Questions/ingsw/0324_34/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_34/correct.txt
rename to legacy/Data/Questions/ingsw/0324_34/correct.txt
diff --git a/Data/Questions/ingsw/0324_34/quest.txt b/legacy/Data/Questions/ingsw/0324_34/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_34/quest.txt
rename to legacy/Data/Questions/ingsw/0324_34/quest.txt
diff --git a/Data/Questions/ingsw/0324_34/wrong1.txt b/legacy/Data/Questions/ingsw/0324_34/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_34/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_34/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_34/wrong2.txt b/legacy/Data/Questions/ingsw/0324_34/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_34/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_34/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_35/quest.txt b/legacy/Data/Questions/ingsw/0324_35/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_35/quest.txt
rename to legacy/Data/Questions/ingsw/0324_35/quest.txt
diff --git a/Data/Questions/ingsw/0324_42/wrong1.txt b/legacy/Data/Questions/ingsw/0324_35/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_42/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_35/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_35/wrong2.txt b/legacy/Data/Questions/ingsw/0324_35/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_35/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_35/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_35/wrong3.txt b/legacy/Data/Questions/ingsw/0324_35/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_35/wrong3.txt
rename to legacy/Data/Questions/ingsw/0324_35/wrong3.txt
diff --git a/Data/Questions/ingsw/0324_36/correct.txt b/legacy/Data/Questions/ingsw/0324_36/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_36/correct.txt
rename to legacy/Data/Questions/ingsw/0324_36/correct.txt
diff --git a/Data/Questions/ingsw/0324_36/quest.txt b/legacy/Data/Questions/ingsw/0324_36/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_36/quest.txt
rename to legacy/Data/Questions/ingsw/0324_36/quest.txt
diff --git a/Data/Questions/ingsw/0324_36/wrong1.txt b/legacy/Data/Questions/ingsw/0324_36/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_36/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_36/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_36/wrong2.txt b/legacy/Data/Questions/ingsw/0324_36/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_36/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_36/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_37/correct.txt b/legacy/Data/Questions/ingsw/0324_37/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_37/correct.txt
rename to legacy/Data/Questions/ingsw/0324_37/correct.txt
diff --git a/Data/Questions/ingsw/0324_37/quest.txt b/legacy/Data/Questions/ingsw/0324_37/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_37/quest.txt
rename to legacy/Data/Questions/ingsw/0324_37/quest.txt
diff --git a/Data/Questions/ingsw/0324_37/wrong1.txt b/legacy/Data/Questions/ingsw/0324_37/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_37/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_37/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_37/wrong2.txt b/legacy/Data/Questions/ingsw/0324_37/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_37/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_37/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_38/correct.txt b/legacy/Data/Questions/ingsw/0324_38/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_38/correct.txt
rename to legacy/Data/Questions/ingsw/0324_38/correct.txt
diff --git a/Data/Questions/ingsw/0324_38/quest.txt b/legacy/Data/Questions/ingsw/0324_38/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_38/quest.txt
rename to legacy/Data/Questions/ingsw/0324_38/quest.txt
diff --git a/Data/Questions/ingsw/0324_38/wrong1.txt b/legacy/Data/Questions/ingsw/0324_38/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_38/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_38/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_38/wrong2.txt b/legacy/Data/Questions/ingsw/0324_38/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_38/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_38/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_39/correct.txt b/legacy/Data/Questions/ingsw/0324_39/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_39/correct.txt
rename to legacy/Data/Questions/ingsw/0324_39/correct.txt
diff --git a/Data/Questions/ingsw/0324_39/quest.txt b/legacy/Data/Questions/ingsw/0324_39/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_39/quest.txt
rename to legacy/Data/Questions/ingsw/0324_39/quest.txt
diff --git a/Data/Questions/ingsw/0324_39/wrong1.txt b/legacy/Data/Questions/ingsw/0324_39/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_39/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_39/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_39/wrong2.txt b/legacy/Data/Questions/ingsw/0324_39/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_39/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_39/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_4/correct.txt b/legacy/Data/Questions/ingsw/0324_4/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_4/correct.txt
rename to legacy/Data/Questions/ingsw/0324_4/correct.txt
diff --git a/Data/Questions/ingsw/0324_4/quest.txt b/legacy/Data/Questions/ingsw/0324_4/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_4/quest.txt
rename to legacy/Data/Questions/ingsw/0324_4/quest.txt
diff --git a/Data/Questions/ingsw/0324_4/wrong1.txt b/legacy/Data/Questions/ingsw/0324_4/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_4/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_4/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_4/wrong2.txt b/legacy/Data/Questions/ingsw/0324_4/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_4/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_4/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_40/correct.txt b/legacy/Data/Questions/ingsw/0324_40/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_40/correct.txt
rename to legacy/Data/Questions/ingsw/0324_40/correct.txt
diff --git a/Data/Questions/ingsw/0324_40/quest.txt b/legacy/Data/Questions/ingsw/0324_40/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_40/quest.txt
rename to legacy/Data/Questions/ingsw/0324_40/quest.txt
diff --git a/Data/Questions/ingsw/0324_40/wrong1.txt b/legacy/Data/Questions/ingsw/0324_40/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_40/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_40/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_40/wrong2.txt b/legacy/Data/Questions/ingsw/0324_40/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_40/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_40/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_41/quest.txt b/legacy/Data/Questions/ingsw/0324_41/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_41/quest.txt
rename to legacy/Data/Questions/ingsw/0324_41/quest.txt
diff --git a/Data/Questions/ingsw/0324_41/wrong1.txt b/legacy/Data/Questions/ingsw/0324_41/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_41/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_41/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_41/wrong2.txt b/legacy/Data/Questions/ingsw/0324_41/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_41/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_41/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_41/wrong3.txt b/legacy/Data/Questions/ingsw/0324_41/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_41/wrong3.txt
rename to legacy/Data/Questions/ingsw/0324_41/wrong3.txt
diff --git a/Data/Questions/ingsw/0324_42/quest.txt b/legacy/Data/Questions/ingsw/0324_42/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_42/quest.txt
rename to legacy/Data/Questions/ingsw/0324_42/quest.txt
diff --git a/Data/Questions/ingsw/0324_47/wrong1.txt b/legacy/Data/Questions/ingsw/0324_42/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_47/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_42/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_42/wrong2.txt b/legacy/Data/Questions/ingsw/0324_42/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_42/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_42/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_42/wrong3.txt b/legacy/Data/Questions/ingsw/0324_42/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_42/wrong3.txt
rename to legacy/Data/Questions/ingsw/0324_42/wrong3.txt
diff --git a/Data/Questions/ingsw/0324_43/correct.txt b/legacy/Data/Questions/ingsw/0324_43/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_43/correct.txt
rename to legacy/Data/Questions/ingsw/0324_43/correct.txt
diff --git a/Data/Questions/ingsw/0324_43/quest.txt b/legacy/Data/Questions/ingsw/0324_43/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_43/quest.txt
rename to legacy/Data/Questions/ingsw/0324_43/quest.txt
diff --git a/Data/Questions/ingsw/0324_43/wrong1.txt b/legacy/Data/Questions/ingsw/0324_43/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_43/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_43/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_43/wrong2.txt b/legacy/Data/Questions/ingsw/0324_43/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_43/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_43/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_44/correct.txt b/legacy/Data/Questions/ingsw/0324_44/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_44/correct.txt
rename to legacy/Data/Questions/ingsw/0324_44/correct.txt
diff --git a/Data/Questions/ingsw/0324_44/quest.txt b/legacy/Data/Questions/ingsw/0324_44/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_44/quest.txt
rename to legacy/Data/Questions/ingsw/0324_44/quest.txt
diff --git a/Data/Questions/ingsw/0324_44/wrong1.txt b/legacy/Data/Questions/ingsw/0324_44/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_44/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_44/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_44/wrong2.txt b/legacy/Data/Questions/ingsw/0324_44/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_44/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_44/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_45/correct.txt b/legacy/Data/Questions/ingsw/0324_45/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_45/correct.txt
rename to legacy/Data/Questions/ingsw/0324_45/correct.txt
diff --git a/Data/Questions/ingsw/0324_45/quest.txt b/legacy/Data/Questions/ingsw/0324_45/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_45/quest.txt
rename to legacy/Data/Questions/ingsw/0324_45/quest.txt
diff --git a/Data/Questions/ingsw/0324_45/wrong1.txt b/legacy/Data/Questions/ingsw/0324_45/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_45/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_45/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_45/wrong2.txt b/legacy/Data/Questions/ingsw/0324_45/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_45/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_45/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_46/correct.txt b/legacy/Data/Questions/ingsw/0324_46/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_46/correct.txt
rename to legacy/Data/Questions/ingsw/0324_46/correct.txt
diff --git a/Data/Questions/ingsw/0324_46/quest.txt b/legacy/Data/Questions/ingsw/0324_46/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_46/quest.txt
rename to legacy/Data/Questions/ingsw/0324_46/quest.txt
diff --git a/Data/Questions/ingsw/0324_46/wrong1.txt b/legacy/Data/Questions/ingsw/0324_46/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_46/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_46/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_46/wrong2.txt b/legacy/Data/Questions/ingsw/0324_46/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_46/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_46/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_47/quest.txt b/legacy/Data/Questions/ingsw/0324_47/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_47/quest.txt
rename to legacy/Data/Questions/ingsw/0324_47/quest.txt
diff --git a/Data/Questions/ingsw/0613_0/wrong1.txt b/legacy/Data/Questions/ingsw/0324_47/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_0/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_47/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_47/wrong2.txt b/legacy/Data/Questions/ingsw/0324_47/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_47/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_47/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_47/wrong3.txt b/legacy/Data/Questions/ingsw/0324_47/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_47/wrong3.txt
rename to legacy/Data/Questions/ingsw/0324_47/wrong3.txt
diff --git a/Data/Questions/ingsw/0324_48/quest.txt b/legacy/Data/Questions/ingsw/0324_48/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_48/quest.txt
rename to legacy/Data/Questions/ingsw/0324_48/quest.txt
diff --git a/Data/Questions/ingsw/0324_48/wrong1.txt b/legacy/Data/Questions/ingsw/0324_48/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_48/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_48/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_48/wrong2.txt b/legacy/Data/Questions/ingsw/0324_48/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_48/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_48/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_48/wrong3.txt b/legacy/Data/Questions/ingsw/0324_48/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_48/wrong3.txt
rename to legacy/Data/Questions/ingsw/0324_48/wrong3.txt
diff --git a/Data/Questions/ingsw/0324_49/correct.txt b/legacy/Data/Questions/ingsw/0324_49/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_49/correct.txt
rename to legacy/Data/Questions/ingsw/0324_49/correct.txt
diff --git a/Data/Questions/ingsw/0324_49/quest.txt b/legacy/Data/Questions/ingsw/0324_49/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_49/quest.txt
rename to legacy/Data/Questions/ingsw/0324_49/quest.txt
diff --git a/Data/Questions/ingsw/0324_49/wrong1.txt b/legacy/Data/Questions/ingsw/0324_49/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_49/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_49/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_49/wrong2.txt b/legacy/Data/Questions/ingsw/0324_49/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_49/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_49/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_5/correct.txt b/legacy/Data/Questions/ingsw/0324_5/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_5/correct.txt
rename to legacy/Data/Questions/ingsw/0324_5/correct.txt
diff --git a/Data/Questions/ingsw/0324_5/quest.txt b/legacy/Data/Questions/ingsw/0324_5/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_5/quest.txt
rename to legacy/Data/Questions/ingsw/0324_5/quest.txt
diff --git a/Data/Questions/ingsw/0324_5/wrong1.txt b/legacy/Data/Questions/ingsw/0324_5/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_5/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_5/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_5/wrong2.txt b/legacy/Data/Questions/ingsw/0324_5/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_5/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_5/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_6/correct.txt b/legacy/Data/Questions/ingsw/0324_6/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_6/correct.txt
rename to legacy/Data/Questions/ingsw/0324_6/correct.txt
diff --git a/Data/Questions/ingsw/0324_6/quest.txt b/legacy/Data/Questions/ingsw/0324_6/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_6/quest.txt
rename to legacy/Data/Questions/ingsw/0324_6/quest.txt
diff --git a/Data/Questions/ingsw/0324_6/wrong1.txt b/legacy/Data/Questions/ingsw/0324_6/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_6/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_6/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_6/wrong2.txt b/legacy/Data/Questions/ingsw/0324_6/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_6/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_6/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_7/correct.txt b/legacy/Data/Questions/ingsw/0324_7/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_7/correct.txt
rename to legacy/Data/Questions/ingsw/0324_7/correct.txt
diff --git a/Data/Questions/ingsw/0324_7/quest.txt b/legacy/Data/Questions/ingsw/0324_7/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_7/quest.txt
rename to legacy/Data/Questions/ingsw/0324_7/quest.txt
diff --git a/Data/Questions/ingsw/0324_7/wrong1.txt b/legacy/Data/Questions/ingsw/0324_7/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_7/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_7/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_7/wrong2.txt b/legacy/Data/Questions/ingsw/0324_7/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_7/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_7/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_8/correct.txt b/legacy/Data/Questions/ingsw/0324_8/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_8/correct.txt
rename to legacy/Data/Questions/ingsw/0324_8/correct.txt
diff --git a/Data/Questions/ingsw/0324_8/quest.txt b/legacy/Data/Questions/ingsw/0324_8/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_8/quest.txt
rename to legacy/Data/Questions/ingsw/0324_8/quest.txt
diff --git a/Data/Questions/ingsw/0324_8/wrong1.txt b/legacy/Data/Questions/ingsw/0324_8/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_8/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_8/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_8/wrong2.txt b/legacy/Data/Questions/ingsw/0324_8/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_8/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_8/wrong2.txt
diff --git a/Data/Questions/ingsw/0324_9/correct.txt b/legacy/Data/Questions/ingsw/0324_9/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_9/correct.txt
rename to legacy/Data/Questions/ingsw/0324_9/correct.txt
diff --git a/Data/Questions/ingsw/0324_9/quest.txt b/legacy/Data/Questions/ingsw/0324_9/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_9/quest.txt
rename to legacy/Data/Questions/ingsw/0324_9/quest.txt
diff --git a/Data/Questions/ingsw/0324_9/wrong1.txt b/legacy/Data/Questions/ingsw/0324_9/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_9/wrong1.txt
rename to legacy/Data/Questions/ingsw/0324_9/wrong1.txt
diff --git a/Data/Questions/ingsw/0324_9/wrong2.txt b/legacy/Data/Questions/ingsw/0324_9/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0324_9/wrong2.txt
rename to legacy/Data/Questions/ingsw/0324_9/wrong2.txt
diff --git a/Data/Questions/ingsw/0422-16/correct.txt b/legacy/Data/Questions/ingsw/0422-16/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0422-16/correct.txt
rename to legacy/Data/Questions/ingsw/0422-16/correct.txt
diff --git a/Data/Questions/ingsw/0422-16/quest.txt b/legacy/Data/Questions/ingsw/0422-16/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0422-16/quest.txt
rename to legacy/Data/Questions/ingsw/0422-16/quest.txt
diff --git a/Data/Questions/ingsw/0422-16/wrong1.txt b/legacy/Data/Questions/ingsw/0422-16/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0422-16/wrong1.txt
rename to legacy/Data/Questions/ingsw/0422-16/wrong1.txt
diff --git a/Data/Questions/ingsw/0422-16/wrong2.txt b/legacy/Data/Questions/ingsw/0422-16/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0422-16/wrong2.txt
rename to legacy/Data/Questions/ingsw/0422-16/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_0/quest.txt b/legacy/Data/Questions/ingsw/0613_0/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_0/quest.txt
rename to legacy/Data/Questions/ingsw/0613_0/quest.txt
diff --git a/Data/Questions/ingsw/0613_14/wrong1.txt b/legacy/Data/Questions/ingsw/0613_0/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_14/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_0/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_0/wrong2.txt b/legacy/Data/Questions/ingsw/0613_0/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_0/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_0/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_0/wrong3.txt b/legacy/Data/Questions/ingsw/0613_0/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_0/wrong3.txt
rename to legacy/Data/Questions/ingsw/0613_0/wrong3.txt
diff --git a/Data/Questions/ingsw/0613_1/correct.txt b/legacy/Data/Questions/ingsw/0613_1/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_1/correct.txt
rename to legacy/Data/Questions/ingsw/0613_1/correct.txt
diff --git a/Data/Questions/ingsw/0613_1/quest.txt b/legacy/Data/Questions/ingsw/0613_1/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_1/quest.txt
rename to legacy/Data/Questions/ingsw/0613_1/quest.txt
diff --git a/Data/Questions/ingsw/0613_1/wrong1.txt b/legacy/Data/Questions/ingsw/0613_1/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_1/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_1/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_1/wrong2.txt b/legacy/Data/Questions/ingsw/0613_1/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_1/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_1/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_10/correct.txt b/legacy/Data/Questions/ingsw/0613_10/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_10/correct.txt
rename to legacy/Data/Questions/ingsw/0613_10/correct.txt
diff --git a/Data/Questions/ingsw/0613_10/quest.txt b/legacy/Data/Questions/ingsw/0613_10/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_10/quest.txt
rename to legacy/Data/Questions/ingsw/0613_10/quest.txt
diff --git a/Data/Questions/ingsw/0613_10/wrong1.txt b/legacy/Data/Questions/ingsw/0613_10/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_10/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_10/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_10/wrong2.txt b/legacy/Data/Questions/ingsw/0613_10/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_10/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_10/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_11/correct.txt b/legacy/Data/Questions/ingsw/0613_11/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_11/correct.txt
rename to legacy/Data/Questions/ingsw/0613_11/correct.txt
diff --git a/Data/Questions/ingsw/0613_11/quest.txt b/legacy/Data/Questions/ingsw/0613_11/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_11/quest.txt
rename to legacy/Data/Questions/ingsw/0613_11/quest.txt
diff --git a/Data/Questions/ingsw/0613_11/wrong1.txt b/legacy/Data/Questions/ingsw/0613_11/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_11/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_11/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_11/wrong2.txt b/legacy/Data/Questions/ingsw/0613_11/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_11/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_11/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_12/correct.txt b/legacy/Data/Questions/ingsw/0613_12/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_12/correct.txt
rename to legacy/Data/Questions/ingsw/0613_12/correct.txt
diff --git a/Data/Questions/ingsw/0613_12/quest.txt b/legacy/Data/Questions/ingsw/0613_12/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_12/quest.txt
rename to legacy/Data/Questions/ingsw/0613_12/quest.txt
diff --git a/Data/Questions/ingsw/0613_12/wrong1.txt b/legacy/Data/Questions/ingsw/0613_12/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_12/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_12/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_12/wrong2.txt b/legacy/Data/Questions/ingsw/0613_12/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_12/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_12/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_13/correct.txt b/legacy/Data/Questions/ingsw/0613_13/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_13/correct.txt
rename to legacy/Data/Questions/ingsw/0613_13/correct.txt
diff --git a/Data/Questions/ingsw/0613_13/quest.txt b/legacy/Data/Questions/ingsw/0613_13/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_13/quest.txt
rename to legacy/Data/Questions/ingsw/0613_13/quest.txt
diff --git a/Data/Questions/ingsw/0613_13/wrong1.txt b/legacy/Data/Questions/ingsw/0613_13/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_13/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_13/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_13/wrong2.txt b/legacy/Data/Questions/ingsw/0613_13/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_13/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_13/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_14/quest.txt b/legacy/Data/Questions/ingsw/0613_14/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_14/quest.txt
rename to legacy/Data/Questions/ingsw/0613_14/quest.txt
diff --git a/Data/Questions/ingsw/0613_19/wrong1.txt b/legacy/Data/Questions/ingsw/0613_14/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_19/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_14/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_14/wrong2.txt b/legacy/Data/Questions/ingsw/0613_14/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_14/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_14/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_14/wrong3.txt b/legacy/Data/Questions/ingsw/0613_14/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_14/wrong3.txt
rename to legacy/Data/Questions/ingsw/0613_14/wrong3.txt
diff --git a/Data/Questions/ingsw/0613_15/correct.txt b/legacy/Data/Questions/ingsw/0613_15/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_15/correct.txt
rename to legacy/Data/Questions/ingsw/0613_15/correct.txt
diff --git a/Data/Questions/ingsw/0613_15/quest.txt b/legacy/Data/Questions/ingsw/0613_15/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_15/quest.txt
rename to legacy/Data/Questions/ingsw/0613_15/quest.txt
diff --git a/Data/Questions/ingsw/0613_15/wrong1.txt b/legacy/Data/Questions/ingsw/0613_15/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_15/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_15/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_15/wrong2.txt b/legacy/Data/Questions/ingsw/0613_15/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_15/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_15/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_16/correct.txt b/legacy/Data/Questions/ingsw/0613_16/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_16/correct.txt
rename to legacy/Data/Questions/ingsw/0613_16/correct.txt
diff --git a/Data/Questions/ingsw/0613_16/quest.txt b/legacy/Data/Questions/ingsw/0613_16/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_16/quest.txt
rename to legacy/Data/Questions/ingsw/0613_16/quest.txt
diff --git a/Data/Questions/ingsw/0613_16/wrong1.txt b/legacy/Data/Questions/ingsw/0613_16/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_16/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_16/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_16/wrong2.txt b/legacy/Data/Questions/ingsw/0613_16/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_16/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_16/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_17/correct.txt b/legacy/Data/Questions/ingsw/0613_17/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_17/correct.txt
rename to legacy/Data/Questions/ingsw/0613_17/correct.txt
diff --git a/Data/Questions/ingsw/0613_17/quest.txt b/legacy/Data/Questions/ingsw/0613_17/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_17/quest.txt
rename to legacy/Data/Questions/ingsw/0613_17/quest.txt
diff --git a/Data/Questions/ingsw/0613_17/wrong1.txt b/legacy/Data/Questions/ingsw/0613_17/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_17/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_17/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_17/wrong2.txt b/legacy/Data/Questions/ingsw/0613_17/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_17/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_17/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_18/correct.txt b/legacy/Data/Questions/ingsw/0613_18/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_18/correct.txt
rename to legacy/Data/Questions/ingsw/0613_18/correct.txt
diff --git a/Data/Questions/ingsw/0613_18/quest.txt b/legacy/Data/Questions/ingsw/0613_18/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_18/quest.txt
rename to legacy/Data/Questions/ingsw/0613_18/quest.txt
diff --git a/Data/Questions/ingsw/0613_18/wrong1.txt b/legacy/Data/Questions/ingsw/0613_18/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_18/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_18/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_18/wrong2.txt b/legacy/Data/Questions/ingsw/0613_18/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_18/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_18/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_19/quest.txt b/legacy/Data/Questions/ingsw/0613_19/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_19/quest.txt
rename to legacy/Data/Questions/ingsw/0613_19/quest.txt
diff --git a/Data/Questions/ingsw/0613_2/wrong1.txt b/legacy/Data/Questions/ingsw/0613_19/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_2/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_19/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_19/wrong2.txt b/legacy/Data/Questions/ingsw/0613_19/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_19/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_19/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_19/wrong3.txt b/legacy/Data/Questions/ingsw/0613_19/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_19/wrong3.txt
rename to legacy/Data/Questions/ingsw/0613_19/wrong3.txt
diff --git a/Data/Questions/ingsw/0613_2/quest.txt b/legacy/Data/Questions/ingsw/0613_2/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_2/quest.txt
rename to legacy/Data/Questions/ingsw/0613_2/quest.txt
diff --git a/Data/Questions/ingsw/0613_2/wrong2.txt b/legacy/Data/Questions/ingsw/0613_2/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_2/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_2/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_2/wrong3.txt b/legacy/Data/Questions/ingsw/0613_2/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_2/wrong3.txt
rename to legacy/Data/Questions/ingsw/0613_2/wrong2.txt
diff --git a/legacy/Data/Questions/ingsw/0613_2/wrong3.txt b/legacy/Data/Questions/ingsw/0613_2/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/Data/Questions/ingsw/0613_20/correct.txt b/legacy/Data/Questions/ingsw/0613_20/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_20/correct.txt
rename to legacy/Data/Questions/ingsw/0613_20/correct.txt
diff --git a/Data/Questions/ingsw/0613_20/quest.txt b/legacy/Data/Questions/ingsw/0613_20/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_20/quest.txt
rename to legacy/Data/Questions/ingsw/0613_20/quest.txt
diff --git a/Data/Questions/ingsw/0613_20/wrong1.txt b/legacy/Data/Questions/ingsw/0613_20/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_20/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_20/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_20/wrong2.txt b/legacy/Data/Questions/ingsw/0613_20/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_20/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_20/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_21/correct.txt b/legacy/Data/Questions/ingsw/0613_21/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_21/correct.txt
rename to legacy/Data/Questions/ingsw/0613_21/correct.txt
diff --git a/Data/Questions/ingsw/0613_21/quest.txt b/legacy/Data/Questions/ingsw/0613_21/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_21/quest.txt
rename to legacy/Data/Questions/ingsw/0613_21/quest.txt
diff --git a/Data/Questions/ingsw/0613_21/wrong1.txt b/legacy/Data/Questions/ingsw/0613_21/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_21/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_21/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_21/wrong2.txt b/legacy/Data/Questions/ingsw/0613_21/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_21/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_21/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_22/correct.txt b/legacy/Data/Questions/ingsw/0613_22/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_22/correct.txt
rename to legacy/Data/Questions/ingsw/0613_22/correct.txt
diff --git a/Data/Questions/ingsw/0613_22/quest.txt b/legacy/Data/Questions/ingsw/0613_22/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_22/quest.txt
rename to legacy/Data/Questions/ingsw/0613_22/quest.txt
diff --git a/Data/Questions/ingsw/0613_22/wrong1.txt b/legacy/Data/Questions/ingsw/0613_22/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_22/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_22/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_22/wrong2.txt b/legacy/Data/Questions/ingsw/0613_22/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_22/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_22/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_23/correct.txt b/legacy/Data/Questions/ingsw/0613_23/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_23/correct.txt
rename to legacy/Data/Questions/ingsw/0613_23/correct.txt
diff --git a/Data/Questions/ingsw/0613_23/quest.txt b/legacy/Data/Questions/ingsw/0613_23/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_23/quest.txt
rename to legacy/Data/Questions/ingsw/0613_23/quest.txt
diff --git a/Data/Questions/ingsw/0613_23/wrong1.txt b/legacy/Data/Questions/ingsw/0613_23/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_23/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_23/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_23/wrong2.txt b/legacy/Data/Questions/ingsw/0613_23/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_23/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_23/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_24/correct.txt b/legacy/Data/Questions/ingsw/0613_24/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_24/correct.txt
rename to legacy/Data/Questions/ingsw/0613_24/correct.txt
diff --git a/Data/Questions/ingsw/0613_24/quest.txt b/legacy/Data/Questions/ingsw/0613_24/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_24/quest.txt
rename to legacy/Data/Questions/ingsw/0613_24/quest.txt
diff --git a/Data/Questions/ingsw/0613_24/wrong1.txt b/legacy/Data/Questions/ingsw/0613_24/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_24/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_24/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_24/wrong2.txt b/legacy/Data/Questions/ingsw/0613_24/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_24/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_24/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_25/correct.txt b/legacy/Data/Questions/ingsw/0613_25/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_25/correct.txt
rename to legacy/Data/Questions/ingsw/0613_25/correct.txt
diff --git a/Data/Questions/ingsw/0613_25/quest.txt b/legacy/Data/Questions/ingsw/0613_25/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_25/quest.txt
rename to legacy/Data/Questions/ingsw/0613_25/quest.txt
diff --git a/Data/Questions/ingsw/0613_25/wrong1.txt b/legacy/Data/Questions/ingsw/0613_25/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_25/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_25/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_25/wrong2.txt b/legacy/Data/Questions/ingsw/0613_25/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_25/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_25/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_26/correct.txt b/legacy/Data/Questions/ingsw/0613_26/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_26/correct.txt
rename to legacy/Data/Questions/ingsw/0613_26/correct.txt
diff --git a/Data/Questions/ingsw/0613_26/quest.txt b/legacy/Data/Questions/ingsw/0613_26/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_26/quest.txt
rename to legacy/Data/Questions/ingsw/0613_26/quest.txt
diff --git a/Data/Questions/ingsw/0613_26/wrong1.txt b/legacy/Data/Questions/ingsw/0613_26/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_26/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_26/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_26/wrong2.txt b/legacy/Data/Questions/ingsw/0613_26/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_26/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_26/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_27/quest.txt b/legacy/Data/Questions/ingsw/0613_27/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_27/quest.txt
rename to legacy/Data/Questions/ingsw/0613_27/quest.txt
diff --git a/Data/Questions/ingsw/0613_27/wrong1.txt b/legacy/Data/Questions/ingsw/0613_27/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_27/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_27/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_27/wrong2.txt b/legacy/Data/Questions/ingsw/0613_27/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_27/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_27/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_27/wrong3.txt b/legacy/Data/Questions/ingsw/0613_27/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_27/wrong3.txt
rename to legacy/Data/Questions/ingsw/0613_27/wrong3.txt
diff --git a/Data/Questions/ingsw/0613_28/correct.txt b/legacy/Data/Questions/ingsw/0613_28/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_28/correct.txt
rename to legacy/Data/Questions/ingsw/0613_28/correct.txt
diff --git a/Data/Questions/ingsw/0613_28/quest.txt b/legacy/Data/Questions/ingsw/0613_28/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_28/quest.txt
rename to legacy/Data/Questions/ingsw/0613_28/quest.txt
diff --git a/Data/Questions/ingsw/0613_28/wrong1.txt b/legacy/Data/Questions/ingsw/0613_28/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_28/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_28/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_28/wrong2.txt b/legacy/Data/Questions/ingsw/0613_28/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_28/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_28/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_29/correct.txt b/legacy/Data/Questions/ingsw/0613_29/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_29/correct.txt
rename to legacy/Data/Questions/ingsw/0613_29/correct.txt
diff --git a/Data/Questions/ingsw/0613_29/quest.txt b/legacy/Data/Questions/ingsw/0613_29/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_29/quest.txt
rename to legacy/Data/Questions/ingsw/0613_29/quest.txt
diff --git a/Data/Questions/ingsw/0613_29/wrong1.txt b/legacy/Data/Questions/ingsw/0613_29/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_29/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_29/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_29/wrong2.txt b/legacy/Data/Questions/ingsw/0613_29/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_29/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_29/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_3/correct.txt b/legacy/Data/Questions/ingsw/0613_3/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_3/correct.txt
rename to legacy/Data/Questions/ingsw/0613_3/correct.txt
diff --git a/Data/Questions/ingsw/0613_3/quest.txt b/legacy/Data/Questions/ingsw/0613_3/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_3/quest.txt
rename to legacy/Data/Questions/ingsw/0613_3/quest.txt
diff --git a/Data/Questions/ingsw/0613_3/wrong1.txt b/legacy/Data/Questions/ingsw/0613_3/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_3/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_3/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_3/wrong2.txt b/legacy/Data/Questions/ingsw/0613_3/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_3/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_3/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_30/correct.txt b/legacy/Data/Questions/ingsw/0613_30/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_30/correct.txt
rename to legacy/Data/Questions/ingsw/0613_30/correct.txt
diff --git a/Data/Questions/ingsw/0613_30/quest.txt b/legacy/Data/Questions/ingsw/0613_30/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_30/quest.txt
rename to legacy/Data/Questions/ingsw/0613_30/quest.txt
diff --git a/Data/Questions/ingsw/0613_30/wrong1.txt b/legacy/Data/Questions/ingsw/0613_30/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_30/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_30/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_30/wrong2.txt b/legacy/Data/Questions/ingsw/0613_30/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_30/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_30/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_31/correct.txt b/legacy/Data/Questions/ingsw/0613_31/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_31/correct.txt
rename to legacy/Data/Questions/ingsw/0613_31/correct.txt
diff --git a/Data/Questions/ingsw/0613_31/quest.txt b/legacy/Data/Questions/ingsw/0613_31/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_31/quest.txt
rename to legacy/Data/Questions/ingsw/0613_31/quest.txt
diff --git a/Data/Questions/ingsw/0613_31/wrong1.txt b/legacy/Data/Questions/ingsw/0613_31/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_31/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_31/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_31/wrong2.txt b/legacy/Data/Questions/ingsw/0613_31/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_31/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_31/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_32/correct.txt b/legacy/Data/Questions/ingsw/0613_32/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_32/correct.txt
rename to legacy/Data/Questions/ingsw/0613_32/correct.txt
diff --git a/Data/Questions/ingsw/0613_32/quest.txt b/legacy/Data/Questions/ingsw/0613_32/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_32/quest.txt
rename to legacy/Data/Questions/ingsw/0613_32/quest.txt
diff --git a/Data/Questions/ingsw/0613_32/wrong1.txt b/legacy/Data/Questions/ingsw/0613_32/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_32/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_32/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_32/wrong2.txt b/legacy/Data/Questions/ingsw/0613_32/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_32/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_32/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_33/correct.txt b/legacy/Data/Questions/ingsw/0613_33/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_33/correct.txt
rename to legacy/Data/Questions/ingsw/0613_33/correct.txt
diff --git a/Data/Questions/ingsw/0613_33/quest.txt b/legacy/Data/Questions/ingsw/0613_33/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_33/quest.txt
rename to legacy/Data/Questions/ingsw/0613_33/quest.txt
diff --git a/Data/Questions/ingsw/0613_33/wrong1.txt b/legacy/Data/Questions/ingsw/0613_33/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_33/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_33/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_33/wrong2.txt b/legacy/Data/Questions/ingsw/0613_33/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_33/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_33/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_34/correct.txt b/legacy/Data/Questions/ingsw/0613_34/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_34/correct.txt
rename to legacy/Data/Questions/ingsw/0613_34/correct.txt
diff --git a/Data/Questions/ingsw/0613_34/quest.txt b/legacy/Data/Questions/ingsw/0613_34/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_34/quest.txt
rename to legacy/Data/Questions/ingsw/0613_34/quest.txt
diff --git a/Data/Questions/ingsw/0613_34/wrong1.txt b/legacy/Data/Questions/ingsw/0613_34/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_34/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_34/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_34/wrong2.txt b/legacy/Data/Questions/ingsw/0613_34/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_34/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_34/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_35/correct.txt b/legacy/Data/Questions/ingsw/0613_35/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_35/correct.txt
rename to legacy/Data/Questions/ingsw/0613_35/correct.txt
diff --git a/Data/Questions/ingsw/0613_35/quest.txt b/legacy/Data/Questions/ingsw/0613_35/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_35/quest.txt
rename to legacy/Data/Questions/ingsw/0613_35/quest.txt
diff --git a/Data/Questions/ingsw/0613_35/wrong1.txt b/legacy/Data/Questions/ingsw/0613_35/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_35/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_35/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_35/wrong2.txt b/legacy/Data/Questions/ingsw/0613_35/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_35/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_35/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_36/correct.txt b/legacy/Data/Questions/ingsw/0613_36/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_36/correct.txt
rename to legacy/Data/Questions/ingsw/0613_36/correct.txt
diff --git a/Data/Questions/ingsw/0613_36/quest.txt b/legacy/Data/Questions/ingsw/0613_36/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_36/quest.txt
rename to legacy/Data/Questions/ingsw/0613_36/quest.txt
diff --git a/Data/Questions/ingsw/0613_36/wrong1.txt b/legacy/Data/Questions/ingsw/0613_36/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_36/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_36/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_36/wrong2.txt b/legacy/Data/Questions/ingsw/0613_36/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_36/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_36/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_37/correct.txt b/legacy/Data/Questions/ingsw/0613_37/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_37/correct.txt
rename to legacy/Data/Questions/ingsw/0613_37/correct.txt
diff --git a/Data/Questions/ingsw/0613_37/quest.txt b/legacy/Data/Questions/ingsw/0613_37/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_37/quest.txt
rename to legacy/Data/Questions/ingsw/0613_37/quest.txt
diff --git a/Data/Questions/ingsw/0613_37/wrong1.txt b/legacy/Data/Questions/ingsw/0613_37/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_37/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_37/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_37/wrong2.txt b/legacy/Data/Questions/ingsw/0613_37/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_37/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_37/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_38/quest.txt b/legacy/Data/Questions/ingsw/0613_38/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_38/quest.txt
rename to legacy/Data/Questions/ingsw/0613_38/quest.txt
diff --git a/Data/Questions/ingsw/0613_38/wrong1.txt b/legacy/Data/Questions/ingsw/0613_38/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_38/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_38/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_38/wrong2.txt b/legacy/Data/Questions/ingsw/0613_38/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_38/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_38/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_38/wrong3.txt b/legacy/Data/Questions/ingsw/0613_38/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_38/wrong3.txt
rename to legacy/Data/Questions/ingsw/0613_38/wrong3.txt
diff --git a/Data/Questions/ingsw/0613_39/correct.txt b/legacy/Data/Questions/ingsw/0613_39/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_39/correct.txt
rename to legacy/Data/Questions/ingsw/0613_39/correct.txt
diff --git a/Data/Questions/ingsw/0613_39/quest.txt b/legacy/Data/Questions/ingsw/0613_39/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_39/quest.txt
rename to legacy/Data/Questions/ingsw/0613_39/quest.txt
diff --git a/Data/Questions/ingsw/0613_39/wrong1.txt b/legacy/Data/Questions/ingsw/0613_39/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_39/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_39/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_39/wrong2.txt b/legacy/Data/Questions/ingsw/0613_39/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_39/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_39/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_4/correct.txt b/legacy/Data/Questions/ingsw/0613_4/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_4/correct.txt
rename to legacy/Data/Questions/ingsw/0613_4/correct.txt
diff --git a/Data/Questions/ingsw/0613_4/quest.txt b/legacy/Data/Questions/ingsw/0613_4/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_4/quest.txt
rename to legacy/Data/Questions/ingsw/0613_4/quest.txt
diff --git a/Data/Questions/ingsw/0613_4/wrong1.txt b/legacy/Data/Questions/ingsw/0613_4/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_4/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_4/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_4/wrong2.txt b/legacy/Data/Questions/ingsw/0613_4/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_4/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_4/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_40/quest.txt b/legacy/Data/Questions/ingsw/0613_40/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_40/quest.txt
rename to legacy/Data/Questions/ingsw/0613_40/quest.txt
diff --git a/Data/Questions/ingsw/0613_40/wrong1.txt b/legacy/Data/Questions/ingsw/0613_40/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_40/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_40/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_40/wrong2.txt b/legacy/Data/Questions/ingsw/0613_40/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_40/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_40/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_40/wrong3.txt b/legacy/Data/Questions/ingsw/0613_40/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_40/wrong3.txt
rename to legacy/Data/Questions/ingsw/0613_40/wrong3.txt
diff --git a/Data/Questions/ingsw/0613_41/quest.txt b/legacy/Data/Questions/ingsw/0613_41/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_41/quest.txt
rename to legacy/Data/Questions/ingsw/0613_41/quest.txt
diff --git a/Data/Questions/ingsw/0613_41/wrong1.txt b/legacy/Data/Questions/ingsw/0613_41/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_41/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_41/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_41/wrong2.txt b/legacy/Data/Questions/ingsw/0613_41/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_41/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_41/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_41/wrong3.txt b/legacy/Data/Questions/ingsw/0613_41/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_41/wrong3.txt
rename to legacy/Data/Questions/ingsw/0613_41/wrong3.txt
diff --git a/Data/Questions/ingsw/0613_42/correct.txt b/legacy/Data/Questions/ingsw/0613_42/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_42/correct.txt
rename to legacy/Data/Questions/ingsw/0613_42/correct.txt
diff --git a/Data/Questions/ingsw/0613_42/quest.txt b/legacy/Data/Questions/ingsw/0613_42/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_42/quest.txt
rename to legacy/Data/Questions/ingsw/0613_42/quest.txt
diff --git a/Data/Questions/ingsw/0613_42/wrong1.txt b/legacy/Data/Questions/ingsw/0613_42/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_42/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_42/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_42/wrong2.txt b/legacy/Data/Questions/ingsw/0613_42/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_42/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_42/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_43/correct.txt b/legacy/Data/Questions/ingsw/0613_43/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_43/correct.txt
rename to legacy/Data/Questions/ingsw/0613_43/correct.txt
diff --git a/Data/Questions/ingsw/0613_43/quest.txt b/legacy/Data/Questions/ingsw/0613_43/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_43/quest.txt
rename to legacy/Data/Questions/ingsw/0613_43/quest.txt
diff --git a/Data/Questions/ingsw/0613_43/wrong1.txt b/legacy/Data/Questions/ingsw/0613_43/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_43/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_43/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_43/wrong2.txt b/legacy/Data/Questions/ingsw/0613_43/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_43/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_43/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_44/correct.txt b/legacy/Data/Questions/ingsw/0613_44/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_44/correct.txt
rename to legacy/Data/Questions/ingsw/0613_44/correct.txt
diff --git a/Data/Questions/ingsw/0613_44/quest.txt b/legacy/Data/Questions/ingsw/0613_44/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_44/quest.txt
rename to legacy/Data/Questions/ingsw/0613_44/quest.txt
diff --git a/Data/Questions/ingsw/0613_44/wrong1.txt b/legacy/Data/Questions/ingsw/0613_44/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_44/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_44/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_44/wrong2.txt b/legacy/Data/Questions/ingsw/0613_44/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_44/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_44/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_45/correct.txt b/legacy/Data/Questions/ingsw/0613_45/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_45/correct.txt
rename to legacy/Data/Questions/ingsw/0613_45/correct.txt
diff --git a/Data/Questions/ingsw/0613_45/quest.txt b/legacy/Data/Questions/ingsw/0613_45/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_45/quest.txt
rename to legacy/Data/Questions/ingsw/0613_45/quest.txt
diff --git a/Data/Questions/ingsw/0613_45/wrong1.txt b/legacy/Data/Questions/ingsw/0613_45/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_45/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_45/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_45/wrong2.txt b/legacy/Data/Questions/ingsw/0613_45/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_45/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_45/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_46/correct.txt b/legacy/Data/Questions/ingsw/0613_46/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_46/correct.txt
rename to legacy/Data/Questions/ingsw/0613_46/correct.txt
diff --git a/Data/Questions/ingsw/0613_46/quest.txt b/legacy/Data/Questions/ingsw/0613_46/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_46/quest.txt
rename to legacy/Data/Questions/ingsw/0613_46/quest.txt
diff --git a/Data/Questions/ingsw/0613_46/wrong1.txt b/legacy/Data/Questions/ingsw/0613_46/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_46/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_46/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_46/wrong2.txt b/legacy/Data/Questions/ingsw/0613_46/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_46/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_46/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_47/correct.txt b/legacy/Data/Questions/ingsw/0613_47/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_47/correct.txt
rename to legacy/Data/Questions/ingsw/0613_47/correct.txt
diff --git a/Data/Questions/ingsw/0613_47/quest.txt b/legacy/Data/Questions/ingsw/0613_47/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_47/quest.txt
rename to legacy/Data/Questions/ingsw/0613_47/quest.txt
diff --git a/Data/Questions/ingsw/0613_47/wrong1.txt b/legacy/Data/Questions/ingsw/0613_47/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_47/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_47/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_47/wrong2.txt b/legacy/Data/Questions/ingsw/0613_47/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_47/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_47/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_48/correct.txt b/legacy/Data/Questions/ingsw/0613_48/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_48/correct.txt
rename to legacy/Data/Questions/ingsw/0613_48/correct.txt
diff --git a/Data/Questions/ingsw/0613_48/quest.txt b/legacy/Data/Questions/ingsw/0613_48/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_48/quest.txt
rename to legacy/Data/Questions/ingsw/0613_48/quest.txt
diff --git a/Data/Questions/ingsw/0613_48/wrong1.txt b/legacy/Data/Questions/ingsw/0613_48/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_48/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_48/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_48/wrong2.txt b/legacy/Data/Questions/ingsw/0613_48/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_48/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_48/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_49/correct.txt b/legacy/Data/Questions/ingsw/0613_49/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_49/correct.txt
rename to legacy/Data/Questions/ingsw/0613_49/correct.txt
diff --git a/Data/Questions/ingsw/0613_49/quest.txt b/legacy/Data/Questions/ingsw/0613_49/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_49/quest.txt
rename to legacy/Data/Questions/ingsw/0613_49/quest.txt
diff --git a/Data/Questions/ingsw/0613_49/wrong1.txt b/legacy/Data/Questions/ingsw/0613_49/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_49/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_49/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_49/wrong2.txt b/legacy/Data/Questions/ingsw/0613_49/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_49/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_49/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_5/correct.txt b/legacy/Data/Questions/ingsw/0613_5/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_5/correct.txt
rename to legacy/Data/Questions/ingsw/0613_5/correct.txt
diff --git a/Data/Questions/ingsw/0613_5/quest.txt b/legacy/Data/Questions/ingsw/0613_5/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_5/quest.txt
rename to legacy/Data/Questions/ingsw/0613_5/quest.txt
diff --git a/Data/Questions/ingsw/0613_5/wrong1.txt b/legacy/Data/Questions/ingsw/0613_5/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_5/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_5/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_5/wrong2.txt b/legacy/Data/Questions/ingsw/0613_5/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_5/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_5/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_6/correct.txt b/legacy/Data/Questions/ingsw/0613_6/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_6/correct.txt
rename to legacy/Data/Questions/ingsw/0613_6/correct.txt
diff --git a/Data/Questions/ingsw/0613_6/quest.txt b/legacy/Data/Questions/ingsw/0613_6/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_6/quest.txt
rename to legacy/Data/Questions/ingsw/0613_6/quest.txt
diff --git a/Data/Questions/ingsw/0613_6/wrong1.txt b/legacy/Data/Questions/ingsw/0613_6/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_6/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_6/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_6/wrong2.txt b/legacy/Data/Questions/ingsw/0613_6/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_6/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_6/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_7/correct.txt b/legacy/Data/Questions/ingsw/0613_7/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_7/correct.txt
rename to legacy/Data/Questions/ingsw/0613_7/correct.txt
diff --git a/Data/Questions/ingsw/0613_7/quest.txt b/legacy/Data/Questions/ingsw/0613_7/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_7/quest.txt
rename to legacy/Data/Questions/ingsw/0613_7/quest.txt
diff --git a/Data/Questions/ingsw/0613_7/wrong1.txt b/legacy/Data/Questions/ingsw/0613_7/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_7/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_7/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_7/wrong2.txt b/legacy/Data/Questions/ingsw/0613_7/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_7/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_7/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_8/correct.txt b/legacy/Data/Questions/ingsw/0613_8/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_8/correct.txt
rename to legacy/Data/Questions/ingsw/0613_8/correct.txt
diff --git a/Data/Questions/ingsw/0613_8/quest.txt b/legacy/Data/Questions/ingsw/0613_8/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_8/quest.txt
rename to legacy/Data/Questions/ingsw/0613_8/quest.txt
diff --git a/Data/Questions/ingsw/0613_8/wrong1.txt b/legacy/Data/Questions/ingsw/0613_8/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_8/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_8/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_8/wrong2.txt b/legacy/Data/Questions/ingsw/0613_8/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_8/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_8/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_9/quest.txt b/legacy/Data/Questions/ingsw/0613_9/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_9/quest.txt
rename to legacy/Data/Questions/ingsw/0613_9/quest.txt
diff --git a/Data/Questions/ingsw/0613_9/wrong1.txt b/legacy/Data/Questions/ingsw/0613_9/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_9/wrong1.txt
rename to legacy/Data/Questions/ingsw/0613_9/wrong1.txt
diff --git a/Data/Questions/ingsw/0613_9/wrong2.txt b/legacy/Data/Questions/ingsw/0613_9/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_9/wrong2.txt
rename to legacy/Data/Questions/ingsw/0613_9/wrong2.txt
diff --git a/Data/Questions/ingsw/0613_9/wrong3.txt b/legacy/Data/Questions/ingsw/0613_9/wrong3.txt
similarity index 100%
rename from Data/Questions/ingsw/0613_9/wrong3.txt
rename to legacy/Data/Questions/ingsw/0613_9/wrong3.txt
diff --git a/Data/Questions/ingsw/0621_0/correct.txt b/legacy/Data/Questions/ingsw/0621_0/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_0/correct.txt
rename to legacy/Data/Questions/ingsw/0621_0/correct.txt
diff --git a/Data/Questions/ingsw/0621_0/quest.txt b/legacy/Data/Questions/ingsw/0621_0/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_0/quest.txt
rename to legacy/Data/Questions/ingsw/0621_0/quest.txt
diff --git a/Data/Questions/ingsw/0621_0/wrong0.txt b/legacy/Data/Questions/ingsw/0621_0/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_0/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_0/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_0/wrong1.txt b/legacy/Data/Questions/ingsw/0621_0/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_0/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_0/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_1/correct.txt b/legacy/Data/Questions/ingsw/0621_1/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_1/correct.txt
rename to legacy/Data/Questions/ingsw/0621_1/correct.txt
diff --git a/Data/Questions/ingsw/0621_1/quest.txt b/legacy/Data/Questions/ingsw/0621_1/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_1/quest.txt
rename to legacy/Data/Questions/ingsw/0621_1/quest.txt
diff --git a/Data/Questions/ingsw/0621_1/wrong1.txt b/legacy/Data/Questions/ingsw/0621_1/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_1/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_1/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_1/wrong2.txt b/legacy/Data/Questions/ingsw/0621_1/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_1/wrong2.txt
rename to legacy/Data/Questions/ingsw/0621_1/wrong2.txt
diff --git a/Data/Questions/ingsw/0621_10/correct.txt b/legacy/Data/Questions/ingsw/0621_10/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_10/correct.txt
rename to legacy/Data/Questions/ingsw/0621_10/correct.txt
diff --git a/Data/Questions/ingsw/0621_10/quest.txt b/legacy/Data/Questions/ingsw/0621_10/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_10/quest.txt
rename to legacy/Data/Questions/ingsw/0621_10/quest.txt
diff --git a/Data/Questions/ingsw/0621_10/wrong0.txt b/legacy/Data/Questions/ingsw/0621_10/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_10/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_10/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_10/wrong1.txt b/legacy/Data/Questions/ingsw/0621_10/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_10/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_10/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_13/correct.txt b/legacy/Data/Questions/ingsw/0621_13/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_13/correct.txt
rename to legacy/Data/Questions/ingsw/0621_13/correct.txt
diff --git a/Data/Questions/ingsw/0621_13/quest.txt b/legacy/Data/Questions/ingsw/0621_13/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_13/quest.txt
rename to legacy/Data/Questions/ingsw/0621_13/quest.txt
diff --git a/Data/Questions/ingsw/0621_13/wrong0.txt b/legacy/Data/Questions/ingsw/0621_13/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_13/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_13/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_13/wrong1.txt b/legacy/Data/Questions/ingsw/0621_13/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_13/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_13/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_14/correct.txt b/legacy/Data/Questions/ingsw/0621_14/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_14/correct.txt
rename to legacy/Data/Questions/ingsw/0621_14/correct.txt
diff --git a/Data/Questions/ingsw/0621_14/quest.txt b/legacy/Data/Questions/ingsw/0621_14/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_14/quest.txt
rename to legacy/Data/Questions/ingsw/0621_14/quest.txt
diff --git a/Data/Questions/ingsw/0621_14/wrong0.txt b/legacy/Data/Questions/ingsw/0621_14/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_14/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_14/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_14/wrong1.txt b/legacy/Data/Questions/ingsw/0621_14/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_14/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_14/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_17/correct.txt b/legacy/Data/Questions/ingsw/0621_17/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_17/correct.txt
rename to legacy/Data/Questions/ingsw/0621_17/correct.txt
diff --git a/Data/Questions/ingsw/0621_17/quest.txt b/legacy/Data/Questions/ingsw/0621_17/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_17/quest.txt
rename to legacy/Data/Questions/ingsw/0621_17/quest.txt
diff --git a/Data/Questions/ingsw/0621_17/wrong0.txt b/legacy/Data/Questions/ingsw/0621_17/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_17/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_17/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_17/wrong1.txt b/legacy/Data/Questions/ingsw/0621_17/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_17/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_17/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_19/correct.txt b/legacy/Data/Questions/ingsw/0621_19/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_19/correct.txt
rename to legacy/Data/Questions/ingsw/0621_19/correct.txt
diff --git a/Data/Questions/ingsw/0621_19/quest.txt b/legacy/Data/Questions/ingsw/0621_19/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_19/quest.txt
rename to legacy/Data/Questions/ingsw/0621_19/quest.txt
diff --git a/Data/Questions/ingsw/0621_19/wrong0.txt b/legacy/Data/Questions/ingsw/0621_19/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_19/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_19/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_19/wrong1.txt b/legacy/Data/Questions/ingsw/0621_19/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_19/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_19/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_2/correct.txt b/legacy/Data/Questions/ingsw/0621_2/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_2/correct.txt
rename to legacy/Data/Questions/ingsw/0621_2/correct.txt
diff --git a/Data/Questions/ingsw/0621_2/quest.txt b/legacy/Data/Questions/ingsw/0621_2/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_2/quest.txt
rename to legacy/Data/Questions/ingsw/0621_2/quest.txt
diff --git a/Data/Questions/ingsw/0621_2/wrong0.txt b/legacy/Data/Questions/ingsw/0621_2/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_2/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_2/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_2/wrong1.txt b/legacy/Data/Questions/ingsw/0621_2/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_2/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_2/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_21/correct.txt b/legacy/Data/Questions/ingsw/0621_21/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_21/correct.txt
rename to legacy/Data/Questions/ingsw/0621_21/correct.txt
diff --git a/Data/Questions/ingsw/0621_21/quest.txt b/legacy/Data/Questions/ingsw/0621_21/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_21/quest.txt
rename to legacy/Data/Questions/ingsw/0621_21/quest.txt
diff --git a/Data/Questions/ingsw/0621_21/wrong0.txt b/legacy/Data/Questions/ingsw/0621_21/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_21/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_21/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_21/wrong1.txt b/legacy/Data/Questions/ingsw/0621_21/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_21/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_21/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_22/correct.txt b/legacy/Data/Questions/ingsw/0621_22/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_22/correct.txt
rename to legacy/Data/Questions/ingsw/0621_22/correct.txt
diff --git a/Data/Questions/ingsw/0621_22/quest.txt b/legacy/Data/Questions/ingsw/0621_22/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_22/quest.txt
rename to legacy/Data/Questions/ingsw/0621_22/quest.txt
diff --git a/Data/Questions/ingsw/0621_22/wrong0.txt b/legacy/Data/Questions/ingsw/0621_22/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_22/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_22/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_22/wrong1.txt b/legacy/Data/Questions/ingsw/0621_22/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_22/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_22/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_24/correct.txt b/legacy/Data/Questions/ingsw/0621_24/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_24/correct.txt
rename to legacy/Data/Questions/ingsw/0621_24/correct.txt
diff --git a/Data/Questions/ingsw/0621_24/quest.txt b/legacy/Data/Questions/ingsw/0621_24/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_24/quest.txt
rename to legacy/Data/Questions/ingsw/0621_24/quest.txt
diff --git a/Data/Questions/ingsw/0621_24/wrong0.txt b/legacy/Data/Questions/ingsw/0621_24/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_24/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_24/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_24/wrong1.txt b/legacy/Data/Questions/ingsw/0621_24/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_24/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_24/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_3/correct.txt b/legacy/Data/Questions/ingsw/0621_3/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_3/correct.txt
rename to legacy/Data/Questions/ingsw/0621_3/correct.txt
diff --git a/Data/Questions/ingsw/0621_3/quest.txt b/legacy/Data/Questions/ingsw/0621_3/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_3/quest.txt
rename to legacy/Data/Questions/ingsw/0621_3/quest.txt
diff --git a/Data/Questions/ingsw/0621_3/wrong0.txt b/legacy/Data/Questions/ingsw/0621_3/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_3/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_3/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_3/wrong1.txt b/legacy/Data/Questions/ingsw/0621_3/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_3/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_3/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_32/correct.txt b/legacy/Data/Questions/ingsw/0621_32/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_32/correct.txt
rename to legacy/Data/Questions/ingsw/0621_32/correct.txt
diff --git a/Data/Questions/ingsw/0621_32/quest.txt b/legacy/Data/Questions/ingsw/0621_32/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_32/quest.txt
rename to legacy/Data/Questions/ingsw/0621_32/quest.txt
diff --git a/Data/Questions/ingsw/0621_32/wrong0.txt b/legacy/Data/Questions/ingsw/0621_32/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_32/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_32/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_32/wrong1.txt b/legacy/Data/Questions/ingsw/0621_32/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_32/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_32/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_35/correct.txt b/legacy/Data/Questions/ingsw/0621_35/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_35/correct.txt
rename to legacy/Data/Questions/ingsw/0621_35/correct.txt
diff --git a/Data/Questions/ingsw/0621_35/quest.txt b/legacy/Data/Questions/ingsw/0621_35/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_35/quest.txt
rename to legacy/Data/Questions/ingsw/0621_35/quest.txt
diff --git a/Data/Questions/ingsw/0621_35/wrong0.txt b/legacy/Data/Questions/ingsw/0621_35/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_35/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_35/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_35/wrong1.txt b/legacy/Data/Questions/ingsw/0621_35/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_35/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_35/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_36/correct.txt b/legacy/Data/Questions/ingsw/0621_36/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_36/correct.txt
rename to legacy/Data/Questions/ingsw/0621_36/correct.txt
diff --git a/Data/Questions/ingsw/0621_36/quest.txt b/legacy/Data/Questions/ingsw/0621_36/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_36/quest.txt
rename to legacy/Data/Questions/ingsw/0621_36/quest.txt
diff --git a/Data/Questions/ingsw/0621_36/wrong0.txt b/legacy/Data/Questions/ingsw/0621_36/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_36/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_36/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_36/wrong1.txt b/legacy/Data/Questions/ingsw/0621_36/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_36/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_36/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_39/correct.txt b/legacy/Data/Questions/ingsw/0621_39/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_39/correct.txt
rename to legacy/Data/Questions/ingsw/0621_39/correct.txt
diff --git a/Data/Questions/ingsw/0621_39/quest.txt b/legacy/Data/Questions/ingsw/0621_39/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_39/quest.txt
rename to legacy/Data/Questions/ingsw/0621_39/quest.txt
diff --git a/Data/Questions/ingsw/0621_39/wrong0.txt b/legacy/Data/Questions/ingsw/0621_39/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_39/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_39/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_39/wrong1.txt b/legacy/Data/Questions/ingsw/0621_39/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_39/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_39/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_6/correct.txt b/legacy/Data/Questions/ingsw/0621_6/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_6/correct.txt
rename to legacy/Data/Questions/ingsw/0621_6/correct.txt
diff --git a/Data/Questions/ingsw/0621_6/quest.txt b/legacy/Data/Questions/ingsw/0621_6/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_6/quest.txt
rename to legacy/Data/Questions/ingsw/0621_6/quest.txt
diff --git a/Data/Questions/ingsw/0621_6/wrong0.txt b/legacy/Data/Questions/ingsw/0621_6/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_6/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_6/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_6/wrong1.txt b/legacy/Data/Questions/ingsw/0621_6/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_6/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_6/wrong1.txt
diff --git a/Data/Questions/ingsw/0621_6/wrong2.txt b/legacy/Data/Questions/ingsw/0621_6/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_6/wrong2.txt
rename to legacy/Data/Questions/ingsw/0621_6/wrong2.txt
diff --git a/Data/Questions/ingsw/0621_9/correct.txt b/legacy/Data/Questions/ingsw/0621_9/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_9/correct.txt
rename to legacy/Data/Questions/ingsw/0621_9/correct.txt
diff --git a/Data/Questions/ingsw/0621_9/quest.txt b/legacy/Data/Questions/ingsw/0621_9/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_9/quest.txt
rename to legacy/Data/Questions/ingsw/0621_9/quest.txt
diff --git a/Data/Questions/ingsw/0621_9/wrong0.txt b/legacy/Data/Questions/ingsw/0621_9/wrong0.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_9/wrong0.txt
rename to legacy/Data/Questions/ingsw/0621_9/wrong0.txt
diff --git a/Data/Questions/ingsw/0621_9/wrong1.txt b/legacy/Data/Questions/ingsw/0621_9/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0621_9/wrong1.txt
rename to legacy/Data/Questions/ingsw/0621_9/wrong1.txt
diff --git a/Data/Questions/ingsw/0622_1/correct.txt b/legacy/Data/Questions/ingsw/0622_1/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_1/correct.txt
rename to legacy/Data/Questions/ingsw/0622_1/correct.txt
diff --git a/Data/Questions/ingsw/0622_1/quest.txt b/legacy/Data/Questions/ingsw/0622_1/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_1/quest.txt
rename to legacy/Data/Questions/ingsw/0622_1/quest.txt
diff --git a/Data/Questions/ingsw/0622_1/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_1/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_1/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0622_1/wrong 1.txt
diff --git a/Data/Questions/ingsw/0622_1/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_1/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_1/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0622_1/wrong 2.txt
diff --git a/Data/Questions/ingsw/0622_2/correct.txt b/legacy/Data/Questions/ingsw/0622_2/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_2/correct.txt
rename to legacy/Data/Questions/ingsw/0622_2/correct.txt
diff --git a/Data/Questions/ingsw/0622_2/quest.txt b/legacy/Data/Questions/ingsw/0622_2/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_2/quest.txt
rename to legacy/Data/Questions/ingsw/0622_2/quest.txt
diff --git a/Data/Questions/ingsw/0622_2/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_2/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_2/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0622_2/wrong 1.txt
diff --git a/Data/Questions/ingsw/0622_2/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_2/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_2/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0622_2/wrong 2.txt
diff --git a/Data/Questions/ingsw/0622_3/correct.txt b/legacy/Data/Questions/ingsw/0622_3/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_3/correct.txt
rename to legacy/Data/Questions/ingsw/0622_3/correct.txt
diff --git a/Data/Questions/ingsw/0622_3/quest.txt b/legacy/Data/Questions/ingsw/0622_3/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_3/quest.txt
rename to legacy/Data/Questions/ingsw/0622_3/quest.txt
diff --git a/Data/Questions/ingsw/0622_3/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_3/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_3/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0622_3/wrong 1.txt
diff --git a/Data/Questions/ingsw/0622_3/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_3/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_3/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0622_3/wrong 2.txt
diff --git a/Data/Questions/ingsw/0622_4/correct.txt b/legacy/Data/Questions/ingsw/0622_4/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_4/correct.txt
rename to legacy/Data/Questions/ingsw/0622_4/correct.txt
diff --git a/Data/Questions/ingsw/0622_4/quest.txt b/legacy/Data/Questions/ingsw/0622_4/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_4/quest.txt
rename to legacy/Data/Questions/ingsw/0622_4/quest.txt
diff --git a/Data/Questions/ingsw/0622_4/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_4/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_4/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0622_4/wrong 1.txt
diff --git a/Data/Questions/ingsw/0622_4/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_4/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_4/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0622_4/wrong 2.txt
diff --git a/Data/Questions/ingsw/0622_5/correct.txt b/legacy/Data/Questions/ingsw/0622_5/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_5/correct.txt
rename to legacy/Data/Questions/ingsw/0622_5/correct.txt
diff --git a/Data/Questions/ingsw/0622_5/quest.txt b/legacy/Data/Questions/ingsw/0622_5/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_5/quest.txt
rename to legacy/Data/Questions/ingsw/0622_5/quest.txt
diff --git a/Data/Questions/ingsw/0622_5/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_5/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_5/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0622_5/wrong 1.txt
diff --git a/Data/Questions/ingsw/0622_5/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_5/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_5/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0622_5/wrong 2.txt
diff --git a/Data/Questions/ingsw/0622_6/correct.txt b/legacy/Data/Questions/ingsw/0622_6/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_6/correct.txt
rename to legacy/Data/Questions/ingsw/0622_6/correct.txt
diff --git a/Data/Questions/ingsw/0622_6/quest.txt b/legacy/Data/Questions/ingsw/0622_6/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_6/quest.txt
rename to legacy/Data/Questions/ingsw/0622_6/quest.txt
diff --git a/Data/Questions/ingsw/0622_6/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_6/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_6/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0622_6/wrong 1.txt
diff --git a/Data/Questions/ingsw/0622_6/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_6/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_6/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0622_6/wrong 2.txt
diff --git a/Data/Questions/ingsw/0622_7/correct.txt b/legacy/Data/Questions/ingsw/0622_7/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_7/correct.txt
rename to legacy/Data/Questions/ingsw/0622_7/correct.txt
diff --git a/Data/Questions/ingsw/0622_7/quest.txt b/legacy/Data/Questions/ingsw/0622_7/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_7/quest.txt
rename to legacy/Data/Questions/ingsw/0622_7/quest.txt
diff --git a/Data/Questions/ingsw/0622_7/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_7/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_7/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0622_7/wrong 1.txt
diff --git a/Data/Questions/ingsw/0622_7/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_7/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_7/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0622_7/wrong 2.txt
diff --git a/Data/Questions/ingsw/0622_8/correct.txt b/legacy/Data/Questions/ingsw/0622_8/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_8/correct.txt
rename to legacy/Data/Questions/ingsw/0622_8/correct.txt
diff --git a/Data/Questions/ingsw/0622_8/quest.txt b/legacy/Data/Questions/ingsw/0622_8/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_8/quest.txt
rename to legacy/Data/Questions/ingsw/0622_8/quest.txt
diff --git a/Data/Questions/ingsw/0622_8/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_8/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_8/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0622_8/wrong 1.txt
diff --git a/Data/Questions/ingsw/0622_8/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_8/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_8/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0622_8/wrong 2.txt
diff --git a/Data/Questions/ingsw/0622_9/correct.txt b/legacy/Data/Questions/ingsw/0622_9/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_9/correct.txt
rename to legacy/Data/Questions/ingsw/0622_9/correct.txt
diff --git a/Data/Questions/ingsw/0622_9/quest.txt b/legacy/Data/Questions/ingsw/0622_9/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_9/quest.txt
rename to legacy/Data/Questions/ingsw/0622_9/quest.txt
diff --git a/Data/Questions/ingsw/0622_9/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_9/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_9/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0622_9/wrong 1.txt
diff --git a/Data/Questions/ingsw/0622_9/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_9/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0622_9/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0622_9/wrong 2.txt
diff --git a/Data/Questions/ingsw/0721_1/correct.txt b/legacy/Data/Questions/ingsw/0721_1/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_1/correct.txt
rename to legacy/Data/Questions/ingsw/0721_1/correct.txt
diff --git a/Data/Questions/ingsw/0721_1/quest.txt b/legacy/Data/Questions/ingsw/0721_1/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_1/quest.txt
rename to legacy/Data/Questions/ingsw/0721_1/quest.txt
diff --git a/Data/Questions/ingsw/0721_1/wrong1.txt b/legacy/Data/Questions/ingsw/0721_1/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_1/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_1/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_1/wrong2.txt b/legacy/Data/Questions/ingsw/0721_1/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_1/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_1/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_10/correct.txt b/legacy/Data/Questions/ingsw/0721_10/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_10/correct.txt
rename to legacy/Data/Questions/ingsw/0721_10/correct.txt
diff --git a/Data/Questions/ingsw/0721_10/quest.txt b/legacy/Data/Questions/ingsw/0721_10/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_10/quest.txt
rename to legacy/Data/Questions/ingsw/0721_10/quest.txt
diff --git a/Data/Questions/ingsw/0721_10/wrong1.txt b/legacy/Data/Questions/ingsw/0721_10/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_10/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_10/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_10/wrong2.txt b/legacy/Data/Questions/ingsw/0721_10/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_10/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_10/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_13/correct.txt b/legacy/Data/Questions/ingsw/0721_13/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_13/correct.txt
rename to legacy/Data/Questions/ingsw/0721_13/correct.txt
diff --git a/Data/Questions/ingsw/0721_13/quest.txt b/legacy/Data/Questions/ingsw/0721_13/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_13/quest.txt
rename to legacy/Data/Questions/ingsw/0721_13/quest.txt
diff --git a/Data/Questions/ingsw/0721_13/wrong1.txt b/legacy/Data/Questions/ingsw/0721_13/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_13/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_13/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_13/wrong2.txt b/legacy/Data/Questions/ingsw/0721_13/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_13/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_13/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_15/correct.txt b/legacy/Data/Questions/ingsw/0721_15/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_15/correct.txt
rename to legacy/Data/Questions/ingsw/0721_15/correct.txt
diff --git a/Data/Questions/ingsw/0721_15/quest.txt b/legacy/Data/Questions/ingsw/0721_15/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_15/quest.txt
rename to legacy/Data/Questions/ingsw/0721_15/quest.txt
diff --git a/Data/Questions/ingsw/0721_15/wrong1.txt b/legacy/Data/Questions/ingsw/0721_15/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_15/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_15/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_15/wrong2.txt b/legacy/Data/Questions/ingsw/0721_15/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_15/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_15/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_17/correct.txt b/legacy/Data/Questions/ingsw/0721_17/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_17/correct.txt
rename to legacy/Data/Questions/ingsw/0721_17/correct.txt
diff --git a/Data/Questions/ingsw/0721_17/quest.txt b/legacy/Data/Questions/ingsw/0721_17/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_17/quest.txt
rename to legacy/Data/Questions/ingsw/0721_17/quest.txt
diff --git a/Data/Questions/ingsw/0721_17/wrong1.txt b/legacy/Data/Questions/ingsw/0721_17/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_17/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_17/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_17/wrong2.txt b/legacy/Data/Questions/ingsw/0721_17/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_17/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_17/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_18/correct.txt b/legacy/Data/Questions/ingsw/0721_18/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_18/correct.txt
rename to legacy/Data/Questions/ingsw/0721_18/correct.txt
diff --git a/Data/Questions/ingsw/0721_18/quest.txt b/legacy/Data/Questions/ingsw/0721_18/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_18/quest.txt
rename to legacy/Data/Questions/ingsw/0721_18/quest.txt
diff --git a/Data/Questions/ingsw/0721_18/wrong1.txt b/legacy/Data/Questions/ingsw/0721_18/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_18/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_18/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_18/wrong2.txt b/legacy/Data/Questions/ingsw/0721_18/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_18/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_18/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_19/correct.txt b/legacy/Data/Questions/ingsw/0721_19/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_19/correct.txt
rename to legacy/Data/Questions/ingsw/0721_19/correct.txt
diff --git a/Data/Questions/ingsw/0721_19/quest.txt b/legacy/Data/Questions/ingsw/0721_19/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_19/quest.txt
rename to legacy/Data/Questions/ingsw/0721_19/quest.txt
diff --git a/Data/Questions/ingsw/0721_19/wrong1.txt b/legacy/Data/Questions/ingsw/0721_19/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_19/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_19/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_19/wrong2.txt b/legacy/Data/Questions/ingsw/0721_19/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_19/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_19/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_21/correct.txt b/legacy/Data/Questions/ingsw/0721_21/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_21/correct.txt
rename to legacy/Data/Questions/ingsw/0721_21/correct.txt
diff --git a/Data/Questions/ingsw/0721_21/quest.txt b/legacy/Data/Questions/ingsw/0721_21/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_21/quest.txt
rename to legacy/Data/Questions/ingsw/0721_21/quest.txt
diff --git a/Data/Questions/ingsw/0721_21/wrong1.txt b/legacy/Data/Questions/ingsw/0721_21/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_21/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_21/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_21/wrong2.txt b/legacy/Data/Questions/ingsw/0721_21/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_21/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_21/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_28/correct.txt b/legacy/Data/Questions/ingsw/0721_28/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_28/correct.txt
rename to legacy/Data/Questions/ingsw/0721_28/correct.txt
diff --git a/Data/Questions/ingsw/0721_28/quest.txt b/legacy/Data/Questions/ingsw/0721_28/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_28/quest.txt
rename to legacy/Data/Questions/ingsw/0721_28/quest.txt
diff --git a/Data/Questions/ingsw/0721_28/wrong1.txt b/legacy/Data/Questions/ingsw/0721_28/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_28/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_28/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_28/wrong2.txt b/legacy/Data/Questions/ingsw/0721_28/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_28/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_28/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_29/correct.txt b/legacy/Data/Questions/ingsw/0721_29/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_29/correct.txt
rename to legacy/Data/Questions/ingsw/0721_29/correct.txt
diff --git a/Data/Questions/ingsw/0721_29/quest.txt b/legacy/Data/Questions/ingsw/0721_29/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_29/quest.txt
rename to legacy/Data/Questions/ingsw/0721_29/quest.txt
diff --git a/Data/Questions/ingsw/0721_29/wrong1.txt b/legacy/Data/Questions/ingsw/0721_29/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_29/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_29/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_29/wrong2.txt b/legacy/Data/Questions/ingsw/0721_29/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_29/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_29/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_32/correct.txt b/legacy/Data/Questions/ingsw/0721_32/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_32/correct.txt
rename to legacy/Data/Questions/ingsw/0721_32/correct.txt
diff --git a/Data/Questions/ingsw/0721_32/quest.txt b/legacy/Data/Questions/ingsw/0721_32/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_32/quest.txt
rename to legacy/Data/Questions/ingsw/0721_32/quest.txt
diff --git a/Data/Questions/ingsw/0721_32/wrong1.txt b/legacy/Data/Questions/ingsw/0721_32/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_32/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_32/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_32/wrong2.txt b/legacy/Data/Questions/ingsw/0721_32/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_32/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_32/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_33/correct.txt b/legacy/Data/Questions/ingsw/0721_33/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_33/correct.txt
rename to legacy/Data/Questions/ingsw/0721_33/correct.txt
diff --git a/Data/Questions/ingsw/0721_33/quest.txt b/legacy/Data/Questions/ingsw/0721_33/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_33/quest.txt
rename to legacy/Data/Questions/ingsw/0721_33/quest.txt
diff --git a/Data/Questions/ingsw/0721_33/wrong1.txt b/legacy/Data/Questions/ingsw/0721_33/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_33/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_33/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_33/wrong2.txt b/legacy/Data/Questions/ingsw/0721_33/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_33/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_33/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_34/correct.txt b/legacy/Data/Questions/ingsw/0721_34/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_34/correct.txt
rename to legacy/Data/Questions/ingsw/0721_34/correct.txt
diff --git a/Data/Questions/ingsw/0721_34/quest.txt b/legacy/Data/Questions/ingsw/0721_34/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_34/quest.txt
rename to legacy/Data/Questions/ingsw/0721_34/quest.txt
diff --git a/Data/Questions/ingsw/0721_34/wrong1.txt b/legacy/Data/Questions/ingsw/0721_34/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_34/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_34/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_34/wrong2.txt b/legacy/Data/Questions/ingsw/0721_34/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_34/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_34/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_36/correct.txt b/legacy/Data/Questions/ingsw/0721_36/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_36/correct.txt
rename to legacy/Data/Questions/ingsw/0721_36/correct.txt
diff --git a/Data/Questions/ingsw/0721_36/quest.txt b/legacy/Data/Questions/ingsw/0721_36/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_36/quest.txt
rename to legacy/Data/Questions/ingsw/0721_36/quest.txt
diff --git a/Data/Questions/ingsw/0721_36/wrong1.txt b/legacy/Data/Questions/ingsw/0721_36/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_36/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_36/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_36/wrong2.txt b/legacy/Data/Questions/ingsw/0721_36/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_36/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_36/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_4/correct.txt b/legacy/Data/Questions/ingsw/0721_4/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_4/correct.txt
rename to legacy/Data/Questions/ingsw/0721_4/correct.txt
diff --git a/Data/Questions/ingsw/0721_4/quest.txt b/legacy/Data/Questions/ingsw/0721_4/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_4/quest.txt
rename to legacy/Data/Questions/ingsw/0721_4/quest.txt
diff --git a/Data/Questions/ingsw/0721_4/wrong1.txt b/legacy/Data/Questions/ingsw/0721_4/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_4/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_4/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_4/wrong2.txt b/legacy/Data/Questions/ingsw/0721_4/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_4/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_4/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_5/correct.txt b/legacy/Data/Questions/ingsw/0721_5/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_5/correct.txt
rename to legacy/Data/Questions/ingsw/0721_5/correct.txt
diff --git a/Data/Questions/ingsw/0721_5/quest.txt b/legacy/Data/Questions/ingsw/0721_5/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_5/quest.txt
rename to legacy/Data/Questions/ingsw/0721_5/quest.txt
diff --git a/Data/Questions/ingsw/0721_5/wrong1.txt b/legacy/Data/Questions/ingsw/0721_5/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_5/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_5/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_5/wrong2.txt b/legacy/Data/Questions/ingsw/0721_5/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_5/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_5/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_6/correct.txt b/legacy/Data/Questions/ingsw/0721_6/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_6/correct.txt
rename to legacy/Data/Questions/ingsw/0721_6/correct.txt
diff --git a/Data/Questions/ingsw/0721_6/quest.txt b/legacy/Data/Questions/ingsw/0721_6/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_6/quest.txt
rename to legacy/Data/Questions/ingsw/0721_6/quest.txt
diff --git a/Data/Questions/ingsw/0721_6/wrong1.txt b/legacy/Data/Questions/ingsw/0721_6/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_6/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_6/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_6/wrong2.txt b/legacy/Data/Questions/ingsw/0721_6/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_6/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_6/wrong2.txt
diff --git a/Data/Questions/ingsw/0721_8/correct.txt b/legacy/Data/Questions/ingsw/0721_8/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_8/correct.txt
rename to legacy/Data/Questions/ingsw/0721_8/correct.txt
diff --git a/Data/Questions/ingsw/0721_8/quest.txt b/legacy/Data/Questions/ingsw/0721_8/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_8/quest.txt
rename to legacy/Data/Questions/ingsw/0721_8/quest.txt
diff --git a/Data/Questions/ingsw/0721_8/wrong1.txt b/legacy/Data/Questions/ingsw/0721_8/wrong1.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_8/wrong1.txt
rename to legacy/Data/Questions/ingsw/0721_8/wrong1.txt
diff --git a/Data/Questions/ingsw/0721_8/wrong2.txt b/legacy/Data/Questions/ingsw/0721_8/wrong2.txt
similarity index 100%
rename from Data/Questions/ingsw/0721_8/wrong2.txt
rename to legacy/Data/Questions/ingsw/0721_8/wrong2.txt
diff --git a/Data/Questions/ingsw/0722_1/correct.txt b/legacy/Data/Questions/ingsw/0722_1/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_1/correct.txt
rename to legacy/Data/Questions/ingsw/0722_1/correct.txt
diff --git a/Data/Questions/ingsw/0722_1/quest.txt b/legacy/Data/Questions/ingsw/0722_1/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_1/quest.txt
rename to legacy/Data/Questions/ingsw/0722_1/quest.txt
diff --git a/Data/Questions/ingsw/0722_1/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_1/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_1/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_1/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_1/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_1/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_1/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_1/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_10/correct.txt b/legacy/Data/Questions/ingsw/0722_10/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_10/correct.txt
rename to legacy/Data/Questions/ingsw/0722_10/correct.txt
diff --git a/Data/Questions/ingsw/0722_10/quest.txt b/legacy/Data/Questions/ingsw/0722_10/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_10/quest.txt
rename to legacy/Data/Questions/ingsw/0722_10/quest.txt
diff --git a/Data/Questions/ingsw/0722_10/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_10/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_10/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_10/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_10/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_10/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_10/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_10/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_11/correct.txt b/legacy/Data/Questions/ingsw/0722_11/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_11/correct.txt
rename to legacy/Data/Questions/ingsw/0722_11/correct.txt
diff --git a/Data/Questions/ingsw/0722_11/quest.txt b/legacy/Data/Questions/ingsw/0722_11/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_11/quest.txt
rename to legacy/Data/Questions/ingsw/0722_11/quest.txt
diff --git a/Data/Questions/ingsw/0722_11/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_11/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_11/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_11/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_11/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_11/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_11/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_11/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_12/correct.txt b/legacy/Data/Questions/ingsw/0722_12/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_12/correct.txt
rename to legacy/Data/Questions/ingsw/0722_12/correct.txt
diff --git a/Data/Questions/ingsw/0722_12/quest.txt b/legacy/Data/Questions/ingsw/0722_12/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_12/quest.txt
rename to legacy/Data/Questions/ingsw/0722_12/quest.txt
diff --git a/Data/Questions/ingsw/0722_12/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_12/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_12/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_12/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_12/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_12/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_12/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_12/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_13/correct.txt b/legacy/Data/Questions/ingsw/0722_13/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_13/correct.txt
rename to legacy/Data/Questions/ingsw/0722_13/correct.txt
diff --git a/Data/Questions/ingsw/0722_13/quest.txt b/legacy/Data/Questions/ingsw/0722_13/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_13/quest.txt
rename to legacy/Data/Questions/ingsw/0722_13/quest.txt
diff --git a/Data/Questions/ingsw/0722_13/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_13/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_13/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_13/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_13/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_13/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_13/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_13/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_14/correct.txt b/legacy/Data/Questions/ingsw/0722_14/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_14/correct.txt
rename to legacy/Data/Questions/ingsw/0722_14/correct.txt
diff --git a/Data/Questions/ingsw/0722_14/quest.txt b/legacy/Data/Questions/ingsw/0722_14/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_14/quest.txt
rename to legacy/Data/Questions/ingsw/0722_14/quest.txt
diff --git a/Data/Questions/ingsw/0722_14/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_14/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_14/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_14/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_14/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_14/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_14/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_14/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_15/correct.txt b/legacy/Data/Questions/ingsw/0722_15/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_15/correct.txt
rename to legacy/Data/Questions/ingsw/0722_15/correct.txt
diff --git a/Data/Questions/ingsw/0722_15/quest.txt b/legacy/Data/Questions/ingsw/0722_15/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_15/quest.txt
rename to legacy/Data/Questions/ingsw/0722_15/quest.txt
diff --git a/Data/Questions/ingsw/0722_15/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_15/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_15/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_15/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_15/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_15/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_15/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_15/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_16/correct.txt b/legacy/Data/Questions/ingsw/0722_16/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_16/correct.txt
rename to legacy/Data/Questions/ingsw/0722_16/correct.txt
diff --git a/Data/Questions/ingsw/0722_16/quest.txt b/legacy/Data/Questions/ingsw/0722_16/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_16/quest.txt
rename to legacy/Data/Questions/ingsw/0722_16/quest.txt
diff --git a/Data/Questions/ingsw/0722_16/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_16/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_16/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_16/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_16/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_16/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_16/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_16/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_17/correct.txt b/legacy/Data/Questions/ingsw/0722_17/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_17/correct.txt
rename to legacy/Data/Questions/ingsw/0722_17/correct.txt
diff --git a/Data/Questions/ingsw/0722_17/quest.txt b/legacy/Data/Questions/ingsw/0722_17/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_17/quest.txt
rename to legacy/Data/Questions/ingsw/0722_17/quest.txt
diff --git a/Data/Questions/ingsw/0722_17/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_17/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_17/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_17/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_17/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_17/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_17/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_17/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_18/correct.txt b/legacy/Data/Questions/ingsw/0722_18/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_18/correct.txt
rename to legacy/Data/Questions/ingsw/0722_18/correct.txt
diff --git a/Data/Questions/ingsw/0722_18/quest.txt b/legacy/Data/Questions/ingsw/0722_18/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_18/quest.txt
rename to legacy/Data/Questions/ingsw/0722_18/quest.txt
diff --git a/Data/Questions/ingsw/0722_18/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_18/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_18/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_18/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_18/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_18/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_18/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_18/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_19/correct.txt b/legacy/Data/Questions/ingsw/0722_19/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_19/correct.txt
rename to legacy/Data/Questions/ingsw/0722_19/correct.txt
diff --git a/Data/Questions/ingsw/0722_19/quest.txt b/legacy/Data/Questions/ingsw/0722_19/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_19/quest.txt
rename to legacy/Data/Questions/ingsw/0722_19/quest.txt
diff --git a/Data/Questions/ingsw/0722_19/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_19/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_19/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_19/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_19/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_19/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_19/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_19/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_2/correct.txt b/legacy/Data/Questions/ingsw/0722_2/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_2/correct.txt
rename to legacy/Data/Questions/ingsw/0722_2/correct.txt
diff --git a/Data/Questions/ingsw/0722_2/quest.txt b/legacy/Data/Questions/ingsw/0722_2/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_2/quest.txt
rename to legacy/Data/Questions/ingsw/0722_2/quest.txt
diff --git a/Data/Questions/ingsw/0722_2/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_2/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_2/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_2/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_2/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_2/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_2/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_2/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_20/correct.txt b/legacy/Data/Questions/ingsw/0722_20/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_20/correct.txt
rename to legacy/Data/Questions/ingsw/0722_20/correct.txt
diff --git a/Data/Questions/ingsw/0722_20/quest.txt b/legacy/Data/Questions/ingsw/0722_20/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_20/quest.txt
rename to legacy/Data/Questions/ingsw/0722_20/quest.txt
diff --git a/Data/Questions/ingsw/0722_20/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_20/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_20/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_20/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_20/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_20/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_20/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_20/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_21/correct.txt b/legacy/Data/Questions/ingsw/0722_21/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_21/correct.txt
rename to legacy/Data/Questions/ingsw/0722_21/correct.txt
diff --git a/Data/Questions/ingsw/0722_21/quest.txt b/legacy/Data/Questions/ingsw/0722_21/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_21/quest.txt
rename to legacy/Data/Questions/ingsw/0722_21/quest.txt
diff --git a/Data/Questions/ingsw/0722_21/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_21/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_21/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_21/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_21/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_21/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_21/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_21/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_22/correct.txt b/legacy/Data/Questions/ingsw/0722_22/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_22/correct.txt
rename to legacy/Data/Questions/ingsw/0722_22/correct.txt
diff --git a/Data/Questions/ingsw/0722_22/quest.txt b/legacy/Data/Questions/ingsw/0722_22/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_22/quest.txt
rename to legacy/Data/Questions/ingsw/0722_22/quest.txt
diff --git a/Data/Questions/ingsw/0722_22/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_22/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_22/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_22/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_22/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_22/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_22/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_22/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_23/correct.txt b/legacy/Data/Questions/ingsw/0722_23/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_23/correct.txt
rename to legacy/Data/Questions/ingsw/0722_23/correct.txt
diff --git a/Data/Questions/ingsw/0722_23/quest.txt b/legacy/Data/Questions/ingsw/0722_23/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_23/quest.txt
rename to legacy/Data/Questions/ingsw/0722_23/quest.txt
diff --git a/Data/Questions/ingsw/0722_23/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_23/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_23/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_23/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_23/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_23/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_23/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_23/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_24/correct.txt b/legacy/Data/Questions/ingsw/0722_24/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_24/correct.txt
rename to legacy/Data/Questions/ingsw/0722_24/correct.txt
diff --git a/Data/Questions/ingsw/0722_24/quest.txt b/legacy/Data/Questions/ingsw/0722_24/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_24/quest.txt
rename to legacy/Data/Questions/ingsw/0722_24/quest.txt
diff --git a/Data/Questions/ingsw/0722_24/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_24/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_24/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_24/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_24/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_24/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_24/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_24/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_25/correct.txt b/legacy/Data/Questions/ingsw/0722_25/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_25/correct.txt
rename to legacy/Data/Questions/ingsw/0722_25/correct.txt
diff --git a/Data/Questions/ingsw/0722_25/quest.txt b/legacy/Data/Questions/ingsw/0722_25/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_25/quest.txt
rename to legacy/Data/Questions/ingsw/0722_25/quest.txt
diff --git a/Data/Questions/ingsw/0722_25/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_25/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_25/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_25/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_25/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_25/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_25/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_25/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_26/correct.txt b/legacy/Data/Questions/ingsw/0722_26/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_26/correct.txt
rename to legacy/Data/Questions/ingsw/0722_26/correct.txt
diff --git a/Data/Questions/ingsw/0722_26/quest.txt b/legacy/Data/Questions/ingsw/0722_26/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_26/quest.txt
rename to legacy/Data/Questions/ingsw/0722_26/quest.txt
diff --git a/Data/Questions/ingsw/0722_26/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_26/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_26/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_26/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_26/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_26/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_26/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_26/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_3/correct.txt b/legacy/Data/Questions/ingsw/0722_3/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_3/correct.txt
rename to legacy/Data/Questions/ingsw/0722_3/correct.txt
diff --git a/Data/Questions/ingsw/0722_3/quest.txt b/legacy/Data/Questions/ingsw/0722_3/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_3/quest.txt
rename to legacy/Data/Questions/ingsw/0722_3/quest.txt
diff --git a/Data/Questions/ingsw/0722_3/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_3/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_3/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_3/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_3/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_3/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_3/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_3/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_4/correct.txt b/legacy/Data/Questions/ingsw/0722_4/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_4/correct.txt
rename to legacy/Data/Questions/ingsw/0722_4/correct.txt
diff --git a/Data/Questions/ingsw/0722_4/quest.txt b/legacy/Data/Questions/ingsw/0722_4/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_4/quest.txt
rename to legacy/Data/Questions/ingsw/0722_4/quest.txt
diff --git a/Data/Questions/ingsw/0722_4/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_4/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_4/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_4/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_4/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_4/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_4/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_4/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_5/correct.txt b/legacy/Data/Questions/ingsw/0722_5/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_5/correct.txt
rename to legacy/Data/Questions/ingsw/0722_5/correct.txt
diff --git a/Data/Questions/ingsw/0722_5/quest.txt b/legacy/Data/Questions/ingsw/0722_5/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_5/quest.txt
rename to legacy/Data/Questions/ingsw/0722_5/quest.txt
diff --git a/Data/Questions/ingsw/0722_5/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_5/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_5/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_5/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_5/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_5/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_5/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_5/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_6/correct.txt b/legacy/Data/Questions/ingsw/0722_6/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_6/correct.txt
rename to legacy/Data/Questions/ingsw/0722_6/correct.txt
diff --git a/Data/Questions/ingsw/0722_6/quest.txt b/legacy/Data/Questions/ingsw/0722_6/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_6/quest.txt
rename to legacy/Data/Questions/ingsw/0722_6/quest.txt
diff --git a/Data/Questions/ingsw/0722_6/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_6/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_6/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_6/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_6/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_6/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_6/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_6/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_7/correct.txt b/legacy/Data/Questions/ingsw/0722_7/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_7/correct.txt
rename to legacy/Data/Questions/ingsw/0722_7/correct.txt
diff --git a/Data/Questions/ingsw/0722_7/quest.txt b/legacy/Data/Questions/ingsw/0722_7/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_7/quest.txt
rename to legacy/Data/Questions/ingsw/0722_7/quest.txt
diff --git a/Data/Questions/ingsw/0722_7/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_7/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_7/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_7/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_7/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_7/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_7/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_7/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_8/correct.txt b/legacy/Data/Questions/ingsw/0722_8/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_8/correct.txt
rename to legacy/Data/Questions/ingsw/0722_8/correct.txt
diff --git a/Data/Questions/ingsw/0722_8/quest.txt b/legacy/Data/Questions/ingsw/0722_8/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_8/quest.txt
rename to legacy/Data/Questions/ingsw/0722_8/quest.txt
diff --git a/Data/Questions/ingsw/0722_8/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_8/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_8/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_8/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_8/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_8/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_8/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_8/wrong 2.txt
diff --git a/Data/Questions/ingsw/0722_9/correct.txt b/legacy/Data/Questions/ingsw/0722_9/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_9/correct.txt
rename to legacy/Data/Questions/ingsw/0722_9/correct.txt
diff --git a/Data/Questions/ingsw/0722_9/quest.txt b/legacy/Data/Questions/ingsw/0722_9/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_9/quest.txt
rename to legacy/Data/Questions/ingsw/0722_9/quest.txt
diff --git a/Data/Questions/ingsw/0722_9/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_9/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_9/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0722_9/wrong 1.txt
diff --git a/Data/Questions/ingsw/0722_9/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_9/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0722_9/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0722_9/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_10/correct.txt b/legacy/Data/Questions/ingsw/0922_10/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_10/correct.txt
rename to legacy/Data/Questions/ingsw/0922_10/correct.txt
diff --git a/Data/Questions/ingsw/0922_10/quest.txt b/legacy/Data/Questions/ingsw/0922_10/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_10/quest.txt
rename to legacy/Data/Questions/ingsw/0922_10/quest.txt
diff --git a/Data/Questions/ingsw/0922_10/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_10/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_10/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_10/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_10/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_10/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_10/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_10/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_11/correct.txt b/legacy/Data/Questions/ingsw/0922_11/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_11/correct.txt
rename to legacy/Data/Questions/ingsw/0922_11/correct.txt
diff --git a/Data/Questions/ingsw/0922_11/quest.txt b/legacy/Data/Questions/ingsw/0922_11/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_11/quest.txt
rename to legacy/Data/Questions/ingsw/0922_11/quest.txt
diff --git a/Data/Questions/ingsw/0922_11/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_11/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_11/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_11/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_11/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_11/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_11/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_11/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_12/correct.txt b/legacy/Data/Questions/ingsw/0922_12/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_12/correct.txt
rename to legacy/Data/Questions/ingsw/0922_12/correct.txt
diff --git a/Data/Questions/ingsw/0922_12/quest.txt b/legacy/Data/Questions/ingsw/0922_12/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_12/quest.txt
rename to legacy/Data/Questions/ingsw/0922_12/quest.txt
diff --git a/Data/Questions/ingsw/0922_12/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_12/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_12/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_12/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_12/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_12/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_12/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_12/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_13/correct.txt b/legacy/Data/Questions/ingsw/0922_13/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_13/correct.txt
rename to legacy/Data/Questions/ingsw/0922_13/correct.txt
diff --git a/Data/Questions/ingsw/0922_13/quest.txt b/legacy/Data/Questions/ingsw/0922_13/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_13/quest.txt
rename to legacy/Data/Questions/ingsw/0922_13/quest.txt
diff --git a/Data/Questions/ingsw/0922_13/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_13/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_13/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_13/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_13/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_13/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_13/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_13/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_14/correct.txt b/legacy/Data/Questions/ingsw/0922_14/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_14/correct.txt
rename to legacy/Data/Questions/ingsw/0922_14/correct.txt
diff --git a/Data/Questions/ingsw/0922_14/quest.txt b/legacy/Data/Questions/ingsw/0922_14/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_14/quest.txt
rename to legacy/Data/Questions/ingsw/0922_14/quest.txt
diff --git a/Data/Questions/ingsw/0922_14/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_14/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_14/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_14/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_14/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_14/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_14/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_14/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_15/correct.txt b/legacy/Data/Questions/ingsw/0922_15/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_15/correct.txt
rename to legacy/Data/Questions/ingsw/0922_15/correct.txt
diff --git a/Data/Questions/ingsw/0922_15/quest.txt b/legacy/Data/Questions/ingsw/0922_15/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_15/quest.txt
rename to legacy/Data/Questions/ingsw/0922_15/quest.txt
diff --git a/Data/Questions/ingsw/0922_15/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_15/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_15/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_15/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_15/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_15/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_15/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_15/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_16/correct.txt b/legacy/Data/Questions/ingsw/0922_16/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_16/correct.txt
rename to legacy/Data/Questions/ingsw/0922_16/correct.txt
diff --git a/Data/Questions/ingsw/0922_16/quest.txt b/legacy/Data/Questions/ingsw/0922_16/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_16/quest.txt
rename to legacy/Data/Questions/ingsw/0922_16/quest.txt
diff --git a/Data/Questions/ingsw/0922_16/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_16/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_16/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_16/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_16/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_16/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_16/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_16/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_17/correct.txt b/legacy/Data/Questions/ingsw/0922_17/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_17/correct.txt
rename to legacy/Data/Questions/ingsw/0922_17/correct.txt
diff --git a/Data/Questions/ingsw/0922_17/quest.txt b/legacy/Data/Questions/ingsw/0922_17/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_17/quest.txt
rename to legacy/Data/Questions/ingsw/0922_17/quest.txt
diff --git a/Data/Questions/ingsw/0922_17/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_17/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_17/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_17/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_17/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_17/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_17/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_17/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_18/correct.txt b/legacy/Data/Questions/ingsw/0922_18/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_18/correct.txt
rename to legacy/Data/Questions/ingsw/0922_18/correct.txt
diff --git a/Data/Questions/ingsw/0922_18/quest.txt b/legacy/Data/Questions/ingsw/0922_18/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_18/quest.txt
rename to legacy/Data/Questions/ingsw/0922_18/quest.txt
diff --git a/Data/Questions/ingsw/0922_18/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_18/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_18/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_18/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_18/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_18/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_18/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_18/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_3/correct.txt b/legacy/Data/Questions/ingsw/0922_3/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_3/correct.txt
rename to legacy/Data/Questions/ingsw/0922_3/correct.txt
diff --git a/Data/Questions/ingsw/0922_3/quest.txt b/legacy/Data/Questions/ingsw/0922_3/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_3/quest.txt
rename to legacy/Data/Questions/ingsw/0922_3/quest.txt
diff --git a/Data/Questions/ingsw/0922_3/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_3/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_3/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_3/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_3/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_3/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_3/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_3/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_4/correct.txt b/legacy/Data/Questions/ingsw/0922_4/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_4/correct.txt
rename to legacy/Data/Questions/ingsw/0922_4/correct.txt
diff --git a/Data/Questions/ingsw/0922_4/quest.txt b/legacy/Data/Questions/ingsw/0922_4/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_4/quest.txt
rename to legacy/Data/Questions/ingsw/0922_4/quest.txt
diff --git a/Data/Questions/ingsw/0922_4/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_4/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_4/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_4/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_4/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_4/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_4/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_4/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_5/correct.txt b/legacy/Data/Questions/ingsw/0922_5/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_5/correct.txt
rename to legacy/Data/Questions/ingsw/0922_5/correct.txt
diff --git a/Data/Questions/ingsw/0922_5/quest.txt b/legacy/Data/Questions/ingsw/0922_5/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_5/quest.txt
rename to legacy/Data/Questions/ingsw/0922_5/quest.txt
diff --git a/Data/Questions/ingsw/0922_5/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_5/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_5/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_5/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_5/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_5/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_5/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_5/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_6/correct.txt b/legacy/Data/Questions/ingsw/0922_6/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_6/correct.txt
rename to legacy/Data/Questions/ingsw/0922_6/correct.txt
diff --git a/Data/Questions/ingsw/0922_6/quest.txt b/legacy/Data/Questions/ingsw/0922_6/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_6/quest.txt
rename to legacy/Data/Questions/ingsw/0922_6/quest.txt
diff --git a/Data/Questions/ingsw/0922_6/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_6/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_6/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_6/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_6/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_6/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_6/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_6/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_7/correct.txt b/legacy/Data/Questions/ingsw/0922_7/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_7/correct.txt
rename to legacy/Data/Questions/ingsw/0922_7/correct.txt
diff --git a/Data/Questions/ingsw/0922_7/quest.txt b/legacy/Data/Questions/ingsw/0922_7/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_7/quest.txt
rename to legacy/Data/Questions/ingsw/0922_7/quest.txt
diff --git a/Data/Questions/ingsw/0922_7/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_7/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_7/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_7/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_7/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_7/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_7/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_7/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_8/correct.txt b/legacy/Data/Questions/ingsw/0922_8/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_8/correct.txt
rename to legacy/Data/Questions/ingsw/0922_8/correct.txt
diff --git a/Data/Questions/ingsw/0922_8/quest.txt b/legacy/Data/Questions/ingsw/0922_8/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_8/quest.txt
rename to legacy/Data/Questions/ingsw/0922_8/quest.txt
diff --git a/Data/Questions/ingsw/0922_8/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_8/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_8/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_8/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_8/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_8/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_8/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_8/wrong 2.txt
diff --git a/Data/Questions/ingsw/0922_9/correct.txt b/legacy/Data/Questions/ingsw/0922_9/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_9/correct.txt
rename to legacy/Data/Questions/ingsw/0922_9/correct.txt
diff --git a/Data/Questions/ingsw/0922_9/quest.txt b/legacy/Data/Questions/ingsw/0922_9/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_9/quest.txt
rename to legacy/Data/Questions/ingsw/0922_9/quest.txt
diff --git a/Data/Questions/ingsw/0922_9/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_9/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_9/wrong 1.txt
rename to legacy/Data/Questions/ingsw/0922_9/wrong 1.txt
diff --git a/Data/Questions/ingsw/0922_9/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_9/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/0922_9/wrong 2.txt
rename to legacy/Data/Questions/ingsw/0922_9/wrong 2.txt
diff --git a/Data/Questions/ingsw/10/correct.txt b/legacy/Data/Questions/ingsw/10/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/10/correct.txt
rename to legacy/Data/Questions/ingsw/10/correct.txt
diff --git a/Data/Questions/ingsw/10/quest.txt b/legacy/Data/Questions/ingsw/10/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/10/quest.txt
rename to legacy/Data/Questions/ingsw/10/quest.txt
diff --git a/Data/Questions/ingsw/10/wrong 2.txt b/legacy/Data/Questions/ingsw/10/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/10/wrong 2.txt
rename to legacy/Data/Questions/ingsw/10/wrong 2.txt
diff --git a/Data/Questions/ingsw/10/wrong.txt b/legacy/Data/Questions/ingsw/10/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/10/wrong.txt
rename to legacy/Data/Questions/ingsw/10/wrong.txt
diff --git a/Data/Questions/ingsw/11/correct.txt b/legacy/Data/Questions/ingsw/11/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/11/correct.txt
rename to legacy/Data/Questions/ingsw/11/correct.txt
diff --git a/Data/Questions/ingsw/11/quest.txt b/legacy/Data/Questions/ingsw/11/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/11/quest.txt
rename to legacy/Data/Questions/ingsw/11/quest.txt
diff --git a/Data/Questions/ingsw/11/wrong 2.txt b/legacy/Data/Questions/ingsw/11/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/11/wrong 2.txt
rename to legacy/Data/Questions/ingsw/11/wrong 2.txt
diff --git a/Data/Questions/ingsw/11/wrong.txt b/legacy/Data/Questions/ingsw/11/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/11/wrong.txt
rename to legacy/Data/Questions/ingsw/11/wrong.txt
diff --git a/Data/Questions/ingsw/1122_1/correct.txt b/legacy/Data/Questions/ingsw/1122_1/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_1/correct.txt
rename to legacy/Data/Questions/ingsw/1122_1/correct.txt
diff --git a/Data/Questions/ingsw/1122_1/quest.txt b/legacy/Data/Questions/ingsw/1122_1/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_1/quest.txt
rename to legacy/Data/Questions/ingsw/1122_1/quest.txt
diff --git a/Data/Questions/ingsw/1122_1/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_1/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_1/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_1/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_1/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_1/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_1/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_1/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_10/correct.txt b/legacy/Data/Questions/ingsw/1122_10/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_10/correct.txt
rename to legacy/Data/Questions/ingsw/1122_10/correct.txt
diff --git a/Data/Questions/ingsw/1122_10/quest.txt b/legacy/Data/Questions/ingsw/1122_10/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_10/quest.txt
rename to legacy/Data/Questions/ingsw/1122_10/quest.txt
diff --git a/Data/Questions/ingsw/1122_10/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_10/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_10/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_10/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_10/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_10/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_10/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_10/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_11/correct.txt b/legacy/Data/Questions/ingsw/1122_11/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_11/correct.txt
rename to legacy/Data/Questions/ingsw/1122_11/correct.txt
diff --git a/Data/Questions/ingsw/1122_11/quest.txt b/legacy/Data/Questions/ingsw/1122_11/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_11/quest.txt
rename to legacy/Data/Questions/ingsw/1122_11/quest.txt
diff --git a/Data/Questions/ingsw/1122_11/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_11/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_11/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_11/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_11/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_11/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_11/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_11/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_12/correct.txt b/legacy/Data/Questions/ingsw/1122_12/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_12/correct.txt
rename to legacy/Data/Questions/ingsw/1122_12/correct.txt
diff --git a/Data/Questions/ingsw/1122_12/quest.txt b/legacy/Data/Questions/ingsw/1122_12/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_12/quest.txt
rename to legacy/Data/Questions/ingsw/1122_12/quest.txt
diff --git a/Data/Questions/ingsw/1122_12/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_12/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_12/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_12/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_12/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_12/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_12/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_12/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_13/correct.txt b/legacy/Data/Questions/ingsw/1122_13/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_13/correct.txt
rename to legacy/Data/Questions/ingsw/1122_13/correct.txt
diff --git a/Data/Questions/ingsw/1122_13/quest.txt b/legacy/Data/Questions/ingsw/1122_13/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_13/quest.txt
rename to legacy/Data/Questions/ingsw/1122_13/quest.txt
diff --git a/Data/Questions/ingsw/1122_13/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_13/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_13/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_13/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_13/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_13/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_13/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_13/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_14/correct.txt b/legacy/Data/Questions/ingsw/1122_14/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_14/correct.txt
rename to legacy/Data/Questions/ingsw/1122_14/correct.txt
diff --git a/Data/Questions/ingsw/1122_14/quest.txt b/legacy/Data/Questions/ingsw/1122_14/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_14/quest.txt
rename to legacy/Data/Questions/ingsw/1122_14/quest.txt
diff --git a/Data/Questions/ingsw/1122_14/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_14/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_14/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_14/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_14/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_14/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_14/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_14/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_15/correct.txt b/legacy/Data/Questions/ingsw/1122_15/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_15/correct.txt
rename to legacy/Data/Questions/ingsw/1122_15/correct.txt
diff --git a/Data/Questions/ingsw/1122_15/quest.txt b/legacy/Data/Questions/ingsw/1122_15/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_15/quest.txt
rename to legacy/Data/Questions/ingsw/1122_15/quest.txt
diff --git a/Data/Questions/ingsw/1122_15/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_15/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_15/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_15/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_15/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_15/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_15/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_15/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_16/correct.txt b/legacy/Data/Questions/ingsw/1122_16/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_16/correct.txt
rename to legacy/Data/Questions/ingsw/1122_16/correct.txt
diff --git a/Data/Questions/ingsw/1122_16/quest.txt b/legacy/Data/Questions/ingsw/1122_16/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_16/quest.txt
rename to legacy/Data/Questions/ingsw/1122_16/quest.txt
diff --git a/Data/Questions/ingsw/1122_16/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_16/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_16/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_16/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_16/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_16/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_16/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_16/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_19/correct.txt b/legacy/Data/Questions/ingsw/1122_19/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_19/correct.txt
rename to legacy/Data/Questions/ingsw/1122_19/correct.txt
diff --git a/Data/Questions/ingsw/1122_19/quest.txt b/legacy/Data/Questions/ingsw/1122_19/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_19/quest.txt
rename to legacy/Data/Questions/ingsw/1122_19/quest.txt
diff --git a/Data/Questions/ingsw/1122_19/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_19/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_19/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_19/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_19/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_19/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_19/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_19/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_2/correct.txt b/legacy/Data/Questions/ingsw/1122_2/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_2/correct.txt
rename to legacy/Data/Questions/ingsw/1122_2/correct.txt
diff --git a/Data/Questions/ingsw/1122_2/quest.txt b/legacy/Data/Questions/ingsw/1122_2/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_2/quest.txt
rename to legacy/Data/Questions/ingsw/1122_2/quest.txt
diff --git a/Data/Questions/ingsw/1122_2/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_2/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_2/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_2/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_2/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_2/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_2/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_2/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_20/correct.txt b/legacy/Data/Questions/ingsw/1122_20/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_20/correct.txt
rename to legacy/Data/Questions/ingsw/1122_20/correct.txt
diff --git a/Data/Questions/ingsw/1122_20/quest.txt b/legacy/Data/Questions/ingsw/1122_20/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_20/quest.txt
rename to legacy/Data/Questions/ingsw/1122_20/quest.txt
diff --git a/Data/Questions/ingsw/1122_20/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_20/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_20/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_20/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_20/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_20/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_20/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_20/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_21/correct.txt b/legacy/Data/Questions/ingsw/1122_21/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_21/correct.txt
rename to legacy/Data/Questions/ingsw/1122_21/correct.txt
diff --git a/Data/Questions/ingsw/1122_21/quest.txt b/legacy/Data/Questions/ingsw/1122_21/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_21/quest.txt
rename to legacy/Data/Questions/ingsw/1122_21/quest.txt
diff --git a/Data/Questions/ingsw/1122_21/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_21/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_21/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_21/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_21/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_21/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_21/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_21/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_22/correct.txt b/legacy/Data/Questions/ingsw/1122_22/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_22/correct.txt
rename to legacy/Data/Questions/ingsw/1122_22/correct.txt
diff --git a/Data/Questions/ingsw/1122_22/quest.txt b/legacy/Data/Questions/ingsw/1122_22/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_22/quest.txt
rename to legacy/Data/Questions/ingsw/1122_22/quest.txt
diff --git a/Data/Questions/ingsw/1122_22/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_22/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_22/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_22/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_22/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_22/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_22/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_22/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_23/correct.txt b/legacy/Data/Questions/ingsw/1122_23/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_23/correct.txt
rename to legacy/Data/Questions/ingsw/1122_23/correct.txt
diff --git a/Data/Questions/ingsw/1122_23/quest.txt b/legacy/Data/Questions/ingsw/1122_23/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_23/quest.txt
rename to legacy/Data/Questions/ingsw/1122_23/quest.txt
diff --git a/Data/Questions/ingsw/1122_23/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_23/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_23/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_23/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_23/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_23/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_23/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_23/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_24/correct.txt b/legacy/Data/Questions/ingsw/1122_24/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_24/correct.txt
rename to legacy/Data/Questions/ingsw/1122_24/correct.txt
diff --git a/Data/Questions/ingsw/1122_24/quest.txt b/legacy/Data/Questions/ingsw/1122_24/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_24/quest.txt
rename to legacy/Data/Questions/ingsw/1122_24/quest.txt
diff --git a/Data/Questions/ingsw/1122_24/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_24/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_24/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_24/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_24/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_24/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_24/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_24/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_25/correct.txt b/legacy/Data/Questions/ingsw/1122_25/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_25/correct.txt
rename to legacy/Data/Questions/ingsw/1122_25/correct.txt
diff --git a/Data/Questions/ingsw/1122_25/quest.txt b/legacy/Data/Questions/ingsw/1122_25/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_25/quest.txt
rename to legacy/Data/Questions/ingsw/1122_25/quest.txt
diff --git a/Data/Questions/ingsw/1122_25/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_25/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_25/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_25/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_25/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_25/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_25/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_25/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_26/correct.txt b/legacy/Data/Questions/ingsw/1122_26/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_26/correct.txt
rename to legacy/Data/Questions/ingsw/1122_26/correct.txt
diff --git a/Data/Questions/ingsw/1122_26/quest.txt b/legacy/Data/Questions/ingsw/1122_26/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_26/quest.txt
rename to legacy/Data/Questions/ingsw/1122_26/quest.txt
diff --git a/Data/Questions/ingsw/1122_26/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_26/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_26/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_26/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_26/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_26/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_26/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_26/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_27/correct.txt b/legacy/Data/Questions/ingsw/1122_27/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_27/correct.txt
rename to legacy/Data/Questions/ingsw/1122_27/correct.txt
diff --git a/Data/Questions/ingsw/1122_27/quest.txt b/legacy/Data/Questions/ingsw/1122_27/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_27/quest.txt
rename to legacy/Data/Questions/ingsw/1122_27/quest.txt
diff --git a/Data/Questions/ingsw/1122_27/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_27/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_27/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_27/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_27/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_27/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_27/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_27/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_28/correct.txt b/legacy/Data/Questions/ingsw/1122_28/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_28/correct.txt
rename to legacy/Data/Questions/ingsw/1122_28/correct.txt
diff --git a/Data/Questions/ingsw/1122_28/quest.txt b/legacy/Data/Questions/ingsw/1122_28/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_28/quest.txt
rename to legacy/Data/Questions/ingsw/1122_28/quest.txt
diff --git a/Data/Questions/ingsw/1122_28/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_28/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_28/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_28/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_28/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_28/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_28/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_28/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_29/correct.txt b/legacy/Data/Questions/ingsw/1122_29/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_29/correct.txt
rename to legacy/Data/Questions/ingsw/1122_29/correct.txt
diff --git a/Data/Questions/ingsw/1122_29/quest.txt b/legacy/Data/Questions/ingsw/1122_29/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_29/quest.txt
rename to legacy/Data/Questions/ingsw/1122_29/quest.txt
diff --git a/Data/Questions/ingsw/1122_29/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_29/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_29/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_29/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_29/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_29/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_29/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_29/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_3/correct.txt b/legacy/Data/Questions/ingsw/1122_3/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_3/correct.txt
rename to legacy/Data/Questions/ingsw/1122_3/correct.txt
diff --git a/Data/Questions/ingsw/1122_3/quest.txt b/legacy/Data/Questions/ingsw/1122_3/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_3/quest.txt
rename to legacy/Data/Questions/ingsw/1122_3/quest.txt
diff --git a/Data/Questions/ingsw/1122_3/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_3/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_3/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_3/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_3/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_3/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_3/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_3/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_30/correct.txt b/legacy/Data/Questions/ingsw/1122_30/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_30/correct.txt
rename to legacy/Data/Questions/ingsw/1122_30/correct.txt
diff --git a/Data/Questions/ingsw/1122_30/quest.txt b/legacy/Data/Questions/ingsw/1122_30/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_30/quest.txt
rename to legacy/Data/Questions/ingsw/1122_30/quest.txt
diff --git a/Data/Questions/ingsw/1122_30/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_30/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_30/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_30/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_30/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_30/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_30/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_30/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_31/correct.txt b/legacy/Data/Questions/ingsw/1122_31/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_31/correct.txt
rename to legacy/Data/Questions/ingsw/1122_31/correct.txt
diff --git a/Data/Questions/ingsw/1122_31/quest.txt b/legacy/Data/Questions/ingsw/1122_31/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_31/quest.txt
rename to legacy/Data/Questions/ingsw/1122_31/quest.txt
diff --git a/Data/Questions/ingsw/1122_31/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_31/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_31/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_31/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_31/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_31/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_31/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_31/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_33/correct.txt b/legacy/Data/Questions/ingsw/1122_33/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_33/correct.txt
rename to legacy/Data/Questions/ingsw/1122_33/correct.txt
diff --git a/Data/Questions/ingsw/1122_33/quest.txt b/legacy/Data/Questions/ingsw/1122_33/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_33/quest.txt
rename to legacy/Data/Questions/ingsw/1122_33/quest.txt
diff --git a/Data/Questions/ingsw/1122_33/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_33/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_33/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_33/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_33/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_33/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_33/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_33/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_34/correct.txt b/legacy/Data/Questions/ingsw/1122_34/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_34/correct.txt
rename to legacy/Data/Questions/ingsw/1122_34/correct.txt
diff --git a/Data/Questions/ingsw/1122_34/quest.txt b/legacy/Data/Questions/ingsw/1122_34/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_34/quest.txt
rename to legacy/Data/Questions/ingsw/1122_34/quest.txt
diff --git a/Data/Questions/ingsw/1122_34/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_34/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_34/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_34/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_34/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_34/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_34/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_34/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_35/correct.txt b/legacy/Data/Questions/ingsw/1122_35/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_35/correct.txt
rename to legacy/Data/Questions/ingsw/1122_35/correct.txt
diff --git a/Data/Questions/ingsw/1122_35/quest.txt b/legacy/Data/Questions/ingsw/1122_35/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_35/quest.txt
rename to legacy/Data/Questions/ingsw/1122_35/quest.txt
diff --git a/Data/Questions/ingsw/1122_35/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_35/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_35/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_35/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_35/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_35/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_35/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_35/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_36/correct.txt b/legacy/Data/Questions/ingsw/1122_36/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_36/correct.txt
rename to legacy/Data/Questions/ingsw/1122_36/correct.txt
diff --git a/Data/Questions/ingsw/1122_36/quest.txt b/legacy/Data/Questions/ingsw/1122_36/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_36/quest.txt
rename to legacy/Data/Questions/ingsw/1122_36/quest.txt
diff --git a/Data/Questions/ingsw/1122_36/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_36/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_36/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_36/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_36/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_36/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_36/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_36/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_37/correct.txt b/legacy/Data/Questions/ingsw/1122_37/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_37/correct.txt
rename to legacy/Data/Questions/ingsw/1122_37/correct.txt
diff --git a/Data/Questions/ingsw/1122_37/quest.txt b/legacy/Data/Questions/ingsw/1122_37/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_37/quest.txt
rename to legacy/Data/Questions/ingsw/1122_37/quest.txt
diff --git a/Data/Questions/ingsw/1122_37/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_37/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_37/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_37/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_37/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_37/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_37/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_37/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_38/correct.txt b/legacy/Data/Questions/ingsw/1122_38/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_38/correct.txt
rename to legacy/Data/Questions/ingsw/1122_38/correct.txt
diff --git a/Data/Questions/ingsw/1122_38/quest.txt b/legacy/Data/Questions/ingsw/1122_38/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_38/quest.txt
rename to legacy/Data/Questions/ingsw/1122_38/quest.txt
diff --git a/Data/Questions/ingsw/1122_38/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_38/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_38/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_38/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_38/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_38/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_38/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_38/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_39/correct.txt b/legacy/Data/Questions/ingsw/1122_39/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_39/correct.txt
rename to legacy/Data/Questions/ingsw/1122_39/correct.txt
diff --git a/Data/Questions/ingsw/1122_39/quest.txt b/legacy/Data/Questions/ingsw/1122_39/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_39/quest.txt
rename to legacy/Data/Questions/ingsw/1122_39/quest.txt
diff --git a/Data/Questions/ingsw/1122_39/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_39/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_39/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_39/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_39/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_39/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_39/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_39/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_4/correct.txt b/legacy/Data/Questions/ingsw/1122_4/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_4/correct.txt
rename to legacy/Data/Questions/ingsw/1122_4/correct.txt
diff --git a/Data/Questions/ingsw/1122_4/quest.txt b/legacy/Data/Questions/ingsw/1122_4/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_4/quest.txt
rename to legacy/Data/Questions/ingsw/1122_4/quest.txt
diff --git a/Data/Questions/ingsw/1122_4/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_4/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_4/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_4/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_4/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_4/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_4/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_4/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_40/correct.txt b/legacy/Data/Questions/ingsw/1122_40/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_40/correct.txt
rename to legacy/Data/Questions/ingsw/1122_40/correct.txt
diff --git a/Data/Questions/ingsw/1122_40/quest.txt b/legacy/Data/Questions/ingsw/1122_40/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_40/quest.txt
rename to legacy/Data/Questions/ingsw/1122_40/quest.txt
diff --git a/Data/Questions/ingsw/1122_40/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_40/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_40/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_40/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_40/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_40/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_40/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_40/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_42/correct.txt b/legacy/Data/Questions/ingsw/1122_42/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_42/correct.txt
rename to legacy/Data/Questions/ingsw/1122_42/correct.txt
diff --git a/Data/Questions/ingsw/1122_42/quest.txt b/legacy/Data/Questions/ingsw/1122_42/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_42/quest.txt
rename to legacy/Data/Questions/ingsw/1122_42/quest.txt
diff --git a/Data/Questions/ingsw/1122_42/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_42/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_42/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_42/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_42/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_42/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_42/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_42/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_43/correct.txt b/legacy/Data/Questions/ingsw/1122_43/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_43/correct.txt
rename to legacy/Data/Questions/ingsw/1122_43/correct.txt
diff --git a/Data/Questions/ingsw/1122_43/quest.txt b/legacy/Data/Questions/ingsw/1122_43/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_43/quest.txt
rename to legacy/Data/Questions/ingsw/1122_43/quest.txt
diff --git a/Data/Questions/ingsw/1122_43/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_43/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_43/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_43/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_43/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_43/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_43/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_43/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_44/correct.txt b/legacy/Data/Questions/ingsw/1122_44/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_44/correct.txt
rename to legacy/Data/Questions/ingsw/1122_44/correct.txt
diff --git a/Data/Questions/ingsw/1122_44/quest.txt b/legacy/Data/Questions/ingsw/1122_44/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_44/quest.txt
rename to legacy/Data/Questions/ingsw/1122_44/quest.txt
diff --git a/Data/Questions/ingsw/1122_44/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_44/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_44/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_44/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_44/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_44/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_44/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_44/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_45/correct.txt b/legacy/Data/Questions/ingsw/1122_45/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_45/correct.txt
rename to legacy/Data/Questions/ingsw/1122_45/correct.txt
diff --git a/Data/Questions/ingsw/1122_45/quest.txt b/legacy/Data/Questions/ingsw/1122_45/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_45/quest.txt
rename to legacy/Data/Questions/ingsw/1122_45/quest.txt
diff --git a/Data/Questions/ingsw/1122_45/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_45/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_45/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_45/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_45/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_45/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_45/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_45/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_46/correct.txt b/legacy/Data/Questions/ingsw/1122_46/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_46/correct.txt
rename to legacy/Data/Questions/ingsw/1122_46/correct.txt
diff --git a/Data/Questions/ingsw/1122_46/quest.txt b/legacy/Data/Questions/ingsw/1122_46/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_46/quest.txt
rename to legacy/Data/Questions/ingsw/1122_46/quest.txt
diff --git a/Data/Questions/ingsw/1122_46/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_46/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_46/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_46/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_46/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_46/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_46/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_46/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_47/correct.txt b/legacy/Data/Questions/ingsw/1122_47/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_47/correct.txt
rename to legacy/Data/Questions/ingsw/1122_47/correct.txt
diff --git a/Data/Questions/ingsw/1122_47/quest.txt b/legacy/Data/Questions/ingsw/1122_47/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_47/quest.txt
rename to legacy/Data/Questions/ingsw/1122_47/quest.txt
diff --git a/Data/Questions/ingsw/1122_47/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_47/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_47/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_47/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_47/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_47/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_47/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_47/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_48/correct.txt b/legacy/Data/Questions/ingsw/1122_48/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_48/correct.txt
rename to legacy/Data/Questions/ingsw/1122_48/correct.txt
diff --git a/Data/Questions/ingsw/1122_48/quest.txt b/legacy/Data/Questions/ingsw/1122_48/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_48/quest.txt
rename to legacy/Data/Questions/ingsw/1122_48/quest.txt
diff --git a/Data/Questions/ingsw/1122_48/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_48/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_48/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_48/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_48/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_48/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_48/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_48/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_49/correct.txt b/legacy/Data/Questions/ingsw/1122_49/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_49/correct.txt
rename to legacy/Data/Questions/ingsw/1122_49/correct.txt
diff --git a/Data/Questions/ingsw/1122_49/quest.txt b/legacy/Data/Questions/ingsw/1122_49/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_49/quest.txt
rename to legacy/Data/Questions/ingsw/1122_49/quest.txt
diff --git a/Data/Questions/ingsw/1122_49/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_49/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_49/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_49/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_49/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_49/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_49/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_49/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_5/correct.txt b/legacy/Data/Questions/ingsw/1122_5/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_5/correct.txt
rename to legacy/Data/Questions/ingsw/1122_5/correct.txt
diff --git a/Data/Questions/ingsw/1122_5/quest.txt b/legacy/Data/Questions/ingsw/1122_5/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_5/quest.txt
rename to legacy/Data/Questions/ingsw/1122_5/quest.txt
diff --git a/Data/Questions/ingsw/1122_5/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_5/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_5/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_5/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_5/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_5/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_5/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_5/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_50/correct.txt b/legacy/Data/Questions/ingsw/1122_50/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_50/correct.txt
rename to legacy/Data/Questions/ingsw/1122_50/correct.txt
diff --git a/Data/Questions/ingsw/1122_50/quest.txt b/legacy/Data/Questions/ingsw/1122_50/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_50/quest.txt
rename to legacy/Data/Questions/ingsw/1122_50/quest.txt
diff --git a/Data/Questions/ingsw/1122_50/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_50/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_50/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_50/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_50/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_50/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_50/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_50/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_6/correct.txt b/legacy/Data/Questions/ingsw/1122_6/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_6/correct.txt
rename to legacy/Data/Questions/ingsw/1122_6/correct.txt
diff --git a/Data/Questions/ingsw/1122_6/quest.txt b/legacy/Data/Questions/ingsw/1122_6/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_6/quest.txt
rename to legacy/Data/Questions/ingsw/1122_6/quest.txt
diff --git a/Data/Questions/ingsw/1122_6/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_6/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_6/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_6/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_6/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_6/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_6/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_6/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_7/correct.txt b/legacy/Data/Questions/ingsw/1122_7/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_7/correct.txt
rename to legacy/Data/Questions/ingsw/1122_7/correct.txt
diff --git a/Data/Questions/ingsw/1122_7/quest.txt b/legacy/Data/Questions/ingsw/1122_7/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_7/quest.txt
rename to legacy/Data/Questions/ingsw/1122_7/quest.txt
diff --git a/Data/Questions/ingsw/1122_7/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_7/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_7/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_7/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_7/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_7/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_7/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_7/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_8/correct.txt b/legacy/Data/Questions/ingsw/1122_8/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_8/correct.txt
rename to legacy/Data/Questions/ingsw/1122_8/correct.txt
diff --git a/Data/Questions/ingsw/1122_8/quest.txt b/legacy/Data/Questions/ingsw/1122_8/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_8/quest.txt
rename to legacy/Data/Questions/ingsw/1122_8/quest.txt
diff --git a/Data/Questions/ingsw/1122_8/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_8/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_8/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_8/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_8/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_8/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_8/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_8/wrong 2.txt
diff --git a/Data/Questions/ingsw/1122_9/correct.txt b/legacy/Data/Questions/ingsw/1122_9/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_9/correct.txt
rename to legacy/Data/Questions/ingsw/1122_9/correct.txt
diff --git a/Data/Questions/ingsw/1122_9/quest.txt b/legacy/Data/Questions/ingsw/1122_9/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_9/quest.txt
rename to legacy/Data/Questions/ingsw/1122_9/quest.txt
diff --git a/Data/Questions/ingsw/1122_9/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_9/wrong 1.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_9/wrong 1.txt
rename to legacy/Data/Questions/ingsw/1122_9/wrong 1.txt
diff --git a/Data/Questions/ingsw/1122_9/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_9/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/1122_9/wrong 2.txt
rename to legacy/Data/Questions/ingsw/1122_9/wrong 2.txt
diff --git a/Data/Questions/ingsw/12/correct.txt b/legacy/Data/Questions/ingsw/12/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/12/correct.txt
rename to legacy/Data/Questions/ingsw/12/correct.txt
diff --git a/Data/Questions/ingsw/12/quest.txt b/legacy/Data/Questions/ingsw/12/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/12/quest.txt
rename to legacy/Data/Questions/ingsw/12/quest.txt
diff --git a/Data/Questions/ingsw/12/wrong 2.txt b/legacy/Data/Questions/ingsw/12/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/12/wrong 2.txt
rename to legacy/Data/Questions/ingsw/12/wrong 2.txt
diff --git a/Data/Questions/ingsw/12/wrong.txt b/legacy/Data/Questions/ingsw/12/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/12/wrong.txt
rename to legacy/Data/Questions/ingsw/12/wrong.txt
diff --git a/Data/Questions/ingsw/16/correct.txt b/legacy/Data/Questions/ingsw/16/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/16/correct.txt
rename to legacy/Data/Questions/ingsw/16/correct.txt
diff --git a/Data/Questions/ingsw/16/quest.txt b/legacy/Data/Questions/ingsw/16/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/16/quest.txt
rename to legacy/Data/Questions/ingsw/16/quest.txt
diff --git a/Data/Questions/ingsw/16/wrong 2.txt b/legacy/Data/Questions/ingsw/16/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/16/wrong 2.txt
rename to legacy/Data/Questions/ingsw/16/wrong 2.txt
diff --git a/Data/Questions/ingsw/16/wrong.txt b/legacy/Data/Questions/ingsw/16/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/16/wrong.txt
rename to legacy/Data/Questions/ingsw/16/wrong.txt
diff --git a/Data/Questions/ingsw/17/correct.txt b/legacy/Data/Questions/ingsw/17/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/17/correct.txt
rename to legacy/Data/Questions/ingsw/17/correct.txt
diff --git a/Data/Questions/ingsw/17/quest.txt b/legacy/Data/Questions/ingsw/17/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/17/quest.txt
rename to legacy/Data/Questions/ingsw/17/quest.txt
diff --git a/Data/Questions/ingsw/17/wrong 2.txt b/legacy/Data/Questions/ingsw/17/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/17/wrong 2.txt
rename to legacy/Data/Questions/ingsw/17/wrong 2.txt
diff --git a/Data/Questions/ingsw/17/wrong.txt b/legacy/Data/Questions/ingsw/17/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/17/wrong.txt
rename to legacy/Data/Questions/ingsw/17/wrong.txt
diff --git a/Data/Questions/ingsw/19/correct.txt b/legacy/Data/Questions/ingsw/19/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/19/correct.txt
rename to legacy/Data/Questions/ingsw/19/correct.txt
diff --git a/Data/Questions/ingsw/19/quest.txt b/legacy/Data/Questions/ingsw/19/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/19/quest.txt
rename to legacy/Data/Questions/ingsw/19/quest.txt
diff --git a/Data/Questions/ingsw/19/wrong 2.txt b/legacy/Data/Questions/ingsw/19/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/19/wrong 2.txt
rename to legacy/Data/Questions/ingsw/19/wrong 2.txt
diff --git a/Data/Questions/ingsw/19/wrong.txt b/legacy/Data/Questions/ingsw/19/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/19/wrong.txt
rename to legacy/Data/Questions/ingsw/19/wrong.txt
diff --git a/Data/Questions/ingsw/2/correct.txt b/legacy/Data/Questions/ingsw/2/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/2/correct.txt
rename to legacy/Data/Questions/ingsw/2/correct.txt
diff --git a/Data/Questions/ingsw/2/quest.txt b/legacy/Data/Questions/ingsw/2/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/2/quest.txt
rename to legacy/Data/Questions/ingsw/2/quest.txt
diff --git a/Data/Questions/ingsw/2/wrong 2.txt b/legacy/Data/Questions/ingsw/2/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/2/wrong 2.txt
rename to legacy/Data/Questions/ingsw/2/wrong 2.txt
diff --git a/Data/Questions/ingsw/2/wrong.txt b/legacy/Data/Questions/ingsw/2/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/2/wrong.txt
rename to legacy/Data/Questions/ingsw/2/wrong.txt
diff --git a/Data/Questions/ingsw/20/correct.txt b/legacy/Data/Questions/ingsw/20/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/20/correct.txt
rename to legacy/Data/Questions/ingsw/20/correct.txt
diff --git a/Data/Questions/ingsw/20/quest.txt b/legacy/Data/Questions/ingsw/20/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/20/quest.txt
rename to legacy/Data/Questions/ingsw/20/quest.txt
diff --git a/Data/Questions/ingsw/20/wrong 2.txt b/legacy/Data/Questions/ingsw/20/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/20/wrong 2.txt
rename to legacy/Data/Questions/ingsw/20/wrong 2.txt
diff --git a/Data/Questions/ingsw/20/wrong.txt b/legacy/Data/Questions/ingsw/20/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/20/wrong.txt
rename to legacy/Data/Questions/ingsw/20/wrong.txt
diff --git a/Data/Questions/ingsw/21/correct.txt b/legacy/Data/Questions/ingsw/21/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/21/correct.txt
rename to legacy/Data/Questions/ingsw/21/correct.txt
diff --git a/Data/Questions/ingsw/21/quest.txt b/legacy/Data/Questions/ingsw/21/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/21/quest.txt
rename to legacy/Data/Questions/ingsw/21/quest.txt
diff --git a/Data/Questions/ingsw/21/wrong 2.txt b/legacy/Data/Questions/ingsw/21/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/21/wrong 2.txt
rename to legacy/Data/Questions/ingsw/21/wrong 2.txt
diff --git a/Data/Questions/ingsw/21/wrong.txt b/legacy/Data/Questions/ingsw/21/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/21/wrong.txt
rename to legacy/Data/Questions/ingsw/21/wrong.txt
diff --git a/Data/Questions/ingsw/22/correct.txt b/legacy/Data/Questions/ingsw/22/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/22/correct.txt
rename to legacy/Data/Questions/ingsw/22/correct.txt
diff --git a/Data/Questions/ingsw/22/quest.txt b/legacy/Data/Questions/ingsw/22/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/22/quest.txt
rename to legacy/Data/Questions/ingsw/22/quest.txt
diff --git a/Data/Questions/ingsw/22/wrong 2.txt b/legacy/Data/Questions/ingsw/22/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/22/wrong 2.txt
rename to legacy/Data/Questions/ingsw/22/wrong 2.txt
diff --git a/Data/Questions/ingsw/22/wrong.txt b/legacy/Data/Questions/ingsw/22/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/22/wrong.txt
rename to legacy/Data/Questions/ingsw/22/wrong.txt
diff --git a/Data/Questions/ingsw/24/correct.txt b/legacy/Data/Questions/ingsw/24/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/24/correct.txt
rename to legacy/Data/Questions/ingsw/24/correct.txt
diff --git a/Data/Questions/ingsw/24/quest.txt b/legacy/Data/Questions/ingsw/24/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/24/quest.txt
rename to legacy/Data/Questions/ingsw/24/quest.txt
diff --git a/Data/Questions/ingsw/24/wrong 2.txt b/legacy/Data/Questions/ingsw/24/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/24/wrong 2.txt
rename to legacy/Data/Questions/ingsw/24/wrong 2.txt
diff --git a/Data/Questions/ingsw/24/wrong.txt b/legacy/Data/Questions/ingsw/24/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/24/wrong.txt
rename to legacy/Data/Questions/ingsw/24/wrong.txt
diff --git a/Data/Questions/ingsw/25/correct.txt b/legacy/Data/Questions/ingsw/25/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/25/correct.txt
rename to legacy/Data/Questions/ingsw/25/correct.txt
diff --git a/Data/Questions/ingsw/25/quest.txt b/legacy/Data/Questions/ingsw/25/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/25/quest.txt
rename to legacy/Data/Questions/ingsw/25/quest.txt
diff --git a/Data/Questions/ingsw/25/wrong 2.txt b/legacy/Data/Questions/ingsw/25/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/25/wrong 2.txt
rename to legacy/Data/Questions/ingsw/25/wrong 2.txt
diff --git a/Data/Questions/ingsw/25/wrong.txt b/legacy/Data/Questions/ingsw/25/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/25/wrong.txt
rename to legacy/Data/Questions/ingsw/25/wrong.txt
diff --git a/Data/Questions/ingsw/26/correct.txt b/legacy/Data/Questions/ingsw/26/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/26/correct.txt
rename to legacy/Data/Questions/ingsw/26/correct.txt
diff --git a/Data/Questions/ingsw/26/quest.txt b/legacy/Data/Questions/ingsw/26/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/26/quest.txt
rename to legacy/Data/Questions/ingsw/26/quest.txt
diff --git a/Data/Questions/ingsw/26/wrong 2.txt b/legacy/Data/Questions/ingsw/26/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/26/wrong 2.txt
rename to legacy/Data/Questions/ingsw/26/wrong 2.txt
diff --git a/Data/Questions/ingsw/26/wrong.txt b/legacy/Data/Questions/ingsw/26/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/26/wrong.txt
rename to legacy/Data/Questions/ingsw/26/wrong.txt
diff --git a/Data/Questions/ingsw/32/correct.txt b/legacy/Data/Questions/ingsw/32/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/32/correct.txt
rename to legacy/Data/Questions/ingsw/32/correct.txt
diff --git a/Data/Questions/ingsw/32/quest.txt b/legacy/Data/Questions/ingsw/32/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/32/quest.txt
rename to legacy/Data/Questions/ingsw/32/quest.txt
diff --git a/Data/Questions/ingsw/32/wrong 2.txt b/legacy/Data/Questions/ingsw/32/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/32/wrong 2.txt
rename to legacy/Data/Questions/ingsw/32/wrong 2.txt
diff --git a/Data/Questions/ingsw/32/wrong.txt b/legacy/Data/Questions/ingsw/32/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/32/wrong.txt
rename to legacy/Data/Questions/ingsw/32/wrong.txt
diff --git a/Data/Questions/ingsw/33/correct.txt b/legacy/Data/Questions/ingsw/33/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/33/correct.txt
rename to legacy/Data/Questions/ingsw/33/correct.txt
diff --git a/Data/Questions/ingsw/33/quest.txt b/legacy/Data/Questions/ingsw/33/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/33/quest.txt
rename to legacy/Data/Questions/ingsw/33/quest.txt
diff --git a/Data/Questions/ingsw/33/wrong 2.txt b/legacy/Data/Questions/ingsw/33/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/33/wrong 2.txt
rename to legacy/Data/Questions/ingsw/33/wrong 2.txt
diff --git a/Data/Questions/ingsw/33/wrong.txt b/legacy/Data/Questions/ingsw/33/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/33/wrong.txt
rename to legacy/Data/Questions/ingsw/33/wrong.txt
diff --git a/Data/Questions/ingsw/34/correct.txt b/legacy/Data/Questions/ingsw/34/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/34/correct.txt
rename to legacy/Data/Questions/ingsw/34/correct.txt
diff --git a/Data/Questions/ingsw/34/quest.txt b/legacy/Data/Questions/ingsw/34/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/34/quest.txt
rename to legacy/Data/Questions/ingsw/34/quest.txt
diff --git a/Data/Questions/ingsw/34/wrong 2.txt b/legacy/Data/Questions/ingsw/34/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/34/wrong 2.txt
rename to legacy/Data/Questions/ingsw/34/wrong 2.txt
diff --git a/Data/Questions/ingsw/34/wrong.txt b/legacy/Data/Questions/ingsw/34/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/34/wrong.txt
rename to legacy/Data/Questions/ingsw/34/wrong.txt
diff --git a/Data/Questions/ingsw/35/correct.txt b/legacy/Data/Questions/ingsw/35/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/35/correct.txt
rename to legacy/Data/Questions/ingsw/35/correct.txt
diff --git a/Data/Questions/ingsw/35/quest.txt b/legacy/Data/Questions/ingsw/35/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/35/quest.txt
rename to legacy/Data/Questions/ingsw/35/quest.txt
diff --git a/Data/Questions/ingsw/35/wrong 2.txt b/legacy/Data/Questions/ingsw/35/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/35/wrong 2.txt
rename to legacy/Data/Questions/ingsw/35/wrong 2.txt
diff --git a/Data/Questions/ingsw/35/wrong.txt b/legacy/Data/Questions/ingsw/35/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/35/wrong.txt
rename to legacy/Data/Questions/ingsw/35/wrong.txt
diff --git a/Data/Questions/ingsw/39/correct.txt b/legacy/Data/Questions/ingsw/39/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/39/correct.txt
rename to legacy/Data/Questions/ingsw/39/correct.txt
diff --git a/Data/Questions/ingsw/39/quest.txt b/legacy/Data/Questions/ingsw/39/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/39/quest.txt
rename to legacy/Data/Questions/ingsw/39/quest.txt
diff --git a/Data/Questions/ingsw/39/wrong 2.txt b/legacy/Data/Questions/ingsw/39/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/39/wrong 2.txt
rename to legacy/Data/Questions/ingsw/39/wrong 2.txt
diff --git a/Data/Questions/ingsw/39/wrong.txt b/legacy/Data/Questions/ingsw/39/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/39/wrong.txt
rename to legacy/Data/Questions/ingsw/39/wrong.txt
diff --git a/Data/Questions/ingsw/4/correct.txt b/legacy/Data/Questions/ingsw/4/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/4/correct.txt
rename to legacy/Data/Questions/ingsw/4/correct.txt
diff --git a/Data/Questions/ingsw/4/quest.txt b/legacy/Data/Questions/ingsw/4/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/4/quest.txt
rename to legacy/Data/Questions/ingsw/4/quest.txt
diff --git a/Data/Questions/ingsw/4/wrong 2.txt b/legacy/Data/Questions/ingsw/4/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/4/wrong 2.txt
rename to legacy/Data/Questions/ingsw/4/wrong 2.txt
diff --git a/Data/Questions/ingsw/4/wrong.txt b/legacy/Data/Questions/ingsw/4/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/4/wrong.txt
rename to legacy/Data/Questions/ingsw/4/wrong.txt
diff --git a/Data/Questions/ingsw/43/correct.txt b/legacy/Data/Questions/ingsw/43/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/43/correct.txt
rename to legacy/Data/Questions/ingsw/43/correct.txt
diff --git a/Data/Questions/ingsw/43/quest.txt b/legacy/Data/Questions/ingsw/43/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/43/quest.txt
rename to legacy/Data/Questions/ingsw/43/quest.txt
diff --git a/Data/Questions/ingsw/43/wrong 2.txt b/legacy/Data/Questions/ingsw/43/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/43/wrong 2.txt
rename to legacy/Data/Questions/ingsw/43/wrong 2.txt
diff --git a/Data/Questions/ingsw/43/wrong.txt b/legacy/Data/Questions/ingsw/43/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/43/wrong.txt
rename to legacy/Data/Questions/ingsw/43/wrong.txt
diff --git a/Data/Questions/ingsw/44/correct.txt b/legacy/Data/Questions/ingsw/44/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/44/correct.txt
rename to legacy/Data/Questions/ingsw/44/correct.txt
diff --git a/Data/Questions/ingsw/44/quest.txt b/legacy/Data/Questions/ingsw/44/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/44/quest.txt
rename to legacy/Data/Questions/ingsw/44/quest.txt
diff --git a/Data/Questions/ingsw/44/wrong 2.txt b/legacy/Data/Questions/ingsw/44/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/44/wrong 2.txt
rename to legacy/Data/Questions/ingsw/44/wrong 2.txt
diff --git a/Data/Questions/ingsw/44/wrong.txt b/legacy/Data/Questions/ingsw/44/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/44/wrong.txt
rename to legacy/Data/Questions/ingsw/44/wrong.txt
diff --git a/Data/Questions/ingsw/45/correct.txt b/legacy/Data/Questions/ingsw/45/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/45/correct.txt
rename to legacy/Data/Questions/ingsw/45/correct.txt
diff --git a/Data/Questions/ingsw/45/quest.txt b/legacy/Data/Questions/ingsw/45/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/45/quest.txt
rename to legacy/Data/Questions/ingsw/45/quest.txt
diff --git a/Data/Questions/ingsw/45/wrong 2.txt b/legacy/Data/Questions/ingsw/45/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/45/wrong 2.txt
rename to legacy/Data/Questions/ingsw/45/wrong 2.txt
diff --git a/Data/Questions/ingsw/45/wrong.txt b/legacy/Data/Questions/ingsw/45/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/45/wrong.txt
rename to legacy/Data/Questions/ingsw/45/wrong.txt
diff --git a/Data/Questions/ingsw/46/correct.txt b/legacy/Data/Questions/ingsw/46/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/46/correct.txt
rename to legacy/Data/Questions/ingsw/46/correct.txt
diff --git a/Data/Questions/ingsw/46/quest.txt b/legacy/Data/Questions/ingsw/46/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/46/quest.txt
rename to legacy/Data/Questions/ingsw/46/quest.txt
diff --git a/Data/Questions/ingsw/46/wrong 2.txt b/legacy/Data/Questions/ingsw/46/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/46/wrong 2.txt
rename to legacy/Data/Questions/ingsw/46/wrong 2.txt
diff --git a/Data/Questions/ingsw/46/wrong.txt b/legacy/Data/Questions/ingsw/46/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/46/wrong.txt
rename to legacy/Data/Questions/ingsw/46/wrong.txt
diff --git a/Data/Questions/ingsw/47/correct.txt b/legacy/Data/Questions/ingsw/47/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/47/correct.txt
rename to legacy/Data/Questions/ingsw/47/correct.txt
diff --git a/Data/Questions/ingsw/47/quest.txt b/legacy/Data/Questions/ingsw/47/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/47/quest.txt
rename to legacy/Data/Questions/ingsw/47/quest.txt
diff --git a/Data/Questions/ingsw/47/wrong 2.txt b/legacy/Data/Questions/ingsw/47/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/47/wrong 2.txt
rename to legacy/Data/Questions/ingsw/47/wrong 2.txt
diff --git a/Data/Questions/ingsw/47/wrong.txt b/legacy/Data/Questions/ingsw/47/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/47/wrong.txt
rename to legacy/Data/Questions/ingsw/47/wrong.txt
diff --git a/Data/Questions/ingsw/48/correct.txt b/legacy/Data/Questions/ingsw/48/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/48/correct.txt
rename to legacy/Data/Questions/ingsw/48/correct.txt
diff --git a/Data/Questions/ingsw/48/quest.txt b/legacy/Data/Questions/ingsw/48/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/48/quest.txt
rename to legacy/Data/Questions/ingsw/48/quest.txt
diff --git a/Data/Questions/ingsw/48/wrong 2.txt b/legacy/Data/Questions/ingsw/48/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/48/wrong 2.txt
rename to legacy/Data/Questions/ingsw/48/wrong 2.txt
diff --git a/Data/Questions/ingsw/48/wrong.txt b/legacy/Data/Questions/ingsw/48/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/48/wrong.txt
rename to legacy/Data/Questions/ingsw/48/wrong.txt
diff --git a/Data/Questions/ingsw/49/correct.txt b/legacy/Data/Questions/ingsw/49/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/49/correct.txt
rename to legacy/Data/Questions/ingsw/49/correct.txt
diff --git a/Data/Questions/ingsw/49/quest.txt b/legacy/Data/Questions/ingsw/49/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/49/quest.txt
rename to legacy/Data/Questions/ingsw/49/quest.txt
diff --git a/Data/Questions/ingsw/49/wrong 2.txt b/legacy/Data/Questions/ingsw/49/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/49/wrong 2.txt
rename to legacy/Data/Questions/ingsw/49/wrong 2.txt
diff --git a/Data/Questions/ingsw/49/wrong.txt b/legacy/Data/Questions/ingsw/49/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/49/wrong.txt
rename to legacy/Data/Questions/ingsw/49/wrong.txt
diff --git a/Data/Questions/ingsw/5/correct.txt b/legacy/Data/Questions/ingsw/5/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/5/correct.txt
rename to legacy/Data/Questions/ingsw/5/correct.txt
diff --git a/Data/Questions/ingsw/5/quest.txt b/legacy/Data/Questions/ingsw/5/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/5/quest.txt
rename to legacy/Data/Questions/ingsw/5/quest.txt
diff --git a/Data/Questions/ingsw/5/wrong 2.txt b/legacy/Data/Questions/ingsw/5/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/5/wrong 2.txt
rename to legacy/Data/Questions/ingsw/5/wrong 2.txt
diff --git a/Data/Questions/ingsw/5/wrong.txt b/legacy/Data/Questions/ingsw/5/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/5/wrong.txt
rename to legacy/Data/Questions/ingsw/5/wrong.txt
diff --git a/Data/Questions/ingsw/50/correct.txt b/legacy/Data/Questions/ingsw/50/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/50/correct.txt
rename to legacy/Data/Questions/ingsw/50/correct.txt
diff --git a/Data/Questions/ingsw/50/quest.txt b/legacy/Data/Questions/ingsw/50/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/50/quest.txt
rename to legacy/Data/Questions/ingsw/50/quest.txt
diff --git a/Data/Questions/ingsw/50/wrong 2.txt b/legacy/Data/Questions/ingsw/50/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/50/wrong 2.txt
rename to legacy/Data/Questions/ingsw/50/wrong 2.txt
diff --git a/Data/Questions/ingsw/50/wrong.txt b/legacy/Data/Questions/ingsw/50/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/50/wrong.txt
rename to legacy/Data/Questions/ingsw/50/wrong.txt
diff --git a/Data/Questions/ingsw/69420/correct.txt b/legacy/Data/Questions/ingsw/69420/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/69420/correct.txt
rename to legacy/Data/Questions/ingsw/69420/correct.txt
diff --git a/Data/Questions/ingsw/69420/quest.txt b/legacy/Data/Questions/ingsw/69420/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/69420/quest.txt
rename to legacy/Data/Questions/ingsw/69420/quest.txt
diff --git a/Data/Questions/ingsw/69420/wrong 2.txt b/legacy/Data/Questions/ingsw/69420/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/69420/wrong 2.txt
rename to legacy/Data/Questions/ingsw/69420/wrong 2.txt
diff --git a/Data/Questions/ingsw/69420/wrong 3.txt b/legacy/Data/Questions/ingsw/69420/wrong 3.txt
similarity index 100%
rename from Data/Questions/ingsw/69420/wrong 3.txt
rename to legacy/Data/Questions/ingsw/69420/wrong 3.txt
diff --git a/Data/Questions/ingsw/69420/wrong.txt b/legacy/Data/Questions/ingsw/69420/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/69420/wrong.txt
rename to legacy/Data/Questions/ingsw/69420/wrong.txt
diff --git a/Data/Questions/ingsw/8/correct.txt b/legacy/Data/Questions/ingsw/8/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/8/correct.txt
rename to legacy/Data/Questions/ingsw/8/correct.txt
diff --git a/Data/Questions/ingsw/8/quest.txt b/legacy/Data/Questions/ingsw/8/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/8/quest.txt
rename to legacy/Data/Questions/ingsw/8/quest.txt
diff --git a/Data/Questions/ingsw/8/wrong 2.txt b/legacy/Data/Questions/ingsw/8/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/8/wrong 2.txt
rename to legacy/Data/Questions/ingsw/8/wrong 2.txt
diff --git a/Data/Questions/ingsw/8/wrong.txt b/legacy/Data/Questions/ingsw/8/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/8/wrong.txt
rename to legacy/Data/Questions/ingsw/8/wrong.txt
diff --git a/Data/Questions/ingsw/9/correct.txt b/legacy/Data/Questions/ingsw/9/correct.txt
similarity index 100%
rename from Data/Questions/ingsw/9/correct.txt
rename to legacy/Data/Questions/ingsw/9/correct.txt
diff --git a/Data/Questions/ingsw/9/quest.txt b/legacy/Data/Questions/ingsw/9/quest.txt
similarity index 100%
rename from Data/Questions/ingsw/9/quest.txt
rename to legacy/Data/Questions/ingsw/9/quest.txt
diff --git a/Data/Questions/ingsw/9/wrong 2.txt b/legacy/Data/Questions/ingsw/9/wrong 2.txt
similarity index 100%
rename from Data/Questions/ingsw/9/wrong 2.txt
rename to legacy/Data/Questions/ingsw/9/wrong 2.txt
diff --git a/Data/Questions/ingsw/9/wrong.txt b/legacy/Data/Questions/ingsw/9/wrong.txt
similarity index 100%
rename from Data/Questions/ingsw/9/wrong.txt
rename to legacy/Data/Questions/ingsw/9/wrong.txt
diff --git a/Data/Questions/ium_unive.txt b/legacy/Data/Questions/ium_unive.txt
similarity index 100%
rename from Data/Questions/ium_unive.txt
rename to legacy/Data/Questions/ium_unive.txt
diff --git a/Data/Questions/ogas.txt b/legacy/Data/Questions/ogas.txt
similarity index 100%
rename from Data/Questions/ogas.txt
rename to legacy/Data/Questions/ogas.txt
diff --git a/Data/Questions/sicurezza.txt b/legacy/Data/Questions/sicurezza.txt
similarity index 100%
rename from Data/Questions/sicurezza.txt
rename to legacy/Data/Questions/sicurezza.txt
diff --git a/Data/Questions/sicurezza_appello1.txt b/legacy/Data/Questions/sicurezza_appello1.txt
similarity index 100%
rename from Data/Questions/sicurezza_appello1.txt
rename to legacy/Data/Questions/sicurezza_appello1.txt
diff --git a/Data/Questions/so1.txt b/legacy/Data/Questions/so1.txt
similarity index 100%
rename from Data/Questions/so1.txt
rename to legacy/Data/Questions/so1.txt
diff --git a/Data/Questions/so1_new.json b/legacy/Data/Questions/so1_new.json
similarity index 100%
rename from Data/Questions/so1_new.json
rename to legacy/Data/Questions/so1_new.json
diff --git a/Data/Questions/so1_unive.txt b/legacy/Data/Questions/so1_unive.txt
similarity index 100%
rename from Data/Questions/so1_unive.txt
rename to legacy/Data/Questions/so1_unive.txt
diff --git a/Data/Questions/so2.txt b/legacy/Data/Questions/so2.txt
similarity index 100%
rename from Data/Questions/so2.txt
rename to legacy/Data/Questions/so2.txt
diff --git a/legacy/Data/ingsw/0000_102/correct.txt b/legacy/Data/ingsw/0000_102/correct.txt
new file mode 100644
index 0000000..6613ca3
--- /dev/null
+++ b/legacy/Data/ingsw/0000_102/correct.txt
@@ -0,0 +1 @@
+(a=100, b=false, c=true), (a=90, b=true, c=false)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_102/quest.txt b/legacy/Data/ingsw/0000_102/quest.txt
new file mode 100644
index 0000000..e13f059
--- /dev/null
+++ b/legacy/Data/ingsw/0000_102/quest.txt
@@ -0,0 +1,20 @@
+Una Condition è una proposizione booleana, cioè una espressione con valore booleano che non può essere decomposta in espressioni boolean più semplici. Ad esempio, (x + y <= 3) è una condition.
+
+Una Decision è una espressione booleana composta da conditions e zero o più operatori booleani. Ad esempio, sono decisions:
+(x + y <= 3)
+((x + y <= 3) || (x - y > 7))
+
+Un insieme di test T soddisfa il criterio di Condition/Decision coverage se tutte le seguenti condizioni sono soddisfatte:
+
+1) Ciascun punto di entrata ed uscita nel programma è eseguito in almeno un test;
+2) Per ogni decision d nel programma, per ogni condition c in d, esiste un test in T in cui c è true ed un test in T in cui c è false.
+3) Per ogni decision d nel programma, esiste in test in T in cui d è true ed un test in T in cui d è false.
+
+Si consideri la seguente funzione:
+
+int f(int a, bool b, bool c)
+{ if ( (a == 100) && (b || c) )
+ { return (1); }
+ else { return (2);}
+}
+Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_102/wrong1.txt b/legacy/Data/ingsw/0000_102/wrong1.txt
new file mode 100644
index 0000000..9e9ca26
--- /dev/null
+++ b/legacy/Data/ingsw/0000_102/wrong1.txt
@@ -0,0 +1 @@
+(a=100, b=false, c=false), (a=90, b=true, c=true)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_102/wrong2.txt b/legacy/Data/ingsw/0000_102/wrong2.txt
new file mode 100644
index 0000000..2a2414b
--- /dev/null
+++ b/legacy/Data/ingsw/0000_102/wrong2.txt
@@ -0,0 +1 @@
+(a=100, b=false, c=true), (a=90, b=false, c=true)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_2/correct.txt b/legacy/Data/ingsw/0000_2/correct.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0000_2/correct.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_2/quest.txt b/legacy/Data/ingsw/0000_2/quest.txt
new file mode 100644
index 0000000..c5fe9fb
--- /dev/null
+++ b/legacy/Data/ingsw/0000_2/quest.txt
@@ -0,0 +1,57 @@
+Il branch coverage di un insieme di test cases è la percentuale di branch del programma che sono attraversati da almeno un test case.
+
+Si consideri il seguente programma C:
+
+-----------
+
+#include
+
+#include
+
+#include
+
+#define N 4 /* number of test cases */
+
+
+
+int f(int x1, int x2)
+
+{
+
+ if (x1 + x2 <= 2)
+
+ return (1);
+
+ else return (2);
+
+}
+
+
+
+int main() { int i, y; int x1[N], x2[N];
+
+ // define test cases
+
+ x1[0] = 5; x2[0] = -2; x1[1] = 6; x2[1] = -3; x1[2] = 7; x2[2] = -4; x1[3] = 8; x2[3] = -5;
+
+ // testing
+
+ for (i = 0; i < N; i++) {
+
+ y = f(x1[i], x2[i]); // function under testing
+
+ assert(y ==(x1[i], x2[i] <= 2) ? 1 : 2); // oracle
+
+ }
+
+ printf("All %d test cases passed\n", N);
+
+ return (0);
+
+}
+
+-----------
+
+Il programma main() sopra realizza il nostro testing per la funzione f1(). I test cases sono i valori in x1[i] ed x2[i].
+
+Quale delle seguenti è la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_2/wrong1.txt b/legacy/Data/ingsw/0000_2/wrong1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0000_2/wrong1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_2/wrong2.txt b/legacy/Data/ingsw/0000_2/wrong2.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0000_2/wrong2.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_3/correct.txt b/legacy/Data/ingsw/0000_3/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0000_3/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_3/quest.txt b/legacy/Data/ingsw/0000_3/quest.txt
new file mode 100644
index 0000000..ba81b1a
--- /dev/null
+++ b/legacy/Data/ingsw/0000_3/quest.txt
@@ -0,0 +1,45 @@
+Il partition coverage di un insieme di test cases è la percentuale di elementi della partition inclusi nei test cases. La partition è una partizione finita dell'insieme di input della funzione che si sta testando.
+
+Si consideri il seguente programma C:
+
+-----------
+
+#include
+
+#include
+
+#include
+
+#define N 5 /* number of test cases */
+
+int f1(int x) { return (2*x); }
+
+int main() { int i, y; int x[N];
+
+ // define test cases
+
+ x[0] = 0; x[1] = 1; x[2] = -1; x[3] = 10; x[4] = -10;
+
+// testing
+
+for (i = 0; i < N; i++) {
+
+ y = f1(x[i]); // function under testing
+
+ assert(y == 2*x[i]); // oracle
+
+ }
+
+ printf("All %d test cases passed\n", N);
+
+ return (0);
+
+}
+
+Si vuole testare la funzione f1(). A tal fine l'insieme degli interi viene partizionato come segue:
+
+{0, {-1}, {1}, {tutti glli interi negativi diversi da -1}, {tutti glli interi positivi diversi da 1}}
+
+Il programma main() sopra realizza il nostro testing per la funzione f1(). I test cases sono i valori in x[i].
+
+Quale delle seguenti è la partition coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_3/wrong1.txt b/legacy/Data/ingsw/0000_3/wrong1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0000_3/wrong1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_3/wrong2.txt b/legacy/Data/ingsw/0000_3/wrong2.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0000_3/wrong2.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_32/correct.txt b/legacy/Data/ingsw/0000_32/correct.txt
new file mode 100644
index 0000000..1ef5b94
--- /dev/null
+++ b/legacy/Data/ingsw/0000_32/correct.txt
@@ -0,0 +1 @@
+(a=100, b=true, c=false), (a=90, b=false, c=true), (a=90, b=false, c=false)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_32/quest.txt b/legacy/Data/ingsw/0000_32/quest.txt
new file mode 100644
index 0000000..f07b439
--- /dev/null
+++ b/legacy/Data/ingsw/0000_32/quest.txt
@@ -0,0 +1,22 @@
+Una Condition è una proposizione booleana, cioè una espressione con valore booleano che non può essere decomposta in espressioni boolean più semplici. Ad esempio, (x + y <= 3) è una condition.
+
+Una Decision è una espressione booleana composta da conditions e zero o più operatori booleani. Ad esempio, sono decisions:
+(x + y <= 3)
+((x + y <= 3) || (x - y > 7))
+
+Un insieme di test T soddisfa il criterio di Condition/Decision coverage se tutte le seguenti condizioni sono soddisfatte:
+
+1) Ciascun punto di entrata ed uscita nel programma è eseguito in almeno un test;
+2) Per ogni decision d nel programma, per ogni condition c in d, esiste un test in T in cui c è true ed un test in T in cui c è false.
+3) Per ogni decision d nel programma, esiste in test in T in cui d è true ed un test in T in cui d è false.
+
+Si consideri la seguente funzione:
+
+int f(int a, bool b, bool c)
+{ if ( (a == 100) && b )
+ return (1); // punto di uscita 1
+ else if (b || c)
+ then return (2); // punto di uscita 2
+ else return (3); // punto di uscita 3
+}
+Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_32/wrong1.txt b/legacy/Data/ingsw/0000_32/wrong1.txt
new file mode 100644
index 0000000..6946352
--- /dev/null
+++ b/legacy/Data/ingsw/0000_32/wrong1.txt
@@ -0,0 +1 @@
+(a=100, b=true, c=false), (a=90, b=false, c=true), (a=100, b=true, c=true)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_32/wrong2.txt b/legacy/Data/ingsw/0000_32/wrong2.txt
new file mode 100644
index 0000000..f9b6750
--- /dev/null
+++ b/legacy/Data/ingsw/0000_32/wrong2.txt
@@ -0,0 +1 @@
+(a=100, b=true, c=false), (a=90, b=false, c=false), (a=100, b=false, c=false)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_4/correct.txt b/legacy/Data/ingsw/0000_4/correct.txt
new file mode 100644
index 0000000..998dfca
--- /dev/null
+++ b/legacy/Data/ingsw/0000_4/correct.txt
@@ -0,0 +1 @@
+Customers should be closely involved throughout the development process.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_4/quest.txt b/legacy/Data/ingsw/0000_4/quest.txt
new file mode 100644
index 0000000..7d22084
--- /dev/null
+++ b/legacy/Data/ingsw/0000_4/quest.txt
@@ -0,0 +1 @@
+Which of the following is an agile principle?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_4/wrong1.txt b/legacy/Data/ingsw/0000_4/wrong1.txt
new file mode 100644
index 0000000..b34acfc
--- /dev/null
+++ b/legacy/Data/ingsw/0000_4/wrong1.txt
@@ -0,0 +1 @@
+Customers should just provide requirements and verify them when the project is completed.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_4/wrong2.txt b/legacy/Data/ingsw/0000_4/wrong2.txt
new file mode 100644
index 0000000..9cfa092
--- /dev/null
+++ b/legacy/Data/ingsw/0000_4/wrong2.txt
@@ -0,0 +1 @@
+Customers should not interfere with the software development.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_7/correct.txt b/legacy/Data/ingsw/0000_7/correct.txt
new file mode 100644
index 0000000..ae41872
--- /dev/null
+++ b/legacy/Data/ingsw/0000_7/correct.txt
@@ -0,0 +1 @@
+Testing interfaces for each component (i.e., integration of several units).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_7/quest.txt b/legacy/Data/ingsw/0000_7/quest.txt
new file mode 100644
index 0000000..8632d4d
--- /dev/null
+++ b/legacy/Data/ingsw/0000_7/quest.txt
@@ -0,0 +1 @@
+Component testing focuses on:
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_7/wrong1.txt b/legacy/Data/ingsw/0000_7/wrong1.txt
new file mode 100644
index 0000000..c2fa097
--- /dev/null
+++ b/legacy/Data/ingsw/0000_7/wrong1.txt
@@ -0,0 +1 @@
+Testing interactions among components (i.e., integration of several units).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_7/wrong2.txt b/legacy/Data/ingsw/0000_7/wrong2.txt
new file mode 100644
index 0000000..85de863
--- /dev/null
+++ b/legacy/Data/ingsw/0000_7/wrong2.txt
@@ -0,0 +1 @@
+Testing functionalities of individual program units, object classes or methods.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_8/correct.txt b/legacy/Data/ingsw/0000_8/correct.txt
new file mode 100644
index 0000000..aef914a
--- /dev/null
+++ b/legacy/Data/ingsw/0000_8/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che un sistema che soddisfa i requisiti risolve il problema del "customer".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_8/quest.txt b/legacy/Data/ingsw/0000_8/quest.txt
new file mode 100644
index 0000000..e821a05
--- /dev/null
+++ b/legacy/Data/ingsw/0000_8/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "validity check" che è parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_8/wrong1.txt b/legacy/Data/ingsw/0000_8/wrong1.txt
new file mode 100644
index 0000000..32c628c
--- /dev/null
+++ b/legacy/Data/ingsw/0000_8/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_8/wrong2.txt b/legacy/Data/ingsw/0000_8/wrong2.txt
new file mode 100644
index 0000000..eb23d05
--- /dev/null
+++ b/legacy/Data/ingsw/0000_8/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_0/correct.txt b/legacy/Data/ingsw/0120_0/correct.txt
new file mode 100644
index 0000000..b110af1
--- /dev/null
+++ b/legacy/Data/ingsw/0120_0/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_0/quest.txt b/legacy/Data/ingsw/0120_0/quest.txt
new file mode 100644
index 0000000..1b78d21
--- /dev/null
+++ b/legacy/Data/ingsw/0120_0/quest.txt
@@ -0,0 +1,11 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_0.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 act1
+Test case 2: act1 act0 act1 act0 act2
+Test case 3: act0 act2 act2 act1
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_0/wrong1.txt b/legacy/Data/ingsw/0120_0/wrong1.txt
new file mode 100644
index 0000000..5464d05
--- /dev/null
+++ b/legacy/Data/ingsw/0120_0/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 30%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_0/wrong2.txt b/legacy/Data/ingsw/0120_0/wrong2.txt
new file mode 100644
index 0000000..a29d476
--- /dev/null
+++ b/legacy/Data/ingsw/0120_0/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_1/correct.txt b/legacy/Data/ingsw/0120_1/correct.txt
new file mode 100644
index 0000000..279908a
--- /dev/null
+++ b/legacy/Data/ingsw/0120_1/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 10) and (x >= 10) and (x <= 20) and ((y 0.7*x)) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_1/quest.txt b/legacy/Data/ingsw/0120_1/quest.txt
new file mode 100644
index 0000000..5922b9f
--- /dev/null
+++ b/legacy/Data/ingsw/0120_1/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ: Dopo 10 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet: se la variabile x nell'intervallo [10, 20] allora la variabile y compresa tra il 50% di x ed il 70% di x.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_1/wrong1.txt b/legacy/Data/ingsw/0120_1/wrong1.txt
new file mode 100644
index 0000000..867889a
--- /dev/null
+++ b/legacy/Data/ingsw/0120_1/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 10) and ((x < 10) or (x > 20)) and ((y < 0.5*x) or (y > 0.7*x)) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_1/wrong2.txt b/legacy/Data/ingsw/0120_1/wrong2.txt
new file mode 100644
index 0000000..a159504
--- /dev/null
+++ b/legacy/Data/ingsw/0120_1/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 10) and (x >= 10) and (x <= 20) and (y >= 0.5*x) and (y <= 0.7*x) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_10/correct.txt b/legacy/Data/ingsw/0120_10/correct.txt
new file mode 100644
index 0000000..fffebc7
--- /dev/null
+++ b/legacy/Data/ingsw/0120_10/correct.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x < 0.6*y) and (x + y <= 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_10/quest.txt b/legacy/Data/ingsw/0120_10/quest.txt
new file mode 100644
index 0000000..e11a044
--- /dev/null
+++ b/legacy/Data/ingsw/0120_10/quest.txt
@@ -0,0 +1,4 @@
+Si consideri il seguente requisito:
+RQ: Dopo 50 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se la variabile x minore del 60% della variabile y allora la somma di x ed y maggiore del 30% della variabile z
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_10/wrong1.txt b/legacy/Data/ingsw/0120_10/wrong1.txt
new file mode 100644
index 0000000..c5ef6d8
--- /dev/null
+++ b/legacy/Data/ingsw/0120_10/wrong1.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x >= 0.6*y) and (x + y <= 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_10/wrong2.txt b/legacy/Data/ingsw/0120_10/wrong2.txt
new file mode 100644
index 0000000..06e9d5a
--- /dev/null
+++ b/legacy/Data/ingsw/0120_10/wrong2.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x < 0.6*y) and (x + y > 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_11/correct.txt b/legacy/Data/ingsw/0120_11/correct.txt
new file mode 100644
index 0000000..1a8a50a
--- /dev/null
+++ b/legacy/Data/ingsw/0120_11/correct.txt
@@ -0,0 +1 @@
+Per ciascun requisito, dovremmo essere in grado di scrivere un inseme di test che può dimostrare che il sistema sviluppato soddisfa il requisito considerato.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_11/quest.txt b/legacy/Data/ingsw/0120_11/quest.txt
new file mode 100644
index 0000000..793b220
--- /dev/null
+++ b/legacy/Data/ingsw/0120_11/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive il criterio di "requirements verifiability" che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_11/wrong1.txt b/legacy/Data/ingsw/0120_11/wrong1.txt
new file mode 100644
index 0000000..fac8307
--- /dev/null
+++ b/legacy/Data/ingsw/0120_11/wrong1.txt
@@ -0,0 +1 @@
+Per ciascuna coppia di componenti, dovremmo essere in grado di scrivere un insieme di test che può dimostrare che l'interazione tra le componenti soddisfa tutti i requisiti di interfaccia.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_11/wrong2.txt b/legacy/Data/ingsw/0120_11/wrong2.txt
new file mode 100644
index 0000000..3fdb31e
--- /dev/null
+++ b/legacy/Data/ingsw/0120_11/wrong2.txt
@@ -0,0 +1 @@
+Per ciascuna componente del sistema, dovremmo essere in grado di scrivere un insieme di test che può dimostrare che essa soddisfa tutti i requisiti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_12/correct.txt b/legacy/Data/ingsw/0120_12/correct.txt
new file mode 100644
index 0000000..b9f32a6
--- /dev/null
+++ b/legacy/Data/ingsw/0120_12/correct.txt
@@ -0,0 +1 @@
+c(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_12/quest.txt b/legacy/Data/ingsw/0120_12/quest.txt
new file mode 100644
index 0000000..aed3c79
--- /dev/null
+++ b/legacy/Data/ingsw/0120_12/quest.txt
@@ -0,0 +1,6 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_12.png
+Si consideri il processo software con due fasi (0 ed 1) rappresentato con la Markov chain in figura. Lo stato iniziale 0 e p in (0, 1). Il costo dello stato (fase) x c(x). La fase 0 la fase di design, che ha probabilit p di dover essere ripetuta causa errori. La fase 1 rappreenta il completamento del processo software, e quindi c(1) = 0.
+Il costo di una istanza del processo software descritto sopra la somma dei costi degli stati attraversati (tenendo presente che si parte sempre dallo stato 0.
+Quindi il costo C(X) della sequenza di stati X = x(0), x(1), x(2), .... C(X) = c(x(0)) + c(x(1)) + c(x(2)) + ...
+Ad esempio se X = 0, 1 abbiamo C(X) = c(0) + c(1) = c(0) (poich c(1) = 0).
+Quale delle seguenti formule calcola il valore atteso del costo per completare il processo software di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_12/wrong1.txt b/legacy/Data/ingsw/0120_12/wrong1.txt
new file mode 100644
index 0000000..70022eb
--- /dev/null
+++ b/legacy/Data/ingsw/0120_12/wrong1.txt
@@ -0,0 +1 @@
+c(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_12/wrong2.txt b/legacy/Data/ingsw/0120_12/wrong2.txt
new file mode 100644
index 0000000..3143da9
--- /dev/null
+++ b/legacy/Data/ingsw/0120_12/wrong2.txt
@@ -0,0 +1 @@
+c(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_13/correct.txt b/legacy/Data/ingsw/0120_13/correct.txt
new file mode 100644
index 0000000..e74b1fc
--- /dev/null
+++ b/legacy/Data/ingsw/0120_13/correct.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x > y) then (z == x) else (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_13/quest.txt b/legacy/Data/ingsw/0120_13/quest.txt
new file mode 100644
index 0000000..c1cd6d0
--- /dev/null
+++ b/legacy/Data/ingsw/0120_13/quest.txt
@@ -0,0 +1,9 @@
+Un test oracle per un programma P una funzione booleana che ha come inputs gli inputs ed outputs di P e ritorna true se e solo se il valore di output di P (con i dati inputs) quello atteso dalle specifiche.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+int z = x;
+while ( (x <= z) && (z <= y) ) { z = z + 1; }
+return (z);
+}
+Siano x, y, gli inputs del programma (f nel nostro caso) e z l'output. Assumendo il programma corretto, quale delle seguenti funzioni booleane F(x, y, z) un test oracle per la funzione f.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_13/wrong1.txt b/legacy/Data/ingsw/0120_13/wrong1.txt
new file mode 100644
index 0000000..d63544a
--- /dev/null
+++ b/legacy/Data/ingsw/0120_13/wrong1.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x > y) then (z == x + 1) else (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_13/wrong2.txt b/legacy/Data/ingsw/0120_13/wrong2.txt
new file mode 100644
index 0000000..1753a91
--- /dev/null
+++ b/legacy/Data/ingsw/0120_13/wrong2.txt
@@ -0,0 +1 @@
+F(x, y, z) = (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_14/correct.txt b/legacy/Data/ingsw/0120_14/correct.txt
new file mode 100644
index 0000000..475d1ef
--- /dev/null
+++ b/legacy/Data/ingsw/0120_14/correct.txt
@@ -0,0 +1 @@
+{x = -150, x = -40, x = 0, x = 200, x = 600}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_14/quest.txt b/legacy/Data/ingsw/0120_14/quest.txt
new file mode 100644
index 0000000..36947c2
--- /dev/null
+++ b/legacy/Data/ingsw/0120_14/quest.txt
@@ -0,0 +1,6 @@
+Il partition coverage di un insieme di test cases la percentuale di elementi della partition inclusi nei test cases. La partition una partizione finita dell'insieme di input della funzione che si sta testando.
+Si consideri la seguente funzione C:
+int f1(int x) { return (x + 7); }
+Si vuole testare la funzione f1(). A tal fine l'insieme degli interi viene partizionato come segue:
+{(-inf, -101], [-100, -1], {0}, [1, 500], [501, +inf)}
+Quale dei seguenti test cases consegue una partition coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_14/wrong1.txt b/legacy/Data/ingsw/0120_14/wrong1.txt
new file mode 100644
index 0000000..a6df32d
--- /dev/null
+++ b/legacy/Data/ingsw/0120_14/wrong1.txt
@@ -0,0 +1 @@
+{x = -200, x = -150, x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_14/wrong2.txt b/legacy/Data/ingsw/0120_14/wrong2.txt
new file mode 100644
index 0000000..0aaedb8
--- /dev/null
+++ b/legacy/Data/ingsw/0120_14/wrong2.txt
@@ -0,0 +1 @@
+{x = -200, x = -50, x = 0, x = 100, x = 500}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_15/correct.txt b/legacy/Data/ingsw/0120_15/correct.txt
new file mode 100644
index 0000000..aef914a
--- /dev/null
+++ b/legacy/Data/ingsw/0120_15/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che un sistema che soddisfa i requisiti risolve il problema del "customer".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_15/quest.txt b/legacy/Data/ingsw/0120_15/quest.txt
new file mode 100644
index 0000000..9af4805
--- /dev/null
+++ b/legacy/Data/ingsw/0120_15/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "validity check" che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_15/wrong1.txt b/legacy/Data/ingsw/0120_15/wrong1.txt
new file mode 100644
index 0000000..32c628c
--- /dev/null
+++ b/legacy/Data/ingsw/0120_15/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_15/wrong2.txt b/legacy/Data/ingsw/0120_15/wrong2.txt
new file mode 100644
index 0000000..eb23d05
--- /dev/null
+++ b/legacy/Data/ingsw/0120_15/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_16/correct.txt b/legacy/Data/ingsw/0120_16/correct.txt
new file mode 100644
index 0000000..0902686
--- /dev/null
+++ b/legacy/Data/ingsw/0120_16/correct.txt
@@ -0,0 +1 @@
+Requisito funzionale.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_16/quest.txt b/legacy/Data/ingsw/0120_16/quest.txt
new file mode 100644
index 0000000..f6839df
--- /dev/null
+++ b/legacy/Data/ingsw/0120_16/quest.txt
@@ -0,0 +1,2 @@
+"Ogni giorno, per ciascuna clinica, il sistema generer una lista dei pazienti che hanno un appuntamento quel giorno."
+La frase precedente un esempio di:
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_16/wrong1.txt b/legacy/Data/ingsw/0120_16/wrong1.txt
new file mode 100644
index 0000000..6084c49
--- /dev/null
+++ b/legacy/Data/ingsw/0120_16/wrong1.txt
@@ -0,0 +1 @@
+Requisito non-funzionale.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_16/wrong2.txt b/legacy/Data/ingsw/0120_16/wrong2.txt
new file mode 100644
index 0000000..396c8d3
--- /dev/null
+++ b/legacy/Data/ingsw/0120_16/wrong2.txt
@@ -0,0 +1 @@
+Requisito di performance.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_17/correct.txt b/legacy/Data/ingsw/0120_17/correct.txt
new file mode 100644
index 0000000..f2bb2d0
--- /dev/null
+++ b/legacy/Data/ingsw/0120_17/correct.txt
@@ -0,0 +1 @@
+0.12
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_17/quest.txt b/legacy/Data/ingsw/0120_17/quest.txt
new file mode 100644
index 0000000..fc7cc95
--- /dev/null
+++ b/legacy/Data/ingsw/0120_17/quest.txt
@@ -0,0 +1,9 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_17.png
+Un processo software pu essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del prcoesso software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilit della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+Ad esempio lo state diagram in figura
+
+
+
+Rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.4 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilit 0.2 di dover essere ripetuta (a causa di errori).
+Uno scenario una sequenza di stati.
+Qual'e' la probabilit dello scenario: 1, 3, 4? In altri terminti, qual' la probabilit che non sia necessario ripetere la seconda fase (ma non la prima) ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_17/wrong1.txt b/legacy/Data/ingsw/0120_17/wrong1.txt
new file mode 100644
index 0000000..2a47a95
--- /dev/null
+++ b/legacy/Data/ingsw/0120_17/wrong1.txt
@@ -0,0 +1 @@
+0.08
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_17/wrong2.txt b/legacy/Data/ingsw/0120_17/wrong2.txt
new file mode 100644
index 0000000..b7bbee2
--- /dev/null
+++ b/legacy/Data/ingsw/0120_17/wrong2.txt
@@ -0,0 +1 @@
+0.32
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_18/correct.txt b/legacy/Data/ingsw/0120_18/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0120_18/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_18/quest.txt b/legacy/Data/ingsw/0120_18/quest.txt
new file mode 100644
index 0000000..fd2ddc5
--- /dev/null
+++ b/legacy/Data/ingsw/0120_18/quest.txt
@@ -0,0 +1,9 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+ if (x - y - 2 <= 0) { if (x + y - 1 >= 0) return (1); else return (2); }
+ else {if (x + 2*y - 5 >= 0) return (3); else return (4); }
+ } /* f() */
+Si considerino i seguenti test cases: {x=1, y=2}, {x=0, y=0}, {x=5, y=0}, {x=3, y=0}.
+Quale delle seguenti la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_18/wrong1.txt b/legacy/Data/ingsw/0120_18/wrong1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0120_18/wrong1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_18/wrong2.txt b/legacy/Data/ingsw/0120_18/wrong2.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0120_18/wrong2.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_19/correct.txt b/legacy/Data/ingsw/0120_19/correct.txt
new file mode 100644
index 0000000..e13eda2
--- /dev/null
+++ b/legacy/Data/ingsw/0120_19/correct.txt
@@ -0,0 +1 @@
+Accertarsi che i requisiti definiscano un sistema che risolve il problema che l'utente pianifica di risolvere.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_19/quest.txt b/legacy/Data/ingsw/0120_19/quest.txt
new file mode 100644
index 0000000..b59a64d
--- /dev/null
+++ b/legacy/Data/ingsw/0120_19/quest.txt
@@ -0,0 +1 @@
+Quali delle seguenti attivit parte del processo di validazione dei requisiti ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_19/wrong1.txt b/legacy/Data/ingsw/0120_19/wrong1.txt
new file mode 100644
index 0000000..b24f900
--- /dev/null
+++ b/legacy/Data/ingsw/0120_19/wrong1.txt
@@ -0,0 +1 @@
+Accertarsi che il sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_19/wrong2.txt b/legacy/Data/ingsw/0120_19/wrong2.txt
new file mode 100644
index 0000000..884d6b1
--- /dev/null
+++ b/legacy/Data/ingsw/0120_19/wrong2.txt
@@ -0,0 +1 @@
+Accertarsi che l'architettura del sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_2/correct.txt b/legacy/Data/ingsw/0120_2/correct.txt
new file mode 100644
index 0000000..2ca9276
--- /dev/null
+++ b/legacy/Data/ingsw/0120_2/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 35%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_2/quest.txt b/legacy/Data/ingsw/0120_2/quest.txt
new file mode 100644
index 0000000..7cf45ee
--- /dev/null
+++ b/legacy/Data/ingsw/0120_2/quest.txt
@@ -0,0 +1,11 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_2.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 act1 act0 act2
+Test case 2: act0 act2 act2 act0 act1
+Test case 3: act0 act0
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_2/wrong1.txt b/legacy/Data/ingsw/0120_2/wrong1.txt
new file mode 100644
index 0000000..2d5aeb0
--- /dev/null
+++ b/legacy/Data/ingsw/0120_2/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_2/wrong2.txt b/legacy/Data/ingsw/0120_2/wrong2.txt
new file mode 100644
index 0000000..a29d476
--- /dev/null
+++ b/legacy/Data/ingsw/0120_2/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_20/correct.txt b/legacy/Data/ingsw/0120_20/correct.txt
new file mode 100644
index 0000000..7311d41
--- /dev/null
+++ b/legacy/Data/ingsw/0120_20/correct.txt
@@ -0,0 +1 @@
+Test set: {x=1, y=1}, {x=0, y=0}, {x=2, y=1}, {x=2, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_20/quest.txt b/legacy/Data/ingsw/0120_20/quest.txt
new file mode 100644
index 0000000..173901c
--- /dev/null
+++ b/legacy/Data/ingsw/0120_20/quest.txt
@@ -0,0 +1,8 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+ if (x - y <= 0) { if (x + y - 1 >= 0) return (1); else return (2); }
+ else {if (2*x + y - 5 >= 0) return (3); else return (4); }
+ } /* f() */
+Quale dei seguenti test sets consegue una branch coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_20/wrong1.txt b/legacy/Data/ingsw/0120_20/wrong1.txt
new file mode 100644
index 0000000..3e327ab
--- /dev/null
+++ b/legacy/Data/ingsw/0120_20/wrong1.txt
@@ -0,0 +1 @@
+Test set: {x=1, y=1}, {x=2, y=2}, {x=2, y=1}, {x=2, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_20/wrong2.txt b/legacy/Data/ingsw/0120_20/wrong2.txt
new file mode 100644
index 0000000..7e48e4f
--- /dev/null
+++ b/legacy/Data/ingsw/0120_20/wrong2.txt
@@ -0,0 +1 @@
+Test set: {x=1, y=1}, {x=0, y=0}, {x=2, y=1}, {x=2, y=3}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_21/correct.txt b/legacy/Data/ingsw/0120_21/correct.txt
new file mode 100644
index 0000000..98939be
--- /dev/null
+++ b/legacy/Data/ingsw/0120_21/correct.txt
@@ -0,0 +1 @@
+1/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_21/quest.txt b/legacy/Data/ingsw/0120_21/quest.txt
new file mode 100644
index 0000000..5e04a05
--- /dev/null
+++ b/legacy/Data/ingsw/0120_21/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_21.png
+Si consideri la Markov chain in figura con stato iniziale 0 e p in (0, 1). Quale delle seguenti formule calcola il valore atteso del numero di transizioni necessarie per lasciare lo stato 0.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_21/wrong1.txt b/legacy/Data/ingsw/0120_21/wrong1.txt
new file mode 100644
index 0000000..db2276d
--- /dev/null
+++ b/legacy/Data/ingsw/0120_21/wrong1.txt
@@ -0,0 +1 @@
+(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_21/wrong2.txt b/legacy/Data/ingsw/0120_21/wrong2.txt
new file mode 100644
index 0000000..56ea6ac
--- /dev/null
+++ b/legacy/Data/ingsw/0120_21/wrong2.txt
@@ -0,0 +1 @@
+1/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_22/quest.txt b/legacy/Data/ingsw/0120_22/quest.txt
new file mode 100644
index 0000000..306d75a
--- /dev/null
+++ b/legacy/Data/ingsw/0120_22/quest.txt
@@ -0,0 +1,32 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti UML state diagram lo rappresenta correttamente ?
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 1) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 2;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_22/wrong1.txt b/legacy/Data/ingsw/0120_22/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0120_22/wrong2.txt b/legacy/Data/ingsw/0120_22/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0120_22/wrong3.txt b/legacy/Data/ingsw/0120_22/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0120_23/correct.txt b/legacy/Data/ingsw/0120_23/correct.txt
new file mode 100644
index 0000000..8b0c318
--- /dev/null
+++ b/legacy/Data/ingsw/0120_23/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_23/quest.txt b/legacy/Data/ingsw/0120_23/quest.txt
new file mode 100644
index 0000000..6f49368
--- /dev/null
+++ b/legacy/Data/ingsw/0120_23/quest.txt
@@ -0,0 +1,11 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_23.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 act2 act1 act2 act1
+Test case 2: act1 act0 act2
+Test case 3: act2 act1 act0
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_23/wrong1.txt b/legacy/Data/ingsw/0120_23/wrong1.txt
new file mode 100644
index 0000000..a29d476
--- /dev/null
+++ b/legacy/Data/ingsw/0120_23/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_23/wrong2.txt b/legacy/Data/ingsw/0120_23/wrong2.txt
new file mode 100644
index 0000000..5464d05
--- /dev/null
+++ b/legacy/Data/ingsw/0120_23/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 30%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_24/correct.txt b/legacy/Data/ingsw/0120_24/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0120_24/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_24/quest.txt b/legacy/Data/ingsw/0120_24/quest.txt
new file mode 100644
index 0000000..702f202
--- /dev/null
+++ b/legacy/Data/ingsw/0120_24/quest.txt
@@ -0,0 +1,9 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+ if (x - y <= 0) { if (x + y - 2>= 0) return (1); else return (2); }
+ else {if (2*x + y - 1>= 0) return (3); else return (4); }
+ } /* f() */
+Si considerino i seguenti test cases: {x=1, y=1}, {x=0, y=0}, {x=1, y=0}, {x=0, y=-1}.
+Quale delle seguenti la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_24/wrong1.txt b/legacy/Data/ingsw/0120_24/wrong1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0120_24/wrong1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_24/wrong2.txt b/legacy/Data/ingsw/0120_24/wrong2.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0120_24/wrong2.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_25/quest.txt b/legacy/Data/ingsw/0120_25/quest.txt
new file mode 100644
index 0000000..5e6a3b5
--- /dev/null
+++ b/legacy/Data/ingsw/0120_25/quest.txt
@@ -0,0 +1,37 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti UML state diagram lo rappresenta correttamente ?
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_25/wrong1.txt b/legacy/Data/ingsw/0120_25/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0120_25/wrong2.txt b/legacy/Data/ingsw/0120_25/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0120_25/wrong3.txt b/legacy/Data/ingsw/0120_25/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0120_26/correct.txt b/legacy/Data/ingsw/0120_26/correct.txt
new file mode 100644
index 0000000..1c7da8c
--- /dev/null
+++ b/legacy/Data/ingsw/0120_26/correct.txt
@@ -0,0 +1 @@
+0.03
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_26/quest.txt b/legacy/Data/ingsw/0120_26/quest.txt
new file mode 100644
index 0000000..458f85c
--- /dev/null
+++ b/legacy/Data/ingsw/0120_26/quest.txt
@@ -0,0 +1,9 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_26.png
+Un processo software pu essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del prcoesso software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilit della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+Ad esempio lo state diagram in figura
+
+
+
+Rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.3 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilit 0.1 di dover essere ripetuta (a causa di errori).
+Uno scenario una sequenza di stati.
+Qual'e' la probabilit dello scenario: 1, 2, 3, 4 ? In altri terminti, qual' la probabilit che sia necessario ripetere sia la fase 1 che la fase 2 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_26/wrong1.txt b/legacy/Data/ingsw/0120_26/wrong1.txt
new file mode 100644
index 0000000..7eb6830
--- /dev/null
+++ b/legacy/Data/ingsw/0120_26/wrong1.txt
@@ -0,0 +1 @@
+0.27
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_26/wrong2.txt b/legacy/Data/ingsw/0120_26/wrong2.txt
new file mode 100644
index 0000000..8a346b7
--- /dev/null
+++ b/legacy/Data/ingsw/0120_26/wrong2.txt
@@ -0,0 +1 @@
+0.07
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_27/correct.txt b/legacy/Data/ingsw/0120_27/correct.txt
new file mode 100644
index 0000000..5f37ecc
--- /dev/null
+++ b/legacy/Data/ingsw/0120_27/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x >= 5) or (x <= 0)) and ((x >= 15) or (x <= 10)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_27/quest.txt b/legacy/Data/ingsw/0120_27/quest.txt
new file mode 100644
index 0000000..864cc93
--- /dev/null
+++ b/legacy/Data/ingsw/0120_27/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ1: Durante l'esecuzione del programma (cio per tutti gli istanti di tempo positivi) la variabile x sempre nell'intervallo [0, 5] oppure [10, 15]
+Quale dei seguenti monitor meglio descrive il requisito RQ1 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_27/wrong1.txt b/legacy/Data/ingsw/0120_27/wrong1.txt
new file mode 100644
index 0000000..8856598
--- /dev/null
+++ b/legacy/Data/ingsw/0120_27/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x >= 0) or (x <= 5)) and ((x >= 10) or (x <= 15)) );
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_27/wrong2.txt b/legacy/Data/ingsw/0120_27/wrong2.txt
new file mode 100644
index 0000000..2057e11
--- /dev/null
+++ b/legacy/Data/ingsw/0120_27/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ( ((x >= 0) and (x <= 5)) or ((x >= 10) and (x <= 15)) );
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_28/quest.txt b/legacy/Data/ingsw/0120_28/quest.txt
new file mode 100644
index 0000000..5826ea3
--- /dev/null
+++ b/legacy/Data/ingsw/0120_28/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_28.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_28/wrong1.txt b/legacy/Data/ingsw/0120_28/wrong1.txt
new file mode 100644
index 0000000..bfb3c5d
--- /dev/null
+++ b/legacy/Data/ingsw/0120_28/wrong1.txt
@@ -0,0 +1,38 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 2;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_28/wrong2.txt b/legacy/Data/ingsw/0120_28/wrong2.txt
new file mode 100644
index 0000000..c5d8c6b
--- /dev/null
+++ b/legacy/Data/ingsw/0120_28/wrong2.txt
@@ -0,0 +1,33 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_28/wrong3.txt b/legacy/Data/ingsw/0120_28/wrong3.txt
new file mode 100644
index 0000000..40db007
--- /dev/null
+++ b/legacy/Data/ingsw/0120_28/wrong3.txt
@@ -0,0 +1,33 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_29/correct.txt b/legacy/Data/ingsw/0120_29/correct.txt
new file mode 100644
index 0000000..080c618
--- /dev/null
+++ b/legacy/Data/ingsw/0120_29/correct.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) > 0) and (y <= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_29/quest.txt b/legacy/Data/ingsw/0120_29/quest.txt
new file mode 100644
index 0000000..576af1a
--- /dev/null
+++ b/legacy/Data/ingsw/0120_29/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+RQ: Dopo 60 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se 10 unit di tempo nel passato era stata richiesta una risorsa (variabile x positiva) allora ora concesso l'accesso alla risorsa (variabile y positiva)
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time < w e ritorna il valore che z aveva al tempo (time - w), se time >= w.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_29/wrong1.txt b/legacy/Data/ingsw/0120_29/wrong1.txt
new file mode 100644
index 0000000..5ea42fe
--- /dev/null
+++ b/legacy/Data/ingsw/0120_29/wrong1.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) or (delay(x, 10) > 0) or (y <= 0);
+
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_29/wrong2.txt b/legacy/Data/ingsw/0120_29/wrong2.txt
new file mode 100644
index 0000000..a55c0a4
--- /dev/null
+++ b/legacy/Data/ingsw/0120_29/wrong2.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) > 0) and (y > 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_3/correct.txt b/legacy/Data/ingsw/0120_3/correct.txt
new file mode 100644
index 0000000..e940faa
--- /dev/null
+++ b/legacy/Data/ingsw/0120_3/correct.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x >= 0) && (y >= 0) && ((x > 3) || (y > 3)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_3/quest.txt b/legacy/Data/ingsw/0120_3/quest.txt
new file mode 100644
index 0000000..2758118
--- /dev/null
+++ b/legacy/Data/ingsw/0120_3/quest.txt
@@ -0,0 +1,4 @@
+Pre-condizioni, invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in ). In particolare, assert(expre) non fa nulla se l'espressione expre vale TRUE (cio non 0), stampa un messaggio di errore su stderr e abortisce l'esecuzione del programma altrimenti.
+Si consideri la funzione C
+int f(int x, int y) { ..... }
+Quale delle seguenti assert esprime la pre-condizione che entrambi gli argomenti di f sono non-negativi ed almeno uno di loro maggiore di 3 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_3/wrong1.txt b/legacy/Data/ingsw/0120_3/wrong1.txt
new file mode 100644
index 0000000..ad32d88
--- /dev/null
+++ b/legacy/Data/ingsw/0120_3/wrong1.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x >= 0) && (y >= 0) && ((x >= 3) || (y >= 3)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_3/wrong2.txt b/legacy/Data/ingsw/0120_3/wrong2.txt
new file mode 100644
index 0000000..642ec6b
--- /dev/null
+++ b/legacy/Data/ingsw/0120_3/wrong2.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x > 0) && (y > 0) && ((x >= 3) || (y > 3)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_30/correct.txt b/legacy/Data/ingsw/0120_30/correct.txt
new file mode 100644
index 0000000..a40ea7d
--- /dev/null
+++ b/legacy/Data/ingsw/0120_30/correct.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 5, c = 0), (a=50, b = 3, c = 0).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_30/quest.txt b/legacy/Data/ingsw/0120_30/quest.txt
new file mode 100644
index 0000000..dbd72c0
--- /dev/null
+++ b/legacy/Data/ingsw/0120_30/quest.txt
@@ -0,0 +1,22 @@
+Una Condition una proposizione booleana, cio una espressione con valore booleano che non pu essere decomposta
+in espressioni boolean pi semplici. Ad esempio, (x + y <= 3) una condition.
+
+Una Decision una espressione booleana composta da conditions e zero o pi operatori booleani. Ad esempio, sono decisions:
+(x + y <= 3)
+((x + y <= 3) || (x - y > 7))
+Un insieme di test cases T soddisfa il criterio di Condition/Decision coverage se tutte le seguenti condizioni sono soddisfatte:
+
+1) Ciascun punto di entrata ed uscita nel programma eseguito in almeno un test;
+2) Per ogni decision d nel programma, per ogni condition c in d, esiste un test in T in cui c true ed un test in T in cui c false.
+3) Per ogni decision d nel programma, esiste un test in T in cui d true ed un test in T in cui d false.
+
+Si consideri la seguente funzione:
+int f(int a, int b, int c)
+{ if ( (a - 100 >= 0) && (b - c - 1 <= 0) )
+ return (1); // punto di uscita 1
+ else if ((b - c - 1 <= 0) || (b + c - 5 >= 0)
+)
+ then return (2); // punto di uscita 2
+ else return (3); // punto di uscita 3
+}
+ Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_30/wrong1.txt b/legacy/Data/ingsw/0120_30/wrong1.txt
new file mode 100644
index 0000000..5b77112
--- /dev/null
+++ b/legacy/Data/ingsw/0120_30/wrong1.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 5, c = 0), (a=50, b = 0, c = 5).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_30/wrong2.txt b/legacy/Data/ingsw/0120_30/wrong2.txt
new file mode 100644
index 0000000..abe0eaa
--- /dev/null
+++ b/legacy/Data/ingsw/0120_30/wrong2.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 4, c = 0), (a=200, b = 4, c = 0)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_31/correct.txt b/legacy/Data/ingsw/0120_31/correct.txt
new file mode 100644
index 0000000..3bb4f54
--- /dev/null
+++ b/legacy/Data/ingsw/0120_31/correct.txt
@@ -0,0 +1 @@
+State coverage: 25%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_31/quest.txt b/legacy/Data/ingsw/0120_31/quest.txt
new file mode 100644
index 0000000..6c8f77e
--- /dev/null
+++ b/legacy/Data/ingsw/0120_31/quest.txt
@@ -0,0 +1,11 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_31.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+Test case 1: act1 act0 act0
+Test case 2: act2 act0 act1
+Test case 3: act0 act0 act0
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_31/wrong1.txt b/legacy/Data/ingsw/0120_31/wrong1.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0120_31/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_31/wrong2.txt b/legacy/Data/ingsw/0120_31/wrong2.txt
new file mode 100644
index 0000000..a8aead7
--- /dev/null
+++ b/legacy/Data/ingsw/0120_31/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_32/correct.txt b/legacy/Data/ingsw/0120_32/correct.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0120_32/correct.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_32/quest.txt b/legacy/Data/ingsw/0120_32/quest.txt
new file mode 100644
index 0000000..dcec721
--- /dev/null
+++ b/legacy/Data/ingsw/0120_32/quest.txt
@@ -0,0 +1,8 @@
+Il partition coverage di un insieme di test cases la percentuale di elementi della partition inclusi nei test cases. La partition una partizione finita dell'insieme di input della funzione che si sta testando.
+Si consideri la seguente funzione C:
+int f1(int x) { return (2*x); }
+Si vuole testare la funzione f1(). A tal fine l'insieme degli interi viene partizionato come segue:
+{(-inf, -11], [-10, -1], {0}, [1, 50], [51, +inf)}
+Si consideri il seguente insieme di test cases:
+{x=-20, x= 10, x=60}
+Quale delle seguenti la partition coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_32/wrong1.txt b/legacy/Data/ingsw/0120_32/wrong1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0120_32/wrong1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_32/wrong2.txt b/legacy/Data/ingsw/0120_32/wrong2.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0120_32/wrong2.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_33/correct.txt b/legacy/Data/ingsw/0120_33/correct.txt
new file mode 100644
index 0000000..a7029bc
--- /dev/null
+++ b/legacy/Data/ingsw/0120_33/correct.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [1, 4] oppure nell'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_33/quest.txt b/legacy/Data/ingsw/0120_33/quest.txt
new file mode 100644
index 0000000..e5fbc81
--- /dev/null
+++ b/legacy/Data/ingsw/0120_33/quest.txt
@@ -0,0 +1,16 @@
+Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato.
+block Monitor
+input Real x;
+output Boolean y;
+Boolean w;
+initial equation
+y = false;
+equation
+w = ((x < 1) or (x > 4)) and ((x < 15) or (x > 20));
+algorithm
+when edge(w) then
+y := true;
+end when;
+end Monitor;
+
+Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_33/wrong1.txt b/legacy/Data/ingsw/0120_33/wrong1.txt
new file mode 100644
index 0000000..a82929b
--- /dev/null
+++ b/legacy/Data/ingsw/0120_33/wrong1.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_33/wrong2.txt b/legacy/Data/ingsw/0120_33/wrong2.txt
new file mode 100644
index 0000000..710b111
--- /dev/null
+++ b/legacy/Data/ingsw/0120_33/wrong2.txt
@@ -0,0 +1 @@
+La variabile x è fuori dall'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_34/quest.txt b/legacy/Data/ingsw/0120_34/quest.txt
new file mode 100644
index 0000000..29d0647
--- /dev/null
+++ b/legacy/Data/ingsw/0120_34/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_34.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_34/wrong1.txt b/legacy/Data/ingsw/0120_34/wrong1.txt
new file mode 100644
index 0000000..160702f
--- /dev/null
+++ b/legacy/Data/ingsw/0120_34/wrong1.txt
@@ -0,0 +1,35 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_34/wrong2.txt b/legacy/Data/ingsw/0120_34/wrong2.txt
new file mode 100644
index 0000000..3c05a37
--- /dev/null
+++ b/legacy/Data/ingsw/0120_34/wrong2.txt
@@ -0,0 +1,36 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_34/wrong3.txt b/legacy/Data/ingsw/0120_34/wrong3.txt
new file mode 100644
index 0000000..bdfb644
--- /dev/null
+++ b/legacy/Data/ingsw/0120_34/wrong3.txt
@@ -0,0 +1,37 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_35/quest.txt b/legacy/Data/ingsw/0120_35/quest.txt
new file mode 100644
index 0000000..99379e6
--- /dev/null
+++ b/legacy/Data/ingsw/0120_35/quest.txt
@@ -0,0 +1,4 @@
+Pre-condizioni, invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in ). In particolare, assert(expre) non fa nulla se l'espressione expre vale TRUE (cio non 0), stampa un messaggio di errore su stderr e abortisce l'esecuzione del programma altrimenti.
+Si consideri la funzione C
+int f(int x, int y) { ..... }
+Quale delle seguenti assert esprime l'invariante che le variabili locali z e w di f() hanno somma minore di 1 oppure maggiore di 7 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_35/wrong1.txt b/legacy/Data/ingsw/0120_35/wrong1.txt
new file mode 100644
index 0000000..cbf1814
--- /dev/null
+++ b/legacy/Data/ingsw/0120_35/wrong1.txt
@@ -0,0 +1,6 @@
+int f(in x, int y)
+{
+int z, w;
+assert( (z + w <= 1) || (z + w >= 7));
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_35/wrong2.txt b/legacy/Data/ingsw/0120_35/wrong2.txt
new file mode 100644
index 0000000..03b9f52
--- /dev/null
+++ b/legacy/Data/ingsw/0120_35/wrong2.txt
@@ -0,0 +1,6 @@
+int f(in x, int y)
+{
+int z, w;
+assert( (z + w < 1) || (z + w > 7));
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_35/wrong3.txt b/legacy/Data/ingsw/0120_35/wrong3.txt
new file mode 100644
index 0000000..6fcb8b5
--- /dev/null
+++ b/legacy/Data/ingsw/0120_35/wrong3.txt
@@ -0,0 +1,6 @@
+int f(in x, int y)
+{
+int z, w;
+assert( (z + w > 1) || (z + w < 7));
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_36/correct.txt b/legacy/Data/ingsw/0120_36/correct.txt
new file mode 100644
index 0000000..b110af1
--- /dev/null
+++ b/legacy/Data/ingsw/0120_36/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_36/quest.txt b/legacy/Data/ingsw/0120_36/quest.txt
new file mode 100644
index 0000000..6f256c3
--- /dev/null
+++ b/legacy/Data/ingsw/0120_36/quest.txt
@@ -0,0 +1,12 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_36.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 act2 act1 act2
+Test case 2: act0 act2 act0
+Test case 3: act0 act0 act0 act1 act1
+
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_36/wrong1.txt b/legacy/Data/ingsw/0120_36/wrong1.txt
new file mode 100644
index 0000000..5464d05
--- /dev/null
+++ b/legacy/Data/ingsw/0120_36/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 30%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_36/wrong2.txt b/legacy/Data/ingsw/0120_36/wrong2.txt
new file mode 100644
index 0000000..cf27703
--- /dev/null
+++ b/legacy/Data/ingsw/0120_36/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_37/correct.txt b/legacy/Data/ingsw/0120_37/correct.txt
new file mode 100644
index 0000000..bc5692f
--- /dev/null
+++ b/legacy/Data/ingsw/0120_37/correct.txt
@@ -0,0 +1 @@
+State coverage: 87%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_37/quest.txt b/legacy/Data/ingsw/0120_37/quest.txt
new file mode 100644
index 0000000..cdbc688
--- /dev/null
+++ b/legacy/Data/ingsw/0120_37/quest.txt
@@ -0,0 +1,13 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_37.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act2 act1 act2 act2
+Test case 2: act2 act0 act2 act0 act2
+Test case 3: act2 act0 act2 act0 act1
+
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_37/wrong1.txt b/legacy/Data/ingsw/0120_37/wrong1.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0120_37/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_37/wrong2.txt b/legacy/Data/ingsw/0120_37/wrong2.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/0120_37/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_38/correct.txt b/legacy/Data/ingsw/0120_38/correct.txt
new file mode 100644
index 0000000..25ac15c
--- /dev/null
+++ b/legacy/Data/ingsw/0120_38/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 20) and ((x >= 30) or (x <= 20)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_38/quest.txt b/legacy/Data/ingsw/0120_38/quest.txt
new file mode 100644
index 0000000..b420aaf
--- /dev/null
+++ b/legacy/Data/ingsw/0120_38/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ1: Dopo 20 unit di tempo dall'inizio dell'esecuzione la variabile x sempre nell'intervallo [20, 30] .
+Quale dei seguenti monitor meglio descrive il requisito RQ1 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_38/wrong1.txt b/legacy/Data/ingsw/0120_38/wrong1.txt
new file mode 100644
index 0000000..157567e
--- /dev/null
+++ b/legacy/Data/ingsw/0120_38/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 20) or ((x >= 20) and (x <= 30)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_38/wrong2.txt b/legacy/Data/ingsw/0120_38/wrong2.txt
new file mode 100644
index 0000000..d021c3b
--- /dev/null
+++ b/legacy/Data/ingsw/0120_38/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 20) and (x >= 20) and (x <= 30) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_39/quest.txt b/legacy/Data/ingsw/0120_39/quest.txt
new file mode 100644
index 0000000..4777dbc
--- /dev/null
+++ b/legacy/Data/ingsw/0120_39/quest.txt
@@ -0,0 +1,35 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti UML state diagram lo rappresenta correttamente ?
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 2;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_39/wrong1.txt b/legacy/Data/ingsw/0120_39/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0120_39/wrong2.txt b/legacy/Data/ingsw/0120_39/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0120_39/wrong3.txt b/legacy/Data/ingsw/0120_39/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0120_4/correct.txt b/legacy/Data/ingsw/0120_4/correct.txt
new file mode 100644
index 0000000..ddb0d65
--- /dev/null
+++ b/legacy/Data/ingsw/0120_4/correct.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_4/quest.txt b/legacy/Data/ingsw/0120_4/quest.txt
new file mode 100644
index 0000000..d1cf8cb
--- /dev/null
+++ b/legacy/Data/ingsw/0120_4/quest.txt
@@ -0,0 +1,16 @@
+Si consideri il monitor seguente che ritorna true appena i requisiti per il sistema monitorato sono violati.
+block Monitor
+input Real x;
+output Boolean y;
+Boolean w;
+initial equation
+y = false;
+equation
+w = ((x < 0) or (x > 5));
+algorithm
+when edge(w) then
+y := true;
+end when;
+end Monitor;
+
+Quale delle seguenti affermazioni meglio descrive il requisito monitorato.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_4/wrong1.txt b/legacy/Data/ingsw/0120_4/wrong1.txt
new file mode 100644
index 0000000..3e05ae7
--- /dev/null
+++ b/legacy/Data/ingsw/0120_4/wrong1.txt
@@ -0,0 +1 @@
+La variabile x è fuori dall'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_4/wrong2.txt b/legacy/Data/ingsw/0120_4/wrong2.txt
new file mode 100644
index 0000000..7c7a691
--- /dev/null
+++ b/legacy/Data/ingsw/0120_4/wrong2.txt
@@ -0,0 +1 @@
+La variable x è minore di 0.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_40/correct.txt b/legacy/Data/ingsw/0120_40/correct.txt
new file mode 100644
index 0000000..31a01d5
--- /dev/null
+++ b/legacy/Data/ingsw/0120_40/correct.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=0, y=0}, {x=15, y=0}, {x=9, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_40/quest.txt b/legacy/Data/ingsw/0120_40/quest.txt
new file mode 100644
index 0000000..74a4d32
--- /dev/null
+++ b/legacy/Data/ingsw/0120_40/quest.txt
@@ -0,0 +1,8 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+ if (x - y - 6 <= 0) { if (x + y - 3 >= 0) return (1); else return (2); }
+ else {if (x + 2*y -15 >= 0) return (3); else return (4); }
+ } /* f() */
+Quale dei seguenti test sets consegue una branch coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_40/wrong1.txt b/legacy/Data/ingsw/0120_40/wrong1.txt
new file mode 100644
index 0000000..549dba8
--- /dev/null
+++ b/legacy/Data/ingsw/0120_40/wrong1.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=0, y=0}, {x=15, y=0}, {x=10, y=3}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_40/wrong2.txt b/legacy/Data/ingsw/0120_40/wrong2.txt
new file mode 100644
index 0000000..0c564f7
--- /dev/null
+++ b/legacy/Data/ingsw/0120_40/wrong2.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=2, y=1}, {x=15, y=0}, {x=9, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_41/correct.txt b/legacy/Data/ingsw/0120_41/correct.txt
new file mode 100644
index 0000000..7a6c6b9
--- /dev/null
+++ b/legacy/Data/ingsw/0120_41/correct.txt
@@ -0,0 +1 @@
+300000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_41/quest.txt b/legacy/Data/ingsw/0120_41/quest.txt
new file mode 100644
index 0000000..47201e7
--- /dev/null
+++ b/legacy/Data/ingsw/0120_41/quest.txt
@@ -0,0 +1,4 @@
+Il rischio R pu essere calcolato come R = P*C, dove P la probabilit dell'evento avverso (software failure nel nostro contesto) e C il costo dell'occorrenza dell'evento avverso.
+Assumiamo che la probabilit P sia legata al costo di sviluppo S dalla formula
+P = 10^{(-b*S)} (cio 10 elevato alla (-b*S))
+dove b una opportuna costante note da dati storici aziendali. Si assuma che b = 0.0001, C = 1000000, ed il rischio ammesso R = 1000. Quale dei seguenti valori meglio approssima il costo S per lo sviluppo del software in questione.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_41/wrong1.txt b/legacy/Data/ingsw/0120_41/wrong1.txt
new file mode 100644
index 0000000..997967b
--- /dev/null
+++ b/legacy/Data/ingsw/0120_41/wrong1.txt
@@ -0,0 +1 @@
+700000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_41/wrong2.txt b/legacy/Data/ingsw/0120_41/wrong2.txt
new file mode 100644
index 0000000..2df501e
--- /dev/null
+++ b/legacy/Data/ingsw/0120_41/wrong2.txt
@@ -0,0 +1 @@
+500000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_42/correct.txt b/legacy/Data/ingsw/0120_42/correct.txt
new file mode 100644
index 0000000..f6a4b07
--- /dev/null
+++ b/legacy/Data/ingsw/0120_42/correct.txt
@@ -0,0 +1 @@
+State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_42/quest.txt b/legacy/Data/ingsw/0120_42/quest.txt
new file mode 100644
index 0000000..4650bbb
--- /dev/null
+++ b/legacy/Data/ingsw/0120_42/quest.txt
@@ -0,0 +1,11 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_42.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+Test case 1: act1 act2 act1 act2 act2
+Test case 2: act2 act0
+Test case 3: act0 act0 act0
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_42/wrong1.txt b/legacy/Data/ingsw/0120_42/wrong1.txt
new file mode 100644
index 0000000..1c07658
--- /dev/null
+++ b/legacy/Data/ingsw/0120_42/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_42/wrong2.txt b/legacy/Data/ingsw/0120_42/wrong2.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0120_42/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_43/quest.txt b/legacy/Data/ingsw/0120_43/quest.txt
new file mode 100644
index 0000000..8636c5a
--- /dev/null
+++ b/legacy/Data/ingsw/0120_43/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_43.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_43/wrong1.txt b/legacy/Data/ingsw/0120_43/wrong1.txt
new file mode 100644
index 0000000..0ca6415
--- /dev/null
+++ b/legacy/Data/ingsw/0120_43/wrong1.txt
@@ -0,0 +1,32 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_43/wrong2.txt b/legacy/Data/ingsw/0120_43/wrong2.txt
new file mode 100644
index 0000000..a5879aa
--- /dev/null
+++ b/legacy/Data/ingsw/0120_43/wrong2.txt
@@ -0,0 +1,36 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_43/wrong3.txt b/legacy/Data/ingsw/0120_43/wrong3.txt
new file mode 100644
index 0000000..b4f56fb
--- /dev/null
+++ b/legacy/Data/ingsw/0120_43/wrong3.txt
@@ -0,0 +1,36 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_44/correct.txt b/legacy/Data/ingsw/0120_44/correct.txt
new file mode 100644
index 0000000..232aedf
--- /dev/null
+++ b/legacy/Data/ingsw/0120_44/correct.txt
@@ -0,0 +1 @@
+(a = 6, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 0).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_44/quest.txt b/legacy/Data/ingsw/0120_44/quest.txt
new file mode 100644
index 0000000..e44e320
--- /dev/null
+++ b/legacy/Data/ingsw/0120_44/quest.txt
@@ -0,0 +1,21 @@
+Una Condition una proposizione booleana, cio una espressione con valore booleano che non pu essere decomposta
+in espressioni boolean pi semplici. Ad esempio, (x + y <= 3) una condition.
+
+Una Decision una espressione booleana composta da conditions e zero o pi operatori booleani. Ad esempio, sono decisions:
+(x + y <= 3)
+((x + y <= 3) || (x - y > 7))
+Un insieme di test cases T soddisfa il criterio di Condition/Decision coverage se tutte le seguenti condizioni sono soddisfatte:
+
+1) Ciascun punto di entrata ed uscita nel programma eseguito in almeno un test;
+2) Per ogni decision d nel programma, per ogni condition c in d, esiste un test in T in cui c true ed un test in T in cui c false.
+3) Per ogni decision d nel programma, esiste un test in T in cui d true ed un test in T in cui d false.
+
+Si consideri la seguente funzione:
+int f(int a, int b, int c)
+{ if ( (a + b - 6 >= 0) && (b - c - 1 <= 0) )
+ return (1); // punto di uscita 1
+ else if ((b - c - 1 <= 0) || (b + c - 5 >= 0))
+ then return (2); // punto di uscita 2
+ else return (3); // punto di uscita 3
+}
+ Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_44/wrong1.txt b/legacy/Data/ingsw/0120_44/wrong1.txt
new file mode 100644
index 0000000..5d5c9a4
--- /dev/null
+++ b/legacy/Data/ingsw/0120_44/wrong1.txt
@@ -0,0 +1 @@
+(a = 6, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 2).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_44/wrong2.txt b/legacy/Data/ingsw/0120_44/wrong2.txt
new file mode 100644
index 0000000..2b6c292
--- /dev/null
+++ b/legacy/Data/ingsw/0120_44/wrong2.txt
@@ -0,0 +1 @@
+(a = 5, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 0).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_45/quest.txt b/legacy/Data/ingsw/0120_45/quest.txt
new file mode 100644
index 0000000..4818a62
--- /dev/null
+++ b/legacy/Data/ingsw/0120_45/quest.txt
@@ -0,0 +1,35 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti UML state diagram lo rappresenta correttamente ?
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_45/wrong1.txt b/legacy/Data/ingsw/0120_45/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0120_45/wrong2.txt b/legacy/Data/ingsw/0120_45/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0120_45/wrong3.txt b/legacy/Data/ingsw/0120_45/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0120_46/correct.txt b/legacy/Data/ingsw/0120_46/correct.txt
new file mode 100644
index 0000000..3fb437d
--- /dev/null
+++ b/legacy/Data/ingsw/0120_46/correct.txt
@@ -0,0 +1 @@
+0.56
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_46/quest.txt b/legacy/Data/ingsw/0120_46/quest.txt
new file mode 100644
index 0000000..6205846
--- /dev/null
+++ b/legacy/Data/ingsw/0120_46/quest.txt
@@ -0,0 +1,9 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_46.png
+Un processo software pu essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del prcoesso software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilit della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+Ad esempio lo state diagram in figura
+
+
+
+Rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.3 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilit 0.2 di dover essere ripetuta (a causa di errori).
+Uno scenario una sequenza di stati.
+Qual'e' la probabilit dello scenario: 1, 3 ? In altri terminti, qual' la probabilit che non sia necessario ripetere nessuna fase?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_46/wrong1.txt b/legacy/Data/ingsw/0120_46/wrong1.txt
new file mode 100644
index 0000000..c64601b
--- /dev/null
+++ b/legacy/Data/ingsw/0120_46/wrong1.txt
@@ -0,0 +1 @@
+0.14
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_46/wrong2.txt b/legacy/Data/ingsw/0120_46/wrong2.txt
new file mode 100644
index 0000000..fc54e00
--- /dev/null
+++ b/legacy/Data/ingsw/0120_46/wrong2.txt
@@ -0,0 +1 @@
+0.24
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_47/correct.txt b/legacy/Data/ingsw/0120_47/correct.txt
new file mode 100644
index 0000000..eb23d05
--- /dev/null
+++ b/legacy/Data/ingsw/0120_47/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_47/quest.txt b/legacy/Data/ingsw/0120_47/quest.txt
new file mode 100644
index 0000000..7710e8f
--- /dev/null
+++ b/legacy/Data/ingsw/0120_47/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "check di consistenza" che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_47/wrong1.txt b/legacy/Data/ingsw/0120_47/wrong1.txt
new file mode 100644
index 0000000..9e12d11
--- /dev/null
+++ b/legacy/Data/ingsw/0120_47/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che per ogni requisito esista un insieme di test che lo possa verificare.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_47/wrong2.txt b/legacy/Data/ingsw/0120_47/wrong2.txt
new file mode 100644
index 0000000..32c628c
--- /dev/null
+++ b/legacy/Data/ingsw/0120_47/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_48/correct.txt b/legacy/Data/ingsw/0120_48/correct.txt
new file mode 100644
index 0000000..519c7fd
--- /dev/null
+++ b/legacy/Data/ingsw/0120_48/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x > 5) or (x < 0));
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_48/quest.txt b/legacy/Data/ingsw/0120_48/quest.txt
new file mode 100644
index 0000000..22c683f
--- /dev/null
+++ b/legacy/Data/ingsw/0120_48/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ: Durante l'esecuzione del programma (cio per tutti gli istanti di tempo positivi) la variabile x sempre nell'intervallo [0, 5].
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_48/wrong1.txt b/legacy/Data/ingsw/0120_48/wrong1.txt
new file mode 100644
index 0000000..5229f7e
--- /dev/null
+++ b/legacy/Data/ingsw/0120_48/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x > 0) or (x < 5));
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_48/wrong2.txt b/legacy/Data/ingsw/0120_48/wrong2.txt
new file mode 100644
index 0000000..c2e617d
--- /dev/null
+++ b/legacy/Data/ingsw/0120_48/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and (x > 0) and (x < 5);
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_49/correct.txt b/legacy/Data/ingsw/0120_49/correct.txt
new file mode 100644
index 0000000..2a2ecea
--- /dev/null
+++ b/legacy/Data/ingsw/0120_49/correct.txt
@@ -0,0 +1 @@
+time(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_49/quest.txt b/legacy/Data/ingsw/0120_49/quest.txt
new file mode 100644
index 0000000..2d6940a
--- /dev/null
+++ b/legacy/Data/ingsw/0120_49/quest.txt
@@ -0,0 +1,6 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_49.png
+Si consideri il processo software con due fasi (0 ed 1) rappresentato con la Markov chain in figura. Lo stato iniziale 0 e p in (0, 1). Il tempo necessario per completare la fase x time(x). La fase 0 la fase di design, che ha probabilit p di dover essere ripetuta causa errori. La fase 1 rappreenta il completamento del processo software, e quindi time(1) = 0.
+Il tempo di una istanza del processo software descritto sopra la somma dei tempi degli stati (fasi) attraversati (tenendo presente che si parte sempre dallo stato 0.
+Quindi il costo Time(X) della sequenza di stati X = x(0), x(1), x(2), .... Time(X) = time(x(0)) + time(x(1)) + time(x(2)) + ...
+Ad esempio se X = 0, 1 abbiamo Time(X) = time(0) + time(1) = time(0) (poich time(1) = 0).
+Quale delle seguenti formule calcola il valore atteso del costo per completare il processo software di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_49/wrong1.txt b/legacy/Data/ingsw/0120_49/wrong1.txt
new file mode 100644
index 0000000..d68fd15
--- /dev/null
+++ b/legacy/Data/ingsw/0120_49/wrong1.txt
@@ -0,0 +1 @@
+time(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_49/wrong2.txt b/legacy/Data/ingsw/0120_49/wrong2.txt
new file mode 100644
index 0000000..9927a93
--- /dev/null
+++ b/legacy/Data/ingsw/0120_49/wrong2.txt
@@ -0,0 +1 @@
+time(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_5/quest.txt b/legacy/Data/ingsw/0120_5/quest.txt
new file mode 100644
index 0000000..3e68301
--- /dev/null
+++ b/legacy/Data/ingsw/0120_5/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_5.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_5/wrong1.txt b/legacy/Data/ingsw/0120_5/wrong1.txt
new file mode 100644
index 0000000..6c46c45
--- /dev/null
+++ b/legacy/Data/ingsw/0120_5/wrong1.txt
@@ -0,0 +1,35 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_5/wrong2.txt b/legacy/Data/ingsw/0120_5/wrong2.txt
new file mode 100644
index 0000000..39e7bfc
--- /dev/null
+++ b/legacy/Data/ingsw/0120_5/wrong2.txt
@@ -0,0 +1,37 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_5/wrong3.txt b/legacy/Data/ingsw/0120_5/wrong3.txt
new file mode 100644
index 0000000..93e29a3
--- /dev/null
+++ b/legacy/Data/ingsw/0120_5/wrong3.txt
@@ -0,0 +1,28 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_6/correct.txt b/legacy/Data/ingsw/0120_6/correct.txt
new file mode 100644
index 0000000..7c149d8
--- /dev/null
+++ b/legacy/Data/ingsw/0120_6/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisisti descrivano tutte le funzionalità e vincoli (e.g., security, performance) del sistema desiderato dal customer.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_6/quest.txt b/legacy/Data/ingsw/0120_6/quest.txt
new file mode 100644
index 0000000..8bba4b8
--- /dev/null
+++ b/legacy/Data/ingsw/0120_6/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "check di completezza" che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_6/wrong1.txt b/legacy/Data/ingsw/0120_6/wrong1.txt
new file mode 100644
index 0000000..32c628c
--- /dev/null
+++ b/legacy/Data/ingsw/0120_6/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_6/wrong2.txt b/legacy/Data/ingsw/0120_6/wrong2.txt
new file mode 100644
index 0000000..3461684
--- /dev/null
+++ b/legacy/Data/ingsw/0120_6/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che per ogni requisito sia stato implementato nel sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_7/correct.txt b/legacy/Data/ingsw/0120_7/correct.txt
new file mode 100644
index 0000000..b559d4a
--- /dev/null
+++ b/legacy/Data/ingsw/0120_7/correct.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) and (delay(x, 10) > 1) and (y < 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_7/quest.txt b/legacy/Data/ingsw/0120_7/quest.txt
new file mode 100644
index 0000000..031c331
--- /dev/null
+++ b/legacy/Data/ingsw/0120_7/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+RQ: Dopo 40 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se 10 unit di tempo nel passato x era maggiore di 1 allora ora y nonegativa.
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time <= w e ritorna il valore che z aveva al tempo (time - w), se time = w.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_7/wrong1.txt b/legacy/Data/ingsw/0120_7/wrong1.txt
new file mode 100644
index 0000000..4b8db59
--- /dev/null
+++ b/legacy/Data/ingsw/0120_7/wrong1.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) or (delay(x, 10) > 1) or (y < 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_7/wrong2.txt b/legacy/Data/ingsw/0120_7/wrong2.txt
new file mode 100644
index 0000000..05ce544
--- /dev/null
+++ b/legacy/Data/ingsw/0120_7/wrong2.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) and (delay(x, 10) > 1) and (y >= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0120_8/correct.txt b/legacy/Data/ingsw/0120_8/correct.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/0120_8/correct.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_8/quest.txt b/legacy/Data/ingsw/0120_8/quest.txt
new file mode 100644
index 0000000..2809138
--- /dev/null
+++ b/legacy/Data/ingsw/0120_8/quest.txt
@@ -0,0 +1,11 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_8.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+Test case 1: act1 act0 act1 act0 act2
+Test case 2: act0 act2 act2 act0 act1
+Test case 3: act0 act0
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_8/wrong1.txt b/legacy/Data/ingsw/0120_8/wrong1.txt
new file mode 100644
index 0000000..1a8a508
--- /dev/null
+++ b/legacy/Data/ingsw/0120_8/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_8/wrong2.txt b/legacy/Data/ingsw/0120_8/wrong2.txt
new file mode 100644
index 0000000..a8aead7
--- /dev/null
+++ b/legacy/Data/ingsw/0120_8/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_9/correct.txt b/legacy/Data/ingsw/0120_9/correct.txt
new file mode 100644
index 0000000..ce9968f
--- /dev/null
+++ b/legacy/Data/ingsw/0120_9/correct.txt
@@ -0,0 +1 @@
+0.28
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_9/quest.txt b/legacy/Data/ingsw/0120_9/quest.txt
new file mode 100644
index 0000000..4962ecf
--- /dev/null
+++ b/legacy/Data/ingsw/0120_9/quest.txt
@@ -0,0 +1,9 @@
+img=https://unspectacular-subdi.000webhostapp.com/0120_domanda_9.png
+Un processo software pu essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del processo software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilit della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+Ad esempio lo state diagram in figura
+
+
+
+Rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.4 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilit 0.3 di dover essere ripetuta (a causa di errori).
+Uno scenario una sequenza di stati.
+Qual'e' la probabilit dello scenario: 1, 2, 3? In altri terminti, qual' la probabilit che non sia necessario ripetere la prima fase (ma non la seconda) ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_9/wrong1.txt b/legacy/Data/ingsw/0120_9/wrong1.txt
new file mode 100644
index 0000000..e8f9017
--- /dev/null
+++ b/legacy/Data/ingsw/0120_9/wrong1.txt
@@ -0,0 +1 @@
+0.42
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_9/wrong2.txt b/legacy/Data/ingsw/0120_9/wrong2.txt
new file mode 100644
index 0000000..f2bb2d0
--- /dev/null
+++ b/legacy/Data/ingsw/0120_9/wrong2.txt
@@ -0,0 +1 @@
+0.12
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0121_34/correct.txt b/legacy/Data/ingsw/0121_34/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0121_34/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0121_34/quest.txt b/legacy/Data/ingsw/0121_34/quest.txt
new file mode 100644
index 0000000..6dbca93
--- /dev/null
+++ b/legacy/Data/ingsw/0121_34/quest.txt
@@ -0,0 +1,53 @@
+Il branch coverage di un insieme di test cases è la percentuale di branch del programma che sono attraversati da almeno un test case.
+
+Si consideri il seguente programma C:
+
+-----------
+
+#include
+
+#include
+
+#include
+
+#define N 4 /* number of test cases */
+
+
+int f(int x1, int x2)
+
+{
+ if (x1 + x2 <= 2)
+
+ return (1);
+
+ else return (2);
+
+}
+
+
+int main() { int i, y; int x1[N], x2[N];
+
+ // define test cases
+
+ x1[0] = 3; x2[0] = -2; x1[1] = 4; x2[1] = -3; x1[2] = 7; x2[2] = -4; x1[3] = 8; x2[3] = -5;
+
+ // testing
+
+ for (i = 0; i < N; i++) {
+
+ y = f(x1[i], x2[i]); // function under testing
+
+ assert(y ==(x1[i], x2[i] <= 2) ? 1 : 2); // oracle
+
+ }
+
+ printf("All %d test cases passed\n", N);
+
+ return (0);
+
+}
+-----------
+
+Il programma main() sopra realizza il nostro testing per la funzione f1(). I test cases sono i valori in x1[i] ed x2[i].
+
+Quale delle seguenti è la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0121_34/wrong1.txt b/legacy/Data/ingsw/0121_34/wrong1.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0121_34/wrong1.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0121_34/wrong2.txt b/legacy/Data/ingsw/0121_34/wrong2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0121_34/wrong2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_0/correct.txt b/legacy/Data/ingsw/0210_0/correct.txt
new file mode 100644
index 0000000..a40ea7d
--- /dev/null
+++ b/legacy/Data/ingsw/0210_0/correct.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 5, c = 0), (a=50, b = 3, c = 0).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_0/quest.txt b/legacy/Data/ingsw/0210_0/quest.txt
new file mode 100644
index 0000000..2d895ca
--- /dev/null
+++ b/legacy/Data/ingsw/0210_0/quest.txt
@@ -0,0 +1,22 @@
+Una Condition una proposizione booleana, cio una espressione con valore booleano che non pu essere decomposta
+in espressioni boolean pi semplici. Ad esempio, (x + y <= 3) una condition.
+
+Una Decision una espressione booleana composta da conditions e zero o pi operatori booleani. Ad esempio, sono decisions:
+(x + y <= 3)
+((x + y <= 3) || (x - y > 7))
+Un insieme di test cases T soddisfa il criterio di Condition/Decision coverage se tutte le seguenti condizioni sono soddisfatte:
+
+1) Ciascun punto di entrata ed uscita nel programma eseguito in almeno un test;
+2) Per ogni decision d nel programma, per ogni condition c in d, esiste un test in T in cui c true ed un test in T in cui c false.
+3) Per ogni decision d nel programma, esiste un test in T in cui d true ed un test in T in cui d false.
+
+Si consideri la seguente funzione:
+int f(int a, int b, int c)
+{ if ( (a >= 100) && (b - c <= 1) )
+ return (1); // punto di uscita 1
+ else if ((b - c <= 1) || (b + c >= 5)
+)
+ then return (2); // punto di uscita 2
+ else return (3); // punto di uscita 3
+}
+ Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_0/wrong1.txt b/legacy/Data/ingsw/0210_0/wrong1.txt
new file mode 100644
index 0000000..abe0eaa
--- /dev/null
+++ b/legacy/Data/ingsw/0210_0/wrong1.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 4, c = 0), (a=200, b = 4, c = 0)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_0/wrong2.txt b/legacy/Data/ingsw/0210_0/wrong2.txt
new file mode 100644
index 0000000..5b77112
--- /dev/null
+++ b/legacy/Data/ingsw/0210_0/wrong2.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 5, c = 0), (a=50, b = 0, c = 5).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_1/quest.txt b/legacy/Data/ingsw/0210_1/quest.txt
new file mode 100644
index 0000000..89110fc
--- /dev/null
+++ b/legacy/Data/ingsw/0210_1/quest.txt
@@ -0,0 +1,5 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_1.png
+Si consideri la seguente architettura software:
+
+
+Quale dei seguenti modelli Modelica meglio la rappresenta ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_1/wrong1.txt b/legacy/Data/ingsw/0210_1/wrong1.txt
new file mode 100644
index 0000000..0487745
--- /dev/null
+++ b/legacy/Data/ingsw/0210_1/wrong1.txt
@@ -0,0 +1,6 @@
+block SysArch;
+SC1 sc1
+SC2 sc2;
+SC3 sc3;
+SC4 sc4;
+connect(sc1.input4, sc
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_1/wrong2.txt b/legacy/Data/ingsw/0210_1/wrong2.txt
new file mode 100644
index 0000000..6b9f4b0
--- /dev/null
+++ b/legacy/Data/ingsw/0210_1/wrong2.txt
@@ -0,0 +1,3 @@
+output4);
+connect(sc1.output4, sc2.input4);
+connect(sc1.input5, sc
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_1/wrong3.txt b/legacy/Data/ingsw/0210_1/wrong3.txt
new file mode 100644
index 0000000..bf32c35
--- /dev/null
+++ b/legacy/Data/ingsw/0210_1/wrong3.txt
@@ -0,0 +1,40 @@
+output5);
+connect(sc1.output5, sc3.input5);
+connect(sc1.input6, sc4.output6);
+connect(sc1.output6, sc4.input6);
+connect(sc2.input1, sc3.output1);
+connect(sc3.input2, sc4.output2);
+connect(sc4.input3, sc2.ouput3);
+end SysArch
+2.
+block SysArch;
+SC1 sc1
+SC2 sc2;
+SC3 sc3;
+SC4 sc4;
+connect(sc1.input4, sc2.output4);
+connect(sc1.output4, sc2.input4);
+connect(sc1.input5, sc3.output5);
+connect(sc1.output5, sc3.input5);
+connect(sc1.input6, sc4.output6);
+connect(sc1.output6, sc4.input6);
+connect(sc2.input1, sc3.output1);
+connect(sc3.input2, sc4.output2);
+connect(sc4.output3, sc2.input3);
+end SysArch
+3.
+block SysArch;
+SC1 sc1
+SC2 sc2;
+SC3 sc3;
+SC4 sc4;
+connect(sc1.input4, sc2.output4);
+connect(sc1.output4, sc2.input4);
+connect(sc1.input5, sc3.output5);
+connect(sc1.output5, sc3.input5);
+connect(sc1.input6, sc4.output6);
+connect(sc1.output6, sc4.input6);
+connect(sc2.output1, sc3.input1);
+connect(sc3.output2, sc4.input2);
+connect(sc4.output3, sc2.input3);
+end SysArch
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_10/correct.txt b/legacy/Data/ingsw/0210_10/correct.txt
new file mode 100644
index 0000000..ddb0d65
--- /dev/null
+++ b/legacy/Data/ingsw/0210_10/correct.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_10/quest.txt b/legacy/Data/ingsw/0210_10/quest.txt
new file mode 100644
index 0000000..d1cf8cb
--- /dev/null
+++ b/legacy/Data/ingsw/0210_10/quest.txt
@@ -0,0 +1,16 @@
+Si consideri il monitor seguente che ritorna true appena i requisiti per il sistema monitorato sono violati.
+block Monitor
+input Real x;
+output Boolean y;
+Boolean w;
+initial equation
+y = false;
+equation
+w = ((x < 0) or (x > 5));
+algorithm
+when edge(w) then
+y := true;
+end when;
+end Monitor;
+
+Quale delle seguenti affermazioni meglio descrive il requisito monitorato.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_10/wrong1.txt b/legacy/Data/ingsw/0210_10/wrong1.txt
new file mode 100644
index 0000000..7c7a691
--- /dev/null
+++ b/legacy/Data/ingsw/0210_10/wrong1.txt
@@ -0,0 +1 @@
+La variable x è minore di 0.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_10/wrong2.txt b/legacy/Data/ingsw/0210_10/wrong2.txt
new file mode 100644
index 0000000..3e05ae7
--- /dev/null
+++ b/legacy/Data/ingsw/0210_10/wrong2.txt
@@ -0,0 +1 @@
+La variabile x è fuori dall'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_11/quest.txt b/legacy/Data/ingsw/0210_11/quest.txt
new file mode 100644
index 0000000..57dc789
--- /dev/null
+++ b/legacy/Data/ingsw/0210_11/quest.txt
@@ -0,0 +1,4 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_11.png
+Si consideri la seguente architettura software:
+
+Quale dei seguneti modelli Modelica meglio la rappresenta.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_11/wrong1.txt b/legacy/Data/ingsw/0210_11/wrong1.txt
new file mode 100644
index 0000000..157d205
--- /dev/null
+++ b/legacy/Data/ingsw/0210_11/wrong1.txt
@@ -0,0 +1,9 @@
+block SysArch
+OS os_c;
+WS ws_c;
+WB wb_c;
+connect(os_c.input1, ws_c.output1);
+connect(os_c.output1, ws_c.input1);
+connect(wb_c.input2, ws_c.output2);
+connect(wb_c.output2, ws_c.input2);
+end SysArch
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_11/wrong2.txt b/legacy/Data/ingsw/0210_11/wrong2.txt
new file mode 100644
index 0000000..04886bb
--- /dev/null
+++ b/legacy/Data/ingsw/0210_11/wrong2.txt
@@ -0,0 +1,9 @@
+block SysArch
+OS os_c;
+WS ws_c;
+WB wb_c;
+connect(os_c.input1, wb_c.output1);
+connect(os_c.output1, wb_c.input1);
+connect(wb_c.input2, ws_c.output2);
+connect(wb_c.output2, ws_c.input2);
+end SysArch
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_11/wrong3.txt b/legacy/Data/ingsw/0210_11/wrong3.txt
new file mode 100644
index 0000000..903ba76
--- /dev/null
+++ b/legacy/Data/ingsw/0210_11/wrong3.txt
@@ -0,0 +1,9 @@
+block SysArch
+OS os_c;
+WS ws_c;
+WB wb_c;
+connect(os_c.input1, ws_c.output1);
+connect(os_c.output1, ws_c.input1);
+connect(wb_c.input2, os_c.output2);
+connect(wb_c.output2, os_c.input2);
+end SysArch
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_12/quest.txt b/legacy/Data/ingsw/0210_12/quest.txt
new file mode 100644
index 0000000..86ee3d4
--- /dev/null
+++ b/legacy/Data/ingsw/0210_12/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_12.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_12/wrong1.txt b/legacy/Data/ingsw/0210_12/wrong1.txt
new file mode 100644
index 0000000..c7f67fe
--- /dev/null
+++ b/legacy/Data/ingsw/0210_12/wrong1.txt
@@ -0,0 +1,38 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_12/wrong2.txt b/legacy/Data/ingsw/0210_12/wrong2.txt
new file mode 100644
index 0000000..b84dfd6
--- /dev/null
+++ b/legacy/Data/ingsw/0210_12/wrong2.txt
@@ -0,0 +1,35 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_12/wrong3.txt b/legacy/Data/ingsw/0210_12/wrong3.txt
new file mode 100644
index 0000000..162b572
--- /dev/null
+++ b/legacy/Data/ingsw/0210_12/wrong3.txt
@@ -0,0 +1,35 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_13/correct.txt b/legacy/Data/ingsw/0210_13/correct.txt
new file mode 100644
index 0000000..25ac15c
--- /dev/null
+++ b/legacy/Data/ingsw/0210_13/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 20) and ((x >= 30) or (x <= 20)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0210_13/quest.txt b/legacy/Data/ingsw/0210_13/quest.txt
new file mode 100644
index 0000000..b420aaf
--- /dev/null
+++ b/legacy/Data/ingsw/0210_13/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ1: Dopo 20 unit di tempo dall'inizio dell'esecuzione la variabile x sempre nell'intervallo [20, 30] .
+Quale dei seguenti monitor meglio descrive il requisito RQ1 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_13/wrong1.txt b/legacy/Data/ingsw/0210_13/wrong1.txt
new file mode 100644
index 0000000..d021c3b
--- /dev/null
+++ b/legacy/Data/ingsw/0210_13/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 20) and (x >= 20) and (x <= 30) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0210_13/wrong2.txt b/legacy/Data/ingsw/0210_13/wrong2.txt
new file mode 100644
index 0000000..157567e
--- /dev/null
+++ b/legacy/Data/ingsw/0210_13/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 20) or ((x >= 20) and (x <= 30)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0210_14/correct.txt b/legacy/Data/ingsw/0210_14/correct.txt
new file mode 100644
index 0000000..e74b1fc
--- /dev/null
+++ b/legacy/Data/ingsw/0210_14/correct.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x > y) then (z == x) else (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_14/quest.txt b/legacy/Data/ingsw/0210_14/quest.txt
new file mode 100644
index 0000000..c1cd6d0
--- /dev/null
+++ b/legacy/Data/ingsw/0210_14/quest.txt
@@ -0,0 +1,9 @@
+Un test oracle per un programma P una funzione booleana che ha come inputs gli inputs ed outputs di P e ritorna true se e solo se il valore di output di P (con i dati inputs) quello atteso dalle specifiche.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+int z = x;
+while ( (x <= z) && (z <= y) ) { z = z + 1; }
+return (z);
+}
+Siano x, y, gli inputs del programma (f nel nostro caso) e z l'output. Assumendo il programma corretto, quale delle seguenti funzioni booleane F(x, y, z) un test oracle per la funzione f.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_14/wrong1.txt b/legacy/Data/ingsw/0210_14/wrong1.txt
new file mode 100644
index 0000000..d63544a
--- /dev/null
+++ b/legacy/Data/ingsw/0210_14/wrong1.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x > y) then (z == x + 1) else (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_14/wrong2.txt b/legacy/Data/ingsw/0210_14/wrong2.txt
new file mode 100644
index 0000000..1753a91
--- /dev/null
+++ b/legacy/Data/ingsw/0210_14/wrong2.txt
@@ -0,0 +1 @@
+F(x, y, z) = (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_15/correct.txt b/legacy/Data/ingsw/0210_15/correct.txt
new file mode 100644
index 0000000..519c7fd
--- /dev/null
+++ b/legacy/Data/ingsw/0210_15/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x > 5) or (x < 0));
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0210_15/quest.txt b/legacy/Data/ingsw/0210_15/quest.txt
new file mode 100644
index 0000000..22c683f
--- /dev/null
+++ b/legacy/Data/ingsw/0210_15/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ: Durante l'esecuzione del programma (cio per tutti gli istanti di tempo positivi) la variabile x sempre nell'intervallo [0, 5].
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_15/wrong1.txt b/legacy/Data/ingsw/0210_15/wrong1.txt
new file mode 100644
index 0000000..5229f7e
--- /dev/null
+++ b/legacy/Data/ingsw/0210_15/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x > 0) or (x < 5));
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
diff --git a/legacy/Data/ingsw/0210_15/wrong2.txt b/legacy/Data/ingsw/0210_15/wrong2.txt
new file mode 100644
index 0000000..2029293
--- /dev/null
+++ b/legacy/Data/ingsw/0210_15/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and (x > 0) and (x < 5);
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_16/correct.txt b/legacy/Data/ingsw/0210_16/correct.txt
new file mode 100644
index 0000000..293ebbc
--- /dev/null
+++ b/legacy/Data/ingsw/0210_16/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 10) and (x >= 10) and (x <= 20) and ((y < 0.5*x) or (y > 0.7*x)) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_16/quest.txt b/legacy/Data/ingsw/0210_16/quest.txt
new file mode 100644
index 0000000..5922b9f
--- /dev/null
+++ b/legacy/Data/ingsw/0210_16/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ: Dopo 10 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet: se la variabile x nell'intervallo [10, 20] allora la variabile y compresa tra il 50% di x ed il 70% di x.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_16/wrong1.txt b/legacy/Data/ingsw/0210_16/wrong1.txt
new file mode 100644
index 0000000..d7890b2
--- /dev/null
+++ b/legacy/Data/ingsw/0210_16/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 10) and (x >= 10) and (x <= 20) and (y >= 0.5*x) and (y <= 0.7*x) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_16/wrong2.txt b/legacy/Data/ingsw/0210_16/wrong2.txt
new file mode 100644
index 0000000..d50b268
--- /dev/null
+++ b/legacy/Data/ingsw/0210_16/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 10) and ((x < 10) or (x > 20)) and ((y < 0.5*x) or (y > 0.7*x)) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_17/correct.txt b/legacy/Data/ingsw/0210_17/correct.txt
new file mode 100644
index 0000000..2ca9276
--- /dev/null
+++ b/legacy/Data/ingsw/0210_17/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 35%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_17/quest.txt b/legacy/Data/ingsw/0210_17/quest.txt
new file mode 100644
index 0000000..5fa40ee
--- /dev/null
+++ b/legacy/Data/ingsw/0210_17/quest.txt
@@ -0,0 +1,13 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_17.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 act2
+Test case 2: act2 act0 act1 act0 act0
+Test case 3: act2 act0 act2
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_17/wrong1.txt b/legacy/Data/ingsw/0210_17/wrong1.txt
new file mode 100644
index 0000000..8b0c318
--- /dev/null
+++ b/legacy/Data/ingsw/0210_17/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_17/wrong2.txt b/legacy/Data/ingsw/0210_17/wrong2.txt
new file mode 100644
index 0000000..2d5aeb0
--- /dev/null
+++ b/legacy/Data/ingsw/0210_17/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_18/correct.txt b/legacy/Data/ingsw/0210_18/correct.txt
new file mode 100644
index 0000000..1a8a50a
--- /dev/null
+++ b/legacy/Data/ingsw/0210_18/correct.txt
@@ -0,0 +1 @@
+Per ciascun requisito, dovremmo essere in grado di scrivere un inseme di test che può dimostrare che il sistema sviluppato soddisfa il requisito considerato.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_18/quest.txt b/legacy/Data/ingsw/0210_18/quest.txt
new file mode 100644
index 0000000..793b220
--- /dev/null
+++ b/legacy/Data/ingsw/0210_18/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive il criterio di "requirements verifiability" che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_18/wrong1.txt b/legacy/Data/ingsw/0210_18/wrong1.txt
new file mode 100644
index 0000000..fac8307
--- /dev/null
+++ b/legacy/Data/ingsw/0210_18/wrong1.txt
@@ -0,0 +1 @@
+Per ciascuna coppia di componenti, dovremmo essere in grado di scrivere un insieme di test che può dimostrare che l'interazione tra le componenti soddisfa tutti i requisiti di interfaccia.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_18/wrong2.txt b/legacy/Data/ingsw/0210_18/wrong2.txt
new file mode 100644
index 0000000..3fdb31e
--- /dev/null
+++ b/legacy/Data/ingsw/0210_18/wrong2.txt
@@ -0,0 +1 @@
+Per ciascuna componente del sistema, dovremmo essere in grado di scrivere un insieme di test che può dimostrare che essa soddisfa tutti i requisiti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_19/correct.txt b/legacy/Data/ingsw/0210_19/correct.txt
new file mode 100644
index 0000000..f6a4b07
--- /dev/null
+++ b/legacy/Data/ingsw/0210_19/correct.txt
@@ -0,0 +1 @@
+State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_19/quest.txt b/legacy/Data/ingsw/0210_19/quest.txt
new file mode 100644
index 0000000..e786bcf
--- /dev/null
+++ b/legacy/Data/ingsw/0210_19/quest.txt
@@ -0,0 +1,12 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_19.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+
+Si consideri il seguente insieme di test cases:
+Test case 1: act1 act1 act2 act2
+Test case 2: act1 act1 act0 act1
+Test case 3: act0 act0 act2 act1 act0
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_19/wrong1.txt b/legacy/Data/ingsw/0210_19/wrong1.txt
new file mode 100644
index 0000000..1c07658
--- /dev/null
+++ b/legacy/Data/ingsw/0210_19/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_19/wrong2.txt b/legacy/Data/ingsw/0210_19/wrong2.txt
new file mode 100644
index 0000000..a8aead7
--- /dev/null
+++ b/legacy/Data/ingsw/0210_19/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_2/quest.txt b/legacy/Data/ingsw/0210_2/quest.txt
new file mode 100644
index 0000000..f9f8976
--- /dev/null
+++ b/legacy/Data/ingsw/0210_2/quest.txt
@@ -0,0 +1,36 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti UML state diagram lo rappresenta correttamente ?
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_2/wrong1.txt b/legacy/Data/ingsw/0210_2/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0210_2/wrong2.txt b/legacy/Data/ingsw/0210_2/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0210_2/wrong3.txt b/legacy/Data/ingsw/0210_2/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0210_20/correct.txt b/legacy/Data/ingsw/0210_20/correct.txt
new file mode 100644
index 0000000..eb23d05
--- /dev/null
+++ b/legacy/Data/ingsw/0210_20/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_20/quest.txt b/legacy/Data/ingsw/0210_20/quest.txt
new file mode 100644
index 0000000..7710e8f
--- /dev/null
+++ b/legacy/Data/ingsw/0210_20/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "check di consistenza" che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_20/wrong1.txt b/legacy/Data/ingsw/0210_20/wrong1.txt
new file mode 100644
index 0000000..9e12d11
--- /dev/null
+++ b/legacy/Data/ingsw/0210_20/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che per ogni requisito esista un insieme di test che lo possa verificare.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_20/wrong2.txt b/legacy/Data/ingsw/0210_20/wrong2.txt
new file mode 100644
index 0000000..32c628c
--- /dev/null
+++ b/legacy/Data/ingsw/0210_20/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_21/correct.txt b/legacy/Data/ingsw/0210_21/correct.txt
new file mode 100644
index 0000000..ad21063
--- /dev/null
+++ b/legacy/Data/ingsw/0210_21/correct.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) and (delay(x, 10) > 1) and (y < 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_21/quest.txt b/legacy/Data/ingsw/0210_21/quest.txt
new file mode 100644
index 0000000..031c331
--- /dev/null
+++ b/legacy/Data/ingsw/0210_21/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+RQ: Dopo 40 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se 10 unit di tempo nel passato x era maggiore di 1 allora ora y nonegativa.
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time <= w e ritorna il valore che z aveva al tempo (time - w), se time = w.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_21/wrong1.txt b/legacy/Data/ingsw/0210_21/wrong1.txt
new file mode 100644
index 0000000..b14ac60
--- /dev/null
+++ b/legacy/Data/ingsw/0210_21/wrong1.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) and (delay(x, 10) > 1) and (y >= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_21/wrong2.txt b/legacy/Data/ingsw/0210_21/wrong2.txt
new file mode 100644
index 0000000..e4201ab
--- /dev/null
+++ b/legacy/Data/ingsw/0210_21/wrong2.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) or (delay(x, 10) > 1) or (y < 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_22/correct.txt b/legacy/Data/ingsw/0210_22/correct.txt
new file mode 100644
index 0000000..a7029bc
--- /dev/null
+++ b/legacy/Data/ingsw/0210_22/correct.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [1, 4] oppure nell'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_22/quest.txt b/legacy/Data/ingsw/0210_22/quest.txt
new file mode 100644
index 0000000..e5fbc81
--- /dev/null
+++ b/legacy/Data/ingsw/0210_22/quest.txt
@@ -0,0 +1,16 @@
+Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato.
+block Monitor
+input Real x;
+output Boolean y;
+Boolean w;
+initial equation
+y = false;
+equation
+w = ((x < 1) or (x > 4)) and ((x < 15) or (x > 20));
+algorithm
+when edge(w) then
+y := true;
+end when;
+end Monitor;
+
+Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_22/wrong1.txt b/legacy/Data/ingsw/0210_22/wrong1.txt
new file mode 100644
index 0000000..710b111
--- /dev/null
+++ b/legacy/Data/ingsw/0210_22/wrong1.txt
@@ -0,0 +1 @@
+La variabile x è fuori dall'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_22/wrong2.txt b/legacy/Data/ingsw/0210_22/wrong2.txt
new file mode 100644
index 0000000..a82929b
--- /dev/null
+++ b/legacy/Data/ingsw/0210_22/wrong2.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_23/correct.txt b/legacy/Data/ingsw/0210_23/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0210_23/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_23/quest.txt b/legacy/Data/ingsw/0210_23/quest.txt
new file mode 100644
index 0000000..adede32
--- /dev/null
+++ b/legacy/Data/ingsw/0210_23/quest.txt
@@ -0,0 +1,9 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+ if (x - y <= 2) { if (x + y >= 1) return (1); else return (2); }
+ else {if (x + 2*y >= 5) return (3); else return (4); }
+ } /* f() */
+Si considerino i seguenti test cases: {x=1, y=2}, {x=0, y=0}, {x=5, y=0}, {x=3, y=0}.
+Quale delle seguenti la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_23/wrong1.txt b/legacy/Data/ingsw/0210_23/wrong1.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0210_23/wrong1.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_23/wrong2.txt b/legacy/Data/ingsw/0210_23/wrong2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0210_23/wrong2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_24/correct.txt b/legacy/Data/ingsw/0210_24/correct.txt
new file mode 100644
index 0000000..2a2ecea
--- /dev/null
+++ b/legacy/Data/ingsw/0210_24/correct.txt
@@ -0,0 +1 @@
+time(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_24/quest.txt b/legacy/Data/ingsw/0210_24/quest.txt
new file mode 100644
index 0000000..d188da2
--- /dev/null
+++ b/legacy/Data/ingsw/0210_24/quest.txt
@@ -0,0 +1,6 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_24.png
+Si consideri il processo software con due fasi (0 ed 1) rappresentato con la Markov chain in figura. Lo stato iniziale 0 e p in (0, 1). Il tempo necessario per completare la fase x time(x). La fase 0 la fase di design, che ha probabilit p di dover essere ripetuta causa errori. La fase 1 rappreenta il completamento del processo software, e quindi time(1) = 0.
+Il tempo di una istanza del processo software descritto sopra la somma dei tempi degli stati (fasi) attraversati (tenendo presente che si parte sempre dallo stato 0.
+Quindi il costo Time(X) della sequenza di stati X = x(0), x(1), x(2), .... Time(X) = time(x(0)) + time(x(1)) + time(x(2)) + ...
+Ad esempio se X = 0, 1 abbiamo Time(X) = time(0) + time(1) = time(0) (poich time(1) = 0).
+Quale delle seguenti formule calcola il valore atteso del costo per completare il processo software di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_24/wrong1.txt b/legacy/Data/ingsw/0210_24/wrong1.txt
new file mode 100644
index 0000000..9927a93
--- /dev/null
+++ b/legacy/Data/ingsw/0210_24/wrong1.txt
@@ -0,0 +1 @@
+time(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_24/wrong2.txt b/legacy/Data/ingsw/0210_24/wrong2.txt
new file mode 100644
index 0000000..d68fd15
--- /dev/null
+++ b/legacy/Data/ingsw/0210_24/wrong2.txt
@@ -0,0 +1 @@
+time(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_25/correct.txt b/legacy/Data/ingsw/0210_25/correct.txt
new file mode 100644
index 0000000..43dc0c9
--- /dev/null
+++ b/legacy/Data/ingsw/0210_25/correct.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x >= 0) && (y >= 0) && ((x > 0) || (y > 0)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_25/quest.txt b/legacy/Data/ingsw/0210_25/quest.txt
new file mode 100644
index 0000000..f6744fd
--- /dev/null
+++ b/legacy/Data/ingsw/0210_25/quest.txt
@@ -0,0 +1,4 @@
+Pre-condizioni, invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in ). In particolare, assert(expre) non fa nulla se l'espressione expre vale TRUE (cio non 0), stampa un messaggio di errore su stderr e abortisce l'esecuzione del programma altrimenti.
+Si consideri la funzione C
+int f(in x, int y) { ..... }
+Quale delle seguenti assert esprime la pre-condizione che entrambi gli argomenti di f sono non-negativi ed almeno uno di loro positivo ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_25/wrong1.txt b/legacy/Data/ingsw/0210_25/wrong1.txt
new file mode 100644
index 0000000..6a97baf
--- /dev/null
+++ b/legacy/Data/ingsw/0210_25/wrong1.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x >= 0) && (y >= 0) && ((x > 1) || (y > 1)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_25/wrong2.txt b/legacy/Data/ingsw/0210_25/wrong2.txt
new file mode 100644
index 0000000..3f63933
--- /dev/null
+++ b/legacy/Data/ingsw/0210_25/wrong2.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x > 0) && (y > 0) && ((x > 1) || (y > 1)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_26/correct.txt b/legacy/Data/ingsw/0210_26/correct.txt
new file mode 100644
index 0000000..b9f32a6
--- /dev/null
+++ b/legacy/Data/ingsw/0210_26/correct.txt
@@ -0,0 +1 @@
+c(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_26/quest.txt b/legacy/Data/ingsw/0210_26/quest.txt
new file mode 100644
index 0000000..d318528
--- /dev/null
+++ b/legacy/Data/ingsw/0210_26/quest.txt
@@ -0,0 +1,6 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_26.png
+Si consideri il processo software con due fasi (0 ed 1) rappresentato con la Markov chain in figura. Lo stato iniziale 0 e p in (0, 1). Il costo dello stato (fase) x c(x). La fase 0 la fase di design, che ha probabilit p di dover essere ripetuta causa errori. La fase 1 rappreenta il completamento del processo software, e quindi c(1) = 0.
+Il costo di una istanza del processo software descritto sopra la somma dei costi degli stati attraversati (tenendo presente che si parte sempre dallo stato 0.
+Quindi il costo C(X) della sequenza di stati X = x(0), x(1), x(2), .... C(X) = c(x(0)) + c(x(1)) + c(x(2)) + ...
+Ad esempio se X = 0, 1 abbiamo C(X) = c(0) + c(1) = c(0) (poich c(1) = 0).
+Quale delle seguenti formule calcola il valore atteso del costo per completare il processo software di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_26/wrong1.txt b/legacy/Data/ingsw/0210_26/wrong1.txt
new file mode 100644
index 0000000..3143da9
--- /dev/null
+++ b/legacy/Data/ingsw/0210_26/wrong1.txt
@@ -0,0 +1 @@
+c(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_26/wrong2.txt b/legacy/Data/ingsw/0210_26/wrong2.txt
new file mode 100644
index 0000000..70022eb
--- /dev/null
+++ b/legacy/Data/ingsw/0210_26/wrong2.txt
@@ -0,0 +1 @@
+c(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_27/quest.txt b/legacy/Data/ingsw/0210_27/quest.txt
new file mode 100644
index 0000000..75e942b
--- /dev/null
+++ b/legacy/Data/ingsw/0210_27/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_27.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_27/wrong1.txt b/legacy/Data/ingsw/0210_27/wrong1.txt
new file mode 100644
index 0000000..c296b22
--- /dev/null
+++ b/legacy/Data/ingsw/0210_27/wrong1.txt
@@ -0,0 +1,36 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_27/wrong2.txt b/legacy/Data/ingsw/0210_27/wrong2.txt
new file mode 100644
index 0000000..d21df5d
--- /dev/null
+++ b/legacy/Data/ingsw/0210_27/wrong2.txt
@@ -0,0 +1,32 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_27/wrong3.txt b/legacy/Data/ingsw/0210_27/wrong3.txt
new file mode 100644
index 0000000..421d23f
--- /dev/null
+++ b/legacy/Data/ingsw/0210_27/wrong3.txt
@@ -0,0 +1,37 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_28/quest.txt b/legacy/Data/ingsw/0210_28/quest.txt
new file mode 100644
index 0000000..932f11d
--- /dev/null
+++ b/legacy/Data/ingsw/0210_28/quest.txt
@@ -0,0 +1,38 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti UML state diagram lo rappresenta correttamente ?
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_28/wrong1.txt b/legacy/Data/ingsw/0210_28/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0210_28/wrong2.txt b/legacy/Data/ingsw/0210_28/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0210_28/wrong3.txt b/legacy/Data/ingsw/0210_28/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0210_29/correct.txt b/legacy/Data/ingsw/0210_29/correct.txt
new file mode 100644
index 0000000..0902686
--- /dev/null
+++ b/legacy/Data/ingsw/0210_29/correct.txt
@@ -0,0 +1 @@
+Requisito funzionale.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_29/quest.txt b/legacy/Data/ingsw/0210_29/quest.txt
new file mode 100644
index 0000000..f6839df
--- /dev/null
+++ b/legacy/Data/ingsw/0210_29/quest.txt
@@ -0,0 +1,2 @@
+"Ogni giorno, per ciascuna clinica, il sistema generer una lista dei pazienti che hanno un appuntamento quel giorno."
+La frase precedente un esempio di:
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_29/wrong1.txt b/legacy/Data/ingsw/0210_29/wrong1.txt
new file mode 100644
index 0000000..6084c49
--- /dev/null
+++ b/legacy/Data/ingsw/0210_29/wrong1.txt
@@ -0,0 +1 @@
+Requisito non-funzionale.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_29/wrong2.txt b/legacy/Data/ingsw/0210_29/wrong2.txt
new file mode 100644
index 0000000..396c8d3
--- /dev/null
+++ b/legacy/Data/ingsw/0210_29/wrong2.txt
@@ -0,0 +1 @@
+Requisito di performance.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_3/quest.txt b/legacy/Data/ingsw/0210_3/quest.txt
new file mode 100644
index 0000000..985c244
--- /dev/null
+++ b/legacy/Data/ingsw/0210_3/quest.txt
@@ -0,0 +1,4 @@
+Un test oracle per un programma P una funzione booleana che ha come inputs gli inputs ed outputs di P e ritorna true se e solo se il valore di output di P (con i dati inputs) quello atteso dalle specifiche.
+Si consideri la seguente specifica funzionale per la funzione f.
+La funzione f(int *A, int *B) prende come input un vettore A di dimensione n ritorna come output un vettore B ottenuto ordinando gli elementi di A in ordine crescente.
+Quale delle seguenti funzioni un test oracle per la funzione f ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_3/wrong1.txt b/legacy/Data/ingsw/0210_3/wrong1.txt
new file mode 100644
index 0000000..ed5ad19
--- /dev/null
+++ b/legacy/Data/ingsw/0210_3/wrong1.txt
@@ -0,0 +1,14 @@
+#define n 1000
+int TestOracle1(int *A, int *B)
+{
+int i, j, D[n];
+//init
+for (i = 0; i < n; i++) D[i] = -1;
+// B is ordered
+for (i = 0; i < n; i++) { for (j = i+1; j < n; j++) {if (B[j] < B[i]) {retun (0);}}}
+// B is a permutation of A
+for (i = 0; i < n; i++) { for (j = 0; j < n; j++) {if ((A[i] == B[j]) && (D[j] == -1)) {C[i][j] = 1; D[j] = 1; break;}
+for (i = 0; i < n; i++) {if (D[i] == -1) return (0);}
+// B ok
+return (1);
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_3/wrong2.txt b/legacy/Data/ingsw/0210_3/wrong2.txt
new file mode 100644
index 0000000..69b9722
--- /dev/null
+++ b/legacy/Data/ingsw/0210_3/wrong2.txt
@@ -0,0 +1,14 @@
+#define n 1000
+int TestOracle2(int *A, int *B)
+{
+int i, j, D[n];
+//init
+for (i = 0; i < n; i++) D[i] = -1;
+// B is ordered
+for (i = 0; i < n; i++) { for (j = i+1; j < n; j++) {if (B[j] < B[i]) {retun (0);}}}
+// B is a permutation of A
+for (i = 0; i < n; i++) { for (j = 0; j < n; j++) {if ((A[i] == B[j]) && (D[j] == -1)) {C[i][j] = 1; break;}
+for (i = 0; i < n; i++) {if (D[i] == -1) return (0);}
+// B ok
+return (1);
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_3/wrong3.txt b/legacy/Data/ingsw/0210_3/wrong3.txt
new file mode 100644
index 0000000..a26ce6e
--- /dev/null
+++ b/legacy/Data/ingsw/0210_3/wrong3.txt
@@ -0,0 +1,15 @@
+#define n 1000
+
+int TestOracle3(int *A, int *B)
+{
+int i, j, D[n];
+//init
+for (i = 0; i < n; i++) D[i] = -1;
+// B is ordered
+for (i = 0; i < n; i++) { for (j = i+1; j < n; j++) {if (B[j] < B[i]) {retun (0);}}}
+// B is a permutation of A
+for (i = 0; i < n; i++) { for (j = 0; j < n; j++) {if (A[i] == B[j]) {C[i][j] = 1; D[j] = 1; break;}
+for (i = 0; i < n; i++) {if (D[i] == -1) return (0);}
+// B ok
+return (1);
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_30/correct.txt b/legacy/Data/ingsw/0210_30/correct.txt
new file mode 100644
index 0000000..b110af1
--- /dev/null
+++ b/legacy/Data/ingsw/0210_30/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_30/quest.txt b/legacy/Data/ingsw/0210_30/quest.txt
new file mode 100644
index 0000000..a27fc55
--- /dev/null
+++ b/legacy/Data/ingsw/0210_30/quest.txt
@@ -0,0 +1,13 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_30.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 act1 act2 act2
+Test case 2: act1 act1 act0 act1
+Test case 3: act0 act0 act2 act1 act0
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_30/wrong1.txt b/legacy/Data/ingsw/0210_30/wrong1.txt
new file mode 100644
index 0000000..2d5aeb0
--- /dev/null
+++ b/legacy/Data/ingsw/0210_30/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_30/wrong2.txt b/legacy/Data/ingsw/0210_30/wrong2.txt
new file mode 100644
index 0000000..a29d476
--- /dev/null
+++ b/legacy/Data/ingsw/0210_30/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_31/correct.txt b/legacy/Data/ingsw/0210_31/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0210_31/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_31/quest.txt b/legacy/Data/ingsw/0210_31/quest.txt
new file mode 100644
index 0000000..65cfd2d
--- /dev/null
+++ b/legacy/Data/ingsw/0210_31/quest.txt
@@ -0,0 +1,9 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+ if (x - y <= 0) { if (x + y >= 2) return (1); else return (2); }
+ else {if (2*x + y >= 1) return (3); else return (4); }
+ } /* f() */
+Si considerino i seguenti test cases: {x=1, y=1}, {x=0, y=0}, {x=1, y=0}, {x=0, y=-1}.
+Quale delle seguenti la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_31/wrong1.txt b/legacy/Data/ingsw/0210_31/wrong1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0210_31/wrong1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_31/wrong2.txt b/legacy/Data/ingsw/0210_31/wrong2.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0210_31/wrong2.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_32/correct.txt b/legacy/Data/ingsw/0210_32/correct.txt
new file mode 100644
index 0000000..973ef63
--- /dev/null
+++ b/legacy/Data/ingsw/0210_32/correct.txt
@@ -0,0 +1 @@
+State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_32/quest.txt b/legacy/Data/ingsw/0210_32/quest.txt
new file mode 100644
index 0000000..cb591da
--- /dev/null
+++ b/legacy/Data/ingsw/0210_32/quest.txt
@@ -0,0 +1,13 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_32.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+
+Si consideri il seguente insieme di test cases:
+Test case 1: act1 act2
+Test case 2: act2 act0 act1 act0 act0
+Test case 3: act2 act0 act2
+
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_32/wrong1.txt b/legacy/Data/ingsw/0210_32/wrong1.txt
new file mode 100644
index 0000000..1c07658
--- /dev/null
+++ b/legacy/Data/ingsw/0210_32/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_32/wrong2.txt b/legacy/Data/ingsw/0210_32/wrong2.txt
new file mode 100644
index 0000000..a8aead7
--- /dev/null
+++ b/legacy/Data/ingsw/0210_32/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_33/correct.txt b/legacy/Data/ingsw/0210_33/correct.txt
new file mode 100644
index 0000000..1c7da8c
--- /dev/null
+++ b/legacy/Data/ingsw/0210_33/correct.txt
@@ -0,0 +1 @@
+0.03
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_33/quest.txt b/legacy/Data/ingsw/0210_33/quest.txt
new file mode 100644
index 0000000..cf9113a
--- /dev/null
+++ b/legacy/Data/ingsw/0210_33/quest.txt
@@ -0,0 +1,9 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_33.png
+Un processo software pu essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del prcoesso software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilit della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+Ad esempio lo state diagram in figura
+
+
+
+Rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.3 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilit 0.1 di dover essere ripetuta (a causa di errori).
+Uno scenario una sequenza di stati.
+Qual'e' la probabilit dello scenario: 1, 2, 3, 4 ? In altri terminti, qual' la probabilit che sia necessario ripetere sia la fase 1 che la fase 2 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_33/wrong1.txt b/legacy/Data/ingsw/0210_33/wrong1.txt
new file mode 100644
index 0000000..7eb6830
--- /dev/null
+++ b/legacy/Data/ingsw/0210_33/wrong1.txt
@@ -0,0 +1 @@
+0.27
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_33/wrong2.txt b/legacy/Data/ingsw/0210_33/wrong2.txt
new file mode 100644
index 0000000..8a346b7
--- /dev/null
+++ b/legacy/Data/ingsw/0210_33/wrong2.txt
@@ -0,0 +1 @@
+0.07
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_34/quest.txt b/legacy/Data/ingsw/0210_34/quest.txt
new file mode 100644
index 0000000..33e1f49
--- /dev/null
+++ b/legacy/Data/ingsw/0210_34/quest.txt
@@ -0,0 +1,34 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti UML state diagram lo rappresenta correttamente ?
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 3;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_34/wrong1.txt b/legacy/Data/ingsw/0210_34/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0210_34/wrong2.txt b/legacy/Data/ingsw/0210_34/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0210_34/wrong3.txt b/legacy/Data/ingsw/0210_34/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0210_35/correct.txt b/legacy/Data/ingsw/0210_35/correct.txt
new file mode 100644
index 0000000..7c149d8
--- /dev/null
+++ b/legacy/Data/ingsw/0210_35/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisisti descrivano tutte le funzionalità e vincoli (e.g., security, performance) del sistema desiderato dal customer.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_35/quest.txt b/legacy/Data/ingsw/0210_35/quest.txt
new file mode 100644
index 0000000..8bba4b8
--- /dev/null
+++ b/legacy/Data/ingsw/0210_35/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "check di completezza" che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_35/wrong1.txt b/legacy/Data/ingsw/0210_35/wrong1.txt
new file mode 100644
index 0000000..3461684
--- /dev/null
+++ b/legacy/Data/ingsw/0210_35/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che per ogni requisito sia stato implementato nel sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_35/wrong2.txt b/legacy/Data/ingsw/0210_35/wrong2.txt
new file mode 100644
index 0000000..32c628c
--- /dev/null
+++ b/legacy/Data/ingsw/0210_35/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_36/correct.txt b/legacy/Data/ingsw/0210_36/correct.txt
new file mode 100644
index 0000000..3f63933
--- /dev/null
+++ b/legacy/Data/ingsw/0210_36/correct.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x > 0) && (y > 0) && ((x > 1) || (y > 1)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_36/quest.txt b/legacy/Data/ingsw/0210_36/quest.txt
new file mode 100644
index 0000000..595ab5d
--- /dev/null
+++ b/legacy/Data/ingsw/0210_36/quest.txt
@@ -0,0 +1,4 @@
+Pre-condizioni, invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in ). In particolare, assert(expre) non fa nulla se l'espressione expre vale TRUE (cio non 0), stampa un messaggio di errore su stderr e abortisce l'esecuzione del programma altrimenti.
+Si consideri la funzione C
+int f(in x, int y) { ..... }
+Quale delle seguenti assert esprime la pre-condizione che entrambi gli argomenti di f sono positivi ed almeno uno di loro maggiore di 1 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_36/wrong1.txt b/legacy/Data/ingsw/0210_36/wrong1.txt
new file mode 100644
index 0000000..6a97baf
--- /dev/null
+++ b/legacy/Data/ingsw/0210_36/wrong1.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x >= 0) && (y >= 0) && ((x > 1) || (y > 1)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_36/wrong2.txt b/legacy/Data/ingsw/0210_36/wrong2.txt
new file mode 100644
index 0000000..e607157
--- /dev/null
+++ b/legacy/Data/ingsw/0210_36/wrong2.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x > 0) && (y > 0) && (x > 1) && (y > 1) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_37/quest.txt b/legacy/Data/ingsw/0210_37/quest.txt
new file mode 100644
index 0000000..5743032
--- /dev/null
+++ b/legacy/Data/ingsw/0210_37/quest.txt
@@ -0,0 +1,36 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti UML state diagram lo rappresenta correttamente ?
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_37/wrong1.txt b/legacy/Data/ingsw/0210_37/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0210_37/wrong2.txt b/legacy/Data/ingsw/0210_37/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0210_37/wrong3.txt b/legacy/Data/ingsw/0210_37/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0210_38/correct.txt b/legacy/Data/ingsw/0210_38/correct.txt
new file mode 100644
index 0000000..232aedf
--- /dev/null
+++ b/legacy/Data/ingsw/0210_38/correct.txt
@@ -0,0 +1 @@
+(a = 6, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 0).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_38/quest.txt b/legacy/Data/ingsw/0210_38/quest.txt
new file mode 100644
index 0000000..b2bed72
--- /dev/null
+++ b/legacy/Data/ingsw/0210_38/quest.txt
@@ -0,0 +1,21 @@
+Una Condition una proposizione booleana, cio una espressione con valore booleano che non pu essere decomposta
+in espressioni boolean pi semplici. Ad esempio, (x + y <= 3) una condition.
+
+Una Decision una espressione booleana composta da conditions e zero o pi operatori booleani. Ad esempio, sono decisions:
+(x + y <= 3)
+((x + y <= 3) || (x - y > 7))
+Un insieme di test cases T soddisfa il criterio di Condition/Decision coverage se tutte le seguenti condizioni sono soddisfatte:
+
+1) Ciascun punto di entrata ed uscita nel programma eseguito in almeno un test;
+2) Per ogni decision d nel programma, per ogni condition c in d, esiste un test in T in cui c true ed un test in T in cui c false.
+3) Per ogni decision d nel programma, esiste un test in T in cui d true ed un test in T in cui d false.
+
+Si consideri la seguente funzione:
+int f(int a, int b, int c)
+{ if ( (a + b >= 6) && (b - c <= 1) )
+ return (1); // punto di uscita 1
+ else if ((b - c <= 1) || (b + c >= 5))
+ then return (2); // punto di uscita 2
+ else return (3); // punto di uscita 3
+}
+ Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_38/wrong1.txt b/legacy/Data/ingsw/0210_38/wrong1.txt
new file mode 100644
index 0000000..2b6c292
--- /dev/null
+++ b/legacy/Data/ingsw/0210_38/wrong1.txt
@@ -0,0 +1 @@
+(a = 5, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 0).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_38/wrong2.txt b/legacy/Data/ingsw/0210_38/wrong2.txt
new file mode 100644
index 0000000..5d5c9a4
--- /dev/null
+++ b/legacy/Data/ingsw/0210_38/wrong2.txt
@@ -0,0 +1 @@
+(a = 6, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 2).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_39/correct.txt b/legacy/Data/ingsw/0210_39/correct.txt
new file mode 100644
index 0000000..8785661
--- /dev/null
+++ b/legacy/Data/ingsw/0210_39/correct.txt
@@ -0,0 +1 @@
+{x = -200, x = -50, x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_39/quest.txt b/legacy/Data/ingsw/0210_39/quest.txt
new file mode 100644
index 0000000..36947c2
--- /dev/null
+++ b/legacy/Data/ingsw/0210_39/quest.txt
@@ -0,0 +1,6 @@
+Il partition coverage di un insieme di test cases la percentuale di elementi della partition inclusi nei test cases. La partition una partizione finita dell'insieme di input della funzione che si sta testando.
+Si consideri la seguente funzione C:
+int f1(int x) { return (x + 7); }
+Si vuole testare la funzione f1(). A tal fine l'insieme degli interi viene partizionato come segue:
+{(-inf, -101], [-100, -1], {0}, [1, 500], [501, +inf)}
+Quale dei seguenti test cases consegue una partition coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_39/wrong1.txt b/legacy/Data/ingsw/0210_39/wrong1.txt
new file mode 100644
index 0000000..0aaedb8
--- /dev/null
+++ b/legacy/Data/ingsw/0210_39/wrong1.txt
@@ -0,0 +1 @@
+{x = -200, x = -50, x = 0, x = 100, x = 500}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_39/wrong2.txt b/legacy/Data/ingsw/0210_39/wrong2.txt
new file mode 100644
index 0000000..a6df32d
--- /dev/null
+++ b/legacy/Data/ingsw/0210_39/wrong2.txt
@@ -0,0 +1 @@
+{x = -200, x = -150, x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_4/correct.txt b/legacy/Data/ingsw/0210_4/correct.txt
new file mode 100644
index 0000000..973ef63
--- /dev/null
+++ b/legacy/Data/ingsw/0210_4/correct.txt
@@ -0,0 +1 @@
+State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_4/quest.txt b/legacy/Data/ingsw/0210_4/quest.txt
new file mode 100644
index 0000000..84d1f53
--- /dev/null
+++ b/legacy/Data/ingsw/0210_4/quest.txt
@@ -0,0 +1,12 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_4.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+Test case 1: act2 act0 act1 act2 act0
+Test case 2: act1 act2 act1
+Test case 3: act1 act2 act1 act0 act0
+
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_4/wrong1.txt b/legacy/Data/ingsw/0210_4/wrong1.txt
new file mode 100644
index 0000000..1a8a508
--- /dev/null
+++ b/legacy/Data/ingsw/0210_4/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_4/wrong2.txt b/legacy/Data/ingsw/0210_4/wrong2.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/0210_4/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_40/correct.txt b/legacy/Data/ingsw/0210_40/correct.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/0210_40/correct.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_40/quest.txt b/legacy/Data/ingsw/0210_40/quest.txt
new file mode 100644
index 0000000..a550159
--- /dev/null
+++ b/legacy/Data/ingsw/0210_40/quest.txt
@@ -0,0 +1,9 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_40.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+Si consideri il seguente insieme di test cases:
+Test case 1: act1 act0 act0 act0 act0
+Test case 2: act2 act0
+Test case 3: act0 act0 act1 act0 act2
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_40/wrong1.txt b/legacy/Data/ingsw/0210_40/wrong1.txt
new file mode 100644
index 0000000..f6a4b07
--- /dev/null
+++ b/legacy/Data/ingsw/0210_40/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_40/wrong2.txt b/legacy/Data/ingsw/0210_40/wrong2.txt
new file mode 100644
index 0000000..a8aead7
--- /dev/null
+++ b/legacy/Data/ingsw/0210_40/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_41/correct.txt b/legacy/Data/ingsw/0210_41/correct.txt
new file mode 100644
index 0000000..5f76c88
--- /dev/null
+++ b/legacy/Data/ingsw/0210_41/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 45%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_41/quest.txt b/legacy/Data/ingsw/0210_41/quest.txt
new file mode 100644
index 0000000..cdbd481
--- /dev/null
+++ b/legacy/Data/ingsw/0210_41/quest.txt
@@ -0,0 +1,13 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_41.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 act0 act0 act0
+Test case 2: act2 act0
+Test case 3: act0 act0 act1 act0 act2
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_41/wrong1.txt b/legacy/Data/ingsw/0210_41/wrong1.txt
new file mode 100644
index 0000000..2ca9276
--- /dev/null
+++ b/legacy/Data/ingsw/0210_41/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 35%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_41/wrong2.txt b/legacy/Data/ingsw/0210_41/wrong2.txt
new file mode 100644
index 0000000..c376ef7
--- /dev/null
+++ b/legacy/Data/ingsw/0210_41/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 55%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_42/quest.txt b/legacy/Data/ingsw/0210_42/quest.txt
new file mode 100644
index 0000000..8e91c31
--- /dev/null
+++ b/legacy/Data/ingsw/0210_42/quest.txt
@@ -0,0 +1,5 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_42.png
+Si consideri la seguente architettura software:
+
+
+Quale dei seguenti modelli Modelica meglio la rappresenta ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_42/wrong1.txt b/legacy/Data/ingsw/0210_42/wrong1.txt
new file mode 100644
index 0000000..512c141
--- /dev/null
+++ b/legacy/Data/ingsw/0210_42/wrong1.txt
@@ -0,0 +1,6 @@
+block SysArch;
+SC1 sc1
+SC2 sc2;
+SC3 sc3;
+SC4 sc4;
+connect(sc1.input1, sc
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_42/wrong2.txt b/legacy/Data/ingsw/0210_42/wrong2.txt
new file mode 100644
index 0000000..77d39c1
--- /dev/null
+++ b/legacy/Data/ingsw/0210_42/wrong2.txt
@@ -0,0 +1,3 @@
+output1);
+connect(sc1.output1, sc2.input1);
+connect(sc1.input2, sc
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_42/wrong3.txt b/legacy/Data/ingsw/0210_42/wrong3.txt
new file mode 100644
index 0000000..b9a8baf
--- /dev/null
+++ b/legacy/Data/ingsw/0210_42/wrong3.txt
@@ -0,0 +1,39 @@
+output2);
+connect(sc1.output2, sc3.input2);
+connect(sc1.input3, sc4.output3);
+connect(sc1.output3, sc4.input3);
+connect(sc2.input4, sc3.output4);
+connect(sc3.input5, sc4.output5);
+end SysArch
+2.
+block SysArch;
+SC1 sc1
+SC2 sc2;
+SC3 sc3;
+SC4 sc4;
+connect(sc1.input1, sc2.output1);
+connect(sc1.output1, sc2.input1);
+connect(sc1.input2, sc3.output2);
+connect(sc1.output2, sc3.input2);
+connect(sc1.input3, sc4.output3);
+connect(sc1.output3, sc4.input3);
+connect(sc2.output4, sc3.input4);
+connect(sc3.output5, sc4.input5);
+end SysArch
+3.
+block SysArch;
+SC1 sc1
+SC2 sc2;
+SC3 sc3;
+SC4 sc4;
+connect(sc1.input1, sc2.output1);
+connect(sc1.output1, sc2.input1);
+connect(sc1.input2, sc3.output2);
+connect(sc1.output2, sc3.input2);
+connect(sc1.input3, sc4.output3);
+connect(sc1.output3, sc4.input3);
+connect(sc2.input4, sc3.output4);
+connect(sc2.output4, sc3.input4);
+connect(sc3.input5, sc4.output5);
+connect(sc3.output5, sc4.input5);
+end SysArch
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_43/correct.txt b/legacy/Data/ingsw/0210_43/correct.txt
new file mode 100644
index 0000000..4c75070
--- /dev/null
+++ b/legacy/Data/ingsw/0210_43/correct.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x < 0.6*y) and (x + y <= 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_43/quest.txt b/legacy/Data/ingsw/0210_43/quest.txt
new file mode 100644
index 0000000..e11a044
--- /dev/null
+++ b/legacy/Data/ingsw/0210_43/quest.txt
@@ -0,0 +1,4 @@
+Si consideri il seguente requisito:
+RQ: Dopo 50 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se la variabile x minore del 60% della variabile y allora la somma di x ed y maggiore del 30% della variabile z
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_43/wrong1.txt b/legacy/Data/ingsw/0210_43/wrong1.txt
new file mode 100644
index 0000000..6dafe94
--- /dev/null
+++ b/legacy/Data/ingsw/0210_43/wrong1.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x < 0.6*y) and (x + y > 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_43/wrong2.txt b/legacy/Data/ingsw/0210_43/wrong2.txt
new file mode 100644
index 0000000..a3d79a4
--- /dev/null
+++ b/legacy/Data/ingsw/0210_43/wrong2.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x >= 0.6*y) and (x + y <= 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_44/quest.txt b/legacy/Data/ingsw/0210_44/quest.txt
new file mode 100644
index 0000000..5c4c81d
--- /dev/null
+++ b/legacy/Data/ingsw/0210_44/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_44.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_44/wrong1.txt b/legacy/Data/ingsw/0210_44/wrong1.txt
new file mode 100644
index 0000000..421b38f
--- /dev/null
+++ b/legacy/Data/ingsw/0210_44/wrong1.txt
@@ -0,0 +1,34 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_44/wrong2.txt b/legacy/Data/ingsw/0210_44/wrong2.txt
new file mode 100644
index 0000000..f385f1c
--- /dev/null
+++ b/legacy/Data/ingsw/0210_44/wrong2.txt
@@ -0,0 +1,35 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_44/wrong3.txt b/legacy/Data/ingsw/0210_44/wrong3.txt
new file mode 100644
index 0000000..1034e02
--- /dev/null
+++ b/legacy/Data/ingsw/0210_44/wrong3.txt
@@ -0,0 +1,32 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_45/correct.txt b/legacy/Data/ingsw/0210_45/correct.txt
new file mode 100644
index 0000000..4a8e634
--- /dev/null
+++ b/legacy/Data/ingsw/0210_45/correct.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) > 0) and (y <= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_45/quest.txt b/legacy/Data/ingsw/0210_45/quest.txt
new file mode 100644
index 0000000..576af1a
--- /dev/null
+++ b/legacy/Data/ingsw/0210_45/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+RQ: Dopo 60 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se 10 unit di tempo nel passato era stata richiesta una risorsa (variabile x positiva) allora ora concesso l'accesso alla risorsa (variabile y positiva)
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time < w e ritorna il valore che z aveva al tempo (time - w), se time >= w.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_45/wrong1.txt b/legacy/Data/ingsw/0210_45/wrong1.txt
new file mode 100644
index 0000000..68aa37a
--- /dev/null
+++ b/legacy/Data/ingsw/0210_45/wrong1.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) or (delay(x, 10) > 0) or (y <= 0);
+
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_45/wrong2.txt b/legacy/Data/ingsw/0210_45/wrong2.txt
new file mode 100644
index 0000000..a43796b
--- /dev/null
+++ b/legacy/Data/ingsw/0210_45/wrong2.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) > 0) and (y > 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_46/correct.txt b/legacy/Data/ingsw/0210_46/correct.txt
new file mode 100644
index 0000000..001b1d9
--- /dev/null
+++ b/legacy/Data/ingsw/0210_46/correct.txt
@@ -0,0 +1,9 @@
+block SysArch
+DB db_c;
+S1 s1_c;
+S2 s2_c;
+connect(db_c.input[1], s1_c.output);
+connect(db_c.output[1], s1_c.input);
+connect(db_c.input[2], s2_c.output);
+connect(db_c.output[2], s2_c.input);
+end SysArch
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_46/quest.txt b/legacy/Data/ingsw/0210_46/quest.txt
new file mode 100644
index 0000000..9f5199d
--- /dev/null
+++ b/legacy/Data/ingsw/0210_46/quest.txt
@@ -0,0 +1,4 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_46.png
+Si consideri la seguente architettura software:
+
+Quale dei seguenti modelli Modelica meglio la rappresenta ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_46/wrong1.txt b/legacy/Data/ingsw/0210_46/wrong1.txt
new file mode 100644
index 0000000..fc95495
--- /dev/null
+++ b/legacy/Data/ingsw/0210_46/wrong1.txt
@@ -0,0 +1,9 @@
+block SysArch
+DB db_c;
+S1 s1_c;
+S2 s2_c;
+connect(db_c.input[1], s2_c.output[1]);
+connect(db_c.output[1], s2_c.input[1]);
+connect(s1_c.input[2], s2_c.output[2]);
+connect(s1_c.output[2], s2_c.input[2]);
+end SysArch
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_46/wrong2.txt b/legacy/Data/ingsw/0210_46/wrong2.txt
new file mode 100644
index 0000000..eaf9272
--- /dev/null
+++ b/legacy/Data/ingsw/0210_46/wrong2.txt
@@ -0,0 +1,9 @@
+block SysArch
+DB db_c;
+S1 s1_c;
+S2 s2_c;
+connect(db_c.input[1], s1_c.output[1]);
+connect(db_c.output[1], s1_c.input[1]);
+connect(s1_c.input[2], s2_c.output[2]);
+connect(s1_c.output[2], s2_c.input[2]);
+end SysArch
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_47/correct.txt b/legacy/Data/ingsw/0210_47/correct.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0210_47/correct.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_47/quest.txt b/legacy/Data/ingsw/0210_47/quest.txt
new file mode 100644
index 0000000..4344b75
--- /dev/null
+++ b/legacy/Data/ingsw/0210_47/quest.txt
@@ -0,0 +1,8 @@
+Il partition coverage di un insieme di test cases la percentuale di elementi della partition inclusi nei test cases. La partition una partizione finita dell'insieme di input della funzione che si sta testando.
+Si consideri la seguente funzione C:
+int f1(int x) { return (2*x); }
+Si vuole testare la funzione f1(). A tal fine l'insieme degli interi viene partizionato come segue:
+{(-inf, -11], [-10, -1], {0}, [1, 50], [51, +inf)}
+Si consideri il seguente insieme di test cases:
+{x=-100, x= 40, x=100}
+Quale delle seguenti la partition coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_47/wrong1.txt b/legacy/Data/ingsw/0210_47/wrong1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0210_47/wrong1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_47/wrong2.txt b/legacy/Data/ingsw/0210_47/wrong2.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0210_47/wrong2.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_48/correct.txt b/legacy/Data/ingsw/0210_48/correct.txt
new file mode 100644
index 0000000..7311d41
--- /dev/null
+++ b/legacy/Data/ingsw/0210_48/correct.txt
@@ -0,0 +1 @@
+Test set: {x=1, y=1}, {x=0, y=0}, {x=2, y=1}, {x=2, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_48/quest.txt b/legacy/Data/ingsw/0210_48/quest.txt
new file mode 100644
index 0000000..d3a9fe2
--- /dev/null
+++ b/legacy/Data/ingsw/0210_48/quest.txt
@@ -0,0 +1,8 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+ if (x - y <= 0) { if (x + y >= 1) return (1); else return (2); }
+ else {if (2*x + y >= 5) return (3); else return (4); }
+ } /* f() */
+Quale dei seguenti test sets consegue una branch coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_48/wrong1.txt b/legacy/Data/ingsw/0210_48/wrong1.txt
new file mode 100644
index 0000000..7e48e4f
--- /dev/null
+++ b/legacy/Data/ingsw/0210_48/wrong1.txt
@@ -0,0 +1 @@
+Test set: {x=1, y=1}, {x=0, y=0}, {x=2, y=1}, {x=2, y=3}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_48/wrong2.txt b/legacy/Data/ingsw/0210_48/wrong2.txt
new file mode 100644
index 0000000..3e327ab
--- /dev/null
+++ b/legacy/Data/ingsw/0210_48/wrong2.txt
@@ -0,0 +1 @@
+Test set: {x=1, y=1}, {x=2, y=2}, {x=2, y=1}, {x=2, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_49/correct.txt b/legacy/Data/ingsw/0210_49/correct.txt
new file mode 100644
index 0000000..b110af1
--- /dev/null
+++ b/legacy/Data/ingsw/0210_49/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_49/quest.txt b/legacy/Data/ingsw/0210_49/quest.txt
new file mode 100644
index 0000000..8cb7d37
--- /dev/null
+++ b/legacy/Data/ingsw/0210_49/quest.txt
@@ -0,0 +1,12 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_49.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 act1 act2 act0
+Test case 2: act1 act2 act1
+Test case 3: act1 act2 act1 act0 act0
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_49/wrong1.txt b/legacy/Data/ingsw/0210_49/wrong1.txt
new file mode 100644
index 0000000..2d5aeb0
--- /dev/null
+++ b/legacy/Data/ingsw/0210_49/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_49/wrong2.txt b/legacy/Data/ingsw/0210_49/wrong2.txt
new file mode 100644
index 0000000..a29d476
--- /dev/null
+++ b/legacy/Data/ingsw/0210_49/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_5/correct.txt b/legacy/Data/ingsw/0210_5/correct.txt
new file mode 100644
index 0000000..e582263
--- /dev/null
+++ b/legacy/Data/ingsw/0210_5/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x >= 5) or (x <= 0)) and ((x >= 15) or (x <= 10)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_5/quest.txt b/legacy/Data/ingsw/0210_5/quest.txt
new file mode 100644
index 0000000..864cc93
--- /dev/null
+++ b/legacy/Data/ingsw/0210_5/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ1: Durante l'esecuzione del programma (cio per tutti gli istanti di tempo positivi) la variabile x sempre nell'intervallo [0, 5] oppure [10, 15]
+Quale dei seguenti monitor meglio descrive il requisito RQ1 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_5/wrong1.txt b/legacy/Data/ingsw/0210_5/wrong1.txt
new file mode 100644
index 0000000..0f38391
--- /dev/null
+++ b/legacy/Data/ingsw/0210_5/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x >= 0) or (x <= 5)) and ((x >= 10) or (x <= 15)) );
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_5/wrong2.txt b/legacy/Data/ingsw/0210_5/wrong2.txt
new file mode 100644
index 0000000..590f7e1
--- /dev/null
+++ b/legacy/Data/ingsw/0210_5/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ( ((x >= 0) and (x <= 5)) or ((x >= 10) and (x <= 15)) );
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_6/correct.txt b/legacy/Data/ingsw/0210_6/correct.txt
new file mode 100644
index 0000000..c37d6ae
--- /dev/null
+++ b/legacy/Data/ingsw/0210_6/correct.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) > 0) and (y >= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_6/quest.txt b/legacy/Data/ingsw/0210_6/quest.txt
new file mode 100644
index 0000000..003d1dd
--- /dev/null
+++ b/legacy/Data/ingsw/0210_6/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+RQ: Dopo 60 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se 10 unit di tempo nel passato x era maggiore di 0 allora ora y negativa.
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time <= w e ritorna il valore che z aveva al tempo (time - w), se time = w.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_6/wrong1.txt b/legacy/Data/ingsw/0210_6/wrong1.txt
new file mode 100644
index 0000000..14bd900
--- /dev/null
+++ b/legacy/Data/ingsw/0210_6/wrong1.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) or (delay(x, 10) > 0) or (y >= 0);
+
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_6/wrong2.txt b/legacy/Data/ingsw/0210_6/wrong2.txt
new file mode 100644
index 0000000..edea147
--- /dev/null
+++ b/legacy/Data/ingsw/0210_6/wrong2.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) <= 0) and (y >= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_7/correct.txt b/legacy/Data/ingsw/0210_7/correct.txt
new file mode 100644
index 0000000..31a01d5
--- /dev/null
+++ b/legacy/Data/ingsw/0210_7/correct.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=0, y=0}, {x=15, y=0}, {x=9, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_7/quest.txt b/legacy/Data/ingsw/0210_7/quest.txt
new file mode 100644
index 0000000..d649932
--- /dev/null
+++ b/legacy/Data/ingsw/0210_7/quest.txt
@@ -0,0 +1,8 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+ if (x - y <= 6) { if (x + y >= 3) return (1); else return (2); }
+ else {if (x + 2*y >= 15) return (3); else return (4); }
+ } /* f() */
+Quale dei seguenti test sets consegue una branch coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_7/wrong1.txt b/legacy/Data/ingsw/0210_7/wrong1.txt
new file mode 100644
index 0000000..549dba8
--- /dev/null
+++ b/legacy/Data/ingsw/0210_7/wrong1.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=0, y=0}, {x=15, y=0}, {x=10, y=3}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_7/wrong2.txt b/legacy/Data/ingsw/0210_7/wrong2.txt
new file mode 100644
index 0000000..0c564f7
--- /dev/null
+++ b/legacy/Data/ingsw/0210_7/wrong2.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=2, y=1}, {x=15, y=0}, {x=9, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_8/correct.txt b/legacy/Data/ingsw/0210_8/correct.txt
new file mode 100644
index 0000000..81a4b93
--- /dev/null
+++ b/legacy/Data/ingsw/0210_8/correct.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x >= 0) then (z == pow(y, x)) else (z == 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_8/quest.txt b/legacy/Data/ingsw/0210_8/quest.txt
new file mode 100644
index 0000000..236ccc7
--- /dev/null
+++ b/legacy/Data/ingsw/0210_8/quest.txt
@@ -0,0 +1,10 @@
+Un test oracle per un programma P una funzione booleana che ha come inputs gli inputs ed outputs di P e ritorna true se e solo se il valore di output di P (con i dati inputs) quello atteso dalle specifiche.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+int z, k;
+z = 1; k = 0;
+while (k < x) { z = y*z; k = k + 1; }
+return (z);
+}
+Siano x, y, gli inputs del programma (f nel nostro caso) e z l'output. Assumendo il programma corretto, quale delle seguenti funzioni booleane F(x, y, z) un test oracle per la funzione f.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_8/wrong1.txt b/legacy/Data/ingsw/0210_8/wrong1.txt
new file mode 100644
index 0000000..f52d5ae
--- /dev/null
+++ b/legacy/Data/ingsw/0210_8/wrong1.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x >= 0) then (z == pow(y, x)) else (z == y)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_8/wrong2.txt b/legacy/Data/ingsw/0210_8/wrong2.txt
new file mode 100644
index 0000000..d246b94
--- /dev/null
+++ b/legacy/Data/ingsw/0210_8/wrong2.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x >= 0) then (z == pow(y, x)) else (z == 0)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_9/quest.txt b/legacy/Data/ingsw/0210_9/quest.txt
new file mode 100644
index 0000000..fcfd787
--- /dev/null
+++ b/legacy/Data/ingsw/0210_9/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0210_domanda_9.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_9/wrong1.txt b/legacy/Data/ingsw/0210_9/wrong1.txt
new file mode 100644
index 0000000..acd5e00
--- /dev/null
+++ b/legacy/Data/ingsw/0210_9/wrong1.txt
@@ -0,0 +1,36 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 2;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_9/wrong2.txt b/legacy/Data/ingsw/0210_9/wrong2.txt
new file mode 100644
index 0000000..298890c
--- /dev/null
+++ b/legacy/Data/ingsw/0210_9/wrong2.txt
@@ -0,0 +1,35 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_9/wrong3.txt b/legacy/Data/ingsw/0210_9/wrong3.txt
new file mode 100644
index 0000000..3b3e08a
--- /dev/null
+++ b/legacy/Data/ingsw/0210_9/wrong3.txt
@@ -0,0 +1,32 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0221_18/correct.txt b/legacy/Data/ingsw/0221_18/correct.txt
new file mode 100644
index 0000000..eb23d05
--- /dev/null
+++ b/legacy/Data/ingsw/0221_18/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0221_18/quest.txt b/legacy/Data/ingsw/0221_18/quest.txt
new file mode 100644
index 0000000..937eabd
--- /dev/null
+++ b/legacy/Data/ingsw/0221_18/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "check di consistenza" che è parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0221_18/wrong1.txt b/legacy/Data/ingsw/0221_18/wrong1.txt
new file mode 100644
index 0000000..32c628c
--- /dev/null
+++ b/legacy/Data/ingsw/0221_18/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0221_18/wrong2.txt b/legacy/Data/ingsw/0221_18/wrong2.txt
new file mode 100644
index 0000000..9e12d11
--- /dev/null
+++ b/legacy/Data/ingsw/0221_18/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che per ogni requisito esista un insieme di test che lo possa verificare.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0221_28/correct.txt b/legacy/Data/ingsw/0221_28/correct.txt
new file mode 100644
index 0000000..7c149d8
--- /dev/null
+++ b/legacy/Data/ingsw/0221_28/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisisti descrivano tutte le funzionalità e vincoli (e.g., security, performance) del sistema desiderato dal customer.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0221_28/quest.txt b/legacy/Data/ingsw/0221_28/quest.txt
new file mode 100644
index 0000000..c71c807
--- /dev/null
+++ b/legacy/Data/ingsw/0221_28/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "check di completezza" che è parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0221_28/wrong1.txt b/legacy/Data/ingsw/0221_28/wrong1.txt
new file mode 100644
index 0000000..3461684
--- /dev/null
+++ b/legacy/Data/ingsw/0221_28/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che per ogni requisito sia stato implementato nel sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0221_28/wrong2.txt b/legacy/Data/ingsw/0221_28/wrong2.txt
new file mode 100644
index 0000000..32c628c
--- /dev/null
+++ b/legacy/Data/ingsw/0221_28/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0221_32/correct.txt b/legacy/Data/ingsw/0221_32/correct.txt
new file mode 100644
index 0000000..e7c5bb8
--- /dev/null
+++ b/legacy/Data/ingsw/0221_32/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che, tenedo conto della tecnologia, budget e tempo disponibili, sia possibile realizzare un sistema che soddisfa i requisisti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0221_32/quest.txt b/legacy/Data/ingsw/0221_32/quest.txt
new file mode 100644
index 0000000..5552f2f
--- /dev/null
+++ b/legacy/Data/ingsw/0221_32/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "check di realismo" (realizability) che è parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0221_32/wrong1.txt b/legacy/Data/ingsw/0221_32/wrong1.txt
new file mode 100644
index 0000000..bfb5124
--- /dev/null
+++ b/legacy/Data/ingsw/0221_32/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che le performance richieste al sistema siano necessarie per soddisfare le necessità del customer.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0221_32/wrong2.txt b/legacy/Data/ingsw/0221_32/wrong2.txt
new file mode 100644
index 0000000..2b6e242
--- /dev/null
+++ b/legacy/Data/ingsw/0221_32/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che le funzionalità richieste al sistema siano necessarie per soddisfare le necessità del customer.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_24/correct.txt b/legacy/Data/ingsw/0222_24/correct.txt
new file mode 100644
index 0000000..1e091a3
--- /dev/null
+++ b/legacy/Data/ingsw/0222_24/correct.txt
@@ -0,0 +1 @@
+90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_24/quest.txt b/legacy/Data/ingsw/0222_24/quest.txt
new file mode 100644
index 0000000..ce59bae
--- /dev/null
+++ b/legacy/Data/ingsw/0222_24/quest.txt
@@ -0,0 +1,12 @@
+img=https://i.imgur.com/6m6ALRb.png
+La state coverage di un insieme di test cases (cioè sequeze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) rggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+ed il seguente insieme di test cases:
+
+1) Start PIN validation, card inserted, PIN Entered, Valid PIN, Cancel 3, End PIN Validation 2
+
+2) Start PIN validation, card inserted, PIN Entered, Cancel 2, End PIN Validation 2
+
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_24/wrong1.txt b/legacy/Data/ingsw/0222_24/wrong1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0222_24/wrong1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_24/wrong2.txt b/legacy/Data/ingsw/0222_24/wrong2.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0222_24/wrong2.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_27/correct.txt b/legacy/Data/ingsw/0222_27/correct.txt
new file mode 100644
index 0000000..1e091a3
--- /dev/null
+++ b/legacy/Data/ingsw/0222_27/correct.txt
@@ -0,0 +1 @@
+90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_27/quest.txt b/legacy/Data/ingsw/0222_27/quest.txt
new file mode 100644
index 0000000..b1548b4
--- /dev/null
+++ b/legacy/Data/ingsw/0222_27/quest.txt
@@ -0,0 +1,13 @@
+img=https://i.imgur.com/6m6ALRb.png
+La state coverage di un insieme di test cases (cioè sequeze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) rggiunti almeno una volta.
+
+Si consideri lo state diagram in figura ed il seguente insieme di test cases:
+
+1) Start PIN validation, card inserted, PIN Entered, Valid PIN, Cancel 3, End PIN Validation 2;
+
+2) Start PIN validation, card inserted, PIN Entered, Invalid PIN, PIN Entered, Valid PIN, Cancel 3, End PIN Validation 2;
+
+3) Start PIN validation, card inserted, PIN Entered, Invalid PIN, PIN Entered, Invalid PIN, PIN Entered, Valid PIN, Cancel 3, End PIN Validation 2.
+
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_27/wrong1.txt b/legacy/Data/ingsw/0222_27/wrong1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0222_27/wrong1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_27/wrong2.txt b/legacy/Data/ingsw/0222_27/wrong2.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0222_27/wrong2.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_33/correct.txt b/legacy/Data/ingsw/0222_33/correct.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0222_33/correct.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_33/quest.txt b/legacy/Data/ingsw/0222_33/quest.txt
new file mode 100644
index 0000000..857057e
--- /dev/null
+++ b/legacy/Data/ingsw/0222_33/quest.txt
@@ -0,0 +1,45 @@
+Il partition coverage di un insieme di test cases è la percentuale di elementi della partition inclusi nei test cases. La partition è una partizione finita dell'insieme di input della funzione che si sta testando.
+
+Si consideri il seguente programma C:
+
+-----------
+
+#include
+
+#include
+
+#include
+
+#define N 5 /* number of test cases */
+
+int f1(int x) { return (2*x); }
+
+int main() { int i, y; int x[N];
+
+ // define test cases
+
+ x[0] = 0; x[1] = 1; x[2] = -1; x[3] = 10; x[4] = -10;
+
+// testing
+
+for (i = 0; i < N; i++) {
+
+ y = f1(x[i]); // function under testing
+
+ assert(y == 2*x[i]); // oracle
+
+ }
+
+ printf("All %d test cases passed\n", N);
+
+ return (0);
+
+}
+
+Si vuole testare la funzione f1(). A tal fine l'insieme degli interi viene partizionato come segue:
+
+{(-inf, -21], [-20, -1], {0}, [1, 20], [21, +inf)}
+
+Il programma main() sopra realizza il nostro testing per la funzione f1(). I test cases sono i valori in x[i].
+
+Quale delle seguenti è la partition coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_33/wrong1.txt b/legacy/Data/ingsw/0222_33/wrong1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0222_33/wrong1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_33/wrong2.txt b/legacy/Data/ingsw/0222_33/wrong2.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0222_33/wrong2.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_35/correct.txt b/legacy/Data/ingsw/0222_35/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0222_35/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_35/quest.txt b/legacy/Data/ingsw/0222_35/quest.txt
new file mode 100644
index 0000000..216c715
--- /dev/null
+++ b/legacy/Data/ingsw/0222_35/quest.txt
@@ -0,0 +1,52 @@
+Il branch coverage di un insieme di test cases è la percentuale di branch del programma che sono attraversati da almeno un test case.
+
+Si consideri il seguente programma C:
+
+-----------
+
+
+#include
+
+#include
+
+#include
+
+#define N 1 /* number of test cases */
+
+int f(int x) { int y = 0;
+
+ LOOP: if (abs(x) - y <= 2)
+
+ {return ;}
+
+ else {y = y + 1; goto LOOP;}
+
+} /* f() */
+
+int main() { int i, y; int x[N];
+
+// define test cases
+
+ x[0] = 3;
+
+// testing
+
+ for (i = 0; i < N; i++) {
+
+ y = f(x[i]); // function under testing
+
+ assert(y == (abs(x[i]) <= 2) ? 0 : (abs(x[i]) - 2)); // oracle
+
+ }
+
+ printf("All %d test cases passed\n", N);
+
+ return (0);
+
+}
+
+-----------
+
+Il programma main() sopra realizza il nostro testing per la funzione f(). I test cases sono i valori in x1[i] ed x2[i].
+
+Quale delle seguenti è la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_35/wrong1.txt b/legacy/Data/ingsw/0222_35/wrong1.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0222_35/wrong1.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_35/wrong2.txt b/legacy/Data/ingsw/0222_35/wrong2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0222_35/wrong2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_39/correct.txt b/legacy/Data/ingsw/0222_39/correct.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0222_39/correct.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_39/quest.txt b/legacy/Data/ingsw/0222_39/quest.txt
new file mode 100644
index 0000000..0e6f9c0
--- /dev/null
+++ b/legacy/Data/ingsw/0222_39/quest.txt
@@ -0,0 +1,55 @@
+Il branch coverage di un insieme di test cases è la percentuale di branch del programma che sono attraversati da almeno un test case.
+
+Si consideri il seguente programma C:
+
+-----------
+
+#include
+
+#include
+
+#include
+
+#define N 4 /* number of test cases */
+
+
+int f(int x1, int x2)
+
+{
+
+ if (x1 + x2 <= 2)
+
+ return (1);
+
+ else return (2);
+
+}
+
+
+int main() { int i, y; int x1[N], x2[N];
+
+ // define test cases
+
+ x1[0] = 3; x2[0] = -2; x1[1] = 4; x2[1] = -3; x1[2] = 5; x2[2] = -4; x1[3] = 6; x2[3] = -5;
+
+ // testing
+
+ for (i = 0; i < N; i++) {
+
+ y = f(x1[i], x2[i]); // function under testing
+
+ assert(y ==(x1[i], x2[i] <= 2) ? 1 : 2); // oracle
+
+ }
+
+ printf("All %d test cases passed\n", N);
+
+ return (0);
+
+}
+
+-----------
+
+Il programma main() sopra realizza il nostro testing per la funzione f1(). I test cases sono i valori in x1[i] ed x2[i].
+
+Quale delle seguenti è la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_39/wrong1.txt b/legacy/Data/ingsw/0222_39/wrong1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0222_39/wrong1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_39/wrong2.txt b/legacy/Data/ingsw/0222_39/wrong2.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0222_39/wrong2.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_41/correct.txt b/legacy/Data/ingsw/0222_41/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0222_41/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_41/quest.txt b/legacy/Data/ingsw/0222_41/quest.txt
new file mode 100644
index 0000000..77ee0c6
--- /dev/null
+++ b/legacy/Data/ingsw/0222_41/quest.txt
@@ -0,0 +1,55 @@
+Il branch coverage di un insieme di test cases è la percentuale di branch del programma che sono attraversati da almeno un test case.
+
+Si consideri il seguente programma C:
+
+-----------
+
+#include
+
+#include
+
+#include
+
+#define N 4 /* number of test cases */
+
+
+int f(int x1, int x2)
+
+{
+
+ if (x1 + x2 <= 2)
+
+ return (1);
+
+ else return (2);
+
+}
+
+
+int main() { int i, y; int x1[N], x2[N];
+
+ // define test cases
+
+ x1[0] = 3; x2[0] = -2; x1[1] = 4; x2[1] = -3; x1[2] = 7; x2[2] = -4; x1[3] = 8; x2[3] = -5;
+
+ // testing
+
+ for (i = 0; i < N; i++) {
+
+ y = f(x1[i], x2[i]); // function under testing
+
+ assert(y ==(x1[i], x2[i] <= 2) ? 1 : 2); // oracle
+
+ }
+
+ printf("All %d test cases passed\n", N);
+
+ return (0);
+
+}
+
+-----------
+
+Il programma main() sopra realizza il nostro testing per la funzione f1(). I test cases sono i valori in x1[i] ed x2[i].
+
+Quale delle seguenti è la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_41/wrong1.txt b/legacy/Data/ingsw/0222_41/wrong1.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0222_41/wrong1.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_41/wrong2.txt b/legacy/Data/ingsw/0222_41/wrong2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0222_41/wrong2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_5/correct.txt b/legacy/Data/ingsw/0222_5/correct.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0222_5/correct.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_5/quest.txt b/legacy/Data/ingsw/0222_5/quest.txt
new file mode 100644
index 0000000..52b1367
--- /dev/null
+++ b/legacy/Data/ingsw/0222_5/quest.txt
@@ -0,0 +1,15 @@
+img=https://i.imgur.com/6m6ALRb.png
+La transition coverage di un insieme di test cases (cioè sequeze 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:
+
+1) Start PIN validation, card inserted, PIN Entered, Valid PIN, Cancel 3, End PIN Validation 2;
+
+2) Start PIN validation, card inserted, PIN Entered, Invalid PIN, PIN Entered, Valid PIN, Cancel 3, End PIN Validation 2;
+
+3) Start PIN validation, card inserted, PIN Entered, Invalid PIN, PIN Entered, Invalid PIN, PIN Entered, Valid PIN, Cancel 3, End PIN Validation 2.
+
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_5/wrong1.txt b/legacy/Data/ingsw/0222_5/wrong1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0222_5/wrong1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_5/wrong2.txt b/legacy/Data/ingsw/0222_5/wrong2.txt
new file mode 100644
index 0000000..711ba55
--- /dev/null
+++ b/legacy/Data/ingsw/0222_5/wrong2.txt
@@ -0,0 +1 @@
+40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_50/correct.txt b/legacy/Data/ingsw/0222_50/correct.txt
new file mode 100644
index 0000000..1e091a3
--- /dev/null
+++ b/legacy/Data/ingsw/0222_50/correct.txt
@@ -0,0 +1 @@
+90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_50/quest.txt b/legacy/Data/ingsw/0222_50/quest.txt
new file mode 100644
index 0000000..a3effb0
--- /dev/null
+++ b/legacy/Data/ingsw/0222_50/quest.txt
@@ -0,0 +1,14 @@
+img=https://i.imgur.com/6m6ALRb.png
+La transition coverage di un insieme di test cases (cioè sequeze 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:
+
+
+1) Start PIN validation, card inserted, PIN Entered, Valid PIN, Cancel 3, End PIN Validation 2
+
+2) Start PIN validation, card inserted, PIN Entered, Valid PIN, Cancel 2, End PIN Validation 2
+
+3) Start PIN validation, card inserted, PIN Entered, Invalid PIN, PIN Entered, Invalid PIN, PIN Entered, Invalid PIN, PIN Entered, Invalid PIN, More than 3 failed..., END PIN validation 1;
+
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_50/wrong1.txt b/legacy/Data/ingsw/0222_50/wrong1.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0222_50/wrong1.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_50/wrong2.txt b/legacy/Data/ingsw/0222_50/wrong2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0222_50/wrong2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_7/correct.txt b/legacy/Data/ingsw/0222_7/correct.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0222_7/correct.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_7/quest.txt b/legacy/Data/ingsw/0222_7/quest.txt
new file mode 100644
index 0000000..97e921b
--- /dev/null
+++ b/legacy/Data/ingsw/0222_7/quest.txt
@@ -0,0 +1,13 @@
+img=https://i.imgur.com/6m6ALRb.png
+La transition coverage di un insieme di test cases (cioè sequeze 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:
+
+1) Start PIN validation, card inserted, PIN Entered, Valid PIN, Cancel 3, End PIN Validation 2
+
+2) Start PIN validation, card inserted, PIN Entered, Cancel 2, End PIN Validation 2
+
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra
diff --git a/legacy/Data/ingsw/0222_7/wrong1.txt b/legacy/Data/ingsw/0222_7/wrong1.txt
new file mode 100644
index 0000000..711ba55
--- /dev/null
+++ b/legacy/Data/ingsw/0222_7/wrong1.txt
@@ -0,0 +1 @@
+40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0222_7/wrong2.txt b/legacy/Data/ingsw/0222_7/wrong2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0222_7/wrong2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_1/correct.txt b/legacy/Data/ingsw/0321_1/correct.txt
new file mode 100644
index 0000000..f3da655
--- /dev/null
+++ b/legacy/Data/ingsw/0321_1/correct.txt
@@ -0,0 +1 @@
+3*(A + 2*B)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_1/quest.txt b/legacy/Data/ingsw/0321_1/quest.txt
new file mode 100644
index 0000000..5d8e650
--- /dev/null
+++ b/legacy/Data/ingsw/0321_1/quest.txt
@@ -0,0 +1 @@
+Il team di sviluppo di un azienda consiste di un senior software engineer e due sviluppatori junior. Usando un approccio agile, ogni iterazione impegna tutti e tre i membri del team per un mese ed occorrono tre iterazioni per completare lo sviluppo. Si assuma che non ci siano "change requests" e che il membro senior costi A Eur/mese ed i membri junior B Eur/mese. Qual'e' il costo dello sviluppo usando un approccio agile ?
diff --git a/legacy/Data/ingsw/0321_1/wrong 1.txt b/legacy/Data/ingsw/0321_1/wrong 1.txt
new file mode 100644
index 0000000..316107c
--- /dev/null
+++ b/legacy/Data/ingsw/0321_1/wrong 1.txt
@@ -0,0 +1 @@
+A + 2*B
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_1/wrong 2.txt b/legacy/Data/ingsw/0321_1/wrong 2.txt
new file mode 100644
index 0000000..82fe5c7
--- /dev/null
+++ b/legacy/Data/ingsw/0321_1/wrong 2.txt
@@ -0,0 +1 @@
+3*A + 2*B
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_10/correct.txt b/legacy/Data/ingsw/0321_10/correct.txt
new file mode 100644
index 0000000..466ac31
--- /dev/null
+++ b/legacy/Data/ingsw/0321_10/correct.txt
@@ -0,0 +1 @@
+Gli utenti del sistema lavorano insieme al team di sviluppo per testare il software nel sito di sviluppo.
diff --git a/legacy/Data/ingsw/0321_10/quest.txt b/legacy/Data/ingsw/0321_10/quest.txt
new file mode 100644
index 0000000..c35e04d
--- /dev/null
+++ b/legacy/Data/ingsw/0321_10/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti affermazioni è vera riguardo all'alpha testing ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_10/wrong 1.txt b/legacy/Data/ingsw/0321_10/wrong 1.txt
new file mode 100644
index 0000000..9a5ec0f
--- /dev/null
+++ b/legacy/Data/ingsw/0321_10/wrong 1.txt
@@ -0,0 +1 @@
+Test automatizzati sono eseguiti su una versione preliminare del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_10/wrong 2.txt b/legacy/Data/ingsw/0321_10/wrong 2.txt
new file mode 100644
index 0000000..e43ca64
--- /dev/null
+++ b/legacy/Data/ingsw/0321_10/wrong 2.txt
@@ -0,0 +1 @@
+Test automatizzati sono eseguiti sulla prima release del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_11/correct.txt b/legacy/Data/ingsw/0321_11/correct.txt
new file mode 100644
index 0000000..b1a56d9
--- /dev/null
+++ b/legacy/Data/ingsw/0321_11/correct.txt
@@ -0,0 +1 @@
+3*(1 + p)*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_11/quest.txt b/legacy/Data/ingsw/0321_11/quest.txt
new file mode 100644
index 0000000..e383a9d
--- /dev/null
+++ b/legacy/Data/ingsw/0321_11/quest.txt
@@ -0,0 +1 @@
+Un processo di sviluppo agile consiste di 3 iterazioni identiche di costo A. Alla fine di ogni iterazione vengono prese in considerazione le "change requests" e, se ve ne sono, l'iterazione viene ripetuta. Sia p la probabilità che ci siano "change requests" all fine di una iterazione. Il valore atteso del costo del progetto è:
diff --git a/legacy/Data/ingsw/0321_11/wrong 1.txt b/legacy/Data/ingsw/0321_11/wrong 1.txt
new file mode 100644
index 0000000..769cb45
--- /dev/null
+++ b/legacy/Data/ingsw/0321_11/wrong 1.txt
@@ -0,0 +1 @@
+3*(A + p)
diff --git a/legacy/Data/ingsw/0321_11/wrong 2.txt b/legacy/Data/ingsw/0321_11/wrong 2.txt
new file mode 100644
index 0000000..1045d03
--- /dev/null
+++ b/legacy/Data/ingsw/0321_11/wrong 2.txt
@@ -0,0 +1 @@
+3*p*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_12/correct.txt b/legacy/Data/ingsw/0321_12/correct.txt
new file mode 100644
index 0000000..04fb622
--- /dev/null
+++ b/legacy/Data/ingsw/0321_12/correct.txt
@@ -0,0 +1 @@
+P = 1/10
diff --git a/legacy/Data/ingsw/0321_12/quest.txt b/legacy/Data/ingsw/0321_12/quest.txt
new file mode 100644
index 0000000..98d8c9c
--- /dev/null
+++ b/legacy/Data/ingsw/0321_12/quest.txt
@@ -0,0 +1 @@
+Una azienda vende software utilizzando un contratto di Service Level Agreement (SLA) per cui l'utente paga 1000 Eur al mese di licenza e l'azienda garantisce che il software sia "up and running". Questo vuol dire che failures del software generano un costo (quello del repair). Sia C = 10000 Eur il costo del repair di una failure e R = P*C il valore atteso (rischio) del costo dovuto alle failures (dove P è la probabilità di una software failure). Ovviamente affinché il business sia profittevole deve essere che R sia al più 1000 Eur. Qual'e' il valore massimo di P che garantisce la validità del modello di business di cui sopra ?
diff --git a/legacy/Data/ingsw/0321_12/wrong 1.txt b/legacy/Data/ingsw/0321_12/wrong 1.txt
new file mode 100644
index 0000000..76d3cf5
--- /dev/null
+++ b/legacy/Data/ingsw/0321_12/wrong 1.txt
@@ -0,0 +1 @@
+P = 1/1000
diff --git a/legacy/Data/ingsw/0321_12/wrong 2.txt b/legacy/Data/ingsw/0321_12/wrong 2.txt
new file mode 100644
index 0000000..79f61ef
--- /dev/null
+++ b/legacy/Data/ingsw/0321_12/wrong 2.txt
@@ -0,0 +1 @@
+P=1/10000
diff --git a/legacy/Data/ingsw/0321_13/correct.txt b/legacy/Data/ingsw/0321_13/correct.txt
new file mode 100644
index 0000000..e639181
--- /dev/null
+++ b/legacy/Data/ingsw/0321_13/correct.txt
@@ -0,0 +1 @@
+S = (1/b)*ln(C/R)
diff --git a/legacy/Data/ingsw/0321_13/quest.txt b/legacy/Data/ingsw/0321_13/quest.txt
new file mode 100644
index 0000000..074190a
--- /dev/null
+++ b/legacy/Data/ingsw/0321_13/quest.txt
@@ -0,0 +1 @@
+Il rischio R può essere calcolato come R = P*C, dove P è la probabilità dell'evento avverso (software failure nel nostro contesto) e C è il costo dell'occorrenza dell'evento avverso. Assumiamo che la probabilità P sia legata al costo di sviluppo S dalla formula P = exp(-b*S), dove b è una opportuna costante note da dati storici aziendali. Quale sarà il costo dello sviluppo S di un software il cui costo della failure è C ed il rischio ammesso è R?
diff --git a/legacy/Data/ingsw/0321_13/wrong 1.txt b/legacy/Data/ingsw/0321_13/wrong 1.txt
new file mode 100644
index 0000000..587fc4b
--- /dev/null
+++ b/legacy/Data/ingsw/0321_13/wrong 1.txt
@@ -0,0 +1 @@
+S = (1/b)*ln(R/C)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_13/wrong 2.txt b/legacy/Data/ingsw/0321_13/wrong 2.txt
new file mode 100644
index 0000000..7e82f01
--- /dev/null
+++ b/legacy/Data/ingsw/0321_13/wrong 2.txt
@@ -0,0 +1 @@
+S = b*ln(R/C)
diff --git a/legacy/Data/ingsw/0321_14/correct.txt b/legacy/Data/ingsw/0321_14/correct.txt
new file mode 100644
index 0000000..b74296c
--- /dev/null
+++ b/legacy/Data/ingsw/0321_14/correct.txt
@@ -0,0 +1,68 @@
+
+model System
+
+parameter Integer F1 = 1;
+
+parameter Integer F2 = 2;
+
+parameter Integer F3 = 3;
+
+parameter Integer End = 4;
+
+parameter Real p = 0.3;
+
+parameter Real A[4, 4] =
+
+[
+
+p, 1-p, 0, 0;
+
+p, 0, 1-p, 0;
+
+p, 0, 0, 1-p;
+
+0, 0, 0, 1
+
+];
+
+Integer x; Real r1024;
+
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+
+algorithm
+
+when initial() then
+
+ state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+
+ x := F1;
+
+ r1024 := 0;
+
+elsewhen sample(0,1) then
+
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+
+if (r1024 <= A[x, F1]) then
+
+ x := F1;
+
+ elseif (r1024 <= A[x, F1] + A[x, F2]) then
+
+ x := F2;
+
+ elseif (r1024 <= A[x, F1] + A[x, F2] + A[x, F3]) then
+
+ x := F3;
+
+ else
+
+ x := End;
+
+end if;
+
+end when;
+
+end System;
+
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_14/quest.txt b/legacy/Data/ingsw/0321_14/quest.txt
new file mode 100644
index 0000000..35d991e
--- /dev/null
+++ b/legacy/Data/ingsw/0321_14/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/6cnLynh.png
+Si consideri la seguente Markov Chain, quale dei seguenti modelli Modelica fornisce un modello ragionevole per la Markov Chain di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_14/wrong 1.txt b/legacy/Data/ingsw/0321_14/wrong 1.txt
new file mode 100644
index 0000000..c7e45ef
--- /dev/null
+++ b/legacy/Data/ingsw/0321_14/wrong 1.txt
@@ -0,0 +1,68 @@
+
+model System
+
+parameter Integer F1 = 1;
+
+parameter Integer F2 = 2;
+
+parameter Integer F3 = 3;
+
+parameter Integer End = 4;
+
+parameter Real p = 0.3;
+
+parameter Real A[4, 4] =
+
+[
+
+p, 0, 1-p, 0;
+
+0, p, 1-p, 0;
+
+p, 0, 0, 1-p;
+
+0, 0, 0, 1
+
+];
+
+Integer x; Real r1024;
+
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+
+algorithm
+
+when initial() then
+
+state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+
+x := F1;
+
+r1024 := 0;
+
+elsewhen sample(0,1) then
+
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+
+if (r1024 <= A[x, F1]) then
+
+ x := F1;
+
+ elseif (r1024 <= A[x, F1] + A[x, F2]) then
+
+ x := F2;
+
+ elseif (r1024 <= A[x, F1] + A[x, F2] + A[x, F3]) then
+
+ x := F3;
+
+ else
+
+ x := End;
+
+end if;
+
+end when;
+
+end System;
+
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_14/wrong 2.txt b/legacy/Data/ingsw/0321_14/wrong 2.txt
new file mode 100644
index 0000000..099e40c
--- /dev/null
+++ b/legacy/Data/ingsw/0321_14/wrong 2.txt
@@ -0,0 +1,67 @@
+
+model System
+
+parameter Integer F1 = 1;
+
+parameter Integer F2 = 2;
+
+parameter Integer F3 = 3;
+
+parameter Integer End = 4;
+
+parameter Real p = 0.3;
+
+parameter Real A[4, 4] =
+
+[
+
+p, 0 , 1-p, 0;
+
+p, 1-p, 0, 0;
+
+p, 0, 0, 1-p;
+
+0, 0, 0, 1
+
+];
+
+Integer x; Real r1024;
+
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+
+algorithm
+
+when initial() then
+
+state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+
+x := F1;
+
+r1024 := 0;
+
+elsewhen sample(0,1) then
+
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+
+if (r1024 <= A[x, F1]) then
+
+ x := F1;
+
+ elseif (r1024 <= A[x, F1] + A[x, F2]) then
+
+ x := F2;
+
+ elseif (r1024 <= A[x, F1] + A[x, F2] + A[x, F3]) then
+
+ x := F3;
+
+ else
+
+ x := End;
+
+end if;
+
+end when;
+
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_15/correct.txt b/legacy/Data/ingsw/0321_15/correct.txt
new file mode 100644
index 0000000..2563af3
--- /dev/null
+++ b/legacy/Data/ingsw/0321_15/correct.txt
@@ -0,0 +1 @@
+Plan driven
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_15/quest.txt b/legacy/Data/ingsw/0321_15/quest.txt
new file mode 100644
index 0000000..9a415e5
--- /dev/null
+++ b/legacy/Data/ingsw/0321_15/quest.txt
@@ -0,0 +1 @@
+Un azienda ha un team di sviluppo in cui il 90% dei membri è junior (cioè con poca esperienza) ed il 10% è senior (cioè con molta esperienza). Con l'obiettivo di massimizzare il numero di progetti completati nell'unità di tempo, quale dei seguenti modelli di sviluppo software appare più opportuno.
diff --git a/legacy/Data/ingsw/0321_15/wrong 1.txt b/legacy/Data/ingsw/0321_15/wrong 1.txt
new file mode 100644
index 0000000..feae3c0
--- /dev/null
+++ b/legacy/Data/ingsw/0321_15/wrong 1.txt
@@ -0,0 +1 @@
+Basato sul riuso
diff --git a/legacy/Data/ingsw/0321_15/wrong 2.txt b/legacy/Data/ingsw/0321_15/wrong 2.txt
new file mode 100644
index 0000000..f28b849
--- /dev/null
+++ b/legacy/Data/ingsw/0321_15/wrong 2.txt
@@ -0,0 +1 @@
+Iterativo
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_16/correct.txt b/legacy/Data/ingsw/0321_16/correct.txt
new file mode 100644
index 0000000..58e85d7
--- /dev/null
+++ b/legacy/Data/ingsw/0321_16/correct.txt
@@ -0,0 +1,40 @@
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+block Controller
+
+InputInteger x;
+
+OutputInteger Integer w;
+
+...
+
+end Controller;
+
+block Plant
+
+InputInteger u;
+
+OutputInteger y;
+
+...
+
+end Plant;
+
+class System
+
+Controller k;
+
+Plant p;
+
+equation
+
+connect(p.y, k.x);
+
+connect(k.w, p.u);
+
+end System;
+
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_16/quest.txt b/legacy/Data/ingsw/0321_16/quest.txt
new file mode 100644
index 0000000..ca5c33a
--- /dev/null
+++ b/legacy/Data/ingsw/0321_16/quest.txt
@@ -0,0 +1 @@
+Un sistema consiste di due sottosistemi: un controller ed un plant (sistema controllato). Il controllore misura l'output del plant e manda comandi al plant in accordo. Quale dei seguenti schemi Modelica modella l'architettura di sistema descritta sopra ?
diff --git a/legacy/Data/ingsw/0321_16/wrong 1.txt b/legacy/Data/ingsw/0321_16/wrong 1.txt
new file mode 100644
index 0000000..16efe9b
--- /dev/null
+++ b/legacy/Data/ingsw/0321_16/wrong 1.txt
@@ -0,0 +1,40 @@
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+block Controller
+
+InputInteger x;
+
+OutputInteger Integer w;
+
+...
+
+end Controller;
+
+block Plant
+
+InputInteger u;
+
+OutputInteger y;
+
+...
+
+end Plant;
+
+class System
+
+Controller k;
+
+Plant p;
+
+equation
+
+connect(p.y, p.u);
+
+connect(k.w, k.u);
+
+end System;
+
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_16/wrong 2.txt b/legacy/Data/ingsw/0321_16/wrong 2.txt
new file mode 100644
index 0000000..6e931cd
--- /dev/null
+++ b/legacy/Data/ingsw/0321_16/wrong 2.txt
@@ -0,0 +1,39 @@
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+block Controller
+
+InputInteger x;
+
+OutputInteger Integer w;
+
+...
+
+end Controller;
+
+block Plant
+
+InputInteger u;
+
+OutputInteger y;
+
+...
+
+end Plant;
+
+class System
+
+Controller k;
+
+Plant p;
+
+equation
+
+connect(p.y, k.w);
+
+connect(k.x, p.u);
+
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_17/correct.txt b/legacy/Data/ingsw/0321_17/correct.txt
new file mode 100644
index 0000000..3e05ae7
--- /dev/null
+++ b/legacy/Data/ingsw/0321_17/correct.txt
@@ -0,0 +1 @@
+La variabile x è fuori dall'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_17/quest.txt b/legacy/Data/ingsw/0321_17/quest.txt
new file mode 100644
index 0000000..fd92d29
--- /dev/null
+++ b/legacy/Data/ingsw/0321_17/quest.txt
@@ -0,0 +1,31 @@
+Si consideri il monitor seguente che ritorna true appena i requisiti per il sistema monitorato sono violati.
+
+//block Monitor
+
+input Real x;
+
+output Boolean y;
+
+Boolean w;
+
+initial equation
+
+y = false;
+
+equation
+
+w = ((x < 0) or (x > 5));
+
+algorithm
+
+when edge(w) then
+
+y := true;
+
+end when;
+
+end Monitor;//
+
+
+Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
+
diff --git a/legacy/Data/ingsw/0321_17/wrong 1.txt b/legacy/Data/ingsw/0321_17/wrong 1.txt
new file mode 100644
index 0000000..7e7f05d
--- /dev/null
+++ b/legacy/Data/ingsw/0321_17/wrong 1.txt
@@ -0,0 +1 @@
+La variable x è minore di 0.
diff --git a/legacy/Data/ingsw/0321_17/wrong 2.txt b/legacy/Data/ingsw/0321_17/wrong 2.txt
new file mode 100644
index 0000000..750bfd2
--- /dev/null
+++ b/legacy/Data/ingsw/0321_17/wrong 2.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [0, 5].
diff --git a/legacy/Data/ingsw/0321_18/correct.txt b/legacy/Data/ingsw/0321_18/correct.txt
new file mode 100644
index 0000000..20bf664
--- /dev/null
+++ b/legacy/Data/ingsw/0321_18/correct.txt
@@ -0,0 +1 @@
+Sviluppo Plan-driven.
diff --git a/legacy/Data/ingsw/0321_18/quest.txt b/legacy/Data/ingsw/0321_18/quest.txt
new file mode 100644
index 0000000..367a9e2
--- /dev/null
+++ b/legacy/Data/ingsw/0321_18/quest.txt
@@ -0,0 +1 @@
+Si pianifica lo sviluppo di un sistema software per controllare il sistema di anti-lock braking in un automobile. Quale dei seguenti è il tipico processo software usato per questo tipo di sistema software ?
diff --git a/legacy/Data/ingsw/0321_18/wrong 1.txt b/legacy/Data/ingsw/0321_18/wrong 1.txt
new file mode 100644
index 0000000..61e542a
--- /dev/null
+++ b/legacy/Data/ingsw/0321_18/wrong 1.txt
@@ -0,0 +1 @@
+Sviluppo Iterativo.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_18/wrong 2.txt b/legacy/Data/ingsw/0321_18/wrong 2.txt
new file mode 100644
index 0000000..04301d6
--- /dev/null
+++ b/legacy/Data/ingsw/0321_18/wrong 2.txt
@@ -0,0 +1 @@
+Extreme programming.
diff --git a/legacy/Data/ingsw/0321_19/correct.txt b/legacy/Data/ingsw/0321_19/correct.txt
new file mode 100644
index 0000000..6bbf6f3
--- /dev/null
+++ b/legacy/Data/ingsw/0321_19/correct.txt
@@ -0,0 +1 @@
+Le attività di definizione dei requisiti e di sviluppo sono interleaved.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_19/quest.txt b/legacy/Data/ingsw/0321_19/quest.txt
new file mode 100644
index 0000000..d0df919
--- /dev/null
+++ b/legacy/Data/ingsw/0321_19/quest.txt
@@ -0,0 +1 @@
+Focalizzandosi sui metodi agile di sviluppo del software, quale delle seguenti affermazioni è vera?
diff --git a/legacy/Data/ingsw/0321_19/wrong 1.txt b/legacy/Data/ingsw/0321_19/wrong 1.txt
new file mode 100644
index 0000000..45da4a7
--- /dev/null
+++ b/legacy/Data/ingsw/0321_19/wrong 1.txt
@@ -0,0 +1 @@
+Per evitare di sprecare tempo durante la fase di sviluppo del software, il customer non è mai coinvolto nel processo di sviluppo del software.
diff --git a/legacy/Data/ingsw/0321_19/wrong 2.txt b/legacy/Data/ingsw/0321_19/wrong 2.txt
new file mode 100644
index 0000000..ddbf5eb
--- /dev/null
+++ b/legacy/Data/ingsw/0321_19/wrong 2.txt
@@ -0,0 +1 @@
+Per evitare di sprecare tempo durante la fase di sviluppo del software, questa inizia solo quando i requisiti sono stati completamente definiti.
diff --git a/legacy/Data/ingsw/0321_2/correct.txt b/legacy/Data/ingsw/0321_2/correct.txt
new file mode 100644
index 0000000..cee9602
--- /dev/null
+++ b/legacy/Data/ingsw/0321_2/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/AFS4W2C.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_2/quest.txt b/legacy/Data/ingsw/0321_2/quest.txt
new file mode 100644
index 0000000..bdf9fb8
--- /dev/null
+++ b/legacy/Data/ingsw/0321_2/quest.txt
@@ -0,0 +1 @@
+Si consideri un software sviluppato seguendo un approccio plan-driven implementato con tre fasi: F1, F2, F3. Dopo ogni fase c'e' una probabilità p di dover ripeter la fase precedente ed una probabilità (1 - p) di passare alla fase successiva (sino ad arrivare al termine dello sviluppo). Quale delle seguenti catene di Markov modella il processo software descritto sopra?
diff --git a/legacy/Data/ingsw/0321_2/wrong 1.txt b/legacy/Data/ingsw/0321_2/wrong 1.txt
new file mode 100644
index 0000000..66185ec
--- /dev/null
+++ b/legacy/Data/ingsw/0321_2/wrong 1.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/Crqd1FF.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_2/wrong 2.txt b/legacy/Data/ingsw/0321_2/wrong 2.txt
new file mode 100644
index 0000000..2079027
--- /dev/null
+++ b/legacy/Data/ingsw/0321_2/wrong 2.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/fmFEpRh.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_20/correct.txt b/legacy/Data/ingsw/0321_20/correct.txt
new file mode 100644
index 0000000..f331550
--- /dev/null
+++ b/legacy/Data/ingsw/0321_20/correct.txt
@@ -0,0 +1,69 @@
+
+model System
+
+parameter Integer F1 = 1;
+
+parameter Integer F2 = 2;
+
+parameter Integer F3 = 3;
+
+parameter Integer End = 4;
+
+parameter Real p = 0.3;
+
+parameter Real A[4, 4] =
+
+[
+
+0, 1, 0, 0;
+
+p, 0, 1-p, 0;
+
+0, p, 0, 1-p;
+
+0, 0, 0, 1
+
+];
+
+Integer x; Real r1024;
+
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+
+algorithm
+
+when initial() then
+
+ state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+
+ x := F1;
+
+ r1024 := 0;
+
+elsewhen sample(0,1) then
+
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+
+if (r1024 <= A[x, F1]) then
+
+ x := F1;
+
+ elseif (r1024 <= A[x, F1] + A[x, F2]) then
+
+ x := F2;
+
+ elseif (r1024 <= A[x, F1] + A[x, F2] + A[x, F3]) then
+
+ x := F3;
+
+ else
+
+ x := End;
+
+end if;
+
+end when;
+
+end System;
+
+
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_20/quest.txt b/legacy/Data/ingsw/0321_20/quest.txt
new file mode 100644
index 0000000..82d67f0
--- /dev/null
+++ b/legacy/Data/ingsw/0321_20/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/l6Qc8kQ.png
+Si consideri la seguente Markov Chain, quale dei seguenti modelli Modelica fornisce un modello ragionevole per la Markov Chain?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_20/wrong 1.txt b/legacy/Data/ingsw/0321_20/wrong 1.txt
new file mode 100644
index 0000000..18b6dcd
--- /dev/null
+++ b/legacy/Data/ingsw/0321_20/wrong 1.txt
@@ -0,0 +1,67 @@
+
+model System
+
+parameter Integer F1 = 1;
+
+parameter Integer F2 = 2;
+
+parameter Integer F3 = 3;
+
+parameter Integer End = 4;
+
+parameter Real p = 0.3;
+
+parameter Real A[4, 4] =
+
+[
+
+0, 1, 0, 0;
+
+p, 1-p, 0, 0;
+
+0, 0, p, 1-p;
+
+0, 0, 0, 1
+
+];
+
+Integer x; Real r1024;
+
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+
+algorithm
+
+when initial() then
+
+state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+
+x := F1;
+
+r1024 := 0;
+
+elsewhen sample(0,1) then
+
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+
+if (r1024 <= A[x, F1]) then
+
+ x := F1;
+
+ elseif (r1024 <= A[x, F1] + A[x, F2]) then
+
+ x := F2;
+
+ elseif (r1024 <= A[x, F1] + A[x, F2] + A[x, F3]) then
+
+ x := F3;
+
+ else
+
+ x := End;
+
+end if;
+
+end when;
+
+end System;
+
diff --git a/legacy/Data/ingsw/0321_20/wrong 2.txt b/legacy/Data/ingsw/0321_20/wrong 2.txt
new file mode 100644
index 0000000..f66d694
--- /dev/null
+++ b/legacy/Data/ingsw/0321_20/wrong 2.txt
@@ -0,0 +1,68 @@
+
+model System
+
+parameter Integer F1 = 1;
+
+parameter Integer F2 = 2;
+
+parameter Integer F3 = 3;
+
+parameter Integer End = 4;
+
+parameter Real p = 0.3;
+
+parameter Real A[4, 4] =
+
+[
+
+0, 1, 0, 0;
+
+p, 0, 0, 1-p;
+
+0, 0, p, 1-p;
+
+0, 0, 0, 1
+
+];
+
+Integer x; Real r1024;
+
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+
+algorithm
+
+when initial() then
+
+state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+
+x := F1;
+
+r1024 := 0;
+
+elsewhen sample(0,1) then
+
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+
+if (r1024 <= A[x, F1]) then
+
+ x := F1;
+
+ elseif (r1024 <= A[x, F1] + A[x, F2]) then
+
+ x := F2;
+
+ elseif (r1024 <= A[x, F1] + A[x, F2] + A[x, F3]) then
+
+ x := F3;
+
+ else
+
+ x := End;
+
+end if;
+
+end when;
+
+end System;
+
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_21/correct.txt b/legacy/Data/ingsw/0321_21/correct.txt
new file mode 100644
index 0000000..37e1847
--- /dev/null
+++ b/legacy/Data/ingsw/0321_21/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/hrzgmMX.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_21/quest.txt b/legacy/Data/ingsw/0321_21/quest.txt
new file mode 100644
index 0000000..269050d
--- /dev/null
+++ b/legacy/Data/ingsw/0321_21/quest.txt
@@ -0,0 +1 @@
+Si consideri un software sviluppato seguendo un approccio plan-driven implementato con tre fasi: F1, F2, F3. Le "change requests" arrivano con probabilità p dopo ciascuna fase e provocano la ripetizione (con relativo costo) di tutte le fasi che precedono. Quali delle seguenti catene di Markov modella lo sviluppo software descritto.
diff --git a/legacy/Data/ingsw/0321_21/wrong 1.txt b/legacy/Data/ingsw/0321_21/wrong 1.txt
new file mode 100644
index 0000000..eb880d8
--- /dev/null
+++ b/legacy/Data/ingsw/0321_21/wrong 1.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/FzqL7wa.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_21/wrong 2.txt b/legacy/Data/ingsw/0321_21/wrong 2.txt
new file mode 100644
index 0000000..1f25f6d
--- /dev/null
+++ b/legacy/Data/ingsw/0321_21/wrong 2.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/PHih8ak.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_23/correct.txt b/legacy/Data/ingsw/0321_23/correct.txt
new file mode 100644
index 0000000..986f4e1
--- /dev/null
+++ b/legacy/Data/ingsw/0321_23/correct.txt
@@ -0,0 +1 @@
+I metodi agile sono metodi di sviluppo incrementale.
diff --git a/legacy/Data/ingsw/0321_23/quest.txt b/legacy/Data/ingsw/0321_23/quest.txt
new file mode 100644
index 0000000..fe96eab
--- /dev/null
+++ b/legacy/Data/ingsw/0321_23/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti affermazioni è vera riguardo ai metodi agile ?
diff --git a/legacy/Data/ingsw/0321_23/wrong 1.txt b/legacy/Data/ingsw/0321_23/wrong 1.txt
new file mode 100644
index 0000000..06e87ff
--- /dev/null
+++ b/legacy/Data/ingsw/0321_23/wrong 1.txt
@@ -0,0 +1 @@
+I metodi agile sono metodi di sviluppo plan-driven.
diff --git a/legacy/Data/ingsw/0321_23/wrong 2.txt b/legacy/Data/ingsw/0321_23/wrong 2.txt
new file mode 100644
index 0000000..d291b48
--- /dev/null
+++ b/legacy/Data/ingsw/0321_23/wrong 2.txt
@@ -0,0 +1 @@
+I metodi agile sono metodi di sviluppo orientato al riuso.
diff --git a/legacy/Data/ingsw/0321_24/correct.txt b/legacy/Data/ingsw/0321_24/correct.txt
new file mode 100644
index 0000000..d4074cf
--- /dev/null
+++ b/legacy/Data/ingsw/0321_24/correct.txt
@@ -0,0 +1 @@
+Testare funzionalità di unità software individuali, oggetti, classi o metodi.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_24/quest.txt b/legacy/Data/ingsw/0321_24/quest.txt
new file mode 100644
index 0000000..b8b36ab
--- /dev/null
+++ b/legacy/Data/ingsw/0321_24/quest.txt
@@ -0,0 +1 @@
+Unit testing si concentra su:
diff --git a/legacy/Data/ingsw/0321_24/wrong 1.txt b/legacy/Data/ingsw/0321_24/wrong 1.txt
new file mode 100644
index 0000000..bc8b2f6
--- /dev/null
+++ b/legacy/Data/ingsw/0321_24/wrong 1.txt
@@ -0,0 +1 @@
+Testare l'interazione tra componenti.
diff --git a/legacy/Data/ingsw/0321_24/wrong 2.txt b/legacy/Data/ingsw/0321_24/wrong 2.txt
new file mode 100644
index 0000000..a801d80
--- /dev/null
+++ b/legacy/Data/ingsw/0321_24/wrong 2.txt
@@ -0,0 +1 @@
+Testare le interfacce di ciascuna componente.
diff --git a/legacy/Data/ingsw/0321_27/correct.txt b/legacy/Data/ingsw/0321_27/correct.txt
new file mode 100644
index 0000000..35e7b12
--- /dev/null
+++ b/legacy/Data/ingsw/0321_27/correct.txt
@@ -0,0 +1 @@
+2*A*(p +1)
diff --git a/legacy/Data/ingsw/0321_27/quest.txt b/legacy/Data/ingsw/0321_27/quest.txt
new file mode 100644
index 0000000..67e890e
--- /dev/null
+++ b/legacy/Data/ingsw/0321_27/quest.txt
@@ -0,0 +1 @@
+Si consideri un software sviluppato seguendo un approccio iterativo implementato con due fasi: F1 seguita da F2. Ciascuna fase ha costo A e deve essere ripetuta una seconda volta con probabilità p. Qual'e' il costo atteso dello sviluppo dell'intero software?
diff --git a/legacy/Data/ingsw/0321_27/wrong 1.txt b/legacy/Data/ingsw/0321_27/wrong 1.txt
new file mode 100644
index 0000000..b84e570
--- /dev/null
+++ b/legacy/Data/ingsw/0321_27/wrong 1.txt
@@ -0,0 +1 @@
+2*A*(p + 2)
diff --git a/legacy/Data/ingsw/0321_27/wrong 2.txt b/legacy/Data/ingsw/0321_27/wrong 2.txt
new file mode 100644
index 0000000..ebab514
--- /dev/null
+++ b/legacy/Data/ingsw/0321_27/wrong 2.txt
@@ -0,0 +1 @@
+3*A*(p + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_28/correct.txt b/legacy/Data/ingsw/0321_28/correct.txt
new file mode 100644
index 0000000..489e74c
--- /dev/null
+++ b/legacy/Data/ingsw/0321_28/correct.txt
@@ -0,0 +1 @@
+5*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_28/quest.txt b/legacy/Data/ingsw/0321_28/quest.txt
new file mode 100644
index 0000000..7441816
--- /dev/null
+++ b/legacy/Data/ingsw/0321_28/quest.txt
@@ -0,0 +1 @@
+Un processo di sviluppo plan-driven consiste di 2 fasi F1, F2, ciascuna costo A. Alla fine di ogni fase vengono prese in considerazione le "change requests" e, se ve ne sono, lo sviluppo viene ripetuto a partire dalla prima iterazione. Quindi con nessuna change request si hanno le fasi: F1, F2 e costo 2A. Con una "change request" dopo la prima fase si ha: F1, F1, F2 e costo 3A. Con una change request dopo la fase 2 si ha: F1, F2, F1, F2 e costo 4A. Qual'è il costo nel caso in cui ci siano change requests sia dopo la fase 1 che dopo la fase 2.
diff --git a/legacy/Data/ingsw/0321_28/wrong 1.txt b/legacy/Data/ingsw/0321_28/wrong 1.txt
new file mode 100644
index 0000000..bf91afb
--- /dev/null
+++ b/legacy/Data/ingsw/0321_28/wrong 1.txt
@@ -0,0 +1 @@
+7*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_28/wrong 2.txt b/legacy/Data/ingsw/0321_28/wrong 2.txt
new file mode 100644
index 0000000..23cbd0e
--- /dev/null
+++ b/legacy/Data/ingsw/0321_28/wrong 2.txt
@@ -0,0 +1 @@
+6*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_29/correct.txt b/legacy/Data/ingsw/0321_29/correct.txt
new file mode 100644
index 0000000..aed001f
--- /dev/null
+++ b/legacy/Data/ingsw/0321_29/correct.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [1, 4] oppure nell'intervallo [15, 20].
diff --git a/legacy/Data/ingsw/0321_29/quest.txt b/legacy/Data/ingsw/0321_29/quest.txt
new file mode 100644
index 0000000..9eb2619
--- /dev/null
+++ b/legacy/Data/ingsw/0321_29/quest.txt
@@ -0,0 +1,31 @@
+Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato.
+
+
+// block Monitor
+
+input Real x;
+
+output Boolean y;
+
+Boolean w;
+
+initial equation
+
+y = false;
+
+equation
+
+w = ((x < 1) or (x > 4)) and ((x < 15) or (x > 20));
+
+algorithm
+
+when edge(w) then
+
+y := true;
+
+end when;
+
+end Monitor; //
+
+
+Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
diff --git a/legacy/Data/ingsw/0321_29/wrong 1.txt b/legacy/Data/ingsw/0321_29/wrong 1.txt
new file mode 100644
index 0000000..bc08e8a
--- /dev/null
+++ b/legacy/Data/ingsw/0321_29/wrong 1.txt
@@ -0,0 +1 @@
+La variabile x è fuori dall'intervallo [1, 4] e fuori dall'intervallo [15, 20].
diff --git a/legacy/Data/ingsw/0321_29/wrong 2.txt b/legacy/Data/ingsw/0321_29/wrong 2.txt
new file mode 100644
index 0000000..52ad14a
--- /dev/null
+++ b/legacy/Data/ingsw/0321_29/wrong 2.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [1, 4] e fuori dall'intervallo [15, 20].
diff --git a/legacy/Data/ingsw/0321_30/correct.txt b/legacy/Data/ingsw/0321_30/correct.txt
new file mode 100644
index 0000000..8cd4fca
--- /dev/null
+++ b/legacy/Data/ingsw/0321_30/correct.txt
@@ -0,0 +1,26 @@
+
+class System
+
+Real x; // MB in buffer
+
+Real u; // input pulse
+
+initial equation
+
+x = 3;
+
+u = 0;
+
+equation
+
+when sample(0, 1) then
+
+ u = 1 - pre(u);
+
+end when;
+
+der(x) = 2*u - 1.0;
+
+end System;
+
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_30/quest.txt b/legacy/Data/ingsw/0321_30/quest.txt
new file mode 100644
index 0000000..6b6eb9d
--- /dev/null
+++ b/legacy/Data/ingsw/0321_30/quest.txt
@@ -0,0 +1 @@
+Un I/O buffer è alimentato da una componente che fornisce un input periodico di periodo 2 secondi. Durante la prima metà del periodo, l'input rate è 2MB/s mentre durante la seconda metà del periodo l'input rate è 0. Quindi l'input rate medio è di 1MB/s. L' I/O buffer, a sua volta, alimenta una componente che richiede (in media) 1MB/s. Quale dei seguenti modelli Modelica è un modello ragionevole per il sistema descritto sopra ?
diff --git a/legacy/Data/ingsw/0321_30/wrong 1.txt b/legacy/Data/ingsw/0321_30/wrong 1.txt
new file mode 100644
index 0000000..d9a0133
--- /dev/null
+++ b/legacy/Data/ingsw/0321_30/wrong 1.txt
@@ -0,0 +1,26 @@
+
+class System
+
+Real x; // MB in buffer
+
+Real u; // input pulse
+
+initial equation
+
+x = 3;
+
+u = 0;
+
+equation
+
+when sample(0, 1) then
+
+ u = 1 - pre(u);
+
+end when;
+
+der(x) = 2*u - 2.0;
+
+end System;
+
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_30/wrong 2.txt b/legacy/Data/ingsw/0321_30/wrong 2.txt
new file mode 100644
index 0000000..e11b34d
--- /dev/null
+++ b/legacy/Data/ingsw/0321_30/wrong 2.txt
@@ -0,0 +1,25 @@
+
+class System
+
+Real x; // MB in buffer
+
+Real u; // input pulse
+
+initial equation
+
+x = 3;
+
+u = 0;
+
+equation
+
+when sample(0, 1) then
+
+ u = 1 - pre(u);
+
+end when;
+
+der(x) = 2*u + 1.0;
+
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_31/correct.txt b/legacy/Data/ingsw/0321_31/correct.txt
new file mode 100644
index 0000000..07800da
--- /dev/null
+++ b/legacy/Data/ingsw/0321_31/correct.txt
@@ -0,0 +1 @@
+(1 + p)*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_31/quest.txt b/legacy/Data/ingsw/0321_31/quest.txt
new file mode 100644
index 0000000..6e4c617
--- /dev/null
+++ b/legacy/Data/ingsw/0321_31/quest.txt
@@ -0,0 +1 @@
+Un processo di sviluppo agile consiste di varie iterazioni. Alla fine di ogni iterazione vengono prese in considerazione le "change requests" e, se ve ne sono, l'iterazione viene ripetuta. Sia p la probabilità che ci siano "change requests" all fine di una iterazione e sia A il costo di una iterazione. Il valore atteso del costo per l'iterazione è:
diff --git a/legacy/Data/ingsw/0321_31/wrong 1.txt b/legacy/Data/ingsw/0321_31/wrong 1.txt
new file mode 100644
index 0000000..8c7e5a6
--- /dev/null
+++ b/legacy/Data/ingsw/0321_31/wrong 1.txt
@@ -0,0 +1 @@
+A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_31/wrong 2.txt b/legacy/Data/ingsw/0321_31/wrong 2.txt
new file mode 100644
index 0000000..14dff62
--- /dev/null
+++ b/legacy/Data/ingsw/0321_31/wrong 2.txt
@@ -0,0 +1 @@
+p*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_32/correct.txt b/legacy/Data/ingsw/0321_32/correct.txt
new file mode 100644
index 0000000..1c03108
--- /dev/null
+++ b/legacy/Data/ingsw/0321_32/correct.txt
@@ -0,0 +1 @@
+Costruire un prototipo, eseguirlo usando dati storici dai log di produzione e valutare la capacità del prototipo di ridurre gli scarti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_32/quest.txt b/legacy/Data/ingsw/0321_32/quest.txt
new file mode 100644
index 0000000..49d08f9
--- /dev/null
+++ b/legacy/Data/ingsw/0321_32/quest.txt
@@ -0,0 +1 @@
+Una azienda manifatturiera desidera costruire un sistema software per monitorare (attraverso sensori) la produzione al fine di ridurre gli scarti. Quali delle seguenti attività contribuisce a validare i requisiti del sistema.
diff --git a/legacy/Data/ingsw/0321_32/wrong 1.txt b/legacy/Data/ingsw/0321_32/wrong 1.txt
new file mode 100644
index 0000000..5187be2
--- /dev/null
+++ b/legacy/Data/ingsw/0321_32/wrong 1.txt
@@ -0,0 +1 @@
+Costruire un prototipo, eseguirlo usando dati storici dai log di produzione e valutarne le performance.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_32/wrong 2.txt b/legacy/Data/ingsw/0321_32/wrong 2.txt
new file mode 100644
index 0000000..52330c1
--- /dev/null
+++ b/legacy/Data/ingsw/0321_32/wrong 2.txt
@@ -0,0 +1 @@
+Costruire un prototipo, eseguirlo usando dati storici dai log di produzione ed identificare errori di implementazione.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_36/correct.txt b/legacy/Data/ingsw/0321_36/correct.txt
new file mode 100644
index 0000000..f8c9568
--- /dev/null
+++ b/legacy/Data/ingsw/0321_36/correct.txt
@@ -0,0 +1 @@
+Per tutti gli istanti di tempo della forma 1 + 4*k (con k = 0, 1, 2, 3, ...) x vale 1.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_36/quest.txt b/legacy/Data/ingsw/0321_36/quest.txt
new file mode 100644
index 0000000..c00055b
--- /dev/null
+++ b/legacy/Data/ingsw/0321_36/quest.txt
@@ -0,0 +1,21 @@
+Si consideri il seguente modello Modelica:
+
+// class System
+
+Integer x;
+
+initial equation
+
+x = 0;
+
+equation
+
+when sample(0, 2) then
+
+ x = 1 - pre(x);
+
+end when;
+
+end System; //
+
+Quale delle seguenti affermazioni è vera per la variabile intera x?
diff --git a/legacy/Data/ingsw/0321_36/wrong 1.txt b/legacy/Data/ingsw/0321_36/wrong 1.txt
new file mode 100644
index 0000000..a7af2cb
--- /dev/null
+++ b/legacy/Data/ingsw/0321_36/wrong 1.txt
@@ -0,0 +1 @@
+Per tutti gli istanti di tempo della forma 1 + 4*k (con k = 0, 1, 2, 3, ...) x vale 0.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_36/wrong 2.txt b/legacy/Data/ingsw/0321_36/wrong 2.txt
new file mode 100644
index 0000000..f485a50
--- /dev/null
+++ b/legacy/Data/ingsw/0321_36/wrong 2.txt
@@ -0,0 +1 @@
+Per tutti gli istanti di tempo della forma 3 + 4*k (con k = 0, 1, 2, 3, ...) x vale 1.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_37/correct.txt b/legacy/Data/ingsw/0321_37/correct.txt
new file mode 100644
index 0000000..ee47430
--- /dev/null
+++ b/legacy/Data/ingsw/0321_37/correct.txt
@@ -0,0 +1,27 @@
+
+model System
+
+Integer y; Real r1024;
+
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+
+equation
+
+y = if (r1024 <= 0.2) then -1 else if (r1024 <= 0.7) then 0 else 1;
+
+algorithm
+
+when initial() then
+
+state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+
+r1024 := 0;
+
+elsewhen sample(0,1) then
+
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+
+end when;
+
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_37/quest.txt b/legacy/Data/ingsw/0321_37/quest.txt
new file mode 100644
index 0000000..a90ebb5
--- /dev/null
+++ b/legacy/Data/ingsw/0321_37/quest.txt
@@ -0,0 +1 @@
+Si consideri l'ambiente (use case) consistente di un utente che ad ogni unità di tempo (ad esempio, un secondo) invia al nostro sistema input -1 con probabilità 0.2, input 0 con probabilità 0.5 ed input 1 con probabilità 0.3. Quale dei seguenti modelli Modelica rappresenta correttamente tale ambiente.
diff --git a/legacy/Data/ingsw/0321_37/wrong 1.txt b/legacy/Data/ingsw/0321_37/wrong 1.txt
new file mode 100644
index 0000000..98dc977
--- /dev/null
+++ b/legacy/Data/ingsw/0321_37/wrong 1.txt
@@ -0,0 +1,28 @@
+
+model System
+
+Integer y; Real r1024;
+
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+
+equation
+
+y = if (r1024 <= 0.3) then -1 else if (r1024 <= 0.7) then 0 else 1;
+
+algorithm
+
+when initial() then
+
+state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+
+r1024 := 0;
+
+elsewhen sample(0,1) then
+
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+
+end when;
+
+end System;
+
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_37/wrong 2.txt b/legacy/Data/ingsw/0321_37/wrong 2.txt
new file mode 100644
index 0000000..dda46fb
--- /dev/null
+++ b/legacy/Data/ingsw/0321_37/wrong 2.txt
@@ -0,0 +1,27 @@
+
+model System
+
+Integer y; Real r1024;
+
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+
+equation
+
+y = if (r1024 <= 0.2) then -1 else if (r1024 <= 0.5) then 0 else 1;
+
+algorithm
+
+when initial() then
+
+state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+
+r1024 := 0;
+
+elsewhen sample(0,1) then
+
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+
+end when;
+
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_38/correct.txt b/legacy/Data/ingsw/0321_38/correct.txt
new file mode 100644
index 0000000..1a8a50a
--- /dev/null
+++ b/legacy/Data/ingsw/0321_38/correct.txt
@@ -0,0 +1 @@
+Per ciascun requisito, dovremmo essere in grado di scrivere un inseme di test che può dimostrare che il sistema sviluppato soddisfa il requisito considerato.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_38/quest.txt b/legacy/Data/ingsw/0321_38/quest.txt
new file mode 100644
index 0000000..580fc18
--- /dev/null
+++ b/legacy/Data/ingsw/0321_38/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive il criterio di "requirements verifiability" che è parte della "requirements validation activity".
diff --git a/legacy/Data/ingsw/0321_38/wrong 1.txt b/legacy/Data/ingsw/0321_38/wrong 1.txt
new file mode 100644
index 0000000..3fdb31e
--- /dev/null
+++ b/legacy/Data/ingsw/0321_38/wrong 1.txt
@@ -0,0 +1 @@
+Per ciascuna componente del sistema, dovremmo essere in grado di scrivere un insieme di test che può dimostrare che essa soddisfa tutti i requisiti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_38/wrong 2.txt b/legacy/Data/ingsw/0321_38/wrong 2.txt
new file mode 100644
index 0000000..fac8307
--- /dev/null
+++ b/legacy/Data/ingsw/0321_38/wrong 2.txt
@@ -0,0 +1 @@
+Per ciascuna coppia di componenti, dovremmo essere in grado di scrivere un insieme di test che può dimostrare che l'interazione tra le componenti soddisfa tutti i requisiti di interfaccia.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_4/correct.txt b/legacy/Data/ingsw/0321_4/correct.txt
new file mode 100644
index 0000000..2736f39
--- /dev/null
+++ b/legacy/Data/ingsw/0321_4/correct.txt
@@ -0,0 +1 @@
+A*(2 + p +q)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_4/quest.txt b/legacy/Data/ingsw/0321_4/quest.txt
new file mode 100644
index 0000000..aec403c
--- /dev/null
+++ b/legacy/Data/ingsw/0321_4/quest.txt
@@ -0,0 +1 @@
+Si consideri un software sviluppato seguendo un approccio iterativo implementato con due fasi: F1 seguita da F2. Ciascuna fase ha costo A. Con probabilità p potrebbe essere necessario ripetere F1 una seconda volta. Con probabilità q potrebbe essere necessario ripetere F2 una seconda volta. Qual'e' il costo atteso dello sviluppo dell'intero software?
diff --git a/legacy/Data/ingsw/0321_4/wrong 1.txt b/legacy/Data/ingsw/0321_4/wrong 1.txt
new file mode 100644
index 0000000..66061d9
--- /dev/null
+++ b/legacy/Data/ingsw/0321_4/wrong 1.txt
@@ -0,0 +1 @@
+A*(1 + p +q)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_4/wrong 2.txt b/legacy/Data/ingsw/0321_4/wrong 2.txt
new file mode 100644
index 0000000..dd9b48a
--- /dev/null
+++ b/legacy/Data/ingsw/0321_4/wrong 2.txt
@@ -0,0 +1 @@
+A*(3 + p +q)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_40/correct.txt b/legacy/Data/ingsw/0321_40/correct.txt
new file mode 100644
index 0000000..b126cfb
--- /dev/null
+++ b/legacy/Data/ingsw/0321_40/correct.txt
@@ -0,0 +1 @@
+Requisito funzionale.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_40/quest.txt b/legacy/Data/ingsw/0321_40/quest.txt
new file mode 100644
index 0000000..91423cc
--- /dev/null
+++ b/legacy/Data/ingsw/0321_40/quest.txt
@@ -0,0 +1 @@
+"Ogni giorno, per ciascuna clinica, il sistema genererà una lista dei pazienti che hanno un appuntamento quel giorno."
diff --git a/legacy/Data/ingsw/0321_40/wrong 1.txt b/legacy/Data/ingsw/0321_40/wrong 1.txt
new file mode 100644
index 0000000..c09e71c
--- /dev/null
+++ b/legacy/Data/ingsw/0321_40/wrong 1.txt
@@ -0,0 +1 @@
+Requisito non-funzionale.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_40/wrong 2.txt b/legacy/Data/ingsw/0321_40/wrong 2.txt
new file mode 100644
index 0000000..4c69e5b
--- /dev/null
+++ b/legacy/Data/ingsw/0321_40/wrong 2.txt
@@ -0,0 +1 @@
+Requisito di performance.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_8/correct.txt b/legacy/Data/ingsw/0321_8/correct.txt
new file mode 100644
index 0000000..0b6b40f
--- /dev/null
+++ b/legacy/Data/ingsw/0321_8/correct.txt
@@ -0,0 +1,53 @@
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+block C1
+
+InputInteger u;
+
+OutputInteger x;
+
+...
+
+end C1;
+
+block C2
+
+InputInteger u;
+
+OutputInteger x;
+
+...
+
+end C2;
+
+block C3
+
+InputInteger u;
+
+OutputInteger x;
+
+...
+
+end C3;
+
+class System
+
+C1 k1;
+
+C2 k2;
+
+C3 k3;
+
+equation
+
+connect(k1.x, k2.u);
+
+connect(k2.x, k3.u);
+
+connect(k3.x, k1.u);
+
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_8/quest.txt b/legacy/Data/ingsw/0321_8/quest.txt
new file mode 100644
index 0000000..01ba436
--- /dev/null
+++ b/legacy/Data/ingsw/0321_8/quest.txt
@@ -0,0 +1 @@
+Un sistema consiste di tre componenti C1, C2, C3 connesse in una architettura ad anello dove l'output della componente C1 (rispettivamente C2, C3) è mandato all'input della componente C2 (rispettivamente C3, C1). Quale dei seguenti schemi Modelica meglio rappresenta l'architettura descritta ?
diff --git a/legacy/Data/ingsw/0321_8/wrong 1.txt b/legacy/Data/ingsw/0321_8/wrong 1.txt
new file mode 100644
index 0000000..6a2cd60
--- /dev/null
+++ b/legacy/Data/ingsw/0321_8/wrong 1.txt
@@ -0,0 +1,54 @@
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+block C1
+
+InputInteger u;
+
+OutputInteger x;
+
+...
+
+end C1;
+
+block C2
+
+InputInteger u;
+
+OutputInteger x;
+
+...
+
+end C2;
+
+block C3
+
+InputInteger u;
+
+OutputInteger x;
+
+...
+
+end C3;
+
+class System
+
+C1 k1;
+
+C2 k2;
+
+C3 k3;
+
+equation
+
+connect(k1.x, k1.u);
+
+connect(k2.x, k2.u);
+
+connect(k3.x, k3.u);
+
+end System;
+
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_8/wrong 2.txt b/legacy/Data/ingsw/0321_8/wrong 2.txt
new file mode 100644
index 0000000..34bb9bd
--- /dev/null
+++ b/legacy/Data/ingsw/0321_8/wrong 2.txt
@@ -0,0 +1,53 @@
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+block C1
+
+InputInteger u;
+
+OutputInteger x;
+
+...
+
+end C1;
+
+block C2
+
+InputInteger u;
+
+OutputInteger x;
+
+...
+
+end C2;
+
+block C3
+
+InputInteger u;
+
+OutputInteger x;
+
+...
+
+end C3;
+
+class System
+
+C1 k1;
+
+C2 k2;
+
+C3 k3;
+
+equation
+
+connect(k1.x, k3.u);
+
+connect(k3.x, k2.u);
+
+connect(k2.x, k1.u);
+
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_9/correct.txt b/legacy/Data/ingsw/0321_9/correct.txt
new file mode 100644
index 0000000..936832d
--- /dev/null
+++ b/legacy/Data/ingsw/0321_9/correct.txt
@@ -0,0 +1 @@
+3*A + 6*B
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_9/quest.txt b/legacy/Data/ingsw/0321_9/quest.txt
new file mode 100644
index 0000000..9f5e001
--- /dev/null
+++ b/legacy/Data/ingsw/0321_9/quest.txt
@@ -0,0 +1 @@
+Il team di sviluppo di un azienda consiste di un senior software engineer e due sviluppatori junior. Usando un approccio plan-driven (ad esempio, water-fall) la fase di design impegna solo il membro senior per tre mesi e la fase di sviluppo e testing solo i due membri junior per tre mesi. Si assuma che non ci siano "change requests" e che il membro senior costi A Eur/mese ed i membri junior B Eur/mese. Qual'e' il costo dello sviluppo usando un approccio plan-driven come sopra ?
diff --git a/legacy/Data/ingsw/0321_9/wrong 1.txt b/legacy/Data/ingsw/0321_9/wrong 1.txt
new file mode 100644
index 0000000..316107c
--- /dev/null
+++ b/legacy/Data/ingsw/0321_9/wrong 1.txt
@@ -0,0 +1 @@
+A + 2*B
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_9/wrong 2.txt b/legacy/Data/ingsw/0321_9/wrong 2.txt
new file mode 100644
index 0000000..68f09b9
--- /dev/null
+++ b/legacy/Data/ingsw/0321_9/wrong 2.txt
@@ -0,0 +1 @@
+3*A + 3*B
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_0/correct.txt b/legacy/Data/ingsw/0324_0/correct.txt
new file mode 100644
index 0000000..3fb437d
--- /dev/null
+++ b/legacy/Data/ingsw/0324_0/correct.txt
@@ -0,0 +1 @@
+0.56
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_0/quest.txt b/legacy/Data/ingsw/0324_0/quest.txt
new file mode 100644
index 0000000..858d9c6
--- /dev/null
+++ b/legacy/Data/ingsw/0324_0/quest.txt
@@ -0,0 +1,9 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_0.png
+Un processo software pu essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del prcoesso software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilit della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+Ad esempio lo state diagram in figura
+
+
+
+Rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.3 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilit 0.2 di dover essere ripetuta (a causa di errori).
+Uno scenario una sequenza di stati.
+Qual'e' la probabilit dello scenario: 1, 3 ? In altri terminti, qual' la probabilit che non sia necessario ripetere nessuna fase?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_0/wrong1.txt b/legacy/Data/ingsw/0324_0/wrong1.txt
new file mode 100644
index 0000000..c64601b
--- /dev/null
+++ b/legacy/Data/ingsw/0324_0/wrong1.txt
@@ -0,0 +1 @@
+0.14
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_0/wrong2.txt b/legacy/Data/ingsw/0324_0/wrong2.txt
new file mode 100644
index 0000000..fc54e00
--- /dev/null
+++ b/legacy/Data/ingsw/0324_0/wrong2.txt
@@ -0,0 +1 @@
+0.24
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_1/quest.txt b/legacy/Data/ingsw/0324_1/quest.txt
new file mode 100644
index 0000000..a4a7e01
--- /dev/null
+++ b/legacy/Data/ingsw/0324_1/quest.txt
@@ -0,0 +1,4 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_1.png
+Si consideri la seguente architettura software:
+
+Quale dei seguneti modelli Modelica meglio la rappresenta.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_1/wrong1.txt b/legacy/Data/ingsw/0324_1/wrong1.txt
new file mode 100644
index 0000000..4bcd55f
--- /dev/null
+++ b/legacy/Data/ingsw/0324_1/wrong1.txt
@@ -0,0 +1,8 @@
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output12, sc
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_1/wrong2.txt b/legacy/Data/ingsw/0324_1/wrong2.txt
new file mode 100644
index 0000000..a3caf2e
--- /dev/null
+++ b/legacy/Data/ingsw/0324_1/wrong2.txt
@@ -0,0 +1,2 @@
+input12)
+connect(sc2.output23, sc
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_1/wrong3.txt b/legacy/Data/ingsw/0324_1/wrong3.txt
new file mode 100644
index 0000000..1d08fb4
--- /dev/null
+++ b/legacy/Data/ingsw/0324_1/wrong3.txt
@@ -0,0 +1,46 @@
+input23)
+connect(sc2.output24, sc4.input24)
+connect(sc3.output31, sc1.input31)
+connect(sc3.output34, sc4.input34)
+connect(sc4.output41, sc1.input41)
+connect(sc4.output43, sc3.input43)
+
+
+end SysArch;
+
+2.
+
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output12, sc2.input12)
+connect(sc1.output13, sc3.input13)
+connect(sc1.output14, sc4.input14)
+connect(sc2.output21, sc1.input21)
+connect(sc3.output31, sc1.input31)
+connect(sc3.output32, sc2.input32)
+connect(sc3.output34, sc4.input34)
+connect(sc4.output41, sc1.input41)
+
+
+end SysArch;
+
+3.
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output14, sc4.input14)
+connect(sc3.output31, sc1.input31)
+connect(sc3.output34, sc4.input34)
+connect(sc4.output41, sc1.input41)
+
+
+end SysArch;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_10/correct.txt b/legacy/Data/ingsw/0324_10/correct.txt
new file mode 100644
index 0000000..aef914a
--- /dev/null
+++ b/legacy/Data/ingsw/0324_10/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che un sistema che soddisfa i requisiti risolve il problema del "customer".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_10/quest.txt b/legacy/Data/ingsw/0324_10/quest.txt
new file mode 100644
index 0000000..9af4805
--- /dev/null
+++ b/legacy/Data/ingsw/0324_10/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "validity check" che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_10/wrong1.txt b/legacy/Data/ingsw/0324_10/wrong1.txt
new file mode 100644
index 0000000..eb23d05
--- /dev/null
+++ b/legacy/Data/ingsw/0324_10/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_10/wrong2.txt b/legacy/Data/ingsw/0324_10/wrong2.txt
new file mode 100644
index 0000000..32c628c
--- /dev/null
+++ b/legacy/Data/ingsw/0324_10/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_11/quest.txt b/legacy/Data/ingsw/0324_11/quest.txt
new file mode 100644
index 0000000..26df850
--- /dev/null
+++ b/legacy/Data/ingsw/0324_11/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_11.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_11/wrong1.txt b/legacy/Data/ingsw/0324_11/wrong1.txt
new file mode 100644
index 0000000..2f7168f
--- /dev/null
+++ b/legacy/Data/ingsw/0324_11/wrong1.txt
@@ -0,0 +1,35 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_11/wrong2.txt b/legacy/Data/ingsw/0324_11/wrong2.txt
new file mode 100644
index 0000000..c3b40d2
--- /dev/null
+++ b/legacy/Data/ingsw/0324_11/wrong2.txt
@@ -0,0 +1,34 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 3;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_11/wrong3.txt b/legacy/Data/ingsw/0324_11/wrong3.txt
new file mode 100644
index 0000000..9116c62
--- /dev/null
+++ b/legacy/Data/ingsw/0324_11/wrong3.txt
@@ -0,0 +1,37 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_12/correct.txt b/legacy/Data/ingsw/0324_12/correct.txt
new file mode 100644
index 0000000..e74b1fc
--- /dev/null
+++ b/legacy/Data/ingsw/0324_12/correct.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x > y) then (z == x) else (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_12/quest.txt b/legacy/Data/ingsw/0324_12/quest.txt
new file mode 100644
index 0000000..c1cd6d0
--- /dev/null
+++ b/legacy/Data/ingsw/0324_12/quest.txt
@@ -0,0 +1,9 @@
+Un test oracle per un programma P una funzione booleana che ha come inputs gli inputs ed outputs di P e ritorna true se e solo se il valore di output di P (con i dati inputs) quello atteso dalle specifiche.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+int z = x;
+while ( (x <= z) && (z <= y) ) { z = z + 1; }
+return (z);
+}
+Siano x, y, gli inputs del programma (f nel nostro caso) e z l'output. Assumendo il programma corretto, quale delle seguenti funzioni booleane F(x, y, z) un test oracle per la funzione f.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_12/wrong1.txt b/legacy/Data/ingsw/0324_12/wrong1.txt
new file mode 100644
index 0000000..d63544a
--- /dev/null
+++ b/legacy/Data/ingsw/0324_12/wrong1.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x > y) then (z == x + 1) else (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_12/wrong2.txt b/legacy/Data/ingsw/0324_12/wrong2.txt
new file mode 100644
index 0000000..1753a91
--- /dev/null
+++ b/legacy/Data/ingsw/0324_12/wrong2.txt
@@ -0,0 +1 @@
+F(x, y, z) = (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_13/correct.txt b/legacy/Data/ingsw/0324_13/correct.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0324_13/correct.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_13/quest.txt b/legacy/Data/ingsw/0324_13/quest.txt
new file mode 100644
index 0000000..4344b75
--- /dev/null
+++ b/legacy/Data/ingsw/0324_13/quest.txt
@@ -0,0 +1,8 @@
+Il partition coverage di un insieme di test cases la percentuale di elementi della partition inclusi nei test cases. La partition una partizione finita dell'insieme di input della funzione che si sta testando.
+Si consideri la seguente funzione C:
+int f1(int x) { return (2*x); }
+Si vuole testare la funzione f1(). A tal fine l'insieme degli interi viene partizionato come segue:
+{(-inf, -11], [-10, -1], {0}, [1, 50], [51, +inf)}
+Si consideri il seguente insieme di test cases:
+{x=-100, x= 40, x=100}
+Quale delle seguenti la partition coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_13/wrong1.txt b/legacy/Data/ingsw/0324_13/wrong1.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0324_13/wrong1.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_13/wrong2.txt b/legacy/Data/ingsw/0324_13/wrong2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0324_13/wrong2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_14/correct.txt b/legacy/Data/ingsw/0324_14/correct.txt
new file mode 100644
index 0000000..1c7da8c
--- /dev/null
+++ b/legacy/Data/ingsw/0324_14/correct.txt
@@ -0,0 +1 @@
+0.03
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_14/quest.txt b/legacy/Data/ingsw/0324_14/quest.txt
new file mode 100644
index 0000000..b9ba678
--- /dev/null
+++ b/legacy/Data/ingsw/0324_14/quest.txt
@@ -0,0 +1,9 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_14.png
+Un processo software pu essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del prcoesso software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilit della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+Ad esempio lo state diagram in figura
+
+
+
+Rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.3 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilit 0.1 di dover essere ripetuta (a causa di errori).
+Uno scenario una sequenza di stati.
+Qual'e' la probabilit dello scenario: 1, 2, 3, 4 ? In altri terminti, qual' la probabilit che sia necessario ripetere sia la fase 1 che la fase 2 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_14/wrong1.txt b/legacy/Data/ingsw/0324_14/wrong1.txt
new file mode 100644
index 0000000..7eb6830
--- /dev/null
+++ b/legacy/Data/ingsw/0324_14/wrong1.txt
@@ -0,0 +1 @@
+0.27
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_14/wrong2.txt b/legacy/Data/ingsw/0324_14/wrong2.txt
new file mode 100644
index 0000000..8a346b7
--- /dev/null
+++ b/legacy/Data/ingsw/0324_14/wrong2.txt
@@ -0,0 +1 @@
+0.07
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_15/correct.txt b/legacy/Data/ingsw/0324_15/correct.txt
new file mode 100644
index 0000000..a40ea7d
--- /dev/null
+++ b/legacy/Data/ingsw/0324_15/correct.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 5, c = 0), (a=50, b = 3, c = 0).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_15/quest.txt b/legacy/Data/ingsw/0324_15/quest.txt
new file mode 100644
index 0000000..2d895ca
--- /dev/null
+++ b/legacy/Data/ingsw/0324_15/quest.txt
@@ -0,0 +1,22 @@
+Una Condition una proposizione booleana, cio una espressione con valore booleano che non pu essere decomposta
+in espressioni boolean pi semplici. Ad esempio, (x + y <= 3) una condition.
+
+Una Decision una espressione booleana composta da conditions e zero o pi operatori booleani. Ad esempio, sono decisions:
+(x + y <= 3)
+((x + y <= 3) || (x - y > 7))
+Un insieme di test cases T soddisfa il criterio di Condition/Decision coverage se tutte le seguenti condizioni sono soddisfatte:
+
+1) Ciascun punto di entrata ed uscita nel programma eseguito in almeno un test;
+2) Per ogni decision d nel programma, per ogni condition c in d, esiste un test in T in cui c true ed un test in T in cui c false.
+3) Per ogni decision d nel programma, esiste un test in T in cui d true ed un test in T in cui d false.
+
+Si consideri la seguente funzione:
+int f(int a, int b, int c)
+{ if ( (a >= 100) && (b - c <= 1) )
+ return (1); // punto di uscita 1
+ else if ((b - c <= 1) || (b + c >= 5)
+)
+ then return (2); // punto di uscita 2
+ else return (3); // punto di uscita 3
+}
+ Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_15/wrong1.txt b/legacy/Data/ingsw/0324_15/wrong1.txt
new file mode 100644
index 0000000..5b77112
--- /dev/null
+++ b/legacy/Data/ingsw/0324_15/wrong1.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 5, c = 0), (a=50, b = 0, c = 5).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_15/wrong2.txt b/legacy/Data/ingsw/0324_15/wrong2.txt
new file mode 100644
index 0000000..abe0eaa
--- /dev/null
+++ b/legacy/Data/ingsw/0324_15/wrong2.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 4, c = 0), (a=200, b = 4, c = 0)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_16/correct.txt b/legacy/Data/ingsw/0324_16/correct.txt
new file mode 100644
index 0000000..1a8a50a
--- /dev/null
+++ b/legacy/Data/ingsw/0324_16/correct.txt
@@ -0,0 +1 @@
+Per ciascun requisito, dovremmo essere in grado di scrivere un inseme di test che può dimostrare che il sistema sviluppato soddisfa il requisito considerato.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_16/quest.txt b/legacy/Data/ingsw/0324_16/quest.txt
new file mode 100644
index 0000000..793b220
--- /dev/null
+++ b/legacy/Data/ingsw/0324_16/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive il criterio di "requirements verifiability" che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_16/wrong1.txt b/legacy/Data/ingsw/0324_16/wrong1.txt
new file mode 100644
index 0000000..fac8307
--- /dev/null
+++ b/legacy/Data/ingsw/0324_16/wrong1.txt
@@ -0,0 +1 @@
+Per ciascuna coppia di componenti, dovremmo essere in grado di scrivere un insieme di test che può dimostrare che l'interazione tra le componenti soddisfa tutti i requisiti di interfaccia.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_16/wrong2.txt b/legacy/Data/ingsw/0324_16/wrong2.txt
new file mode 100644
index 0000000..3fdb31e
--- /dev/null
+++ b/legacy/Data/ingsw/0324_16/wrong2.txt
@@ -0,0 +1 @@
+Per ciascuna componente del sistema, dovremmo essere in grado di scrivere un insieme di test che può dimostrare che essa soddisfa tutti i requisiti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_17/correct.txt b/legacy/Data/ingsw/0324_17/correct.txt
new file mode 100644
index 0000000..b110af1
--- /dev/null
+++ b/legacy/Data/ingsw/0324_17/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_17/quest.txt b/legacy/Data/ingsw/0324_17/quest.txt
new file mode 100644
index 0000000..1f51ab1
--- /dev/null
+++ b/legacy/Data/ingsw/0324_17/quest.txt
@@ -0,0 +1,13 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_17.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 act1 act2
+Test case 2: act2 act2 act2 act2 act1
+Test case 3: act2 act2 act2 act2 act0
+
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_17/wrong1.txt b/legacy/Data/ingsw/0324_17/wrong1.txt
new file mode 100644
index 0000000..a29d476
--- /dev/null
+++ b/legacy/Data/ingsw/0324_17/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_17/wrong2.txt b/legacy/Data/ingsw/0324_17/wrong2.txt
new file mode 100644
index 0000000..2d5aeb0
--- /dev/null
+++ b/legacy/Data/ingsw/0324_17/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_18/correct.txt b/legacy/Data/ingsw/0324_18/correct.txt
new file mode 100644
index 0000000..7311d41
--- /dev/null
+++ b/legacy/Data/ingsw/0324_18/correct.txt
@@ -0,0 +1 @@
+Test set: {x=1, y=1}, {x=0, y=0}, {x=2, y=1}, {x=2, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_18/quest.txt b/legacy/Data/ingsw/0324_18/quest.txt
new file mode 100644
index 0000000..d3a9fe2
--- /dev/null
+++ b/legacy/Data/ingsw/0324_18/quest.txt
@@ -0,0 +1,8 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+ if (x - y <= 0) { if (x + y >= 1) return (1); else return (2); }
+ else {if (2*x + y >= 5) return (3); else return (4); }
+ } /* f() */
+Quale dei seguenti test sets consegue una branch coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_18/wrong1.txt b/legacy/Data/ingsw/0324_18/wrong1.txt
new file mode 100644
index 0000000..3e327ab
--- /dev/null
+++ b/legacy/Data/ingsw/0324_18/wrong1.txt
@@ -0,0 +1 @@
+Test set: {x=1, y=1}, {x=2, y=2}, {x=2, y=1}, {x=2, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_18/wrong2.txt b/legacy/Data/ingsw/0324_18/wrong2.txt
new file mode 100644
index 0000000..7e48e4f
--- /dev/null
+++ b/legacy/Data/ingsw/0324_18/wrong2.txt
@@ -0,0 +1 @@
+Test set: {x=1, y=1}, {x=0, y=0}, {x=2, y=1}, {x=2, y=3}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_19/correct.txt b/legacy/Data/ingsw/0324_19/correct.txt
new file mode 100644
index 0000000..6b560cf
--- /dev/null
+++ b/legacy/Data/ingsw/0324_19/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 25%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_19/quest.txt b/legacy/Data/ingsw/0324_19/quest.txt
new file mode 100644
index 0000000..b7a608e
--- /dev/null
+++ b/legacy/Data/ingsw/0324_19/quest.txt
@@ -0,0 +1,12 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_19.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: act0
+Test case 2: act2 act2 act0
+Test case 3: act1 act1 act0
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_19/wrong1.txt b/legacy/Data/ingsw/0324_19/wrong1.txt
new file mode 100644
index 0000000..b110af1
--- /dev/null
+++ b/legacy/Data/ingsw/0324_19/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_19/wrong2.txt b/legacy/Data/ingsw/0324_19/wrong2.txt
new file mode 100644
index 0000000..2d5aeb0
--- /dev/null
+++ b/legacy/Data/ingsw/0324_19/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_2/correct.txt b/legacy/Data/ingsw/0324_2/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0324_2/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_2/quest.txt b/legacy/Data/ingsw/0324_2/quest.txt
new file mode 100644
index 0000000..adede32
--- /dev/null
+++ b/legacy/Data/ingsw/0324_2/quest.txt
@@ -0,0 +1,9 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+ if (x - y <= 2) { if (x + y >= 1) return (1); else return (2); }
+ else {if (x + 2*y >= 5) return (3); else return (4); }
+ } /* f() */
+Si considerino i seguenti test cases: {x=1, y=2}, {x=0, y=0}, {x=5, y=0}, {x=3, y=0}.
+Quale delle seguenti la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_2/wrong1.txt b/legacy/Data/ingsw/0324_2/wrong1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0324_2/wrong1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_2/wrong2.txt b/legacy/Data/ingsw/0324_2/wrong2.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0324_2/wrong2.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_20/correct.txt b/legacy/Data/ingsw/0324_20/correct.txt
new file mode 100644
index 0000000..90b2f35
--- /dev/null
+++ b/legacy/Data/ingsw/0324_20/correct.txt
@@ -0,0 +1 @@
+State coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_20/quest.txt b/legacy/Data/ingsw/0324_20/quest.txt
new file mode 100644
index 0000000..9d685ad
--- /dev/null
+++ b/legacy/Data/ingsw/0324_20/quest.txt
@@ -0,0 +1,13 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_20.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act0 act2
+Test case 2: act1
+Test case 3: act0 act2
+
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_20/wrong1.txt b/legacy/Data/ingsw/0324_20/wrong1.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0324_20/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_20/wrong2.txt b/legacy/Data/ingsw/0324_20/wrong2.txt
new file mode 100644
index 0000000..a8aead7
--- /dev/null
+++ b/legacy/Data/ingsw/0324_20/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_21/correct.txt b/legacy/Data/ingsw/0324_21/correct.txt
new file mode 100644
index 0000000..31a01d5
--- /dev/null
+++ b/legacy/Data/ingsw/0324_21/correct.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=0, y=0}, {x=15, y=0}, {x=9, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_21/quest.txt b/legacy/Data/ingsw/0324_21/quest.txt
new file mode 100644
index 0000000..d649932
--- /dev/null
+++ b/legacy/Data/ingsw/0324_21/quest.txt
@@ -0,0 +1,8 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+ if (x - y <= 6) { if (x + y >= 3) return (1); else return (2); }
+ else {if (x + 2*y >= 15) return (3); else return (4); }
+ } /* f() */
+Quale dei seguenti test sets consegue una branch coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_21/wrong1.txt b/legacy/Data/ingsw/0324_21/wrong1.txt
new file mode 100644
index 0000000..0c564f7
--- /dev/null
+++ b/legacy/Data/ingsw/0324_21/wrong1.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=2, y=1}, {x=15, y=0}, {x=9, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_21/wrong2.txt b/legacy/Data/ingsw/0324_21/wrong2.txt
new file mode 100644
index 0000000..549dba8
--- /dev/null
+++ b/legacy/Data/ingsw/0324_21/wrong2.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=0, y=0}, {x=15, y=0}, {x=10, y=3}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_22/correct.txt b/legacy/Data/ingsw/0324_22/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0324_22/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_22/quest.txt b/legacy/Data/ingsw/0324_22/quest.txt
new file mode 100644
index 0000000..65cfd2d
--- /dev/null
+++ b/legacy/Data/ingsw/0324_22/quest.txt
@@ -0,0 +1,9 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+ if (x - y <= 0) { if (x + y >= 2) return (1); else return (2); }
+ else {if (2*x + y >= 1) return (3); else return (4); }
+ } /* f() */
+Si considerino i seguenti test cases: {x=1, y=1}, {x=0, y=0}, {x=1, y=0}, {x=0, y=-1}.
+Quale delle seguenti la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_22/wrong1.txt b/legacy/Data/ingsw/0324_22/wrong1.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0324_22/wrong1.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_22/wrong2.txt b/legacy/Data/ingsw/0324_22/wrong2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0324_22/wrong2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_23/correct.txt b/legacy/Data/ingsw/0324_23/correct.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0324_23/correct.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_23/quest.txt b/legacy/Data/ingsw/0324_23/quest.txt
new file mode 100644
index 0000000..c9ea208
--- /dev/null
+++ b/legacy/Data/ingsw/0324_23/quest.txt
@@ -0,0 +1,11 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_23.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+Test case 1: act0 act2
+Test case 2: act1 act0 act0 act2
+Test case 3: act0 act0 act2 act2
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_23/wrong1.txt b/legacy/Data/ingsw/0324_23/wrong1.txt
new file mode 100644
index 0000000..a8aead7
--- /dev/null
+++ b/legacy/Data/ingsw/0324_23/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_23/wrong2.txt b/legacy/Data/ingsw/0324_23/wrong2.txt
new file mode 100644
index 0000000..1a8a508
--- /dev/null
+++ b/legacy/Data/ingsw/0324_23/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_24/correct.txt b/legacy/Data/ingsw/0324_24/correct.txt
new file mode 100644
index 0000000..e13eda2
--- /dev/null
+++ b/legacy/Data/ingsw/0324_24/correct.txt
@@ -0,0 +1 @@
+Accertarsi che i requisiti definiscano un sistema che risolve il problema che l'utente pianifica di risolvere.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_24/quest.txt b/legacy/Data/ingsw/0324_24/quest.txt
new file mode 100644
index 0000000..b59a64d
--- /dev/null
+++ b/legacy/Data/ingsw/0324_24/quest.txt
@@ -0,0 +1 @@
+Quali delle seguenti attivit parte del processo di validazione dei requisiti ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_24/wrong1.txt b/legacy/Data/ingsw/0324_24/wrong1.txt
new file mode 100644
index 0000000..b24f900
--- /dev/null
+++ b/legacy/Data/ingsw/0324_24/wrong1.txt
@@ -0,0 +1 @@
+Accertarsi che il sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_24/wrong2.txt b/legacy/Data/ingsw/0324_24/wrong2.txt
new file mode 100644
index 0000000..884d6b1
--- /dev/null
+++ b/legacy/Data/ingsw/0324_24/wrong2.txt
@@ -0,0 +1 @@
+Accertarsi che l'architettura del sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_25/correct.txt b/legacy/Data/ingsw/0324_25/correct.txt
new file mode 100644
index 0000000..7c149d8
--- /dev/null
+++ b/legacy/Data/ingsw/0324_25/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisisti descrivano tutte le funzionalità e vincoli (e.g., security, performance) del sistema desiderato dal customer.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_25/quest.txt b/legacy/Data/ingsw/0324_25/quest.txt
new file mode 100644
index 0000000..8bba4b8
--- /dev/null
+++ b/legacy/Data/ingsw/0324_25/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "check di completezza" che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_25/wrong1.txt b/legacy/Data/ingsw/0324_25/wrong1.txt
new file mode 100644
index 0000000..3461684
--- /dev/null
+++ b/legacy/Data/ingsw/0324_25/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che per ogni requisito sia stato implementato nel sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_25/wrong2.txt b/legacy/Data/ingsw/0324_25/wrong2.txt
new file mode 100644
index 0000000..32c628c
--- /dev/null
+++ b/legacy/Data/ingsw/0324_25/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_26/quest.txt b/legacy/Data/ingsw/0324_26/quest.txt
new file mode 100644
index 0000000..aef871e
--- /dev/null
+++ b/legacy/Data/ingsw/0324_26/quest.txt
@@ -0,0 +1,19 @@
+Si consideri il seguente modello Modelica. Quale delle seguenti architetture software meglio lo rappresenta ?
+
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output12, sc2.input12)
+connect(sc1.output13, sc3.input13)
+connect(sc2.output23, sc3.input23)
+connect(sc2.output24, sc4.input24)
+connect(sc3.output34, sc4.input34)
+connect(sc4.output41, sc1.input41)
+connect(sc4.output42, sc2.input42)
+
+
+end SysArch;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_26/wrong1.txt b/legacy/Data/ingsw/0324_26/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0324_26/wrong2.txt b/legacy/Data/ingsw/0324_26/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0324_26/wrong3.txt b/legacy/Data/ingsw/0324_26/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0324_27/correct.txt b/legacy/Data/ingsw/0324_27/correct.txt
new file mode 100644
index 0000000..e582263
--- /dev/null
+++ b/legacy/Data/ingsw/0324_27/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x >= 5) or (x <= 0)) and ((x >= 15) or (x <= 10)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_27/quest.txt b/legacy/Data/ingsw/0324_27/quest.txt
new file mode 100644
index 0000000..864cc93
--- /dev/null
+++ b/legacy/Data/ingsw/0324_27/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ1: Durante l'esecuzione del programma (cio per tutti gli istanti di tempo positivi) la variabile x sempre nell'intervallo [0, 5] oppure [10, 15]
+Quale dei seguenti monitor meglio descrive il requisito RQ1 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_27/wrong1.txt b/legacy/Data/ingsw/0324_27/wrong1.txt
new file mode 100644
index 0000000..590f7e1
--- /dev/null
+++ b/legacy/Data/ingsw/0324_27/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ( ((x >= 0) and (x <= 5)) or ((x >= 10) and (x <= 15)) );
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_27/wrong2.txt b/legacy/Data/ingsw/0324_27/wrong2.txt
new file mode 100644
index 0000000..0f38391
--- /dev/null
+++ b/legacy/Data/ingsw/0324_27/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x >= 0) or (x <= 5)) and ((x >= 10) or (x <= 15)) );
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_28/correct.txt b/legacy/Data/ingsw/0324_28/correct.txt
new file mode 100644
index 0000000..4c75070
--- /dev/null
+++ b/legacy/Data/ingsw/0324_28/correct.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x < 0.6*y) and (x + y <= 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_28/quest.txt b/legacy/Data/ingsw/0324_28/quest.txt
new file mode 100644
index 0000000..e11a044
--- /dev/null
+++ b/legacy/Data/ingsw/0324_28/quest.txt
@@ -0,0 +1,4 @@
+Si consideri il seguente requisito:
+RQ: Dopo 50 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se la variabile x minore del 60% della variabile y allora la somma di x ed y maggiore del 30% della variabile z
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_28/wrong1.txt b/legacy/Data/ingsw/0324_28/wrong1.txt
new file mode 100644
index 0000000..6dafe94
--- /dev/null
+++ b/legacy/Data/ingsw/0324_28/wrong1.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x < 0.6*y) and (x + y > 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_28/wrong2.txt b/legacy/Data/ingsw/0324_28/wrong2.txt
new file mode 100644
index 0000000..a3d79a4
--- /dev/null
+++ b/legacy/Data/ingsw/0324_28/wrong2.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x >= 0.6*y) and (x + y <= 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_29/correct.txt b/legacy/Data/ingsw/0324_29/correct.txt
new file mode 100644
index 0000000..e7c5bb8
--- /dev/null
+++ b/legacy/Data/ingsw/0324_29/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che, tenedo conto della tecnologia, budget e tempo disponibili, sia possibile realizzare un sistema che soddisfa i requisisti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_29/quest.txt b/legacy/Data/ingsw/0324_29/quest.txt
new file mode 100644
index 0000000..296cdcb
--- /dev/null
+++ b/legacy/Data/ingsw/0324_29/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "check di realismo" (realizability) che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_29/wrong1.txt b/legacy/Data/ingsw/0324_29/wrong1.txt
new file mode 100644
index 0000000..2b6e242
--- /dev/null
+++ b/legacy/Data/ingsw/0324_29/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che le funzionalità richieste al sistema siano necessarie per soddisfare le necessità del customer.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_29/wrong2.txt b/legacy/Data/ingsw/0324_29/wrong2.txt
new file mode 100644
index 0000000..bfb5124
--- /dev/null
+++ b/legacy/Data/ingsw/0324_29/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che le performance richieste al sistema siano necessarie per soddisfare le necessità del customer.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_3/correct.txt b/legacy/Data/ingsw/0324_3/correct.txt
new file mode 100644
index 0000000..f6a4b07
--- /dev/null
+++ b/legacy/Data/ingsw/0324_3/correct.txt
@@ -0,0 +1 @@
+State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_3/quest.txt b/legacy/Data/ingsw/0324_3/quest.txt
new file mode 100644
index 0000000..b865ed9
--- /dev/null
+++ b/legacy/Data/ingsw/0324_3/quest.txt
@@ -0,0 +1,11 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_3.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+Test case 1: act0 act0 act0 act2 act2
+Test case 2: act2 act0 act2
+Test case 3: act1 act0 act0 act2 act2
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_3/wrong1.txt b/legacy/Data/ingsw/0324_3/wrong1.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/0324_3/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_3/wrong2.txt b/legacy/Data/ingsw/0324_3/wrong2.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0324_3/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_30/quest.txt b/legacy/Data/ingsw/0324_30/quest.txt
new file mode 100644
index 0000000..985c244
--- /dev/null
+++ b/legacy/Data/ingsw/0324_30/quest.txt
@@ -0,0 +1,4 @@
+Un test oracle per un programma P una funzione booleana che ha come inputs gli inputs ed outputs di P e ritorna true se e solo se il valore di output di P (con i dati inputs) quello atteso dalle specifiche.
+Si consideri la seguente specifica funzionale per la funzione f.
+La funzione f(int *A, int *B) prende come input un vettore A di dimensione n ritorna come output un vettore B ottenuto ordinando gli elementi di A in ordine crescente.
+Quale delle seguenti funzioni un test oracle per la funzione f ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_30/wrong1.txt b/legacy/Data/ingsw/0324_30/wrong1.txt
new file mode 100644
index 0000000..69b9722
--- /dev/null
+++ b/legacy/Data/ingsw/0324_30/wrong1.txt
@@ -0,0 +1,14 @@
+#define n 1000
+int TestOracle2(int *A, int *B)
+{
+int i, j, D[n];
+//init
+for (i = 0; i < n; i++) D[i] = -1;
+// B is ordered
+for (i = 0; i < n; i++) { for (j = i+1; j < n; j++) {if (B[j] < B[i]) {retun (0);}}}
+// B is a permutation of A
+for (i = 0; i < n; i++) { for (j = 0; j < n; j++) {if ((A[i] == B[j]) && (D[j] == -1)) {C[i][j] = 1; break;}
+for (i = 0; i < n; i++) {if (D[i] == -1) return (0);}
+// B ok
+return (1);
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_30/wrong2.txt b/legacy/Data/ingsw/0324_30/wrong2.txt
new file mode 100644
index 0000000..a26ce6e
--- /dev/null
+++ b/legacy/Data/ingsw/0324_30/wrong2.txt
@@ -0,0 +1,15 @@
+#define n 1000
+
+int TestOracle3(int *A, int *B)
+{
+int i, j, D[n];
+//init
+for (i = 0; i < n; i++) D[i] = -1;
+// B is ordered
+for (i = 0; i < n; i++) { for (j = i+1; j < n; j++) {if (B[j] < B[i]) {retun (0);}}}
+// B is a permutation of A
+for (i = 0; i < n; i++) { for (j = 0; j < n; j++) {if (A[i] == B[j]) {C[i][j] = 1; D[j] = 1; break;}
+for (i = 0; i < n; i++) {if (D[i] == -1) return (0);}
+// B ok
+return (1);
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_30/wrong3.txt b/legacy/Data/ingsw/0324_30/wrong3.txt
new file mode 100644
index 0000000..ed5ad19
--- /dev/null
+++ b/legacy/Data/ingsw/0324_30/wrong3.txt
@@ -0,0 +1,14 @@
+#define n 1000
+int TestOracle1(int *A, int *B)
+{
+int i, j, D[n];
+//init
+for (i = 0; i < n; i++) D[i] = -1;
+// B is ordered
+for (i = 0; i < n; i++) { for (j = i+1; j < n; j++) {if (B[j] < B[i]) {retun (0);}}}
+// B is a permutation of A
+for (i = 0; i < n; i++) { for (j = 0; j < n; j++) {if ((A[i] == B[j]) && (D[j] == -1)) {C[i][j] = 1; D[j] = 1; break;}
+for (i = 0; i < n; i++) {if (D[i] == -1) return (0);}
+// B ok
+return (1);
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_31/correct.txt b/legacy/Data/ingsw/0324_31/correct.txt
new file mode 100644
index 0000000..293ebbc
--- /dev/null
+++ b/legacy/Data/ingsw/0324_31/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 10) and (x >= 10) and (x <= 20) and ((y < 0.5*x) or (y > 0.7*x)) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_31/quest.txt b/legacy/Data/ingsw/0324_31/quest.txt
new file mode 100644
index 0000000..5922b9f
--- /dev/null
+++ b/legacy/Data/ingsw/0324_31/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ: Dopo 10 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet: se la variabile x nell'intervallo [10, 20] allora la variabile y compresa tra il 50% di x ed il 70% di x.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_31/wrong1.txt b/legacy/Data/ingsw/0324_31/wrong1.txt
new file mode 100644
index 0000000..d50b268
--- /dev/null
+++ b/legacy/Data/ingsw/0324_31/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 10) and ((x < 10) or (x > 20)) and ((y < 0.5*x) or (y > 0.7*x)) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_31/wrong2.txt b/legacy/Data/ingsw/0324_31/wrong2.txt
new file mode 100644
index 0000000..d7890b2
--- /dev/null
+++ b/legacy/Data/ingsw/0324_31/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 10) and (x >= 10) and (x <= 20) and (y >= 0.5*x) and (y <= 0.7*x) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_32/correct.txt b/legacy/Data/ingsw/0324_32/correct.txt
new file mode 100644
index 0000000..2a2ecea
--- /dev/null
+++ b/legacy/Data/ingsw/0324_32/correct.txt
@@ -0,0 +1 @@
+time(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_32/quest.txt b/legacy/Data/ingsw/0324_32/quest.txt
new file mode 100644
index 0000000..5d96d42
--- /dev/null
+++ b/legacy/Data/ingsw/0324_32/quest.txt
@@ -0,0 +1,6 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_32.png
+Si consideri il processo software con due fasi (0 ed 1) rappresentato con la Markov chain in figura. Lo stato iniziale 0 e p in (0, 1). Il tempo necessario per completare la fase x time(x). La fase 0 la fase di design, che ha probabilit p di dover essere ripetuta causa errori. La fase 1 rappreenta il completamento del processo software, e quindi time(1) = 0.
+Il tempo di una istanza del processo software descritto sopra la somma dei tempi degli stati (fasi) attraversati (tenendo presente che si parte sempre dallo stato 0.
+Quindi il costo Time(X) della sequenza di stati X = x(0), x(1), x(2), .... Time(X) = time(x(0)) + time(x(1)) + time(x(2)) + ...
+Ad esempio se X = 0, 1 abbiamo Time(X) = time(0) + time(1) = time(0) (poich time(1) = 0).
+Quale delle seguenti formule calcola il valore atteso del costo per completare il processo software di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_32/wrong1.txt b/legacy/Data/ingsw/0324_32/wrong1.txt
new file mode 100644
index 0000000..9927a93
--- /dev/null
+++ b/legacy/Data/ingsw/0324_32/wrong1.txt
@@ -0,0 +1 @@
+time(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_32/wrong2.txt b/legacy/Data/ingsw/0324_32/wrong2.txt
new file mode 100644
index 0000000..d68fd15
--- /dev/null
+++ b/legacy/Data/ingsw/0324_32/wrong2.txt
@@ -0,0 +1 @@
+time(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_33/correct.txt b/legacy/Data/ingsw/0324_33/correct.txt
new file mode 100644
index 0000000..232aedf
--- /dev/null
+++ b/legacy/Data/ingsw/0324_33/correct.txt
@@ -0,0 +1 @@
+(a = 6, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 0).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_33/quest.txt b/legacy/Data/ingsw/0324_33/quest.txt
new file mode 100644
index 0000000..b2bed72
--- /dev/null
+++ b/legacy/Data/ingsw/0324_33/quest.txt
@@ -0,0 +1,21 @@
+Una Condition una proposizione booleana, cio una espressione con valore booleano che non pu essere decomposta
+in espressioni boolean pi semplici. Ad esempio, (x + y <= 3) una condition.
+
+Una Decision una espressione booleana composta da conditions e zero o pi operatori booleani. Ad esempio, sono decisions:
+(x + y <= 3)
+((x + y <= 3) || (x - y > 7))
+Un insieme di test cases T soddisfa il criterio di Condition/Decision coverage se tutte le seguenti condizioni sono soddisfatte:
+
+1) Ciascun punto di entrata ed uscita nel programma eseguito in almeno un test;
+2) Per ogni decision d nel programma, per ogni condition c in d, esiste un test in T in cui c true ed un test in T in cui c false.
+3) Per ogni decision d nel programma, esiste un test in T in cui d true ed un test in T in cui d false.
+
+Si consideri la seguente funzione:
+int f(int a, int b, int c)
+{ if ( (a + b >= 6) && (b - c <= 1) )
+ return (1); // punto di uscita 1
+ else if ((b - c <= 1) || (b + c >= 5))
+ then return (2); // punto di uscita 2
+ else return (3); // punto di uscita 3
+}
+ Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_33/wrong1.txt b/legacy/Data/ingsw/0324_33/wrong1.txt
new file mode 100644
index 0000000..5d5c9a4
--- /dev/null
+++ b/legacy/Data/ingsw/0324_33/wrong1.txt
@@ -0,0 +1 @@
+(a = 6, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 2).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_33/wrong2.txt b/legacy/Data/ingsw/0324_33/wrong2.txt
new file mode 100644
index 0000000..2b6c292
--- /dev/null
+++ b/legacy/Data/ingsw/0324_33/wrong2.txt
@@ -0,0 +1 @@
+(a = 5, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 0).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_34/correct.txt b/legacy/Data/ingsw/0324_34/correct.txt
new file mode 100644
index 0000000..ad21063
--- /dev/null
+++ b/legacy/Data/ingsw/0324_34/correct.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) and (delay(x, 10) > 1) and (y < 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_34/quest.txt b/legacy/Data/ingsw/0324_34/quest.txt
new file mode 100644
index 0000000..031c331
--- /dev/null
+++ b/legacy/Data/ingsw/0324_34/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+RQ: Dopo 40 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se 10 unit di tempo nel passato x era maggiore di 1 allora ora y nonegativa.
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time <= w e ritorna il valore che z aveva al tempo (time - w), se time = w.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_34/wrong1.txt b/legacy/Data/ingsw/0324_34/wrong1.txt
new file mode 100644
index 0000000..b14ac60
--- /dev/null
+++ b/legacy/Data/ingsw/0324_34/wrong1.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) and (delay(x, 10) > 1) and (y >= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_34/wrong2.txt b/legacy/Data/ingsw/0324_34/wrong2.txt
new file mode 100644
index 0000000..e4201ab
--- /dev/null
+++ b/legacy/Data/ingsw/0324_34/wrong2.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) or (delay(x, 10) > 1) or (y < 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_35/quest.txt b/legacy/Data/ingsw/0324_35/quest.txt
new file mode 100644
index 0000000..627c57e
--- /dev/null
+++ b/legacy/Data/ingsw/0324_35/quest.txt
@@ -0,0 +1,39 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti UML state diagram lo rappresenta correttamente ?
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 2;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_35/wrong1.txt b/legacy/Data/ingsw/0324_35/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0324_35/wrong2.txt b/legacy/Data/ingsw/0324_35/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0324_35/wrong3.txt b/legacy/Data/ingsw/0324_35/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0324_36/correct.txt b/legacy/Data/ingsw/0324_36/correct.txt
new file mode 100644
index 0000000..b9f32a6
--- /dev/null
+++ b/legacy/Data/ingsw/0324_36/correct.txt
@@ -0,0 +1 @@
+c(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_36/quest.txt b/legacy/Data/ingsw/0324_36/quest.txt
new file mode 100644
index 0000000..36471c2
--- /dev/null
+++ b/legacy/Data/ingsw/0324_36/quest.txt
@@ -0,0 +1,6 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_36.png
+Si consideri il processo software con due fasi (0 ed 1) rappresentato con la Markov chain in figura. Lo stato iniziale 0 e p in (0, 1). Il costo dello stato (fase) x c(x). La fase 0 la fase di design, che ha probabilit p di dover essere ripetuta causa errori. La fase 1 rappreenta il completamento del processo software, e quindi c(1) = 0.
+Il costo di una istanza del processo software descritto sopra la somma dei costi degli stati attraversati (tenendo presente che si parte sempre dallo stato 0.
+Quindi il costo C(X) della sequenza di stati X = x(0), x(1), x(2), .... C(X) = c(x(0)) + c(x(1)) + c(x(2)) + ...
+Ad esempio se X = 0, 1 abbiamo C(X) = c(0) + c(1) = c(0) (poich c(1) = 0).
+Quale delle seguenti formule calcola il valore atteso del costo per completare il processo software di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_36/wrong1.txt b/legacy/Data/ingsw/0324_36/wrong1.txt
new file mode 100644
index 0000000..3143da9
--- /dev/null
+++ b/legacy/Data/ingsw/0324_36/wrong1.txt
@@ -0,0 +1 @@
+c(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_36/wrong2.txt b/legacy/Data/ingsw/0324_36/wrong2.txt
new file mode 100644
index 0000000..70022eb
--- /dev/null
+++ b/legacy/Data/ingsw/0324_36/wrong2.txt
@@ -0,0 +1 @@
+c(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_37/correct.txt b/legacy/Data/ingsw/0324_37/correct.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0324_37/correct.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_37/quest.txt b/legacy/Data/ingsw/0324_37/quest.txt
new file mode 100644
index 0000000..fc6a5e1
--- /dev/null
+++ b/legacy/Data/ingsw/0324_37/quest.txt
@@ -0,0 +1,12 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_37.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act1 act2 act2 act2
+Test case 2: act0 act2 act1 act2 act0
+Test case 3: act0 act2 act1 act2 act2
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_37/wrong1.txt b/legacy/Data/ingsw/0324_37/wrong1.txt
new file mode 100644
index 0000000..90b2f35
--- /dev/null
+++ b/legacy/Data/ingsw/0324_37/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_37/wrong2.txt b/legacy/Data/ingsw/0324_37/wrong2.txt
new file mode 100644
index 0000000..a8aead7
--- /dev/null
+++ b/legacy/Data/ingsw/0324_37/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_38/correct.txt b/legacy/Data/ingsw/0324_38/correct.txt
new file mode 100644
index 0000000..98939be
--- /dev/null
+++ b/legacy/Data/ingsw/0324_38/correct.txt
@@ -0,0 +1 @@
+1/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_38/quest.txt b/legacy/Data/ingsw/0324_38/quest.txt
new file mode 100644
index 0000000..d24403f
--- /dev/null
+++ b/legacy/Data/ingsw/0324_38/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_38.png
+Si consideri la Markov chain in figura con stato iniziale 0 e p in (0, 1). Quale delle seguenti formule calcola il valore atteso del numero di transizioni necessarie per lasciare lo stato 0.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_38/wrong1.txt b/legacy/Data/ingsw/0324_38/wrong1.txt
new file mode 100644
index 0000000..56ea6ac
--- /dev/null
+++ b/legacy/Data/ingsw/0324_38/wrong1.txt
@@ -0,0 +1 @@
+1/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_38/wrong2.txt b/legacy/Data/ingsw/0324_38/wrong2.txt
new file mode 100644
index 0000000..db2276d
--- /dev/null
+++ b/legacy/Data/ingsw/0324_38/wrong2.txt
@@ -0,0 +1 @@
+(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_39/correct.txt b/legacy/Data/ingsw/0324_39/correct.txt
new file mode 100644
index 0000000..4a8e634
--- /dev/null
+++ b/legacy/Data/ingsw/0324_39/correct.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) > 0) and (y <= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_39/quest.txt b/legacy/Data/ingsw/0324_39/quest.txt
new file mode 100644
index 0000000..576af1a
--- /dev/null
+++ b/legacy/Data/ingsw/0324_39/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+RQ: Dopo 60 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se 10 unit di tempo nel passato era stata richiesta una risorsa (variabile x positiva) allora ora concesso l'accesso alla risorsa (variabile y positiva)
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time < w e ritorna il valore che z aveva al tempo (time - w), se time >= w.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_39/wrong1.txt b/legacy/Data/ingsw/0324_39/wrong1.txt
new file mode 100644
index 0000000..a43796b
--- /dev/null
+++ b/legacy/Data/ingsw/0324_39/wrong1.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) > 0) and (y > 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_39/wrong2.txt b/legacy/Data/ingsw/0324_39/wrong2.txt
new file mode 100644
index 0000000..68aa37a
--- /dev/null
+++ b/legacy/Data/ingsw/0324_39/wrong2.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) or (delay(x, 10) > 0) or (y <= 0);
+
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_4/correct.txt b/legacy/Data/ingsw/0324_4/correct.txt
new file mode 100644
index 0000000..f2bb2d0
--- /dev/null
+++ b/legacy/Data/ingsw/0324_4/correct.txt
@@ -0,0 +1 @@
+0.12
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_4/quest.txt b/legacy/Data/ingsw/0324_4/quest.txt
new file mode 100644
index 0000000..40b7789
--- /dev/null
+++ b/legacy/Data/ingsw/0324_4/quest.txt
@@ -0,0 +1,9 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_4.png
+Un processo software pu essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del prcoesso software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilit della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+Ad esempio lo state diagram in figura
+
+
+
+Rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.4 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilit 0.2 di dover essere ripetuta (a causa di errori).
+Uno scenario una sequenza di stati.
+Qual'e' la probabilit dello scenario: 1, 3, 4? In altri terminti, qual' la probabilit che non sia necessario ripetere la seconda fase (ma non la prima) ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_4/wrong1.txt b/legacy/Data/ingsw/0324_4/wrong1.txt
new file mode 100644
index 0000000..2a47a95
--- /dev/null
+++ b/legacy/Data/ingsw/0324_4/wrong1.txt
@@ -0,0 +1 @@
+0.08
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_4/wrong2.txt b/legacy/Data/ingsw/0324_4/wrong2.txt
new file mode 100644
index 0000000..b7bbee2
--- /dev/null
+++ b/legacy/Data/ingsw/0324_4/wrong2.txt
@@ -0,0 +1 @@
+0.32
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_40/correct.txt b/legacy/Data/ingsw/0324_40/correct.txt
new file mode 100644
index 0000000..ce9968f
--- /dev/null
+++ b/legacy/Data/ingsw/0324_40/correct.txt
@@ -0,0 +1 @@
+0.28
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_40/quest.txt b/legacy/Data/ingsw/0324_40/quest.txt
new file mode 100644
index 0000000..fbee794
--- /dev/null
+++ b/legacy/Data/ingsw/0324_40/quest.txt
@@ -0,0 +1,9 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_40.png
+Un processo software pu essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del processo software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilit della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+Ad esempio lo state diagram in figura
+
+
+
+Rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.4 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilit 0.3 di dover essere ripetuta (a causa di errori).
+Uno scenario una sequenza di stati.
+Qual'e' la probabilit dello scenario: 1, 2, 3? In altri terminti, qual' la probabilit che non sia necessario ripetere la prima fase (ma non la seconda) ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_40/wrong1.txt b/legacy/Data/ingsw/0324_40/wrong1.txt
new file mode 100644
index 0000000..f2bb2d0
--- /dev/null
+++ b/legacy/Data/ingsw/0324_40/wrong1.txt
@@ -0,0 +1 @@
+0.12
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_40/wrong2.txt b/legacy/Data/ingsw/0324_40/wrong2.txt
new file mode 100644
index 0000000..e8f9017
--- /dev/null
+++ b/legacy/Data/ingsw/0324_40/wrong2.txt
@@ -0,0 +1 @@
+0.42
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_41/quest.txt b/legacy/Data/ingsw/0324_41/quest.txt
new file mode 100644
index 0000000..bfb2790
--- /dev/null
+++ b/legacy/Data/ingsw/0324_41/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_41.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_41/wrong1.txt b/legacy/Data/ingsw/0324_41/wrong1.txt
new file mode 100644
index 0000000..1fad89a
--- /dev/null
+++ b/legacy/Data/ingsw/0324_41/wrong1.txt
@@ -0,0 +1,36 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_41/wrong2.txt b/legacy/Data/ingsw/0324_41/wrong2.txt
new file mode 100644
index 0000000..882ae3e
--- /dev/null
+++ b/legacy/Data/ingsw/0324_41/wrong2.txt
@@ -0,0 +1,36 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_41/wrong3.txt b/legacy/Data/ingsw/0324_41/wrong3.txt
new file mode 100644
index 0000000..e5618fa
--- /dev/null
+++ b/legacy/Data/ingsw/0324_41/wrong3.txt
@@ -0,0 +1,34 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_42/quest.txt b/legacy/Data/ingsw/0324_42/quest.txt
new file mode 100644
index 0000000..071ac68
--- /dev/null
+++ b/legacy/Data/ingsw/0324_42/quest.txt
@@ -0,0 +1,35 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti UML state diagram lo rappresenta correttamente ?
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_42/wrong1.txt b/legacy/Data/ingsw/0324_42/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0324_42/wrong2.txt b/legacy/Data/ingsw/0324_42/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0324_42/wrong3.txt b/legacy/Data/ingsw/0324_42/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0324_43/correct.txt b/legacy/Data/ingsw/0324_43/correct.txt
new file mode 100644
index 0000000..5464d05
--- /dev/null
+++ b/legacy/Data/ingsw/0324_43/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 30%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_43/quest.txt b/legacy/Data/ingsw/0324_43/quest.txt
new file mode 100644
index 0000000..710edb6
--- /dev/null
+++ b/legacy/Data/ingsw/0324_43/quest.txt
@@ -0,0 +1,13 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_43.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 act1 act0 act1 act0
+Test case 2: act1 act0 act2 act2
+Test case 3: act2 act2 act1 act2 act1
+
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_43/wrong1.txt b/legacy/Data/ingsw/0324_43/wrong1.txt
new file mode 100644
index 0000000..a29d476
--- /dev/null
+++ b/legacy/Data/ingsw/0324_43/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_43/wrong2.txt b/legacy/Data/ingsw/0324_43/wrong2.txt
new file mode 100644
index 0000000..2d5aeb0
--- /dev/null
+++ b/legacy/Data/ingsw/0324_43/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_44/correct.txt b/legacy/Data/ingsw/0324_44/correct.txt
new file mode 100644
index 0000000..8785661
--- /dev/null
+++ b/legacy/Data/ingsw/0324_44/correct.txt
@@ -0,0 +1 @@
+{x = -200, x = -50, x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_44/quest.txt b/legacy/Data/ingsw/0324_44/quest.txt
new file mode 100644
index 0000000..36947c2
--- /dev/null
+++ b/legacy/Data/ingsw/0324_44/quest.txt
@@ -0,0 +1,6 @@
+Il partition coverage di un insieme di test cases la percentuale di elementi della partition inclusi nei test cases. La partition una partizione finita dell'insieme di input della funzione che si sta testando.
+Si consideri la seguente funzione C:
+int f1(int x) { return (x + 7); }
+Si vuole testare la funzione f1(). A tal fine l'insieme degli interi viene partizionato come segue:
+{(-inf, -101], [-100, -1], {0}, [1, 500], [501, +inf)}
+Quale dei seguenti test cases consegue una partition coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_44/wrong1.txt b/legacy/Data/ingsw/0324_44/wrong1.txt
new file mode 100644
index 0000000..0aaedb8
--- /dev/null
+++ b/legacy/Data/ingsw/0324_44/wrong1.txt
@@ -0,0 +1 @@
+{x = -200, x = -50, x = 0, x = 100, x = 500}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_44/wrong2.txt b/legacy/Data/ingsw/0324_44/wrong2.txt
new file mode 100644
index 0000000..a6df32d
--- /dev/null
+++ b/legacy/Data/ingsw/0324_44/wrong2.txt
@@ -0,0 +1 @@
+{x = -200, x = -150, x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_45/correct.txt b/legacy/Data/ingsw/0324_45/correct.txt
new file mode 100644
index 0000000..c37d6ae
--- /dev/null
+++ b/legacy/Data/ingsw/0324_45/correct.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) > 0) and (y >= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_45/quest.txt b/legacy/Data/ingsw/0324_45/quest.txt
new file mode 100644
index 0000000..003d1dd
--- /dev/null
+++ b/legacy/Data/ingsw/0324_45/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+RQ: Dopo 60 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se 10 unit di tempo nel passato x era maggiore di 0 allora ora y negativa.
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time <= w e ritorna il valore che z aveva al tempo (time - w), se time = w.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_45/wrong1.txt b/legacy/Data/ingsw/0324_45/wrong1.txt
new file mode 100644
index 0000000..edea147
--- /dev/null
+++ b/legacy/Data/ingsw/0324_45/wrong1.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) <= 0) and (y >= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_45/wrong2.txt b/legacy/Data/ingsw/0324_45/wrong2.txt
new file mode 100644
index 0000000..14bd900
--- /dev/null
+++ b/legacy/Data/ingsw/0324_45/wrong2.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) or (delay(x, 10) > 0) or (y >= 0);
+
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_46/correct.txt b/legacy/Data/ingsw/0324_46/correct.txt
new file mode 100644
index 0000000..a98afd2
--- /dev/null
+++ b/legacy/Data/ingsw/0324_46/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 20) and ((x >= 30) or (x <= 20)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_46/quest.txt b/legacy/Data/ingsw/0324_46/quest.txt
new file mode 100644
index 0000000..b420aaf
--- /dev/null
+++ b/legacy/Data/ingsw/0324_46/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ1: Dopo 20 unit di tempo dall'inizio dell'esecuzione la variabile x sempre nell'intervallo [20, 30] .
+Quale dei seguenti monitor meglio descrive il requisito RQ1 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_46/wrong1.txt b/legacy/Data/ingsw/0324_46/wrong1.txt
new file mode 100644
index 0000000..66064fe
--- /dev/null
+++ b/legacy/Data/ingsw/0324_46/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 20) and (x >= 20) and (x <= 30) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_46/wrong2.txt b/legacy/Data/ingsw/0324_46/wrong2.txt
new file mode 100644
index 0000000..c71f1f5
--- /dev/null
+++ b/legacy/Data/ingsw/0324_46/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 20) or ((x >= 20) and (x <= 30)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_47/quest.txt b/legacy/Data/ingsw/0324_47/quest.txt
new file mode 100644
index 0000000..0240bc8
--- /dev/null
+++ b/legacy/Data/ingsw/0324_47/quest.txt
@@ -0,0 +1,18 @@
+Si consideri il seguente modello Modelica. Quale delle seguenti architetture software meglio lo rappresenta ?
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output12, sc2.input12)
+connect(sc1.output13, sc3.input13)
+connect(sc1.output14, sc4.input14)
+connect(sc2.output21, sc1.input21)
+connect(sc2.output24, sc4.input24)
+connect(sc3.output31, sc1.input31)
+connect(sc4.output41, sc1.input41)
+connect(sc4.output42, sc2.input42)
+connect(sc4.output43, sc3.input43)
+end SysArch;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_47/wrong1.txt b/legacy/Data/ingsw/0324_47/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0324_47/wrong2.txt b/legacy/Data/ingsw/0324_47/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0324_47/wrong3.txt b/legacy/Data/ingsw/0324_47/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0324_48/quest.txt b/legacy/Data/ingsw/0324_48/quest.txt
new file mode 100644
index 0000000..1109458
--- /dev/null
+++ b/legacy/Data/ingsw/0324_48/quest.txt
@@ -0,0 +1,4 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_48.png
+Si consideri la seguente architettura software:
+
+Quale dei seguneti modelli Modelica meglio la rappresenta.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_48/wrong1.txt b/legacy/Data/ingsw/0324_48/wrong1.txt
new file mode 100644
index 0000000..4bcd55f
--- /dev/null
+++ b/legacy/Data/ingsw/0324_48/wrong1.txt
@@ -0,0 +1,8 @@
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output12, sc
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_48/wrong2.txt b/legacy/Data/ingsw/0324_48/wrong2.txt
new file mode 100644
index 0000000..19be218
--- /dev/null
+++ b/legacy/Data/ingsw/0324_48/wrong2.txt
@@ -0,0 +1,2 @@
+input12)
+connect(sc1.output13, sc
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_48/wrong3.txt b/legacy/Data/ingsw/0324_48/wrong3.txt
new file mode 100644
index 0000000..3387be9
--- /dev/null
+++ b/legacy/Data/ingsw/0324_48/wrong3.txt
@@ -0,0 +1,49 @@
+input13)
+connect(sc2.output21, sc1.input21)
+connect(sc2.output23, sc3.input23)
+connect(sc2.output24, sc4.input24)
+connect(sc3.output32, sc2.input32)
+connect(sc3.output34, sc4.input34)
+connect(sc4.output41, sc1.input41)
+connect(sc4.output42, sc2.input42)
+
+
+end SysArch;
+
+2.
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output13, sc3.input13)
+connect(sc2.output21, sc1.input21)
+connect(sc2.output23, sc3.input23)
+connect(sc2.output24, sc4.input24)
+connect(sc3.output31, sc1.input31)
+connect(sc4.output41, sc1.input41)
+connect(sc4.output42, sc2.input42)
+connect(sc4.output43, sc3.input43)
+
+
+end SysArch;
+
+3.
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output13, sc3.input13)
+connect(sc2.output21, sc1.input21)
+connect(sc2.output24, sc4.input24)
+connect(sc3.output32, sc2.input32)
+connect(sc4.output41, sc1.input41)
+connect(sc4.output43, sc3.input43)
+
+
+end SysArch;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_49/correct.txt b/legacy/Data/ingsw/0324_49/correct.txt
new file mode 100644
index 0000000..eb23d05
--- /dev/null
+++ b/legacy/Data/ingsw/0324_49/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_49/quest.txt b/legacy/Data/ingsw/0324_49/quest.txt
new file mode 100644
index 0000000..7710e8f
--- /dev/null
+++ b/legacy/Data/ingsw/0324_49/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "check di consistenza" che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_49/wrong1.txt b/legacy/Data/ingsw/0324_49/wrong1.txt
new file mode 100644
index 0000000..9e12d11
--- /dev/null
+++ b/legacy/Data/ingsw/0324_49/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che per ogni requisito esista un insieme di test che lo possa verificare.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_49/wrong2.txt b/legacy/Data/ingsw/0324_49/wrong2.txt
new file mode 100644
index 0000000..32c628c
--- /dev/null
+++ b/legacy/Data/ingsw/0324_49/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_5/correct.txt b/legacy/Data/ingsw/0324_5/correct.txt
new file mode 100644
index 0000000..81a4b93
--- /dev/null
+++ b/legacy/Data/ingsw/0324_5/correct.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x >= 0) then (z == pow(y, x)) else (z == 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_5/quest.txt b/legacy/Data/ingsw/0324_5/quest.txt
new file mode 100644
index 0000000..236ccc7
--- /dev/null
+++ b/legacy/Data/ingsw/0324_5/quest.txt
@@ -0,0 +1,10 @@
+Un test oracle per un programma P una funzione booleana che ha come inputs gli inputs ed outputs di P e ritorna true se e solo se il valore di output di P (con i dati inputs) quello atteso dalle specifiche.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+int z, k;
+z = 1; k = 0;
+while (k < x) { z = y*z; k = k + 1; }
+return (z);
+}
+Siano x, y, gli inputs del programma (f nel nostro caso) e z l'output. Assumendo il programma corretto, quale delle seguenti funzioni booleane F(x, y, z) un test oracle per la funzione f.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_5/wrong1.txt b/legacy/Data/ingsw/0324_5/wrong1.txt
new file mode 100644
index 0000000..d246b94
--- /dev/null
+++ b/legacy/Data/ingsw/0324_5/wrong1.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x >= 0) then (z == pow(y, x)) else (z == 0)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_5/wrong2.txt b/legacy/Data/ingsw/0324_5/wrong2.txt
new file mode 100644
index 0000000..f52d5ae
--- /dev/null
+++ b/legacy/Data/ingsw/0324_5/wrong2.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x >= 0) then (z == pow(y, x)) else (z == y)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_6/correct.txt b/legacy/Data/ingsw/0324_6/correct.txt
new file mode 100644
index 0000000..b110af1
--- /dev/null
+++ b/legacy/Data/ingsw/0324_6/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_6/quest.txt b/legacy/Data/ingsw/0324_6/quest.txt
new file mode 100644
index 0000000..f6ffda4
--- /dev/null
+++ b/legacy/Data/ingsw/0324_6/quest.txt
@@ -0,0 +1,13 @@
+img=https://unspectacular-subdi.000webhostapp.com/0324_domanda_6.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: act0 act0 act0 act0 act1
+Test case 2: act2 act2
+Test case 3: act0 act0 act2 act1 act2
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_6/wrong1.txt b/legacy/Data/ingsw/0324_6/wrong1.txt
new file mode 100644
index 0000000..a29d476
--- /dev/null
+++ b/legacy/Data/ingsw/0324_6/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_6/wrong2.txt b/legacy/Data/ingsw/0324_6/wrong2.txt
new file mode 100644
index 0000000..2d5aeb0
--- /dev/null
+++ b/legacy/Data/ingsw/0324_6/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_7/correct.txt b/legacy/Data/ingsw/0324_7/correct.txt
new file mode 100644
index 0000000..43dc0c9
--- /dev/null
+++ b/legacy/Data/ingsw/0324_7/correct.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x >= 0) && (y >= 0) && ((x > 0) || (y > 0)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_7/quest.txt b/legacy/Data/ingsw/0324_7/quest.txt
new file mode 100644
index 0000000..f6744fd
--- /dev/null
+++ b/legacy/Data/ingsw/0324_7/quest.txt
@@ -0,0 +1,4 @@
+Pre-condizioni, invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in ). In particolare, assert(expre) non fa nulla se l'espressione expre vale TRUE (cio non 0), stampa un messaggio di errore su stderr e abortisce l'esecuzione del programma altrimenti.
+Si consideri la funzione C
+int f(in x, int y) { ..... }
+Quale delle seguenti assert esprime la pre-condizione che entrambi gli argomenti di f sono non-negativi ed almeno uno di loro positivo ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_7/wrong1.txt b/legacy/Data/ingsw/0324_7/wrong1.txt
new file mode 100644
index 0000000..3f63933
--- /dev/null
+++ b/legacy/Data/ingsw/0324_7/wrong1.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x > 0) && (y > 0) && ((x > 1) || (y > 1)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_7/wrong2.txt b/legacy/Data/ingsw/0324_7/wrong2.txt
new file mode 100644
index 0000000..6a97baf
--- /dev/null
+++ b/legacy/Data/ingsw/0324_7/wrong2.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x >= 0) && (y >= 0) && ((x > 1) || (y > 1)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_8/correct.txt b/legacy/Data/ingsw/0324_8/correct.txt
new file mode 100644
index 0000000..b8bf06e
--- /dev/null
+++ b/legacy/Data/ingsw/0324_8/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x > 5) or (x < 0));
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_8/quest.txt b/legacy/Data/ingsw/0324_8/quest.txt
new file mode 100644
index 0000000..22c683f
--- /dev/null
+++ b/legacy/Data/ingsw/0324_8/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ: Durante l'esecuzione del programma (cio per tutti gli istanti di tempo positivi) la variabile x sempre nell'intervallo [0, 5].
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_8/wrong1.txt b/legacy/Data/ingsw/0324_8/wrong1.txt
new file mode 100644
index 0000000..2029293
--- /dev/null
+++ b/legacy/Data/ingsw/0324_8/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and (x > 0) and (x < 5);
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_8/wrong2.txt b/legacy/Data/ingsw/0324_8/wrong2.txt
new file mode 100644
index 0000000..bc8720d
--- /dev/null
+++ b/legacy/Data/ingsw/0324_8/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x > 0) or (x < 5));
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_9/correct.txt b/legacy/Data/ingsw/0324_9/correct.txt
new file mode 100644
index 0000000..7a6c6b9
--- /dev/null
+++ b/legacy/Data/ingsw/0324_9/correct.txt
@@ -0,0 +1 @@
+300000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_9/quest.txt b/legacy/Data/ingsw/0324_9/quest.txt
new file mode 100644
index 0000000..47201e7
--- /dev/null
+++ b/legacy/Data/ingsw/0324_9/quest.txt
@@ -0,0 +1,4 @@
+Il rischio R pu essere calcolato come R = P*C, dove P la probabilit dell'evento avverso (software failure nel nostro contesto) e C il costo dell'occorrenza dell'evento avverso.
+Assumiamo che la probabilit P sia legata al costo di sviluppo S dalla formula
+P = 10^{(-b*S)} (cio 10 elevato alla (-b*S))
+dove b una opportuna costante note da dati storici aziendali. Si assuma che b = 0.0001, C = 1000000, ed il rischio ammesso R = 1000. Quale dei seguenti valori meglio approssima il costo S per lo sviluppo del software in questione.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_9/wrong1.txt b/legacy/Data/ingsw/0324_9/wrong1.txt
new file mode 100644
index 0000000..2df501e
--- /dev/null
+++ b/legacy/Data/ingsw/0324_9/wrong1.txt
@@ -0,0 +1 @@
+500000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_9/wrong2.txt b/legacy/Data/ingsw/0324_9/wrong2.txt
new file mode 100644
index 0000000..997967b
--- /dev/null
+++ b/legacy/Data/ingsw/0324_9/wrong2.txt
@@ -0,0 +1 @@
+700000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0422-16/correct.txt b/legacy/Data/ingsw/0422-16/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0422-16/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0422-16/quest.txt b/legacy/Data/ingsw/0422-16/quest.txt
new file mode 100644
index 0000000..1b18990
--- /dev/null
+++ b/legacy/Data/ingsw/0422-16/quest.txt
@@ -0,0 +1,20 @@
+img=https://i.imgur.com/6m6ALRb.png
+La state coverage di un insieme di test cases (cioè sequeze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) rggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+
+
+
+ed il seguente insieme di test cases:
+
+
+
+1) Start PIN validation, card inserted, PIN Entered, Valid PIN, Cancel 3, End PIN Validation 2
+
+2) Start PIN validation, card inserted, PIN Entered, Valid PIN, Cancel 2, End PIN Validation 2
+
+3) Start PIN validation, card inserted, PIN Entered, Invalid PIN, PIN Entered, Invalid PIN, PIN Entered, Invalid PIN, PIN Entered, Invalid PIN, More than 3 failed..., END PIN validation 1;
+
+
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0422-16/wrong1.txt b/legacy/Data/ingsw/0422-16/wrong1.txt
new file mode 100644
index 0000000..1e091a3
--- /dev/null
+++ b/legacy/Data/ingsw/0422-16/wrong1.txt
@@ -0,0 +1 @@
+90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0422-16/wrong2.txt b/legacy/Data/ingsw/0422-16/wrong2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0422-16/wrong2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_0/quest.txt b/legacy/Data/ingsw/0613_0/quest.txt
new file mode 100644
index 0000000..1f3419c
--- /dev/null
+++ b/legacy/Data/ingsw/0613_0/quest.txt
@@ -0,0 +1,35 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti UML state diagram lo rappresenta correttamente ?
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_0/wrong1.txt b/legacy/Data/ingsw/0613_0/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0613_0/wrong2.txt b/legacy/Data/ingsw/0613_0/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0613_0/wrong3.txt b/legacy/Data/ingsw/0613_0/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0613_1/correct.txt b/legacy/Data/ingsw/0613_1/correct.txt
new file mode 100644
index 0000000..f2bb2d0
--- /dev/null
+++ b/legacy/Data/ingsw/0613_1/correct.txt
@@ -0,0 +1 @@
+0.12
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_1/quest.txt b/legacy/Data/ingsw/0613_1/quest.txt
new file mode 100644
index 0000000..654955e
--- /dev/null
+++ b/legacy/Data/ingsw/0613_1/quest.txt
@@ -0,0 +1,9 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_1.png
+Un processo software pu essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del prcoesso software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilit della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+Ad esempio lo state diagram in figura
+
+
+
+Rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.4 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilit 0.2 di dover essere ripetuta (a causa di errori).
+Uno scenario una sequenza di stati.
+Qual'e' la probabilit dello scenario: 1, 3, 4? In altri terminti, qual' la probabilit che non sia necessario ripetere la seconda fase (ma non la prima) ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_1/wrong1.txt b/legacy/Data/ingsw/0613_1/wrong1.txt
new file mode 100644
index 0000000..2a47a95
--- /dev/null
+++ b/legacy/Data/ingsw/0613_1/wrong1.txt
@@ -0,0 +1 @@
+0.08
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_1/wrong2.txt b/legacy/Data/ingsw/0613_1/wrong2.txt
new file mode 100644
index 0000000..b7bbee2
--- /dev/null
+++ b/legacy/Data/ingsw/0613_1/wrong2.txt
@@ -0,0 +1 @@
+0.32
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_10/correct.txt b/legacy/Data/ingsw/0613_10/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0613_10/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_10/quest.txt b/legacy/Data/ingsw/0613_10/quest.txt
new file mode 100644
index 0000000..9e4d3a9
--- /dev/null
+++ b/legacy/Data/ingsw/0613_10/quest.txt
@@ -0,0 +1,31 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x[3])
+{
+ if (-x[0] + x[1] - x[2] < -7)
+ { return (0); }
+ else if (-3*x[0] +3*x[1] - 5*x[2] > 7)
+ {
+ if (-x[0] + x[1] - x[2] > 10)
+ { return (1); }
+ else
+ { return (0); }
+ }
+ else
+ {
+ if (3*x[0] - 5*x[1] + 7*x[2] > 9)
+ { return (1); }
+ else
+ { return (0); }
+ }
+
+} /* f() */
+----------
+ed il seguente insieme di test cases:
+
+Test 1: x[0] = 0, x[1] = 0, x[2] = 1,
+Test 2: x[0] = 3, x[1] = 1, x[2] = 5,
+Test 3: x[0] = 0, x[1] = 4, x[2] = -2,
+Test 4: x[0] = -4, x[1] = 5, x[2] = -2,
+Test 5: x[0] = 1, x[1] = -4, x[2] = 4,
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_10/wrong1.txt b/legacy/Data/ingsw/0613_10/wrong1.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0613_10/wrong1.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_10/wrong2.txt b/legacy/Data/ingsw/0613_10/wrong2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0613_10/wrong2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_11/correct.txt b/legacy/Data/ingsw/0613_11/correct.txt
new file mode 100644
index 0000000..aef914a
--- /dev/null
+++ b/legacy/Data/ingsw/0613_11/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che un sistema che soddisfa i requisiti risolve il problema del "customer".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_11/quest.txt b/legacy/Data/ingsw/0613_11/quest.txt
new file mode 100644
index 0000000..9af4805
--- /dev/null
+++ b/legacy/Data/ingsw/0613_11/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "validity check" che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_11/wrong1.txt b/legacy/Data/ingsw/0613_11/wrong1.txt
new file mode 100644
index 0000000..eb23d05
--- /dev/null
+++ b/legacy/Data/ingsw/0613_11/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_11/wrong2.txt b/legacy/Data/ingsw/0613_11/wrong2.txt
new file mode 100644
index 0000000..32c628c
--- /dev/null
+++ b/legacy/Data/ingsw/0613_11/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_12/correct.txt b/legacy/Data/ingsw/0613_12/correct.txt
new file mode 100644
index 0000000..475d1ef
--- /dev/null
+++ b/legacy/Data/ingsw/0613_12/correct.txt
@@ -0,0 +1 @@
+{x = -150, x = -40, x = 0, x = 200, x = 600}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_12/quest.txt b/legacy/Data/ingsw/0613_12/quest.txt
new file mode 100644
index 0000000..36947c2
--- /dev/null
+++ b/legacy/Data/ingsw/0613_12/quest.txt
@@ -0,0 +1,6 @@
+Il partition coverage di un insieme di test cases la percentuale di elementi della partition inclusi nei test cases. La partition una partizione finita dell'insieme di input della funzione che si sta testando.
+Si consideri la seguente funzione C:
+int f1(int x) { return (x + 7); }
+Si vuole testare la funzione f1(). A tal fine l'insieme degli interi viene partizionato come segue:
+{(-inf, -101], [-100, -1], {0}, [1, 500], [501, +inf)}
+Quale dei seguenti test cases consegue una partition coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_12/wrong1.txt b/legacy/Data/ingsw/0613_12/wrong1.txt
new file mode 100644
index 0000000..0aaedb8
--- /dev/null
+++ b/legacy/Data/ingsw/0613_12/wrong1.txt
@@ -0,0 +1 @@
+{x = -200, x = -50, x = 0, x = 100, x = 500}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_12/wrong2.txt b/legacy/Data/ingsw/0613_12/wrong2.txt
new file mode 100644
index 0000000..a6df32d
--- /dev/null
+++ b/legacy/Data/ingsw/0613_12/wrong2.txt
@@ -0,0 +1 @@
+{x = -200, x = -150, x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_13/correct.txt b/legacy/Data/ingsw/0613_13/correct.txt
new file mode 100644
index 0000000..12d93cc
--- /dev/null
+++ b/legacy/Data/ingsw/0613_13/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 20%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_13/quest.txt b/legacy/Data/ingsw/0613_13/quest.txt
new file mode 100644
index 0000000..6f20250
--- /dev/null
+++ b/legacy/Data/ingsw/0613_13/quest.txt
@@ -0,0 +1,13 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_13.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 act0
+Test case 2: act1 act0 act1 act2 act1
+Test case 3: act1 act2 act0 act2 act1
+
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_13/wrong1.txt b/legacy/Data/ingsw/0613_13/wrong1.txt
new file mode 100644
index 0000000..8b0c318
--- /dev/null
+++ b/legacy/Data/ingsw/0613_13/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_13/wrong2.txt b/legacy/Data/ingsw/0613_13/wrong2.txt
new file mode 100644
index 0000000..5464d05
--- /dev/null
+++ b/legacy/Data/ingsw/0613_13/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 30%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_14/quest.txt b/legacy/Data/ingsw/0613_14/quest.txt
new file mode 100644
index 0000000..b95c7d3
--- /dev/null
+++ b/legacy/Data/ingsw/0613_14/quest.txt
@@ -0,0 +1,13 @@
+Si consideri il seguente modello Modelica. Quale delle seguenti architetture software meglio lo rappresenta ?
+block SysArch // System Architecture
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+connect(sc1.output12, sc2.input12)
+connect(sc1.output13, sc3.input13)
+connect(sc1.output14, sc4.input14)
+connect(sc3.output31, sc1.input31)
+connect(sc3.output32, sc2.input32)
+connect(sc4.output42, sc2.input42)
+end SysArch;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_14/wrong1.txt b/legacy/Data/ingsw/0613_14/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0613_14/wrong2.txt b/legacy/Data/ingsw/0613_14/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0613_14/wrong3.txt b/legacy/Data/ingsw/0613_14/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0613_15/correct.txt b/legacy/Data/ingsw/0613_15/correct.txt
new file mode 100644
index 0000000..b8bf06e
--- /dev/null
+++ b/legacy/Data/ingsw/0613_15/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x > 5) or (x < 0));
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_15/quest.txt b/legacy/Data/ingsw/0613_15/quest.txt
new file mode 100644
index 0000000..22c683f
--- /dev/null
+++ b/legacy/Data/ingsw/0613_15/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ: Durante l'esecuzione del programma (cio per tutti gli istanti di tempo positivi) la variabile x sempre nell'intervallo [0, 5].
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_15/wrong1.txt b/legacy/Data/ingsw/0613_15/wrong1.txt
new file mode 100644
index 0000000..bc8720d
--- /dev/null
+++ b/legacy/Data/ingsw/0613_15/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x > 0) or (x < 5));
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_15/wrong2.txt b/legacy/Data/ingsw/0613_15/wrong2.txt
new file mode 100644
index 0000000..2029293
--- /dev/null
+++ b/legacy/Data/ingsw/0613_15/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and (x > 0) and (x < 5);
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_16/correct.txt b/legacy/Data/ingsw/0613_16/correct.txt
new file mode 100644
index 0000000..e582263
--- /dev/null
+++ b/legacy/Data/ingsw/0613_16/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x >= 5) or (x <= 0)) and ((x >= 15) or (x <= 10)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_16/quest.txt b/legacy/Data/ingsw/0613_16/quest.txt
new file mode 100644
index 0000000..864cc93
--- /dev/null
+++ b/legacy/Data/ingsw/0613_16/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ1: Durante l'esecuzione del programma (cio per tutti gli istanti di tempo positivi) la variabile x sempre nell'intervallo [0, 5] oppure [10, 15]
+Quale dei seguenti monitor meglio descrive il requisito RQ1 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_16/wrong1.txt b/legacy/Data/ingsw/0613_16/wrong1.txt
new file mode 100644
index 0000000..590f7e1
--- /dev/null
+++ b/legacy/Data/ingsw/0613_16/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ( ((x >= 0) and (x <= 5)) or ((x >= 10) and (x <= 15)) );
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_16/wrong2.txt b/legacy/Data/ingsw/0613_16/wrong2.txt
new file mode 100644
index 0000000..0f38391
--- /dev/null
+++ b/legacy/Data/ingsw/0613_16/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x >= 0) or (x <= 5)) and ((x >= 10) or (x <= 15)) );
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_17/correct.txt b/legacy/Data/ingsw/0613_17/correct.txt
new file mode 100644
index 0000000..c37d6ae
--- /dev/null
+++ b/legacy/Data/ingsw/0613_17/correct.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) > 0) and (y >= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_17/quest.txt b/legacy/Data/ingsw/0613_17/quest.txt
new file mode 100644
index 0000000..003d1dd
--- /dev/null
+++ b/legacy/Data/ingsw/0613_17/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+RQ: Dopo 60 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se 10 unit di tempo nel passato x era maggiore di 0 allora ora y negativa.
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time <= w e ritorna il valore che z aveva al tempo (time - w), se time = w.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_17/wrong1.txt b/legacy/Data/ingsw/0613_17/wrong1.txt
new file mode 100644
index 0000000..14bd900
--- /dev/null
+++ b/legacy/Data/ingsw/0613_17/wrong1.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) or (delay(x, 10) > 0) or (y >= 0);
+
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_17/wrong2.txt b/legacy/Data/ingsw/0613_17/wrong2.txt
new file mode 100644
index 0000000..edea147
--- /dev/null
+++ b/legacy/Data/ingsw/0613_17/wrong2.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) <= 0) and (y >= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_18/correct.txt b/legacy/Data/ingsw/0613_18/correct.txt
new file mode 100644
index 0000000..98939be
--- /dev/null
+++ b/legacy/Data/ingsw/0613_18/correct.txt
@@ -0,0 +1 @@
+1/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_18/quest.txt b/legacy/Data/ingsw/0613_18/quest.txt
new file mode 100644
index 0000000..91edad5
--- /dev/null
+++ b/legacy/Data/ingsw/0613_18/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_18.png
+Si consideri la Markov chain in figura con stato iniziale 0 e p in (0, 1). Quale delle seguenti formule calcola il valore atteso del numero di transizioni necessarie per lasciare lo stato 0.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_18/wrong1.txt b/legacy/Data/ingsw/0613_18/wrong1.txt
new file mode 100644
index 0000000..56ea6ac
--- /dev/null
+++ b/legacy/Data/ingsw/0613_18/wrong1.txt
@@ -0,0 +1 @@
+1/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_18/wrong2.txt b/legacy/Data/ingsw/0613_18/wrong2.txt
new file mode 100644
index 0000000..db2276d
--- /dev/null
+++ b/legacy/Data/ingsw/0613_18/wrong2.txt
@@ -0,0 +1 @@
+(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_19/quest.txt b/legacy/Data/ingsw/0613_19/quest.txt
new file mode 100644
index 0000000..052028b
--- /dev/null
+++ b/legacy/Data/ingsw/0613_19/quest.txt
@@ -0,0 +1,37 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti UML state diagram lo rappresenta correttamente ?
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_19/wrong1.txt b/legacy/Data/ingsw/0613_19/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0613_19/wrong2.txt b/legacy/Data/ingsw/0613_19/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0613_19/wrong3.txt b/legacy/Data/ingsw/0613_19/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0613_2/quest.txt b/legacy/Data/ingsw/0613_2/quest.txt
new file mode 100644
index 0000000..fcb1323
--- /dev/null
+++ b/legacy/Data/ingsw/0613_2/quest.txt
@@ -0,0 +1,19 @@
+Si consideri il seguente modello Modelica. Quale delle seguenti architetture software meglio lo rappresenta ?
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output12, sc2.input12)
+connect(sc1.output13, sc3.input13)
+connect(sc1.output14, sc4.input14)
+connect(sc2.output21, sc1.input21)
+connect(sc2.output24, sc4.input24)
+connect(sc3.output34, sc4.input34)
+connect(sc4.output41, sc1.input41)
+connect(sc4.output42, sc2.input42)
+
+
+end SysArch;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_2/wrong1.txt b/legacy/Data/ingsw/0613_2/wrong1.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0613_2/wrong2.txt b/legacy/Data/ingsw/0613_2/wrong2.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0613_2/wrong3.txt b/legacy/Data/ingsw/0613_2/wrong3.txt
new file mode 100644
index 0000000..e69de29
diff --git a/legacy/Data/ingsw/0613_20/correct.txt b/legacy/Data/ingsw/0613_20/correct.txt
new file mode 100644
index 0000000..2a2ecea
--- /dev/null
+++ b/legacy/Data/ingsw/0613_20/correct.txt
@@ -0,0 +1 @@
+time(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_20/quest.txt b/legacy/Data/ingsw/0613_20/quest.txt
new file mode 100644
index 0000000..79b69ac
--- /dev/null
+++ b/legacy/Data/ingsw/0613_20/quest.txt
@@ -0,0 +1,6 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_20.png
+Si consideri il processo software con due fasi (0 ed 1) rappresentato con la Markov chain in figura. Lo stato iniziale 0 e p in (0, 1). Il tempo necessario per completare la fase x time(x). La fase 0 la fase di design, che ha probabilit p di dover essere ripetuta causa errori. La fase 1 rappreenta il completamento del processo software, e quindi time(1) = 0.
+Il tempo di una istanza del processo software descritto sopra la somma dei tempi degli stati (fasi) attraversati (tenendo presente che si parte sempre dallo stato 0.
+Quindi il costo Time(X) della sequenza di stati X = x(0), x(1), x(2), .... Time(X) = time(x(0)) + time(x(1)) + time(x(2)) + ...
+Ad esempio se X = 0, 1 abbiamo Time(X) = time(0) + time(1) = time(0) (poich time(1) = 0).
+Quale delle seguenti formule calcola il valore atteso del costo per completare il processo software di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_20/wrong1.txt b/legacy/Data/ingsw/0613_20/wrong1.txt
new file mode 100644
index 0000000..d68fd15
--- /dev/null
+++ b/legacy/Data/ingsw/0613_20/wrong1.txt
@@ -0,0 +1 @@
+time(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_20/wrong2.txt b/legacy/Data/ingsw/0613_20/wrong2.txt
new file mode 100644
index 0000000..9927a93
--- /dev/null
+++ b/legacy/Data/ingsw/0613_20/wrong2.txt
@@ -0,0 +1 @@
+time(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_21/correct.txt b/legacy/Data/ingsw/0613_21/correct.txt
new file mode 100644
index 0000000..936832d
--- /dev/null
+++ b/legacy/Data/ingsw/0613_21/correct.txt
@@ -0,0 +1 @@
+3*A + 6*B
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_21/quest.txt b/legacy/Data/ingsw/0613_21/quest.txt
new file mode 100644
index 0000000..07ce5c9
--- /dev/null
+++ b/legacy/Data/ingsw/0613_21/quest.txt
@@ -0,0 +1 @@
+Il team di sviluppo di un azienda consiste di un senior software engineer e due sviluppatori junior. Usando un approccio plan-driven (ad esempio, water-fall) la fase di design impegna solo il membro senior per tre mesi e la fase di sviluppo e testing solo i due membri junior per tre mesi. Si assuma che non ci siano "change requests" e che il membro senior costi A Eur/mese ed i membri junior B Eur/mese. Qual'e' il costo dello sviluppo usando un approccio plan-driven come sopra ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_21/wrong1.txt b/legacy/Data/ingsw/0613_21/wrong1.txt
new file mode 100644
index 0000000..316107c
--- /dev/null
+++ b/legacy/Data/ingsw/0613_21/wrong1.txt
@@ -0,0 +1 @@
+A + 2*B
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_21/wrong2.txt b/legacy/Data/ingsw/0613_21/wrong2.txt
new file mode 100644
index 0000000..68f09b9
--- /dev/null
+++ b/legacy/Data/ingsw/0613_21/wrong2.txt
@@ -0,0 +1 @@
+3*A + 3*B
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_22/correct.txt b/legacy/Data/ingsw/0613_22/correct.txt
new file mode 100644
index 0000000..2ca9276
--- /dev/null
+++ b/legacy/Data/ingsw/0613_22/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 35%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_22/quest.txt b/legacy/Data/ingsw/0613_22/quest.txt
new file mode 100644
index 0000000..aef94a6
--- /dev/null
+++ b/legacy/Data/ingsw/0613_22/quest.txt
@@ -0,0 +1,13 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_22.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 act2 act1 act0
+Test case 2: act2 act2 act0 act2 act2
+Test case 3: act1 act1 act2 act2
+
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_22/wrong1.txt b/legacy/Data/ingsw/0613_22/wrong1.txt
new file mode 100644
index 0000000..5623b39
--- /dev/null
+++ b/legacy/Data/ingsw/0613_22/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 65%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_22/wrong2.txt b/legacy/Data/ingsw/0613_22/wrong2.txt
new file mode 100644
index 0000000..c376ef7
--- /dev/null
+++ b/legacy/Data/ingsw/0613_22/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 55%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_23/correct.txt b/legacy/Data/ingsw/0613_23/correct.txt
new file mode 100644
index 0000000..4a8e634
--- /dev/null
+++ b/legacy/Data/ingsw/0613_23/correct.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) > 0) and (y <= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_23/quest.txt b/legacy/Data/ingsw/0613_23/quest.txt
new file mode 100644
index 0000000..576af1a
--- /dev/null
+++ b/legacy/Data/ingsw/0613_23/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+RQ: Dopo 60 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se 10 unit di tempo nel passato era stata richiesta una risorsa (variabile x positiva) allora ora concesso l'accesso alla risorsa (variabile y positiva)
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time < w e ritorna il valore che z aveva al tempo (time - w), se time >= w.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_23/wrong1.txt b/legacy/Data/ingsw/0613_23/wrong1.txt
new file mode 100644
index 0000000..68aa37a
--- /dev/null
+++ b/legacy/Data/ingsw/0613_23/wrong1.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) or (delay(x, 10) > 0) or (y <= 0);
+
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_23/wrong2.txt b/legacy/Data/ingsw/0613_23/wrong2.txt
new file mode 100644
index 0000000..a43796b
--- /dev/null
+++ b/legacy/Data/ingsw/0613_23/wrong2.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) > 0) and (y > 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_24/correct.txt b/legacy/Data/ingsw/0613_24/correct.txt
new file mode 100644
index 0000000..5464d05
--- /dev/null
+++ b/legacy/Data/ingsw/0613_24/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 30%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_24/quest.txt b/legacy/Data/ingsw/0613_24/quest.txt
new file mode 100644
index 0000000..9534ab3
--- /dev/null
+++ b/legacy/Data/ingsw/0613_24/quest.txt
@@ -0,0 +1,13 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_24.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 act2
+Test case 2: act1
+Test case 3: act2 act0 act2 act0 act2
+
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_24/wrong1.txt b/legacy/Data/ingsw/0613_24/wrong1.txt
new file mode 100644
index 0000000..8b0c318
--- /dev/null
+++ b/legacy/Data/ingsw/0613_24/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_24/wrong2.txt b/legacy/Data/ingsw/0613_24/wrong2.txt
new file mode 100644
index 0000000..cf27703
--- /dev/null
+++ b/legacy/Data/ingsw/0613_24/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_25/correct.txt b/legacy/Data/ingsw/0613_25/correct.txt
new file mode 100644
index 0000000..e74b1fc
--- /dev/null
+++ b/legacy/Data/ingsw/0613_25/correct.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x > y) then (z == x) else (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_25/quest.txt b/legacy/Data/ingsw/0613_25/quest.txt
new file mode 100644
index 0000000..c1cd6d0
--- /dev/null
+++ b/legacy/Data/ingsw/0613_25/quest.txt
@@ -0,0 +1,9 @@
+Un test oracle per un programma P una funzione booleana che ha come inputs gli inputs ed outputs di P e ritorna true se e solo se il valore di output di P (con i dati inputs) quello atteso dalle specifiche.
+Si consideri la seguente funzione C:
+-----------
+int f(int x, int y) {
+int z = x;
+while ( (x <= z) && (z <= y) ) { z = z + 1; }
+return (z);
+}
+Siano x, y, gli inputs del programma (f nel nostro caso) e z l'output. Assumendo il programma corretto, quale delle seguenti funzioni booleane F(x, y, z) un test oracle per la funzione f.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_25/wrong1.txt b/legacy/Data/ingsw/0613_25/wrong1.txt
new file mode 100644
index 0000000..d63544a
--- /dev/null
+++ b/legacy/Data/ingsw/0613_25/wrong1.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x > y) then (z == x + 1) else (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_25/wrong2.txt b/legacy/Data/ingsw/0613_25/wrong2.txt
new file mode 100644
index 0000000..1753a91
--- /dev/null
+++ b/legacy/Data/ingsw/0613_25/wrong2.txt
@@ -0,0 +1 @@
+F(x, y, z) = (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_26/correct.txt b/legacy/Data/ingsw/0613_26/correct.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0613_26/correct.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_26/quest.txt b/legacy/Data/ingsw/0613_26/quest.txt
new file mode 100644
index 0000000..dcec721
--- /dev/null
+++ b/legacy/Data/ingsw/0613_26/quest.txt
@@ -0,0 +1,8 @@
+Il partition coverage di un insieme di test cases la percentuale di elementi della partition inclusi nei test cases. La partition una partizione finita dell'insieme di input della funzione che si sta testando.
+Si consideri la seguente funzione C:
+int f1(int x) { return (2*x); }
+Si vuole testare la funzione f1(). A tal fine l'insieme degli interi viene partizionato come segue:
+{(-inf, -11], [-10, -1], {0}, [1, 50], [51, +inf)}
+Si consideri il seguente insieme di test cases:
+{x=-20, x= 10, x=60}
+Quale delle seguenti la partition coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_26/wrong1.txt b/legacy/Data/ingsw/0613_26/wrong1.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0613_26/wrong1.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_26/wrong2.txt b/legacy/Data/ingsw/0613_26/wrong2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0613_26/wrong2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_27/quest.txt b/legacy/Data/ingsw/0613_27/quest.txt
new file mode 100644
index 0000000..35670bc
--- /dev/null
+++ b/legacy/Data/ingsw/0613_27/quest.txt
@@ -0,0 +1,4 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_27.png
+Si consideri la seguente architettura software:
+
+Quale dei seguenti modelli Modelica meglio la rappresenta.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_27/wrong1.txt b/legacy/Data/ingsw/0613_27/wrong1.txt
new file mode 100644
index 0000000..4bcd55f
--- /dev/null
+++ b/legacy/Data/ingsw/0613_27/wrong1.txt
@@ -0,0 +1,8 @@
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output12, sc
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_27/wrong2.txt b/legacy/Data/ingsw/0613_27/wrong2.txt
new file mode 100644
index 0000000..19be218
--- /dev/null
+++ b/legacy/Data/ingsw/0613_27/wrong2.txt
@@ -0,0 +1,2 @@
+input12)
+connect(sc1.output13, sc
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_27/wrong3.txt b/legacy/Data/ingsw/0613_27/wrong3.txt
new file mode 100644
index 0000000..29daf30
--- /dev/null
+++ b/legacy/Data/ingsw/0613_27/wrong3.txt
@@ -0,0 +1,49 @@
+input13)
+connect(sc1.output14, sc4.input14)
+connect(sc2.output21, sc1.input21)
+connect(sc2.output23, sc3.input23)
+connect(sc2.output24, sc4.input24)
+connect(sc3.output32, sc2.input32)
+connect(sc3.output34, sc4.input34)
+connect(sc4.output41, sc1.input41)
+
+
+end SysArch;
+
+2.
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output12, sc2.input12)
+connect(sc1.output14, sc4.input14)
+connect(sc2.output23, sc3.input23)
+connect(sc2.output24, sc4.input24)
+connect(sc3.output31, sc1.input31)
+connect(sc3.output32, sc2.input32)
+connect(sc3.output34, sc4.input34)
+
+
+end SysArch;
+
+3.
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output12, sc2.input12)
+connect(sc1.output13, sc3.input13)
+connect(sc1.output14, sc4.input14)
+connect(sc2.output21, sc1.input21)
+connect(sc2.output24, sc4.input24)
+connect(sc3.output34, sc4.input34)
+connect(sc4.output41, sc1.input41)
+
+
+end SysArch;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_28/correct.txt b/legacy/Data/ingsw/0613_28/correct.txt
new file mode 100644
index 0000000..973ef63
--- /dev/null
+++ b/legacy/Data/ingsw/0613_28/correct.txt
@@ -0,0 +1 @@
+State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_28/quest.txt b/legacy/Data/ingsw/0613_28/quest.txt
new file mode 100644
index 0000000..32aecd3
--- /dev/null
+++ b/legacy/Data/ingsw/0613_28/quest.txt
@@ -0,0 +1,11 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_28.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+Test case 1: act2 act0 act1 act0
+Test case 2: act2 act0 act0
+Test case 3: act2 act0 act2 act1 act1
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_28/wrong1.txt b/legacy/Data/ingsw/0613_28/wrong1.txt
new file mode 100644
index 0000000..f6a4b07
--- /dev/null
+++ b/legacy/Data/ingsw/0613_28/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_28/wrong2.txt b/legacy/Data/ingsw/0613_28/wrong2.txt
new file mode 100644
index 0000000..90b2f35
--- /dev/null
+++ b/legacy/Data/ingsw/0613_28/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_29/correct.txt b/legacy/Data/ingsw/0613_29/correct.txt
new file mode 100644
index 0000000..7a6c6b9
--- /dev/null
+++ b/legacy/Data/ingsw/0613_29/correct.txt
@@ -0,0 +1 @@
+300000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_29/quest.txt b/legacy/Data/ingsw/0613_29/quest.txt
new file mode 100644
index 0000000..47201e7
--- /dev/null
+++ b/legacy/Data/ingsw/0613_29/quest.txt
@@ -0,0 +1,4 @@
+Il rischio R pu essere calcolato come R = P*C, dove P la probabilit dell'evento avverso (software failure nel nostro contesto) e C il costo dell'occorrenza dell'evento avverso.
+Assumiamo che la probabilit P sia legata al costo di sviluppo S dalla formula
+P = 10^{(-b*S)} (cio 10 elevato alla (-b*S))
+dove b una opportuna costante note da dati storici aziendali. Si assuma che b = 0.0001, C = 1000000, ed il rischio ammesso R = 1000. Quale dei seguenti valori meglio approssima il costo S per lo sviluppo del software in questione.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_29/wrong1.txt b/legacy/Data/ingsw/0613_29/wrong1.txt
new file mode 100644
index 0000000..997967b
--- /dev/null
+++ b/legacy/Data/ingsw/0613_29/wrong1.txt
@@ -0,0 +1 @@
+700000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_29/wrong2.txt b/legacy/Data/ingsw/0613_29/wrong2.txt
new file mode 100644
index 0000000..2df501e
--- /dev/null
+++ b/legacy/Data/ingsw/0613_29/wrong2.txt
@@ -0,0 +1 @@
+500000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_3/correct.txt b/legacy/Data/ingsw/0613_3/correct.txt
new file mode 100644
index 0000000..3fb437d
--- /dev/null
+++ b/legacy/Data/ingsw/0613_3/correct.txt
@@ -0,0 +1 @@
+0.56
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_3/quest.txt b/legacy/Data/ingsw/0613_3/quest.txt
new file mode 100644
index 0000000..d8bc097
--- /dev/null
+++ b/legacy/Data/ingsw/0613_3/quest.txt
@@ -0,0 +1,9 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_3.png
+Un processo software pu essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del prcoesso software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilit della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+Ad esempio lo state diagram in figura
+
+
+
+Rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.3 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilit 0.2 di dover essere ripetuta (a causa di errori).
+Uno scenario una sequenza di stati.
+Qual'e' la probabilit dello scenario: 1, 3 ? In altri terminti, qual' la probabilit che non sia necessario ripetere nessuna fase?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_3/wrong1.txt b/legacy/Data/ingsw/0613_3/wrong1.txt
new file mode 100644
index 0000000..fc54e00
--- /dev/null
+++ b/legacy/Data/ingsw/0613_3/wrong1.txt
@@ -0,0 +1 @@
+0.24
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_3/wrong2.txt b/legacy/Data/ingsw/0613_3/wrong2.txt
new file mode 100644
index 0000000..c64601b
--- /dev/null
+++ b/legacy/Data/ingsw/0613_3/wrong2.txt
@@ -0,0 +1 @@
+0.14
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_30/correct.txt b/legacy/Data/ingsw/0613_30/correct.txt
new file mode 100644
index 0000000..973ef63
--- /dev/null
+++ b/legacy/Data/ingsw/0613_30/correct.txt
@@ -0,0 +1 @@
+State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_30/quest.txt b/legacy/Data/ingsw/0613_30/quest.txt
new file mode 100644
index 0000000..56ab57a
--- /dev/null
+++ b/legacy/Data/ingsw/0613_30/quest.txt
@@ -0,0 +1,11 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_30.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+Test case 1: act0 act0 act0 act1 act1
+Test case 2: act1 act0 act1
+Test case 3: act0 act2 act2 act2
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_30/wrong1.txt b/legacy/Data/ingsw/0613_30/wrong1.txt
new file mode 100644
index 0000000..90b2f35
--- /dev/null
+++ b/legacy/Data/ingsw/0613_30/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_30/wrong2.txt b/legacy/Data/ingsw/0613_30/wrong2.txt
new file mode 100644
index 0000000..f6a4b07
--- /dev/null
+++ b/legacy/Data/ingsw/0613_30/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_31/correct.txt b/legacy/Data/ingsw/0613_31/correct.txt
new file mode 100644
index 0000000..f6a4b07
--- /dev/null
+++ b/legacy/Data/ingsw/0613_31/correct.txt
@@ -0,0 +1 @@
+State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_31/quest.txt b/legacy/Data/ingsw/0613_31/quest.txt
new file mode 100644
index 0000000..9f9ed74
--- /dev/null
+++ b/legacy/Data/ingsw/0613_31/quest.txt
@@ -0,0 +1,12 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_31.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+Test case 1: act1 act2 act2 act2 act0
+Test case 2: act1 act0 act1 act1 act1
+Test case 3: act1 act2 act2 act2 act2
+
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_31/wrong1.txt b/legacy/Data/ingsw/0613_31/wrong1.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0613_31/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_31/wrong2.txt b/legacy/Data/ingsw/0613_31/wrong2.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/0613_31/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_32/correct.txt b/legacy/Data/ingsw/0613_32/correct.txt
new file mode 100644
index 0000000..b110af1
--- /dev/null
+++ b/legacy/Data/ingsw/0613_32/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_32/quest.txt b/legacy/Data/ingsw/0613_32/quest.txt
new file mode 100644
index 0000000..1724f1c
--- /dev/null
+++ b/legacy/Data/ingsw/0613_32/quest.txt
@@ -0,0 +1,13 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_32.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: act0 act2 act0 act0 act2
+Test case 2: act1 act0 act0 act0
+Test case 3: act0 act2 act2 act0 act2
+
+Quale delle seguenti la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_32/wrong1.txt b/legacy/Data/ingsw/0613_32/wrong1.txt
new file mode 100644
index 0000000..8b0c318
--- /dev/null
+++ b/legacy/Data/ingsw/0613_32/wrong1.txt
@@ -0,0 +1 @@
+Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_32/wrong2.txt b/legacy/Data/ingsw/0613_32/wrong2.txt
new file mode 100644
index 0000000..cf27703
--- /dev/null
+++ b/legacy/Data/ingsw/0613_32/wrong2.txt
@@ -0,0 +1 @@
+Transition coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_33/correct.txt b/legacy/Data/ingsw/0613_33/correct.txt
new file mode 100644
index 0000000..e940faa
--- /dev/null
+++ b/legacy/Data/ingsw/0613_33/correct.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x >= 0) && (y >= 0) && ((x > 3) || (y > 3)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_33/quest.txt b/legacy/Data/ingsw/0613_33/quest.txt
new file mode 100644
index 0000000..2758118
--- /dev/null
+++ b/legacy/Data/ingsw/0613_33/quest.txt
@@ -0,0 +1,4 @@
+Pre-condizioni, invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in ). In particolare, assert(expre) non fa nulla se l'espressione expre vale TRUE (cio non 0), stampa un messaggio di errore su stderr e abortisce l'esecuzione del programma altrimenti.
+Si consideri la funzione C
+int f(int x, int y) { ..... }
+Quale delle seguenti assert esprime la pre-condizione che entrambi gli argomenti di f sono non-negativi ed almeno uno di loro maggiore di 3 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_33/wrong1.txt b/legacy/Data/ingsw/0613_33/wrong1.txt
new file mode 100644
index 0000000..ad32d88
--- /dev/null
+++ b/legacy/Data/ingsw/0613_33/wrong1.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x >= 0) && (y >= 0) && ((x >= 3) || (y >= 3)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_33/wrong2.txt b/legacy/Data/ingsw/0613_33/wrong2.txt
new file mode 100644
index 0000000..642ec6b
--- /dev/null
+++ b/legacy/Data/ingsw/0613_33/wrong2.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x > 0) && (y > 0) && ((x >= 3) || (y > 3)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_34/correct.txt b/legacy/Data/ingsw/0613_34/correct.txt
new file mode 100644
index 0000000..e7c5bb8
--- /dev/null
+++ b/legacy/Data/ingsw/0613_34/correct.txt
@@ -0,0 +1 @@
+Assicurarsi che, tenedo conto della tecnologia, budget e tempo disponibili, sia possibile realizzare un sistema che soddisfa i requisisti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_34/quest.txt b/legacy/Data/ingsw/0613_34/quest.txt
new file mode 100644
index 0000000..296cdcb
--- /dev/null
+++ b/legacy/Data/ingsw/0613_34/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive l'obiettivo del "check di realismo" (realizability) che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_34/wrong1.txt b/legacy/Data/ingsw/0613_34/wrong1.txt
new file mode 100644
index 0000000..bfb5124
--- /dev/null
+++ b/legacy/Data/ingsw/0613_34/wrong1.txt
@@ -0,0 +1 @@
+Assicurarsi che le performance richieste al sistema siano necessarie per soddisfare le necessità del customer.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_34/wrong2.txt b/legacy/Data/ingsw/0613_34/wrong2.txt
new file mode 100644
index 0000000..2b6e242
--- /dev/null
+++ b/legacy/Data/ingsw/0613_34/wrong2.txt
@@ -0,0 +1 @@
+Assicurarsi che le funzionalità richieste al sistema siano necessarie per soddisfare le necessità del customer.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_35/correct.txt b/legacy/Data/ingsw/0613_35/correct.txt
new file mode 100644
index 0000000..ad21063
--- /dev/null
+++ b/legacy/Data/ingsw/0613_35/correct.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) and (delay(x, 10) > 1) and (y < 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_35/quest.txt b/legacy/Data/ingsw/0613_35/quest.txt
new file mode 100644
index 0000000..031c331
--- /dev/null
+++ b/legacy/Data/ingsw/0613_35/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+RQ: Dopo 40 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se 10 unit di tempo nel passato x era maggiore di 1 allora ora y nonegativa.
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time <= w e ritorna il valore che z aveva al tempo (time - w), se time = w.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_35/wrong1.txt b/legacy/Data/ingsw/0613_35/wrong1.txt
new file mode 100644
index 0000000..b14ac60
--- /dev/null
+++ b/legacy/Data/ingsw/0613_35/wrong1.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) and (delay(x, 10) > 1) and (y >= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_35/wrong2.txt b/legacy/Data/ingsw/0613_35/wrong2.txt
new file mode 100644
index 0000000..e4201ab
--- /dev/null
+++ b/legacy/Data/ingsw/0613_35/wrong2.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) or (delay(x, 10) > 1) or (y < 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_36/correct.txt b/legacy/Data/ingsw/0613_36/correct.txt
new file mode 100644
index 0000000..1c7da8c
--- /dev/null
+++ b/legacy/Data/ingsw/0613_36/correct.txt
@@ -0,0 +1 @@
+0.03
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_36/quest.txt b/legacy/Data/ingsw/0613_36/quest.txt
new file mode 100644
index 0000000..58782d5
--- /dev/null
+++ b/legacy/Data/ingsw/0613_36/quest.txt
@@ -0,0 +1,9 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_36.png
+Un processo software pu essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del prcoesso software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilit della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+Ad esempio lo state diagram in figura
+
+
+
+Rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.3 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilit 0.1 di dover essere ripetuta (a causa di errori).
+Uno scenario una sequenza di stati.
+Qual'e' la probabilit dello scenario: 1, 2, 3, 4 ? In altri terminti, qual' la probabilit che sia necessario ripetere sia la fase 1 che la fase 2 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_36/wrong1.txt b/legacy/Data/ingsw/0613_36/wrong1.txt
new file mode 100644
index 0000000..8a346b7
--- /dev/null
+++ b/legacy/Data/ingsw/0613_36/wrong1.txt
@@ -0,0 +1 @@
+0.07
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_36/wrong2.txt b/legacy/Data/ingsw/0613_36/wrong2.txt
new file mode 100644
index 0000000..7eb6830
--- /dev/null
+++ b/legacy/Data/ingsw/0613_36/wrong2.txt
@@ -0,0 +1 @@
+0.27
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_37/correct.txt b/legacy/Data/ingsw/0613_37/correct.txt
new file mode 100644
index 0000000..a7029bc
--- /dev/null
+++ b/legacy/Data/ingsw/0613_37/correct.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [1, 4] oppure nell'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_37/quest.txt b/legacy/Data/ingsw/0613_37/quest.txt
new file mode 100644
index 0000000..e5fbc81
--- /dev/null
+++ b/legacy/Data/ingsw/0613_37/quest.txt
@@ -0,0 +1,16 @@
+Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato.
+block Monitor
+input Real x;
+output Boolean y;
+Boolean w;
+initial equation
+y = false;
+equation
+w = ((x < 1) or (x > 4)) and ((x < 15) or (x > 20));
+algorithm
+when edge(w) then
+y := true;
+end when;
+end Monitor;
+
+Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_37/wrong1.txt b/legacy/Data/ingsw/0613_37/wrong1.txt
new file mode 100644
index 0000000..710b111
--- /dev/null
+++ b/legacy/Data/ingsw/0613_37/wrong1.txt
@@ -0,0 +1 @@
+La variabile x è fuori dall'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_37/wrong2.txt b/legacy/Data/ingsw/0613_37/wrong2.txt
new file mode 100644
index 0000000..a82929b
--- /dev/null
+++ b/legacy/Data/ingsw/0613_37/wrong2.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_38/quest.txt b/legacy/Data/ingsw/0613_38/quest.txt
new file mode 100644
index 0000000..230115c
--- /dev/null
+++ b/legacy/Data/ingsw/0613_38/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_38.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_38/wrong1.txt b/legacy/Data/ingsw/0613_38/wrong1.txt
new file mode 100644
index 0000000..00b636b
--- /dev/null
+++ b/legacy/Data/ingsw/0613_38/wrong1.txt
@@ -0,0 +1,35 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_38/wrong2.txt b/legacy/Data/ingsw/0613_38/wrong2.txt
new file mode 100644
index 0000000..dc39134
--- /dev/null
+++ b/legacy/Data/ingsw/0613_38/wrong2.txt
@@ -0,0 +1,34 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_38/wrong3.txt b/legacy/Data/ingsw/0613_38/wrong3.txt
new file mode 100644
index 0000000..6a9ef82
--- /dev/null
+++ b/legacy/Data/ingsw/0613_38/wrong3.txt
@@ -0,0 +1,35 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_39/correct.txt b/legacy/Data/ingsw/0613_39/correct.txt
new file mode 100644
index 0000000..b9f32a6
--- /dev/null
+++ b/legacy/Data/ingsw/0613_39/correct.txt
@@ -0,0 +1 @@
+c(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_39/quest.txt b/legacy/Data/ingsw/0613_39/quest.txt
new file mode 100644
index 0000000..24a64fe
--- /dev/null
+++ b/legacy/Data/ingsw/0613_39/quest.txt
@@ -0,0 +1,6 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_39.png
+Si consideri il processo software con due fasi (0 ed 1) rappresentato con la Markov chain in figura. Lo stato iniziale 0 e p in (0, 1). Il costo dello stato (fase) x c(x). La fase 0 la fase di design, che ha probabilit p di dover essere ripetuta causa errori. La fase 1 rappreenta il completamento del processo software, e quindi c(1) = 0.
+Il costo di una istanza del processo software descritto sopra la somma dei costi degli stati attraversati (tenendo presente che si parte sempre dallo stato 0.
+Quindi il costo C(X) della sequenza di stati X = x(0), x(1), x(2), .... C(X) = c(x(0)) + c(x(1)) + c(x(2)) + ...
+Ad esempio se X = 0, 1 abbiamo C(X) = c(0) + c(1) = c(0) (poich c(1) = 0).
+Quale delle seguenti formule calcola il valore atteso del costo per completare il processo software di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_39/wrong1.txt b/legacy/Data/ingsw/0613_39/wrong1.txt
new file mode 100644
index 0000000..70022eb
--- /dev/null
+++ b/legacy/Data/ingsw/0613_39/wrong1.txt
@@ -0,0 +1 @@
+c(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_39/wrong2.txt b/legacy/Data/ingsw/0613_39/wrong2.txt
new file mode 100644
index 0000000..3143da9
--- /dev/null
+++ b/legacy/Data/ingsw/0613_39/wrong2.txt
@@ -0,0 +1 @@
+c(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_4/correct.txt b/legacy/Data/ingsw/0613_4/correct.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0613_4/correct.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_4/quest.txt b/legacy/Data/ingsw/0613_4/quest.txt
new file mode 100644
index 0000000..5cf5cae
--- /dev/null
+++ b/legacy/Data/ingsw/0613_4/quest.txt
@@ -0,0 +1,12 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_4.png
+La state coverage di un insieme di test cases (cio sequenze di inputs) per uno state diagram la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+Test case 1: act0 act0 act0
+Test case 2: act1 act0 act2 act1 act0
+Test case 3: act1 act2 act2 act0 act2
+
+Quale delle seguenti la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_4/wrong1.txt b/legacy/Data/ingsw/0613_4/wrong1.txt
new file mode 100644
index 0000000..a8aead7
--- /dev/null
+++ b/legacy/Data/ingsw/0613_4/wrong1.txt
@@ -0,0 +1 @@
+State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_4/wrong2.txt b/legacy/Data/ingsw/0613_4/wrong2.txt
new file mode 100644
index 0000000..90b2f35
--- /dev/null
+++ b/legacy/Data/ingsw/0613_4/wrong2.txt
@@ -0,0 +1 @@
+State coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_40/quest.txt b/legacy/Data/ingsw/0613_40/quest.txt
new file mode 100644
index 0000000..2959407
--- /dev/null
+++ b/legacy/Data/ingsw/0613_40/quest.txt
@@ -0,0 +1,2 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_40.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_40/wrong1.txt b/legacy/Data/ingsw/0613_40/wrong1.txt
new file mode 100644
index 0000000..f919b6b
--- /dev/null
+++ b/legacy/Data/ingsw/0613_40/wrong1.txt
@@ -0,0 +1,36 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 2;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_40/wrong2.txt b/legacy/Data/ingsw/0613_40/wrong2.txt
new file mode 100644
index 0000000..fc9e0aa
--- /dev/null
+++ b/legacy/Data/ingsw/0613_40/wrong2.txt
@@ -0,0 +1,36 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_40/wrong3.txt b/legacy/Data/ingsw/0613_40/wrong3.txt
new file mode 100644
index 0000000..e537817
--- /dev/null
+++ b/legacy/Data/ingsw/0613_40/wrong3.txt
@@ -0,0 +1,35 @@
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+algorithm
+
+when initial() then
+x := 0;
+
+elsewhen sample(0,T) then
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+else x := pre(x); // default
+end if;
+
+end when;
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_41/quest.txt b/legacy/Data/ingsw/0613_41/quest.txt
new file mode 100644
index 0000000..99379e6
--- /dev/null
+++ b/legacy/Data/ingsw/0613_41/quest.txt
@@ -0,0 +1,4 @@
+Pre-condizioni, invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in ). In particolare, assert(expre) non fa nulla se l'espressione expre vale TRUE (cio non 0), stampa un messaggio di errore su stderr e abortisce l'esecuzione del programma altrimenti.
+Si consideri la funzione C
+int f(int x, int y) { ..... }
+Quale delle seguenti assert esprime l'invariante che le variabili locali z e w di f() hanno somma minore di 1 oppure maggiore di 7 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_41/wrong1.txt b/legacy/Data/ingsw/0613_41/wrong1.txt
new file mode 100644
index 0000000..cbf1814
--- /dev/null
+++ b/legacy/Data/ingsw/0613_41/wrong1.txt
@@ -0,0 +1,6 @@
+int f(in x, int y)
+{
+int z, w;
+assert( (z + w <= 1) || (z + w >= 7));
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_41/wrong2.txt b/legacy/Data/ingsw/0613_41/wrong2.txt
new file mode 100644
index 0000000..6fcb8b5
--- /dev/null
+++ b/legacy/Data/ingsw/0613_41/wrong2.txt
@@ -0,0 +1,6 @@
+int f(in x, int y)
+{
+int z, w;
+assert( (z + w > 1) || (z + w < 7));
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_41/wrong3.txt b/legacy/Data/ingsw/0613_41/wrong3.txt
new file mode 100644
index 0000000..03b9f52
--- /dev/null
+++ b/legacy/Data/ingsw/0613_41/wrong3.txt
@@ -0,0 +1,6 @@
+int f(in x, int y)
+{
+int z, w;
+assert( (z + w < 1) || (z + w > 7));
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_42/correct.txt b/legacy/Data/ingsw/0613_42/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0613_42/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_42/quest.txt b/legacy/Data/ingsw/0613_42/quest.txt
new file mode 100644
index 0000000..2bda796
--- /dev/null
+++ b/legacy/Data/ingsw/0613_42/quest.txt
@@ -0,0 +1,29 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x[3])
+{
+ if (x[0] + x[1] - x[2] < -7)
+ { return (0); }
+ else if (2*x[0] -3*x[1] + 4*x[2] > 7)
+ {
+ if (x[0] + x[1] + x[2] > 10)
+ { return (1); }
+ else
+ { return (0); }
+ }
+ else
+ {
+ if (2*x[0] + 3*x[1] + 4*x[2] > 9)
+ { return (1); }
+ else
+ { return (0); }
+ }
+ } /* f() */
+ed il seguente insieme di test cases:
+
+Test 1: x[0] = 1, x[1] = 1, x[2] = 1,
+Test2: x[0] = 2, x[1] = 3, x[2] = 3,
+Test 3: x[0] = -4, x[1] = -4, x[2] = 0,
+Test 4: x[0] = 3, x[1] = 0, x[2] = 4,
+Test 5: x[0] = 3, x[1] = 3, x[2] = 5.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_42/wrong1.txt b/legacy/Data/ingsw/0613_42/wrong1.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0613_42/wrong1.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_42/wrong2.txt b/legacy/Data/ingsw/0613_42/wrong2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0613_42/wrong2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_43/correct.txt b/legacy/Data/ingsw/0613_43/correct.txt
new file mode 100644
index 0000000..293ebbc
--- /dev/null
+++ b/legacy/Data/ingsw/0613_43/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 10) and (x >= 10) and (x <= 20) and ((y < 0.5*x) or (y > 0.7*x)) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_43/quest.txt b/legacy/Data/ingsw/0613_43/quest.txt
new file mode 100644
index 0000000..5922b9f
--- /dev/null
+++ b/legacy/Data/ingsw/0613_43/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ: Dopo 10 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet: se la variabile x nell'intervallo [10, 20] allora la variabile y compresa tra il 50% di x ed il 70% di x.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_43/wrong1.txt b/legacy/Data/ingsw/0613_43/wrong1.txt
new file mode 100644
index 0000000..d7890b2
--- /dev/null
+++ b/legacy/Data/ingsw/0613_43/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 10) and (x >= 10) and (x <= 20) and (y >= 0.5*x) and (y <= 0.7*x) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_43/wrong2.txt b/legacy/Data/ingsw/0613_43/wrong2.txt
new file mode 100644
index 0000000..d50b268
--- /dev/null
+++ b/legacy/Data/ingsw/0613_43/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 10) and ((x < 10) or (x > 20)) and ((y < 0.5*x) or (y > 0.7*x)) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_44/correct.txt b/legacy/Data/ingsw/0613_44/correct.txt
new file mode 100644
index 0000000..1a8a50a
--- /dev/null
+++ b/legacy/Data/ingsw/0613_44/correct.txt
@@ -0,0 +1 @@
+Per ciascun requisito, dovremmo essere in grado di scrivere un inseme di test che può dimostrare che il sistema sviluppato soddisfa il requisito considerato.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_44/quest.txt b/legacy/Data/ingsw/0613_44/quest.txt
new file mode 100644
index 0000000..793b220
--- /dev/null
+++ b/legacy/Data/ingsw/0613_44/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti frasi meglio descrive il criterio di "requirements verifiability" che parte della "requirements validation activity".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_44/wrong1.txt b/legacy/Data/ingsw/0613_44/wrong1.txt
new file mode 100644
index 0000000..fac8307
--- /dev/null
+++ b/legacy/Data/ingsw/0613_44/wrong1.txt
@@ -0,0 +1 @@
+Per ciascuna coppia di componenti, dovremmo essere in grado di scrivere un insieme di test che può dimostrare che l'interazione tra le componenti soddisfa tutti i requisiti di interfaccia.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_44/wrong2.txt b/legacy/Data/ingsw/0613_44/wrong2.txt
new file mode 100644
index 0000000..3fdb31e
--- /dev/null
+++ b/legacy/Data/ingsw/0613_44/wrong2.txt
@@ -0,0 +1 @@
+Per ciascuna componente del sistema, dovremmo essere in grado di scrivere un insieme di test che può dimostrare che essa soddisfa tutti i requisiti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_45/correct.txt b/legacy/Data/ingsw/0613_45/correct.txt
new file mode 100644
index 0000000..232aedf
--- /dev/null
+++ b/legacy/Data/ingsw/0613_45/correct.txt
@@ -0,0 +1 @@
+(a = 6, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 0).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_45/quest.txt b/legacy/Data/ingsw/0613_45/quest.txt
new file mode 100644
index 0000000..e44e320
--- /dev/null
+++ b/legacy/Data/ingsw/0613_45/quest.txt
@@ -0,0 +1,21 @@
+Una Condition una proposizione booleana, cio una espressione con valore booleano che non pu essere decomposta
+in espressioni boolean pi semplici. Ad esempio, (x + y <= 3) una condition.
+
+Una Decision una espressione booleana composta da conditions e zero o pi operatori booleani. Ad esempio, sono decisions:
+(x + y <= 3)
+((x + y <= 3) || (x - y > 7))
+Un insieme di test cases T soddisfa il criterio di Condition/Decision coverage se tutte le seguenti condizioni sono soddisfatte:
+
+1) Ciascun punto di entrata ed uscita nel programma eseguito in almeno un test;
+2) Per ogni decision d nel programma, per ogni condition c in d, esiste un test in T in cui c true ed un test in T in cui c false.
+3) Per ogni decision d nel programma, esiste un test in T in cui d true ed un test in T in cui d false.
+
+Si consideri la seguente funzione:
+int f(int a, int b, int c)
+{ if ( (a + b - 6 >= 0) && (b - c - 1 <= 0) )
+ return (1); // punto di uscita 1
+ else if ((b - c - 1 <= 0) || (b + c - 5 >= 0))
+ then return (2); // punto di uscita 2
+ else return (3); // punto di uscita 3
+}
+ Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_45/wrong1.txt b/legacy/Data/ingsw/0613_45/wrong1.txt
new file mode 100644
index 0000000..5d5c9a4
--- /dev/null
+++ b/legacy/Data/ingsw/0613_45/wrong1.txt
@@ -0,0 +1 @@
+(a = 6, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 2).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_45/wrong2.txt b/legacy/Data/ingsw/0613_45/wrong2.txt
new file mode 100644
index 0000000..2b6c292
--- /dev/null
+++ b/legacy/Data/ingsw/0613_45/wrong2.txt
@@ -0,0 +1 @@
+(a = 5, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 0).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_46/correct.txt b/legacy/Data/ingsw/0613_46/correct.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0613_46/correct.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_46/quest.txt b/legacy/Data/ingsw/0613_46/quest.txt
new file mode 100644
index 0000000..03acbcc
--- /dev/null
+++ b/legacy/Data/ingsw/0613_46/quest.txt
@@ -0,0 +1,30 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+
+int f(int x[3])
+{
+ if (-x[0] + x[1] - x[2] < -7)
+ if (-x[0] + x[1] - x[2] > 10)
+ { return (0); }
+ else
+ { return (1); }
+ else if (-3*x[0] +3*x[1] - 5*x[2] > 7)
+ {
+ return (0);
+ }
+ else
+ {
+ if (3*x[0] - 5*x[1] + 7*x[2] > 9)
+ { return (1); }
+ else
+ { return (0); }
+ }
+} /* f() */
+----------
+ed il seguente insieme di test cases:
+
+Test 1: x[0] = 2, x[1] = -3, x[2] = 4,
+Test 2: x[0] = 1, x[1] = 0, x[2] = 2,
+Test 3: x[0] = -3, x[1] = -4, x[2] = -3,
+Test 4: x[0] = 3, x[1] = -1, x[2] = -3.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_46/wrong1.txt b/legacy/Data/ingsw/0613_46/wrong1.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0613_46/wrong1.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_46/wrong2.txt b/legacy/Data/ingsw/0613_46/wrong2.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0613_46/wrong2.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_47/correct.txt b/legacy/Data/ingsw/0613_47/correct.txt
new file mode 100644
index 0000000..f3da655
--- /dev/null
+++ b/legacy/Data/ingsw/0613_47/correct.txt
@@ -0,0 +1 @@
+3*(A + 2*B)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_47/quest.txt b/legacy/Data/ingsw/0613_47/quest.txt
new file mode 100644
index 0000000..6395b05
--- /dev/null
+++ b/legacy/Data/ingsw/0613_47/quest.txt
@@ -0,0 +1 @@
+Il team di sviluppo di un azienda consiste di un senior software engineer e due sviluppatori junior. Usando un approccio agile, ogni iterazione impegna tutti e tre i membri del team per un mese ed occorrono tre iterazioni per completare lo sviluppo. Si assuma che non ci siano "change requests" e che il membro senior costi A Eur/mese ed i membri junior B Eur/mese. Qual'e' il costo dello sviluppo usando un approccio agile ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_47/wrong1.txt b/legacy/Data/ingsw/0613_47/wrong1.txt
new file mode 100644
index 0000000..316107c
--- /dev/null
+++ b/legacy/Data/ingsw/0613_47/wrong1.txt
@@ -0,0 +1 @@
+A + 2*B
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_47/wrong2.txt b/legacy/Data/ingsw/0613_47/wrong2.txt
new file mode 100644
index 0000000..82fe5c7
--- /dev/null
+++ b/legacy/Data/ingsw/0613_47/wrong2.txt
@@ -0,0 +1 @@
+3*A + 2*B
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_48/correct.txt b/legacy/Data/ingsw/0613_48/correct.txt
new file mode 100644
index 0000000..ce9968f
--- /dev/null
+++ b/legacy/Data/ingsw/0613_48/correct.txt
@@ -0,0 +1 @@
+0.28
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_48/quest.txt b/legacy/Data/ingsw/0613_48/quest.txt
new file mode 100644
index 0000000..adccf3a
--- /dev/null
+++ b/legacy/Data/ingsw/0613_48/quest.txt
@@ -0,0 +1,9 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_48.png
+Un processo software pu essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del processo software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilit della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+Ad esempio lo state diagram in figura
+
+
+
+Rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.4 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilit 0.3 di dover essere ripetuta (a causa di errori).
+Uno scenario una sequenza di stati.
+Qual'e' la probabilit dello scenario: 1, 2, 3? In altri terminti, qual' la probabilit che non sia necessario ripetere la prima fase (ma non la seconda) ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_48/wrong1.txt b/legacy/Data/ingsw/0613_48/wrong1.txt
new file mode 100644
index 0000000..f2bb2d0
--- /dev/null
+++ b/legacy/Data/ingsw/0613_48/wrong1.txt
@@ -0,0 +1 @@
+0.12
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_48/wrong2.txt b/legacy/Data/ingsw/0613_48/wrong2.txt
new file mode 100644
index 0000000..e8f9017
--- /dev/null
+++ b/legacy/Data/ingsw/0613_48/wrong2.txt
@@ -0,0 +1 @@
+0.42
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_49/correct.txt b/legacy/Data/ingsw/0613_49/correct.txt
new file mode 100644
index 0000000..4c75070
--- /dev/null
+++ b/legacy/Data/ingsw/0613_49/correct.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x < 0.6*y) and (x + y <= 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_49/quest.txt b/legacy/Data/ingsw/0613_49/quest.txt
new file mode 100644
index 0000000..e11a044
--- /dev/null
+++ b/legacy/Data/ingsw/0613_49/quest.txt
@@ -0,0 +1,4 @@
+Si consideri il seguente requisito:
+RQ: Dopo 50 unit di tempo dall'inizio dell'esecuzione vale la seguente propriet:
+se la variabile x minore del 60% della variabile y allora la somma di x ed y maggiore del 30% della variabile z
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_49/wrong1.txt b/legacy/Data/ingsw/0613_49/wrong1.txt
new file mode 100644
index 0000000..6dafe94
--- /dev/null
+++ b/legacy/Data/ingsw/0613_49/wrong1.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x < 0.6*y) and (x + y > 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_49/wrong2.txt b/legacy/Data/ingsw/0613_49/wrong2.txt
new file mode 100644
index 0000000..a3d79a4
--- /dev/null
+++ b/legacy/Data/ingsw/0613_49/wrong2.txt
@@ -0,0 +1,16 @@
+
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x >= 0.6*y) and (x + y <= 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_5/correct.txt b/legacy/Data/ingsw/0613_5/correct.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0613_5/correct.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_5/quest.txt b/legacy/Data/ingsw/0613_5/quest.txt
new file mode 100644
index 0000000..579b39b
--- /dev/null
+++ b/legacy/Data/ingsw/0613_5/quest.txt
@@ -0,0 +1,29 @@
+Il branch coverage di un insieme di test cases la percentuale di branch del programma che sono attraversati da almeno un test case.
+Si consideri la seguente funzione C:
+-----------
+int f(int x[3])
+{
+ if (-x[0] + x[1] - x[2] < -7)
+ if (-x[0] + x[1] - x[2] > 10)
+ { return (0); }
+ else
+ { return (1); }
+ else if (-3*x[0] +3*x[1] - 5*x[2] > 7)
+ {
+ if (3*x[0] - 5*x[1] + 7*x[2] > 9)
+ { return (0); }
+ else
+ { return (1); }
+ }
+ else
+ {
+ return (0);
+ }
+
+} /* f() */
+----------
+ed il seguente insieme di test cases:
+
+Test 1: x[0] = 1, x[1] = 5, x[2] = 3,
+Test 2: x[0] = 4, x[1] = -2, x[2] = 2,
+Test 3: x[0] = 5, x[1] = 3, x[2] = -4.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_5/wrong1.txt b/legacy/Data/ingsw/0613_5/wrong1.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0613_5/wrong1.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_5/wrong2.txt b/legacy/Data/ingsw/0613_5/wrong2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0613_5/wrong2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_6/correct.txt b/legacy/Data/ingsw/0613_6/correct.txt
new file mode 100644
index 0000000..a98afd2
--- /dev/null
+++ b/legacy/Data/ingsw/0613_6/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 20) and ((x >= 30) or (x <= 20)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_6/quest.txt b/legacy/Data/ingsw/0613_6/quest.txt
new file mode 100644
index 0000000..b420aaf
--- /dev/null
+++ b/legacy/Data/ingsw/0613_6/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ1: Dopo 20 unit di tempo dall'inizio dell'esecuzione la variabile x sempre nell'intervallo [20, 30] .
+Quale dei seguenti monitor meglio descrive il requisito RQ1 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_6/wrong1.txt b/legacy/Data/ingsw/0613_6/wrong1.txt
new file mode 100644
index 0000000..66064fe
--- /dev/null
+++ b/legacy/Data/ingsw/0613_6/wrong1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 20) and (x >= 20) and (x <= 30) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_6/wrong2.txt b/legacy/Data/ingsw/0613_6/wrong2.txt
new file mode 100644
index 0000000..c71f1f5
--- /dev/null
+++ b/legacy/Data/ingsw/0613_6/wrong2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 20) or ((x >= 20) and (x <= 30)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_7/correct.txt b/legacy/Data/ingsw/0613_7/correct.txt
new file mode 100644
index 0000000..a40ea7d
--- /dev/null
+++ b/legacy/Data/ingsw/0613_7/correct.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 5, c = 0), (a=50, b = 3, c = 0).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_7/quest.txt b/legacy/Data/ingsw/0613_7/quest.txt
new file mode 100644
index 0000000..dbd72c0
--- /dev/null
+++ b/legacy/Data/ingsw/0613_7/quest.txt
@@ -0,0 +1,22 @@
+Una Condition una proposizione booleana, cio una espressione con valore booleano che non pu essere decomposta
+in espressioni boolean pi semplici. Ad esempio, (x + y <= 3) una condition.
+
+Una Decision una espressione booleana composta da conditions e zero o pi operatori booleani. Ad esempio, sono decisions:
+(x + y <= 3)
+((x + y <= 3) || (x - y > 7))
+Un insieme di test cases T soddisfa il criterio di Condition/Decision coverage se tutte le seguenti condizioni sono soddisfatte:
+
+1) Ciascun punto di entrata ed uscita nel programma eseguito in almeno un test;
+2) Per ogni decision d nel programma, per ogni condition c in d, esiste un test in T in cui c true ed un test in T in cui c false.
+3) Per ogni decision d nel programma, esiste un test in T in cui d true ed un test in T in cui d false.
+
+Si consideri la seguente funzione:
+int f(int a, int b, int c)
+{ if ( (a - 100 >= 0) && (b - c - 1 <= 0) )
+ return (1); // punto di uscita 1
+ else if ((b - c - 1 <= 0) || (b + c - 5 >= 0)
+)
+ then return (2); // punto di uscita 2
+ else return (3); // punto di uscita 3
+}
+ Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_7/wrong1.txt b/legacy/Data/ingsw/0613_7/wrong1.txt
new file mode 100644
index 0000000..abe0eaa
--- /dev/null
+++ b/legacy/Data/ingsw/0613_7/wrong1.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 4, c = 0), (a=200, b = 4, c = 0)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_7/wrong2.txt b/legacy/Data/ingsw/0613_7/wrong2.txt
new file mode 100644
index 0000000..5b77112
--- /dev/null
+++ b/legacy/Data/ingsw/0613_7/wrong2.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 5, c = 0), (a=50, b = 0, c = 5).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_8/correct.txt b/legacy/Data/ingsw/0613_8/correct.txt
new file mode 100644
index 0000000..489e74c
--- /dev/null
+++ b/legacy/Data/ingsw/0613_8/correct.txt
@@ -0,0 +1 @@
+5*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_8/quest.txt b/legacy/Data/ingsw/0613_8/quest.txt
new file mode 100644
index 0000000..570368e
--- /dev/null
+++ b/legacy/Data/ingsw/0613_8/quest.txt
@@ -0,0 +1 @@
+Un processo di sviluppo plan-driven consiste di 2 fasi F1, F2, ciascuna costo A. Alla fine di ogni fase vengono prese in considerazione le "change requests" e, se ve ne sono, lo sviluppo viene ripetuto a partire dalla prima iterazione. Quindi con nessuna change request si hanno le fasi: F1, F2 e costo 2A. Con una "change request" dopo la prima fase si ha: F1, F1, F2 e costo 3A. Con una change request dopo la fase 2 si ha: F1, F2, F1, F2 e costo 4A. Qual' il costo nel caso in cui ci siano change requests sia dopo la fase 1 che dopo la fase 2.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_8/wrong1.txt b/legacy/Data/ingsw/0613_8/wrong1.txt
new file mode 100644
index 0000000..bf91afb
--- /dev/null
+++ b/legacy/Data/ingsw/0613_8/wrong1.txt
@@ -0,0 +1 @@
+7*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_8/wrong2.txt b/legacy/Data/ingsw/0613_8/wrong2.txt
new file mode 100644
index 0000000..23cbd0e
--- /dev/null
+++ b/legacy/Data/ingsw/0613_8/wrong2.txt
@@ -0,0 +1 @@
+6*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_9/quest.txt b/legacy/Data/ingsw/0613_9/quest.txt
new file mode 100644
index 0000000..89f55eb
--- /dev/null
+++ b/legacy/Data/ingsw/0613_9/quest.txt
@@ -0,0 +1,4 @@
+img=https://unspectacular-subdi.000webhostapp.com/0613_domanda_9.png
+Si consideri la seguente architettura software:
+
+Quale dei seguenti modelli Modelica meglio la rappresenta.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_9/wrong1.txt b/legacy/Data/ingsw/0613_9/wrong1.txt
new file mode 100644
index 0000000..4bcd55f
--- /dev/null
+++ b/legacy/Data/ingsw/0613_9/wrong1.txt
@@ -0,0 +1,8 @@
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output12, sc
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_9/wrong2.txt b/legacy/Data/ingsw/0613_9/wrong2.txt
new file mode 100644
index 0000000..2c10a10
--- /dev/null
+++ b/legacy/Data/ingsw/0613_9/wrong2.txt
@@ -0,0 +1,4 @@
+input12)
+connect(sc1.output14, sc4.input14)
+connect(sc2.output24, sc4.input24)
+connect(sc
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_9/wrong3.txt b/legacy/Data/ingsw/0613_9/wrong3.txt
new file mode 100644
index 0000000..7ddc09e
--- /dev/null
+++ b/legacy/Data/ingsw/0613_9/wrong3.txt
@@ -0,0 +1,46 @@
+output34, sc4.input34)
+connect(sc4.output41, sc1.input41)
+connect(sc4.output43, sc3.input43)
+
+
+end SysArch;
+
+2.
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output12, sc2.input12)
+connect(sc1.output14, sc4.input14)
+connect(sc2.output23, sc3.input23)
+connect(sc2.output24, sc4.input24)
+connect(sc3.output31, sc1.input31)
+connect(sc3.output32, sc2.input32)
+connect(sc3.output34, sc4.input34)
+connect(sc4.output41, sc1.input41)
+connect(sc4.output43, sc3.input43)
+
+
+end SysArch;
+
+3.
+block SysArch // System Architecture
+
+SC1 sc1
+SC2 sc2
+SC3 sc3
+SC4 sc4
+
+connect(sc1.output13, sc3.input13)
+connect(sc2.output21, sc1.input21)
+connect(sc2.output23, sc3.input23)
+connect(sc3.output32, sc2.input32)
+connect(sc3.output34, sc4.input34)
+connect(sc4.output41, sc1.input41)
+connect(sc4.output42, sc2.input42)
+
+
+end SysArch;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_0/correct.txt b/legacy/Data/ingsw/0621_0/correct.txt
new file mode 100644
index 0000000..81ceb23
--- /dev/null
+++ b/legacy/Data/ingsw/0621_0/correct.txt
@@ -0,0 +1,14 @@
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x < 0.6*y) and (x + y <= 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_0/quest.txt b/legacy/Data/ingsw/0621_0/quest.txt
new file mode 100644
index 0000000..2eb7f69
--- /dev/null
+++ b/legacy/Data/ingsw/0621_0/quest.txt
@@ -0,0 +1,4 @@
+Si consideri il seguente requisito:
+RQ: Dopo 50 unità di tempo dall'inizio dell'esecuzione vale la seguente proprietà:
+se la variabile x è minore del 60% della variabile y allora la somma di x ed y è maggiore del 30% della variabile z
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_0/wrong0.txt b/legacy/Data/ingsw/0621_0/wrong0.txt
new file mode 100644
index 0000000..e09501c
--- /dev/null
+++ b/legacy/Data/ingsw/0621_0/wrong0.txt
@@ -0,0 +1,14 @@
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x >= 0.6*y) and (x + y <= 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_0/wrong1.txt b/legacy/Data/ingsw/0621_0/wrong1.txt
new file mode 100644
index 0000000..f7ab72e
--- /dev/null
+++ b/legacy/Data/ingsw/0621_0/wrong1.txt
@@ -0,0 +1,14 @@
+class Monitor
+
+InputReal x, y, z; // plant output
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 50) and (x < 0.6*y) and (x + y > 0.3*z);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_1/correct.txt b/legacy/Data/ingsw/0621_1/correct.txt
new file mode 100644
index 0000000..b740a0a
--- /dev/null
+++ b/legacy/Data/ingsw/0621_1/correct.txt
@@ -0,0 +1,14 @@
+model System
+Integer y;
+Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+equation
+y = if (r1024 <= 0.3) then 1 else 0;
+algorithm
+when initial() then
+state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+r1024 := 0;
+elsewhen sample(0,1) then
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+end when;
+end System;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_1/quest.txt b/legacy/Data/ingsw/0621_1/quest.txt
new file mode 100644
index 0000000..5a1289f
--- /dev/null
+++ b/legacy/Data/ingsw/0621_1/quest.txt
@@ -0,0 +1 @@
+Si consideri l'ambiente (use case) che consiste di un utente che, ad ogni unità di tempo (ad esempio, un secondo) manda al nostro sistema input 1 (ad esempio, esegue una prenotazione) con probabilità 0.3 oppure input 0 con probabilità 0.7. Quale dei seguenti modelli Modelica rappresenta correttamente tale ambiente.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_1/wrong1.txt b/legacy/Data/ingsw/0621_1/wrong1.txt
new file mode 100644
index 0000000..57fc69d
--- /dev/null
+++ b/legacy/Data/ingsw/0621_1/wrong1.txt
@@ -0,0 +1,13 @@
+model System
+Integer y; Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+equation
+y = if (r1024 <= 0.3) then 0 else 1;
+algorithm
+when initial() then
+state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+r1024 := 0;
+elsewhen sample(0,1) then
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+end when;
+end System;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_1/wrong2.txt b/legacy/Data/ingsw/0621_1/wrong2.txt
new file mode 100644
index 0000000..3390b13
--- /dev/null
+++ b/legacy/Data/ingsw/0621_1/wrong2.txt
@@ -0,0 +1,13 @@
+model System
+Integer y; Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+equation
+y = if (r1024 >= 0.3) then 1 else 0;
+algorithm
+when initial() then
+state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+r1024 := 0;
+elsewhen sample(0,1) then
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+end when;
+end System;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_10/correct.txt b/legacy/Data/ingsw/0621_10/correct.txt
new file mode 100644
index 0000000..f8c9568
--- /dev/null
+++ b/legacy/Data/ingsw/0621_10/correct.txt
@@ -0,0 +1 @@
+Per tutti gli istanti di tempo della forma 1 + 4*k (con k = 0, 1, 2, 3, ...) x vale 1.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_10/quest.txt b/legacy/Data/ingsw/0621_10/quest.txt
new file mode 100644
index 0000000..ba1496d
--- /dev/null
+++ b/legacy/Data/ingsw/0621_10/quest.txt
@@ -0,0 +1,13 @@
+Si consideri il seguente modello Modelica:
+
+class System
+Integer x;
+initial equation
+x = 0;
+equation
+when sample(0, 2) then
+ x = 1 - pre(x);
+end when;
+end System;
+
+Quale delle seguenti affermazioni è vera per la variabile intera x?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_10/wrong0.txt b/legacy/Data/ingsw/0621_10/wrong0.txt
new file mode 100644
index 0000000..f485a50
--- /dev/null
+++ b/legacy/Data/ingsw/0621_10/wrong0.txt
@@ -0,0 +1 @@
+Per tutti gli istanti di tempo della forma 3 + 4*k (con k = 0, 1, 2, 3, ...) x vale 1.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_10/wrong1.txt b/legacy/Data/ingsw/0621_10/wrong1.txt
new file mode 100644
index 0000000..a7af2cb
--- /dev/null
+++ b/legacy/Data/ingsw/0621_10/wrong1.txt
@@ -0,0 +1 @@
+Per tutti gli istanti di tempo della forma 1 + 4*k (con k = 0, 1, 2, 3, ...) x vale 0.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_13/correct.txt b/legacy/Data/ingsw/0621_13/correct.txt
new file mode 100644
index 0000000..0c54a95
--- /dev/null
+++ b/legacy/Data/ingsw/0621_13/correct.txt
@@ -0,0 +1 @@
+Sviluppo plan-driven.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_13/quest.txt b/legacy/Data/ingsw/0621_13/quest.txt
new file mode 100644
index 0000000..3c60626
--- /dev/null
+++ b/legacy/Data/ingsw/0621_13/quest.txt
@@ -0,0 +1 @@
+Si pianifica di sviluppare un software gestionale per una università. Considerando che questo può essere considerato un sistema mission-critical, quali dei seguenti modelli di processi software generici è più adatto per lo sviluppo di tale software.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_13/wrong0.txt b/legacy/Data/ingsw/0621_13/wrong0.txt
new file mode 100644
index 0000000..9d2b250
--- /dev/null
+++ b/legacy/Data/ingsw/0621_13/wrong0.txt
@@ -0,0 +1 @@
+Sviluppo Iterativo
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_13/wrong1.txt b/legacy/Data/ingsw/0621_13/wrong1.txt
new file mode 100644
index 0000000..b37e1a6
--- /dev/null
+++ b/legacy/Data/ingsw/0621_13/wrong1.txt
@@ -0,0 +1 @@
+Sviluppo Agile.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_14/correct.txt b/legacy/Data/ingsw/0621_14/correct.txt
new file mode 100644
index 0000000..a4a8878
--- /dev/null
+++ b/legacy/Data/ingsw/0621_14/correct.txt
@@ -0,0 +1 @@
+Testare l'interazione tra le componenti del sistema (cioè, integrazione di molte unità di sistema).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_14/quest.txt b/legacy/Data/ingsw/0621_14/quest.txt
new file mode 100644
index 0000000..8bbcdb8
--- /dev/null
+++ b/legacy/Data/ingsw/0621_14/quest.txt
@@ -0,0 +1 @@
+Il system testing si concentra su:
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_14/wrong0.txt b/legacy/Data/ingsw/0621_14/wrong0.txt
new file mode 100644
index 0000000..3214f65
--- /dev/null
+++ b/legacy/Data/ingsw/0621_14/wrong0.txt
@@ -0,0 +1 @@
+Testare le interfacce per ciascuna componente.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_14/wrong1.txt b/legacy/Data/ingsw/0621_14/wrong1.txt
new file mode 100644
index 0000000..6a9cb98
--- /dev/null
+++ b/legacy/Data/ingsw/0621_14/wrong1.txt
@@ -0,0 +1 @@
+Testare le funzionalità di unità software individuali, oggetti, classi o metodi.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_17/correct.txt b/legacy/Data/ingsw/0621_17/correct.txt
new file mode 100644
index 0000000..3f5bba6
--- /dev/null
+++ b/legacy/Data/ingsw/0621_17/correct.txt
@@ -0,0 +1,13 @@
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) > 0) and (y <= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_17/quest.txt b/legacy/Data/ingsw/0621_17/quest.txt
new file mode 100644
index 0000000..de77723
--- /dev/null
+++ b/legacy/Data/ingsw/0621_17/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+RQ: Dopo 60 unità di tempo dall'inizio dell'esecuzione vale la seguente proprietà:
+se 10 unità di tempo nel passato era stata richiesta una risorsa (variabile x positiva) allora ora è concesso l'accesso alla risorsa (variabile y positiva)
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time < w e ritorna il valore che z aveva al tempo (time - w), se time >= w.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_17/wrong0.txt b/legacy/Data/ingsw/0621_17/wrong0.txt
new file mode 100644
index 0000000..d23fe8e
--- /dev/null
+++ b/legacy/Data/ingsw/0621_17/wrong0.txt
@@ -0,0 +1,14 @@
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) or (delay(x, 10) > 0) or (y <= 0);
+
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_17/wrong1.txt b/legacy/Data/ingsw/0621_17/wrong1.txt
new file mode 100644
index 0000000..33310f9
--- /dev/null
+++ b/legacy/Data/ingsw/0621_17/wrong1.txt
@@ -0,0 +1,13 @@
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) > 0) and (y > 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_19/correct.txt b/legacy/Data/ingsw/0621_19/correct.txt
new file mode 100644
index 0000000..d3826b5
--- /dev/null
+++ b/legacy/Data/ingsw/0621_19/correct.txt
@@ -0,0 +1 @@
+Ad ogni istante di tempo della forma 1 + 4*k (k = 0, 1, 2, 3, ...), x vale "true".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_19/quest.txt b/legacy/Data/ingsw/0621_19/quest.txt
new file mode 100644
index 0000000..b3ee6d9
--- /dev/null
+++ b/legacy/Data/ingsw/0621_19/quest.txt
@@ -0,0 +1,13 @@
+Si consideri il seguente modello Modelica.
+
+class System
+Boolean x;
+initial equation
+x = false;
+equation
+when sample(0, 2) then
+ x = not (pre(x));
+end when;
+end System;
+
+Quale delle seguenti affermazioni vale per la variabile booleana x ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_19/wrong0.txt b/legacy/Data/ingsw/0621_19/wrong0.txt
new file mode 100644
index 0000000..6245a2f
--- /dev/null
+++ b/legacy/Data/ingsw/0621_19/wrong0.txt
@@ -0,0 +1 @@
+At time instants of form 1 + 4*k (with k = 0, 1, 2, 3, ...) x takes value "false".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_19/wrong1.txt b/legacy/Data/ingsw/0621_19/wrong1.txt
new file mode 100644
index 0000000..0ba96d3
--- /dev/null
+++ b/legacy/Data/ingsw/0621_19/wrong1.txt
@@ -0,0 +1 @@
+Ad ogni istante di tempo della forma 3 + 4*k (k = 0, 1, 2, 3, ...), x vale "true".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_2/correct.txt b/legacy/Data/ingsw/0621_2/correct.txt
new file mode 100644
index 0000000..23cbd0e
--- /dev/null
+++ b/legacy/Data/ingsw/0621_2/correct.txt
@@ -0,0 +1 @@
+6*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_2/quest.txt b/legacy/Data/ingsw/0621_2/quest.txt
new file mode 100644
index 0000000..c91abc9
--- /dev/null
+++ b/legacy/Data/ingsw/0621_2/quest.txt
@@ -0,0 +1 @@
+Si consideri un software sviluppato seguendo un approccio plan-driven implementato con tre fasi: F1, F2, F3 ciascuna con costo A. Le "change request" possono arrivare solo al fine di una fase e provocano la ripetizione (con relativo costo) di tutte le fasi che precedono. Si assuma che dopo la fase F3 (cioè al termine dello sviluppo) arriva una change request. Qual'e' il costo totale per lo sviluppo del software in questione.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_2/wrong0.txt b/legacy/Data/ingsw/0621_2/wrong0.txt
new file mode 100644
index 0000000..489e74c
--- /dev/null
+++ b/legacy/Data/ingsw/0621_2/wrong0.txt
@@ -0,0 +1 @@
+5*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_2/wrong1.txt b/legacy/Data/ingsw/0621_2/wrong1.txt
new file mode 100644
index 0000000..63ca2eb
--- /dev/null
+++ b/legacy/Data/ingsw/0621_2/wrong1.txt
@@ -0,0 +1 @@
+4*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_21/correct.txt b/legacy/Data/ingsw/0621_21/correct.txt
new file mode 100644
index 0000000..c24cae9
--- /dev/null
+++ b/legacy/Data/ingsw/0621_21/correct.txt
@@ -0,0 +1 @@
+A*(2 + p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_21/quest.txt b/legacy/Data/ingsw/0621_21/quest.txt
new file mode 100644
index 0000000..77c80a6
--- /dev/null
+++ b/legacy/Data/ingsw/0621_21/quest.txt
@@ -0,0 +1 @@
+Si consideri un software costituito da due fasi F1 ed F2 ciascuna di costo A. Con probabilità p la fase F1 deve essere ripetuta (a causa di change requests) e con probabilità (1 - p) si passa alla fase F2 e poi al completamento (End) dello sviluppo. Qual'eè il costo atteso per lo sviluppo del software seguendo il processo sopra descritto ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_21/wrong0.txt b/legacy/Data/ingsw/0621_21/wrong0.txt
new file mode 100644
index 0000000..a9b1c29
--- /dev/null
+++ b/legacy/Data/ingsw/0621_21/wrong0.txt
@@ -0,0 +1 @@
+3*A*p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_21/wrong1.txt b/legacy/Data/ingsw/0621_21/wrong1.txt
new file mode 100644
index 0000000..6e771e9
--- /dev/null
+++ b/legacy/Data/ingsw/0621_21/wrong1.txt
@@ -0,0 +1 @@
+A*(1 + p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_22/correct.txt b/legacy/Data/ingsw/0621_22/correct.txt
new file mode 100644
index 0000000..83f9204
--- /dev/null
+++ b/legacy/Data/ingsw/0621_22/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/LSxqSIl.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_22/quest.txt b/legacy/Data/ingsw/0621_22/quest.txt
new file mode 100644
index 0000000..5d926db
--- /dev/null
+++ b/legacy/Data/ingsw/0621_22/quest.txt
@@ -0,0 +1 @@
+Si consideri un software sviluppato seguendo un approccio plan-driven implementato con tre fasi: F1, F2, F3. Dopo ogni fase c'e' una probabilità p di dover ripeter la fase precedente ed una probabilità (1 - p) di passare alla fase successiva (sino ad arrivare al termine dello sviluppo). Quale delle seguenti catene di Markov modella il processo software descritto sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_22/wrong0.txt b/legacy/Data/ingsw/0621_22/wrong0.txt
new file mode 100644
index 0000000..d2eb66b
--- /dev/null
+++ b/legacy/Data/ingsw/0621_22/wrong0.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/yGc7Zf2.png
diff --git a/legacy/Data/ingsw/0621_22/wrong1.txt b/legacy/Data/ingsw/0621_22/wrong1.txt
new file mode 100644
index 0000000..dbdbad5
--- /dev/null
+++ b/legacy/Data/ingsw/0621_22/wrong1.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/3t92wEw.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_24/correct.txt b/legacy/Data/ingsw/0621_24/correct.txt
new file mode 100644
index 0000000..a7029bc
--- /dev/null
+++ b/legacy/Data/ingsw/0621_24/correct.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [1, 4] oppure nell'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_24/quest.txt b/legacy/Data/ingsw/0621_24/quest.txt
new file mode 100644
index 0000000..e943282
--- /dev/null
+++ b/legacy/Data/ingsw/0621_24/quest.txt
@@ -0,0 +1,17 @@
+Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato.
+
+block Monitor
+input Real x;
+output Boolean y;
+Boolean w;
+initial equation
+y = false;
+equation
+w = ((x < 1) or (x > 4)) and ((x < 15) or (x > 20));
+algorithm
+when edge(w) then
+y := true;
+end when;
+end Monitor;
+
+Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_24/wrong0.txt b/legacy/Data/ingsw/0621_24/wrong0.txt
new file mode 100644
index 0000000..710b111
--- /dev/null
+++ b/legacy/Data/ingsw/0621_24/wrong0.txt
@@ -0,0 +1 @@
+La variabile x è fuori dall'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_24/wrong1.txt b/legacy/Data/ingsw/0621_24/wrong1.txt
new file mode 100644
index 0000000..a82929b
--- /dev/null
+++ b/legacy/Data/ingsw/0621_24/wrong1.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_3/correct.txt b/legacy/Data/ingsw/0621_3/correct.txt
new file mode 100644
index 0000000..68bfd31
--- /dev/null
+++ b/legacy/Data/ingsw/0621_3/correct.txt
@@ -0,0 +1 @@
+Una release del software è resa disponibile agli utenti (beta users) per permettergli di sperimentare e quindi segnalare eventuali problemi rilevati agli sviluppatori.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_3/quest.txt b/legacy/Data/ingsw/0621_3/quest.txt
new file mode 100644
index 0000000..4589c15
--- /dev/null
+++ b/legacy/Data/ingsw/0621_3/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti affermazione è vera riguardo al beta testing ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_3/wrong0.txt b/legacy/Data/ingsw/0621_3/wrong0.txt
new file mode 100644
index 0000000..ab58544
--- /dev/null
+++ b/legacy/Data/ingsw/0621_3/wrong0.txt
@@ -0,0 +1 @@
+Test automatizzato sono eseguiti sulla versione finale del sistema presso il sito di sviluppo del software.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_3/wrong1.txt b/legacy/Data/ingsw/0621_3/wrong1.txt
new file mode 100644
index 0000000..f021931
--- /dev/null
+++ b/legacy/Data/ingsw/0621_3/wrong1.txt
@@ -0,0 +1 @@
+Test automatizzato sono eseguiti sulla versione finale del sistema presso il cliente.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_32/correct.txt b/legacy/Data/ingsw/0621_32/correct.txt
new file mode 100644
index 0000000..ddb0d65
--- /dev/null
+++ b/legacy/Data/ingsw/0621_32/correct.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_32/quest.txt b/legacy/Data/ingsw/0621_32/quest.txt
new file mode 100644
index 0000000..7004fa1
--- /dev/null
+++ b/legacy/Data/ingsw/0621_32/quest.txt
@@ -0,0 +1,17 @@
+Si consideri il monitor seguente che ritorna true appena i requisiti per il sistema monitorato sono violati.
+
+block Monitor
+input Real x;
+output Boolean y;
+Boolean w;
+initial equation
+y = false;
+equation
+w = ((x < 0) or (x > 5));
+algorithm
+when edge(w) then
+y := true;
+end when;
+end Monitor;
+
+Quale delle seguenti affermazioni meglio descrive il requisito monitorato.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_32/wrong0.txt b/legacy/Data/ingsw/0621_32/wrong0.txt
new file mode 100644
index 0000000..3e05ae7
--- /dev/null
+++ b/legacy/Data/ingsw/0621_32/wrong0.txt
@@ -0,0 +1 @@
+La variabile x è fuori dall'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_32/wrong1.txt b/legacy/Data/ingsw/0621_32/wrong1.txt
new file mode 100644
index 0000000..7c7a691
--- /dev/null
+++ b/legacy/Data/ingsw/0621_32/wrong1.txt
@@ -0,0 +1 @@
+La variable x è minore di 0.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_35/correct.txt b/legacy/Data/ingsw/0621_35/correct.txt
new file mode 100644
index 0000000..0dcbeca
--- /dev/null
+++ b/legacy/Data/ingsw/0621_35/correct.txt
@@ -0,0 +1 @@
+Per ciascun incremento di funzionalità, scrivi test automatizzati, implementa la funzionalità, esegui i test e rivedi l'implementazione come necessario.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_35/quest.txt b/legacy/Data/ingsw/0621_35/quest.txt
new file mode 100644
index 0000000..f3019d0
--- /dev/null
+++ b/legacy/Data/ingsw/0621_35/quest.txt
@@ -0,0 +1 @@
+Si consideri il Test-Driven Development (TDD). Quale delle seguenti affermazioni è vera?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_35/wrong0.txt b/legacy/Data/ingsw/0621_35/wrong0.txt
new file mode 100644
index 0000000..2891ab7
--- /dev/null
+++ b/legacy/Data/ingsw/0621_35/wrong0.txt
@@ -0,0 +1 @@
+Scrivi test automatizzati per tutti i requisiti di sistema, esegui i test e rivedi l'implementazione come necessario.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_35/wrong1.txt b/legacy/Data/ingsw/0621_35/wrong1.txt
new file mode 100644
index 0000000..cf5eab4
--- /dev/null
+++ b/legacy/Data/ingsw/0621_35/wrong1.txt
@@ -0,0 +1 @@
+Per ciascun incremento di funzionalità, implementa la funzionalità, scrivi test automatizzati, esegui i test e rivedi l'implementazione come necessario.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_36/correct.txt b/legacy/Data/ingsw/0621_36/correct.txt
new file mode 100644
index 0000000..fc560a2
--- /dev/null
+++ b/legacy/Data/ingsw/0621_36/correct.txt
@@ -0,0 +1,15 @@
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x > 5) or (x < 0));
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_36/quest.txt b/legacy/Data/ingsw/0621_36/quest.txt
new file mode 100644
index 0000000..6473814
--- /dev/null
+++ b/legacy/Data/ingsw/0621_36/quest.txt
@@ -0,0 +1,3 @@
+Si consideri il seguente requisito:
+RQ: Durante l'esecuzione del programma (cioè per tutti gli istanti di tempo positivi) la variabile x è sempre nell'intervallo [0, 5].
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_36/wrong0.txt b/legacy/Data/ingsw/0621_36/wrong0.txt
new file mode 100644
index 0000000..61fa628
--- /dev/null
+++ b/legacy/Data/ingsw/0621_36/wrong0.txt
@@ -0,0 +1,15 @@
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and (x > 0) and (x < 5);
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_36/wrong1.txt b/legacy/Data/ingsw/0621_36/wrong1.txt
new file mode 100644
index 0000000..c8a2c3d
--- /dev/null
+++ b/legacy/Data/ingsw/0621_36/wrong1.txt
@@ -0,0 +1,15 @@
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x > 0) or (x < 5));
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_39/correct.txt b/legacy/Data/ingsw/0621_39/correct.txt
new file mode 100644
index 0000000..91e6e0a
--- /dev/null
+++ b/legacy/Data/ingsw/0621_39/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/J4TFpmw.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_39/quest.txt b/legacy/Data/ingsw/0621_39/quest.txt
new file mode 100644
index 0000000..406c612
--- /dev/null
+++ b/legacy/Data/ingsw/0621_39/quest.txt
@@ -0,0 +1 @@
+Si consideri un software sviluppato seguendo un approccio plan-driven implementato con tre fasi: F1, F2, F3. Le "change requests" arrivano con probabilità p dopo ciascuna fase e provocano la ripetizione (con relativo costo) di tutte le fasi che precedono. Quali delle seguenti catene di Markov modella lo sviluppo software descritto.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_39/wrong0.txt b/legacy/Data/ingsw/0621_39/wrong0.txt
new file mode 100644
index 0000000..0f68af0
--- /dev/null
+++ b/legacy/Data/ingsw/0621_39/wrong0.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/xVrmeoj.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_39/wrong1.txt b/legacy/Data/ingsw/0621_39/wrong1.txt
new file mode 100644
index 0000000..908366a
--- /dev/null
+++ b/legacy/Data/ingsw/0621_39/wrong1.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/4Ew3YtM.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_6/correct.txt b/legacy/Data/ingsw/0621_6/correct.txt
new file mode 100644
index 0000000..81653ea
--- /dev/null
+++ b/legacy/Data/ingsw/0621_6/correct.txt
@@ -0,0 +1,16 @@
+function next
+input Integer x;
+output Integer y;
+algorithm
+ y := 1 - x;
+end next;
+
+class System
+Integer x;
+initial equation
+x = 0;
+equation
+when sample(0, 1) then
+ x = next(pre(x));
+end when;
+end System;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_6/quest.txt b/legacy/Data/ingsw/0621_6/quest.txt
new file mode 100644
index 0000000..8bc0606
--- /dev/null
+++ b/legacy/Data/ingsw/0621_6/quest.txt
@@ -0,0 +1,3 @@
+img=https://i.imgur.com/F6JCFSU.png
+Si consideri l'automa segunete:
+Quale dei seguenti modelli Modelica fornisce un modello ragionevole per l'automa di cui sopra.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_6/wrong0.txt b/legacy/Data/ingsw/0621_6/wrong0.txt
new file mode 100644
index 0000000..4c7125e
--- /dev/null
+++ b/legacy/Data/ingsw/0621_6/wrong0.txt
@@ -0,0 +1,16 @@
+function next
+input Integer x;
+output Integer y;
+algorithm
+ y := x;
+end next;
+
+class System
+Integer x;
+initial equation
+x = 0;
+equation
+when sample(0, 1) then
+ x = next(pre(x));
+end when;
+end System;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_6/wrong1.txt b/legacy/Data/ingsw/0621_6/wrong1.txt
new file mode 100644
index 0000000..47cf8cd
--- /dev/null
+++ b/legacy/Data/ingsw/0621_6/wrong1.txt
@@ -0,0 +1,16 @@
+function next
+input Integer x;
+output Integer y;
+algorithm
+ y := 1 + x;
+end next;
+
+class System
+Integer x;
+initial equation
+x = 0;
+equation
+when sample(0, 1) then
+ x = next(pre(x));
+end when;
+end System;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_6/wrong2.txt b/legacy/Data/ingsw/0621_6/wrong2.txt
new file mode 100644
index 0000000..81653ea
--- /dev/null
+++ b/legacy/Data/ingsw/0621_6/wrong2.txt
@@ -0,0 +1,16 @@
+function next
+input Integer x;
+output Integer y;
+algorithm
+ y := 1 - x;
+end next;
+
+class System
+Integer x;
+initial equation
+x = 0;
+equation
+when sample(0, 1) then
+ x = next(pre(x));
+end when;
+end System;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_9/correct.txt b/legacy/Data/ingsw/0621_9/correct.txt
new file mode 100644
index 0000000..4bef521
--- /dev/null
+++ b/legacy/Data/ingsw/0621_9/correct.txt
@@ -0,0 +1 @@
+Requirements specification precedes the component analysis activity.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_9/quest.txt b/legacy/Data/ingsw/0621_9/quest.txt
new file mode 100644
index 0000000..47b8c7e
--- /dev/null
+++ b/legacy/Data/ingsw/0621_9/quest.txt
@@ -0,0 +1 @@
+Consider reuse-based software development. Which of the following is true?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_9/wrong0.txt b/legacy/Data/ingsw/0621_9/wrong0.txt
new file mode 100644
index 0000000..d37b8fe
--- /dev/null
+++ b/legacy/Data/ingsw/0621_9/wrong0.txt
@@ -0,0 +1 @@
+Requirements specification is not needed thanks to reuse.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0621_9/wrong1.txt b/legacy/Data/ingsw/0621_9/wrong1.txt
new file mode 100644
index 0000000..53c7eb8
--- /dev/null
+++ b/legacy/Data/ingsw/0621_9/wrong1.txt
@@ -0,0 +1 @@
+Development and integration are not needed thanks to reuse.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_1/correct.txt b/legacy/Data/ingsw/0622_1/correct.txt
new file mode 100644
index 0000000..8da85a2
--- /dev/null
+++ b/legacy/Data/ingsw/0622_1/correct.txt
@@ -0,0 +1 @@
+3000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_1/quest.txt b/legacy/Data/ingsw/0622_1/quest.txt
new file mode 100644
index 0000000..045f2d6
--- /dev/null
+++ b/legacy/Data/ingsw/0622_1/quest.txt
@@ -0,0 +1 @@
+Si consideri un software sviluppato seguendo un approccio iterativo implementato con due fasi: F1 seguita da F2. Ciascuna fase ha costo 1000 Eur e deve essere ripetuta una seconda volta con probabilità 0.5. Qual'e' il costo atteso dello sviluppo dell'intero software?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_1/wrong 1.txt b/legacy/Data/ingsw/0622_1/wrong 1.txt
new file mode 100644
index 0000000..0b3e0a6
--- /dev/null
+++ b/legacy/Data/ingsw/0622_1/wrong 1.txt
@@ -0,0 +1 @@
+5000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_1/wrong 2.txt b/legacy/Data/ingsw/0622_1/wrong 2.txt
new file mode 100644
index 0000000..9463411
--- /dev/null
+++ b/legacy/Data/ingsw/0622_1/wrong 2.txt
@@ -0,0 +1 @@
+2000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_2/correct.txt b/legacy/Data/ingsw/0622_2/correct.txt
new file mode 100644
index 0000000..f8ae137
--- /dev/null
+++ b/legacy/Data/ingsw/0622_2/correct.txt
@@ -0,0 +1 @@
+2700
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_2/quest.txt b/legacy/Data/ingsw/0622_2/quest.txt
new file mode 100644
index 0000000..7083f7d
--- /dev/null
+++ b/legacy/Data/ingsw/0622_2/quest.txt
@@ -0,0 +1 @@
+Si consideri un software sviluppato seguendo un approccio iterativo implementato con due fasi: F1 seguita da F2. Ciascuna fase ha costo 1000. Con probabilità 0.5 potrebbe essere necessario ripetere F1 una seconda volta. Con probabilità 0.2 potrebbe essere necessario ripetere F2 una seconda volta. Qual'e' il costo atteso dello sviluppo dell'intero software?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_2/wrong 1.txt b/legacy/Data/ingsw/0622_2/wrong 1.txt
new file mode 100644
index 0000000..a211371
--- /dev/null
+++ b/legacy/Data/ingsw/0622_2/wrong 1.txt
@@ -0,0 +1 @@
+4000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_2/wrong 2.txt b/legacy/Data/ingsw/0622_2/wrong 2.txt
new file mode 100644
index 0000000..0b3e0a6
--- /dev/null
+++ b/legacy/Data/ingsw/0622_2/wrong 2.txt
@@ -0,0 +1 @@
+5000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_3/correct.txt b/legacy/Data/ingsw/0622_3/correct.txt
new file mode 100644
index 0000000..07c6432
--- /dev/null
+++ b/legacy/Data/ingsw/0622_3/correct.txt
@@ -0,0 +1 @@
+24000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_3/quest.txt b/legacy/Data/ingsw/0622_3/quest.txt
new file mode 100644
index 0000000..641cce2
--- /dev/null
+++ b/legacy/Data/ingsw/0622_3/quest.txt
@@ -0,0 +1 @@
+Si consideri un processo software costituito da due fasi F1 ed F2 ciascuna di costo 10000. Con probabilità p = 0.4 la fase F1 deve essere ripetuta (a causa di change requests) e con probabilità (1 - p) si passa alla fase F2 e poi al completamento (End) dello sviluppo. Qual'è il costo atteso per lo sviluppo del software seguendo il processo sopra descritto ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_3/wrong 1.txt b/legacy/Data/ingsw/0622_3/wrong 1.txt
new file mode 100644
index 0000000..45842b7
--- /dev/null
+++ b/legacy/Data/ingsw/0622_3/wrong 1.txt
@@ -0,0 +1 @@
+35000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_3/wrong 2.txt b/legacy/Data/ingsw/0622_3/wrong 2.txt
new file mode 100644
index 0000000..137b176
--- /dev/null
+++ b/legacy/Data/ingsw/0622_3/wrong 2.txt
@@ -0,0 +1 @@
+30000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_4/correct.txt b/legacy/Data/ingsw/0622_4/correct.txt
new file mode 100644
index 0000000..7c67f71
--- /dev/null
+++ b/legacy/Data/ingsw/0622_4/correct.txt
@@ -0,0 +1 @@
+950000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_4/quest.txt b/legacy/Data/ingsw/0622_4/quest.txt
new file mode 100644
index 0000000..0c283e9
--- /dev/null
+++ b/legacy/Data/ingsw/0622_4/quest.txt
@@ -0,0 +1 @@
+Il rischio R può essere calcolato come R = P*C, dove P è la probabilità dell'evento avverso (software failure nel nostro contesto) e C è il costo dell'occorrenza dell'evento avverso. Assumiamo che la probabilità P sia legata al costo di sviluppo S dalla formula P = exp(-b*S), dove b è una opportuna costante note da dati storici aziendali. Si assuma che b = 0.00001, C = 1000000, ed il rischio ammesso è R = 100. Quale delle seguenti opzioni meglio approssima il costo S per lo sviluppo del software in questione.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_4/wrong 1.txt b/legacy/Data/ingsw/0622_4/wrong 1.txt
new file mode 100644
index 0000000..7695ad8
--- /dev/null
+++ b/legacy/Data/ingsw/0622_4/wrong 1.txt
@@ -0,0 +1 @@
+850000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_4/wrong 2.txt b/legacy/Data/ingsw/0622_4/wrong 2.txt
new file mode 100644
index 0000000..1acd587
--- /dev/null
+++ b/legacy/Data/ingsw/0622_4/wrong 2.txt
@@ -0,0 +1 @@
+750000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_5/correct.txt b/legacy/Data/ingsw/0622_5/correct.txt
new file mode 100644
index 0000000..4d597fb
--- /dev/null
+++ b/legacy/Data/ingsw/0622_5/correct.txt
@@ -0,0 +1 @@
+22000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_5/quest.txt b/legacy/Data/ingsw/0622_5/quest.txt
new file mode 100644
index 0000000..5e83ec2
--- /dev/null
+++ b/legacy/Data/ingsw/0622_5/quest.txt
@@ -0,0 +1 @@
+Si consideri un software sviluppato seguendo un approccio iterativo implementato con due fasi: F1 seguita da F2. Ciascuna fase ha costo 10000 Eur e deve essere ripetuta una seconda volta con probabilità 0.1. Qual'e' il costo atteso dello sviluppo dell'intero software?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_5/wrong 1.txt b/legacy/Data/ingsw/0622_5/wrong 1.txt
new file mode 100644
index 0000000..137b176
--- /dev/null
+++ b/legacy/Data/ingsw/0622_5/wrong 1.txt
@@ -0,0 +1 @@
+30000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_5/wrong 2.txt b/legacy/Data/ingsw/0622_5/wrong 2.txt
new file mode 100644
index 0000000..fcb0699
--- /dev/null
+++ b/legacy/Data/ingsw/0622_5/wrong 2.txt
@@ -0,0 +1 @@
+25000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_6/correct.txt b/legacy/Data/ingsw/0622_6/correct.txt
new file mode 100644
index 0000000..ea557e9
--- /dev/null
+++ b/legacy/Data/ingsw/0622_6/correct.txt
@@ -0,0 +1 @@
+23000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_6/quest.txt b/legacy/Data/ingsw/0622_6/quest.txt
new file mode 100644
index 0000000..b5b9386
--- /dev/null
+++ b/legacy/Data/ingsw/0622_6/quest.txt
@@ -0,0 +1 @@
+Si consideri un software sviluppato seguendo un approccio iterativo implementato con due fasi: F1 seguita da F2. Ciascuna fase ha costo 10000. Con probabilità 0.1 potrebbe essere necessario ripetere F1 una seconda volta. Con probabilità 0.2 potrebbe essere necessario ripetere F2 una seconda volta. Qual'e' il costo atteso dello sviluppo dell'intero software?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_6/wrong 1.txt b/legacy/Data/ingsw/0622_6/wrong 1.txt
new file mode 100644
index 0000000..137b176
--- /dev/null
+++ b/legacy/Data/ingsw/0622_6/wrong 1.txt
@@ -0,0 +1 @@
+30000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_6/wrong 2.txt b/legacy/Data/ingsw/0622_6/wrong 2.txt
new file mode 100644
index 0000000..fcb0699
--- /dev/null
+++ b/legacy/Data/ingsw/0622_6/wrong 2.txt
@@ -0,0 +1 @@
+25000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_7/correct.txt b/legacy/Data/ingsw/0622_7/correct.txt
new file mode 100644
index 0000000..8eb46f4
--- /dev/null
+++ b/legacy/Data/ingsw/0622_7/correct.txt
@@ -0,0 +1 @@
+21000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_7/quest.txt b/legacy/Data/ingsw/0622_7/quest.txt
new file mode 100644
index 0000000..3ab551d
--- /dev/null
+++ b/legacy/Data/ingsw/0622_7/quest.txt
@@ -0,0 +1 @@
+Si consideri un processo software costituito da due fasi F1 ed F2 ciascuna di costo 10000. Con probabilità p = 0.1 la fase F1 deve essere ripetuta (a causa di change requests) e con probabilità (1 - p) si passa alla fase F2 e poi al completamento (End) dello sviluppo. Qual'è il costo atteso per lo sviluppo del software seguendo il processo sopra descritto ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_7/wrong 1.txt b/legacy/Data/ingsw/0622_7/wrong 1.txt
new file mode 100644
index 0000000..fcb0699
--- /dev/null
+++ b/legacy/Data/ingsw/0622_7/wrong 1.txt
@@ -0,0 +1 @@
+25000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_7/wrong 2.txt b/legacy/Data/ingsw/0622_7/wrong 2.txt
new file mode 100644
index 0000000..137b176
--- /dev/null
+++ b/legacy/Data/ingsw/0622_7/wrong 2.txt
@@ -0,0 +1 @@
+30000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_8/correct.txt b/legacy/Data/ingsw/0622_8/correct.txt
new file mode 100644
index 0000000..60eaa92
--- /dev/null
+++ b/legacy/Data/ingsw/0622_8/correct.txt
@@ -0,0 +1 @@
+Una volta selezionato il piatto di mare da preparare, la preparazione del pesce e del contorno procedono in parallelo.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_8/quest.txt b/legacy/Data/ingsw/0622_8/quest.txt
new file mode 100644
index 0000000..31346ae
--- /dev/null
+++ b/legacy/Data/ingsw/0622_8/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/7c1TI6f.png
+Quale delle seguenti frasi è corretta riguardo all'ctivity diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_8/wrong 1.txt b/legacy/Data/ingsw/0622_8/wrong 1.txt
new file mode 100644
index 0000000..3e13d27
--- /dev/null
+++ b/legacy/Data/ingsw/0622_8/wrong 1.txt
@@ -0,0 +1 @@
+Una volta selezionato il piatto di mare da preparare, la stessa persona prepara prima il pesce e poi il contorno.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_8/wrong 2.txt b/legacy/Data/ingsw/0622_8/wrong 2.txt
new file mode 100644
index 0000000..06a3fbf
--- /dev/null
+++ b/legacy/Data/ingsw/0622_8/wrong 2.txt
@@ -0,0 +1 @@
+Una volta selezionato il piatto di mare da preparare, la preparazione del pesce e del contorno procedono in sequenza.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_9/correct.txt b/legacy/Data/ingsw/0622_9/correct.txt
new file mode 100644
index 0000000..997967b
--- /dev/null
+++ b/legacy/Data/ingsw/0622_9/correct.txt
@@ -0,0 +1 @@
+700000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_9/quest.txt b/legacy/Data/ingsw/0622_9/quest.txt
new file mode 100644
index 0000000..da5f8a9
--- /dev/null
+++ b/legacy/Data/ingsw/0622_9/quest.txt
@@ -0,0 +1 @@
+Il rischio R può essere calcolato come R = P*C, dove P è la probabilità dell'evento avverso (software failure nel nostro contesto) e C è il costo dell'occorrenza dell'evento avverso. Assumiamo che la probabilità P sia legata al costo di sviluppo S dalla formula P = exp(-b*S), dove b è una opportuna costante note da dati storici aziendali. Si assuma che b = 0.00001, C = 1000000, ed il rischio ammesso è R = 1000. Quale delle seguenti opzioni meglio approssima il costo S per lo sviluppo del software in questione.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_9/wrong 1.txt b/legacy/Data/ingsw/0622_9/wrong 1.txt
new file mode 100644
index 0000000..2df501e
--- /dev/null
+++ b/legacy/Data/ingsw/0622_9/wrong 1.txt
@@ -0,0 +1 @@
+500000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0622_9/wrong 2.txt b/legacy/Data/ingsw/0622_9/wrong 2.txt
new file mode 100644
index 0000000..7a6c6b9
--- /dev/null
+++ b/legacy/Data/ingsw/0622_9/wrong 2.txt
@@ -0,0 +1 @@
+300000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_1/correct.txt b/legacy/Data/ingsw/0721_1/correct.txt
new file mode 100644
index 0000000..f8c9568
--- /dev/null
+++ b/legacy/Data/ingsw/0721_1/correct.txt
@@ -0,0 +1 @@
+Per tutti gli istanti di tempo della forma 1 + 4*k (con k = 0, 1, 2, 3, ...) x vale 1.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_1/quest.txt b/legacy/Data/ingsw/0721_1/quest.txt
new file mode 100644
index 0000000..c5af322
--- /dev/null
+++ b/legacy/Data/ingsw/0721_1/quest.txt
@@ -0,0 +1,13 @@
+Si consideri il seguente modello Modelica:
+
+class System
+Integer x;
+initial equation
+x = 0;
+equation
+when sample(0, 2) then
+ x = 1 - pre(x);
+end when;
+end System;
+
+Quale delle seguenti affermazioni è vera per la variabile intera x?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_1/wrong1.txt b/legacy/Data/ingsw/0721_1/wrong1.txt
new file mode 100644
index 0000000..f485a50
--- /dev/null
+++ b/legacy/Data/ingsw/0721_1/wrong1.txt
@@ -0,0 +1 @@
+Per tutti gli istanti di tempo della forma 3 + 4*k (con k = 0, 1, 2, 3, ...) x vale 1.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_1/wrong2.txt b/legacy/Data/ingsw/0721_1/wrong2.txt
new file mode 100644
index 0000000..a7af2cb
--- /dev/null
+++ b/legacy/Data/ingsw/0721_1/wrong2.txt
@@ -0,0 +1 @@
+Per tutti gli istanti di tempo della forma 1 + 4*k (con k = 0, 1, 2, 3, ...) x vale 0.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_10/correct.txt b/legacy/Data/ingsw/0721_10/correct.txt
new file mode 100644
index 0000000..f4e4c53
--- /dev/null
+++ b/legacy/Data/ingsw/0721_10/correct.txt
@@ -0,0 +1 @@
+Il performance testing è tipicamente eseguito una volta che il sistema è stato completamento integrato.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_10/quest.txt b/legacy/Data/ingsw/0721_10/quest.txt
new file mode 100644
index 0000000..4a711a4
--- /dev/null
+++ b/legacy/Data/ingsw/0721_10/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti affermazioni è vera riguardo al performance testing?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_10/wrong1.txt b/legacy/Data/ingsw/0721_10/wrong1.txt
new file mode 100644
index 0000000..4885062
--- /dev/null
+++ b/legacy/Data/ingsw/0721_10/wrong1.txt
@@ -0,0 +1 @@
+Il performance testing è tipicamente eseguito su un prototipo del sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_10/wrong2.txt b/legacy/Data/ingsw/0721_10/wrong2.txt
new file mode 100644
index 0000000..bd881bc
--- /dev/null
+++ b/legacy/Data/ingsw/0721_10/wrong2.txt
@@ -0,0 +1 @@
+Il performance testing è tipicamente eseguito solo sulle componenti del sistema prima dell'integrazione.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_13/correct.txt b/legacy/Data/ingsw/0721_13/correct.txt
new file mode 100644
index 0000000..9b5317b
--- /dev/null
+++ b/legacy/Data/ingsw/0721_13/correct.txt
@@ -0,0 +1,18 @@
+
+function next
+input Integer x;
+output Integer y;
+algorithm
+ y := 1 - x;
+end next;
+
+class System
+Integer x;
+initial equation
+x = 0;
+equation
+when sample(0, 1) then
+ x = next(pre(x));
+end when;
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_13/quest.txt b/legacy/Data/ingsw/0721_13/quest.txt
new file mode 100644
index 0000000..c105449
--- /dev/null
+++ b/legacy/Data/ingsw/0721_13/quest.txt
@@ -0,0 +1,4 @@
+Si consideri l'automa seguente:
+0->1 e 1->0
+
+Quale dei seguenti modelli Modelica fornisce un modello ragionevole per l'automa di cui sopra.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_13/wrong1.txt b/legacy/Data/ingsw/0721_13/wrong1.txt
new file mode 100644
index 0000000..9b5317b
--- /dev/null
+++ b/legacy/Data/ingsw/0721_13/wrong1.txt
@@ -0,0 +1,18 @@
+
+function next
+input Integer x;
+output Integer y;
+algorithm
+ y := 1 - x;
+end next;
+
+class System
+Integer x;
+initial equation
+x = 0;
+equation
+when sample(0, 1) then
+ x = next(pre(x));
+end when;
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_13/wrong2.txt b/legacy/Data/ingsw/0721_13/wrong2.txt
new file mode 100644
index 0000000..78c7306
--- /dev/null
+++ b/legacy/Data/ingsw/0721_13/wrong2.txt
@@ -0,0 +1,18 @@
+
+function next
+input Integer x;
+output Integer y;
+algorithm
+ y := x;
+end next;
+
+class System
+Integer x;
+initial equation
+x = 0;
+equation
+when sample(0, 1) then
+ x = next(pre(x));
+end when;
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_15/correct.txt b/legacy/Data/ingsw/0721_15/correct.txt
new file mode 100644
index 0000000..355e195
--- /dev/null
+++ b/legacy/Data/ingsw/0721_15/correct.txt
@@ -0,0 +1 @@
+Costruire un prototipo, metterlo in esercizio ed accertarsi che i porti i benefici attesi.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_15/quest.txt b/legacy/Data/ingsw/0721_15/quest.txt
new file mode 100644
index 0000000..15dbdf2
--- /dev/null
+++ b/legacy/Data/ingsw/0721_15/quest.txt
@@ -0,0 +1 @@
+Quali delle seguenti attività può contribuire a validare i requisiti di un sistema ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_15/wrong1.txt b/legacy/Data/ingsw/0721_15/wrong1.txt
new file mode 100644
index 0000000..6806506
--- /dev/null
+++ b/legacy/Data/ingsw/0721_15/wrong1.txt
@@ -0,0 +1 @@
+Costruire un prototipo e valutarne attentamente le performance.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_15/wrong2.txt b/legacy/Data/ingsw/0721_15/wrong2.txt
new file mode 100644
index 0000000..586ebee
--- /dev/null
+++ b/legacy/Data/ingsw/0721_15/wrong2.txt
@@ -0,0 +1 @@
+Costruire un prototipo e testarlo a fondo per evidenziare subito errori di implementazione.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_17/correct.txt b/legacy/Data/ingsw/0721_17/correct.txt
new file mode 100644
index 0000000..d3826b5
--- /dev/null
+++ b/legacy/Data/ingsw/0721_17/correct.txt
@@ -0,0 +1 @@
+Ad ogni istante di tempo della forma 1 + 4*k (k = 0, 1, 2, 3, ...), x vale "true".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_17/quest.txt b/legacy/Data/ingsw/0721_17/quest.txt
new file mode 100644
index 0000000..4e55a8a
--- /dev/null
+++ b/legacy/Data/ingsw/0721_17/quest.txt
@@ -0,0 +1,13 @@
+Si consideri il seguente modello Modelica.
+
+class System
+Boolean x;
+initial equation
+x = false;
+equation
+when sample(0, 2) then
+ x = not (pre(x));
+end when;
+end System;
+
+Quale delle seguenti affermazioni vale per la variabile booleana x ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_17/wrong1.txt b/legacy/Data/ingsw/0721_17/wrong1.txt
new file mode 100644
index 0000000..6245a2f
--- /dev/null
+++ b/legacy/Data/ingsw/0721_17/wrong1.txt
@@ -0,0 +1 @@
+At time instants of form 1 + 4*k (with k = 0, 1, 2, 3, ...) x takes value "false".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_17/wrong2.txt b/legacy/Data/ingsw/0721_17/wrong2.txt
new file mode 100644
index 0000000..0ba96d3
--- /dev/null
+++ b/legacy/Data/ingsw/0721_17/wrong2.txt
@@ -0,0 +1 @@
+Ad ogni istante di tempo della forma 3 + 4*k (k = 0, 1, 2, 3, ...), x vale "true".
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_18/correct.txt b/legacy/Data/ingsw/0721_18/correct.txt
new file mode 100644
index 0000000..eea60e9
--- /dev/null
+++ b/legacy/Data/ingsw/0721_18/correct.txt
@@ -0,0 +1,16 @@
+
+model Env
+Integer x; // Pulsante premuto dall'utente
+Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+algorithm
+when initial() then
+ state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+ x := 0;
+ r1024 := 0;
+elsewhen sample(0,1) then
+ (r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+ if (r1024 <= 0.6) then x := 0; else x := 1; end if;
+end when;
+end Env;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_18/quest.txt b/legacy/Data/ingsw/0721_18/quest.txt
new file mode 100644
index 0000000..c46480d
--- /dev/null
+++ b/legacy/Data/ingsw/0721_18/quest.txt
@@ -0,0 +1,3 @@
+L'input ad un sistema è costituito da un utente (umano) che preme due pulsanti etichettati con 0 ed 1.
+Con probabilità 0.6 l'utente preme il pulsante 0, con probabilità 0.4 l'utente preme il pulsante 1.
+Quale dei seguenti modelli Modelica fornisce un modello ragionevole per l'utente di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_18/wrong1.txt b/legacy/Data/ingsw/0721_18/wrong1.txt
new file mode 100644
index 0000000..f66dbc7
--- /dev/null
+++ b/legacy/Data/ingsw/0721_18/wrong1.txt
@@ -0,0 +1,16 @@
+
+model Env
+Integer x; // Pulsante premuto dall'utente
+Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+algorithm
+when initial() then
+ state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+ x := 0;
+ r1024 := 0;
+elsewhen sample(0,1) then
+ (r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+ if (r1024 >= 0.6) then x := 0; else x := 1; end if;
+end when;
+end Env;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_18/wrong2.txt b/legacy/Data/ingsw/0721_18/wrong2.txt
new file mode 100644
index 0000000..2192e79
--- /dev/null
+++ b/legacy/Data/ingsw/0721_18/wrong2.txt
@@ -0,0 +1,16 @@
+
+model Env
+Integer x; // Pulsante premuto dall'utente
+Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+algorithm
+when initial() then
+ state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+ x := 0;
+ r1024 := 0;
+elsewhen sample(0,1) then
+ (r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+ if (r1024 <= 0.6) then x := 1; else x := 0; end if;
+end when;
+end Env;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_19/correct.txt b/legacy/Data/ingsw/0721_19/correct.txt
new file mode 100644
index 0000000..44ac343
--- /dev/null
+++ b/legacy/Data/ingsw/0721_19/correct.txt
@@ -0,0 +1,35 @@
+
+model System
+parameter Integer F1 = 1;
+parameter Integer F2 = 2;
+parameter Integer F3 = 3;
+parameter Integer End = 4;
+parameter Real p = 0.3;
+parameter Real A[4, 4] =
+[
+0, 1, 0, 0;
+p, 0, 1-p, 0;
+0, p, 0, 1-p;
+0, 0, 0, 1
+];
+Integer x; Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+algorithm
+when initial() then
+ state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+ x := F1;
+ r1024 := 0;
+elsewhen sample(0,1) then
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+if (r1024 <= A[x, F1]) then
+ x := F1;
+ elseif (r1024 <= A[x, F1] + A[x, F2]) then
+ x := F2;
+ elseif (r1024 <= A[x, F1] + A[x, F2] + A[x, F3]) then
+ x := F3;
+ else
+ x := End;
+end if;
+end when;
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_19/quest.txt b/legacy/Data/ingsw/0721_19/quest.txt
new file mode 100644
index 0000000..6229852
--- /dev/null
+++ b/legacy/Data/ingsw/0721_19/quest.txt
@@ -0,0 +1,4 @@
+img=https://i.imgur.com/c4UjAQc.png
+Si consideri la seguente Markov Chain:
+
+Quale dei seguenti modelli Modelica fornisce un modello ragionevole per la Markov Chain di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_19/wrong1.txt b/legacy/Data/ingsw/0721_19/wrong1.txt
new file mode 100644
index 0000000..45f3fbe
--- /dev/null
+++ b/legacy/Data/ingsw/0721_19/wrong1.txt
@@ -0,0 +1,35 @@
+
+model System
+parameter Integer F1 = 1;
+parameter Integer F2 = 2;
+parameter Integer F3 = 3;
+parameter Integer End = 4;
+parameter Real p = 0.3;
+parameter Real A[4, 4] =
+[
+0, 1, 0, 0;
+p, 1-p, 0, 0;
+0, 0, p, 1-p;
+0, 0, 0, 1
+];
+Integer x; Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+algorithm
+when initial() then
+state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+x := F1;
+r1024 := 0;
+elsewhen sample(0,1) then
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+if (r1024 <= A[x, F1]) then
+ x := F1;
+ elseif (r1024 <= A[x, F1] + A[x, F2]) then
+ x := F2;
+ elseif (r1024 <= A[x, F1] + A[x, F2] + A[x, F3]) then
+ x := F3;
+ else
+ x := End;
+end if;
+end when;
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_19/wrong2.txt b/legacy/Data/ingsw/0721_19/wrong2.txt
new file mode 100644
index 0000000..f6b2fef
--- /dev/null
+++ b/legacy/Data/ingsw/0721_19/wrong2.txt
@@ -0,0 +1,35 @@
+
+model System
+parameter Integer F1 = 1;
+parameter Integer F2 = 2;
+parameter Integer F3 = 3;
+parameter Integer End = 4;
+parameter Real p = 0.3;
+parameter Real A[4, 4] =
+[
+0, 1, 0, 0;
+p, 0, 0, 1-p;
+0, 0, p, 1-p;
+0, 0, 0, 1
+];
+Integer x; Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+algorithm
+when initial() then
+state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+x := F1;
+r1024 := 0;
+elsewhen sample(0,1) then
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+if (r1024 <= A[x, F1]) then
+ x := F1;
+ elseif (r1024 <= A[x, F1] + A[x, F2]) then
+ x := F2;
+ elseif (r1024 <= A[x, F1] + A[x, F2] + A[x, F3]) then
+ x := F3;
+ else
+ x := End;
+end if;
+end when;
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_21/correct.txt b/legacy/Data/ingsw/0721_21/correct.txt
new file mode 100644
index 0000000..67edba8
--- /dev/null
+++ b/legacy/Data/ingsw/0721_21/correct.txt
@@ -0,0 +1 @@
+Costruire un modello di simulazione per i principali aspetti dei processi di business dell'azienda e per il sistema software da realizzare e valutare le migliorie apportate dal sistema software ai processi di business dell'azienda mediante simulazione.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_21/quest.txt b/legacy/Data/ingsw/0721_21/quest.txt
new file mode 100644
index 0000000..02d9102
--- /dev/null
+++ b/legacy/Data/ingsw/0721_21/quest.txt
@@ -0,0 +1 @@
+Una azienda finanziaria desidera costruire un sistema software per ottimizzare i processi di business. Quali delle seguenti attività può contribuire a validare i requisiti del sistema ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_21/wrong1.txt b/legacy/Data/ingsw/0721_21/wrong1.txt
new file mode 100644
index 0000000..2c917d7
--- /dev/null
+++ b/legacy/Data/ingsw/0721_21/wrong1.txt
@@ -0,0 +1 @@
+Costruire un prototipo del sistema e valutarne i requisiti non funzionali usando i dati storici dall'azienda.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_21/wrong2.txt b/legacy/Data/ingsw/0721_21/wrong2.txt
new file mode 100644
index 0000000..1aa1cd5
--- /dev/null
+++ b/legacy/Data/ingsw/0721_21/wrong2.txt
@@ -0,0 +1 @@
+Costruire un prototipo del sistema e testarlo rispetto ai requisiti funzionali usando i dati storici dall'azienda.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_28/correct.txt b/legacy/Data/ingsw/0721_28/correct.txt
new file mode 100644
index 0000000..c0acec0
--- /dev/null
+++ b/legacy/Data/ingsw/0721_28/correct.txt
@@ -0,0 +1,23 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Real x0 = 1;
+OutputReal x;
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+if (myrandom() <= 0.9)
+then
+ if (myrandom() <= 0.7)
+ then
+ x := 1.1*x;
+ else
+ x := 0.9*x;
+ end if;
+else
+ x := 0.73*x;
+end if;
+end when;
+end MarkovChain;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_28/quest.txt b/legacy/Data/ingsw/0721_28/quest.txt
new file mode 100644
index 0000000..04a9c59
--- /dev/null
+++ b/legacy/Data/ingsw/0721_28/quest.txt
@@ -0,0 +1,2 @@
+L'input di un sistema software è costituito da un sensore che ogni unità di tempo (ad esempio, un secondo) invia un numero reale. Con probabilità 0.63 il valore inviato in una unità di tempo è maggiore del 10% rispetto quello inviato nell'unità di tempo precedente. Con probabilità 0.1 è inferiore del 27% rispetto al valore inviato nell'unità di tempo precedente. Con probabilità 0.27 è inferiore del 10% rispetto quello inviato nell'unità di tempo precedente.
+Quale dei seguenti modelli Modelica modella correttamente l'environment descritto sopra.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_28/wrong1.txt b/legacy/Data/ingsw/0721_28/wrong1.txt
new file mode 100644
index 0000000..af5ef9e
--- /dev/null
+++ b/legacy/Data/ingsw/0721_28/wrong1.txt
@@ -0,0 +1,23 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Real x0 = 1;
+OutputReal x;
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+if (myrandom() <= 0.9)
+then
+ if (myrandom() <= 0.7)
+ then
+ x := 0.9*x;
+ else
+ x := 01.1*x;
+ end if;
+else
+ x := 0.73*x;
+end if;
+end when;
+end MarkovChain;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_28/wrong2.txt b/legacy/Data/ingsw/0721_28/wrong2.txt
new file mode 100644
index 0000000..7e94fc7
--- /dev/null
+++ b/legacy/Data/ingsw/0721_28/wrong2.txt
@@ -0,0 +1,23 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Real x0 = 1;
+OutputReal x;
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+if (myrandom() <= 0.7)
+then
+ if (myrandom() <= 0.9)
+ then
+ x := 1.1*x;
+ else
+ x := 0.9*x;
+ end if;
+else
+ x := 0.73*x;
+end if;
+end when;
+end MarkovChain;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_29/correct.txt b/legacy/Data/ingsw/0721_29/correct.txt
new file mode 100644
index 0000000..cb4fc9a
--- /dev/null
+++ b/legacy/Data/ingsw/0721_29/correct.txt
@@ -0,0 +1,21 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Real x0 = 0;
+OutputReal x;
+Integer countdown;
+algorithm
+when initial() then
+ x := x0;
+ countdown := 0;
+elsewhen sample(0, 1) then
+ if (countdown <= 0)
+ then
+ countdown := 1 + integer(floor(10*myrandom()));
+ x := x + (-1 + 2*myrandom());
+ else
+ countdown := countdown - 1;
+ end if;
+end when;
+end MarkovChain;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_29/quest.txt b/legacy/Data/ingsw/0721_29/quest.txt
new file mode 100644
index 0000000..8f5424d
--- /dev/null
+++ b/legacy/Data/ingsw/0721_29/quest.txt
@@ -0,0 +1,2 @@
+L'input di un sistema software è costituito da una sequenza di valori reali. Ad ogni unità di tempo il valore di input può rimanere uguale al precedente oppure differire di un numero random in [-1, 1]. L'input resta costante per numero random di unità di tempo in [1, 10].
+Quale dei seguenti modelli Modelica modella meglio l'environment descritto sopra.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_29/wrong1.txt b/legacy/Data/ingsw/0721_29/wrong1.txt
new file mode 100644
index 0000000..f32ca15
--- /dev/null
+++ b/legacy/Data/ingsw/0721_29/wrong1.txt
@@ -0,0 +1,21 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Real x0 = 0;
+OutputReal x;
+Integer countdown;
+algorithm
+when initial() then
+ x := x0;
+ countdown := 0;
+elsewhen sample(0, 1) then
+ if (countdown <= 0)
+ then
+ countdown := 1 + integer(floor(10*myrandom()));
+ x := x + (-1 + 4*myrandom());
+ else
+ countdown := countdown - 1;
+ end if;
+end when;
+end MarkovChain;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_29/wrong2.txt b/legacy/Data/ingsw/0721_29/wrong2.txt
new file mode 100644
index 0000000..38e1c17
--- /dev/null
+++ b/legacy/Data/ingsw/0721_29/wrong2.txt
@@ -0,0 +1,21 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Real x0 = 0;
+OutputReal x;
+Integer countdown;
+algorithm
+when initial() then
+ x := x0;
+ countdown := 0;
+elsewhen sample(0, 1) then
+ if (countdown <= 0)
+ then
+ countdown := 1 + integer(floor(10*myrandom()));
+ x := x - myrandom();
+ else
+ countdown := countdown - 1;
+ end if;
+end when;
+end MarkovChain;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_32/correct.txt b/legacy/Data/ingsw/0721_32/correct.txt
new file mode 100644
index 0000000..e13eda2
--- /dev/null
+++ b/legacy/Data/ingsw/0721_32/correct.txt
@@ -0,0 +1 @@
+Accertarsi che i requisiti definiscano un sistema che risolve il problema che l'utente pianifica di risolvere.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_32/quest.txt b/legacy/Data/ingsw/0721_32/quest.txt
new file mode 100644
index 0000000..ea06339
--- /dev/null
+++ b/legacy/Data/ingsw/0721_32/quest.txt
@@ -0,0 +1 @@
+Quali delle seguenti attività è parte del processo di validazione dei requisiti ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_32/wrong1.txt b/legacy/Data/ingsw/0721_32/wrong1.txt
new file mode 100644
index 0000000..b24f900
--- /dev/null
+++ b/legacy/Data/ingsw/0721_32/wrong1.txt
@@ -0,0 +1 @@
+Accertarsi che il sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_32/wrong2.txt b/legacy/Data/ingsw/0721_32/wrong2.txt
new file mode 100644
index 0000000..884d6b1
--- /dev/null
+++ b/legacy/Data/ingsw/0721_32/wrong2.txt
@@ -0,0 +1 @@
+Accertarsi che l'architettura del sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_33/correct.txt b/legacy/Data/ingsw/0721_33/correct.txt
new file mode 100644
index 0000000..9f4a8bf
--- /dev/null
+++ b/legacy/Data/ingsw/0721_33/correct.txt
@@ -0,0 +1,23 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Integer x0 = 0;
+OutputInteger x;
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+ if (myrandom() <= 0.8)
+ then
+ if (myrandom() <= 0.7)
+ then
+ x := 0;
+ else
+ x := 1;
+ end if;
+ else
+ x := -1;
+ end if;
+end when;
+end MarkovChain;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_33/quest.txt b/legacy/Data/ingsw/0721_33/quest.txt
new file mode 100644
index 0000000..496b6af
--- /dev/null
+++ b/legacy/Data/ingsw/0721_33/quest.txt
@@ -0,0 +1,2 @@
+L'environment di un sistema software è costituito da uno user che, ogni untià di tempo (ad esempio, un secondo) invia al sistema tre numeri: -1, 0, 1, con probabilità, rispettivamente, 0.2, 0.56, 0.24.
+Quale dei seguenti modelli Modelica modella correttamente l'environment descritto sopra.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_33/wrong1.txt b/legacy/Data/ingsw/0721_33/wrong1.txt
new file mode 100644
index 0000000..8e7ebc7
--- /dev/null
+++ b/legacy/Data/ingsw/0721_33/wrong1.txt
@@ -0,0 +1,23 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Integer x0 = 0;
+OutputInteger x;
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+ if (myrandom() <= 0.8)
+ then
+ if (myrandom() <= 0.7)
+ then
+ x := 1;
+ else
+ x := 0;
+ end if;
+ else
+ x := -1;
+ end if;
+end when;
+end MarkovChain;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_33/wrong2.txt b/legacy/Data/ingsw/0721_33/wrong2.txt
new file mode 100644
index 0000000..2fd0f2e
--- /dev/null
+++ b/legacy/Data/ingsw/0721_33/wrong2.txt
@@ -0,0 +1,23 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Integer x0 = 0;
+OutputInteger x;
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+ if (myrandom() <= 0.7)
+ then
+ if (myrandom() <= 0.8)
+ then
+ x := 0;
+ else
+ x := 1;
+ end if;
+ else
+ x := -1;
+ end if;
+end when;
+end MarkovChain;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_34/correct.txt b/legacy/Data/ingsw/0721_34/correct.txt
new file mode 100644
index 0000000..5bca5f8
--- /dev/null
+++ b/legacy/Data/ingsw/0721_34/correct.txt
@@ -0,0 +1 @@
+Testare le interfacce per ciascun componente.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_34/quest.txt b/legacy/Data/ingsw/0721_34/quest.txt
new file mode 100644
index 0000000..561755a
--- /dev/null
+++ b/legacy/Data/ingsw/0721_34/quest.txt
@@ -0,0 +1 @@
+Il component testing si concentra su:
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_34/wrong1.txt b/legacy/Data/ingsw/0721_34/wrong1.txt
new file mode 100644
index 0000000..7a3fe03
--- /dev/null
+++ b/legacy/Data/ingsw/0721_34/wrong1.txt
@@ -0,0 +1 @@
+Testare l'interazione tra molte componenti (cioè integrazione di molte unità).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_34/wrong2.txt b/legacy/Data/ingsw/0721_34/wrong2.txt
new file mode 100644
index 0000000..d4074cf
--- /dev/null
+++ b/legacy/Data/ingsw/0721_34/wrong2.txt
@@ -0,0 +1 @@
+Testare funzionalità di unità software individuali, oggetti, classi o metodi.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_36/correct.txt b/legacy/Data/ingsw/0721_36/correct.txt
new file mode 100644
index 0000000..3a0f9a1
--- /dev/null
+++ b/legacy/Data/ingsw/0721_36/correct.txt
@@ -0,0 +1 @@
+Stiamo costruendo il sistema giusto ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_36/quest.txt b/legacy/Data/ingsw/0721_36/quest.txt
new file mode 100644
index 0000000..f7ef080
--- /dev/null
+++ b/legacy/Data/ingsw/0721_36/quest.txt
@@ -0,0 +1 @@
+La validazione risponde alla seguenete domanda:
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_36/wrong1.txt b/legacy/Data/ingsw/0721_36/wrong1.txt
new file mode 100644
index 0000000..6633b8c
--- /dev/null
+++ b/legacy/Data/ingsw/0721_36/wrong1.txt
@@ -0,0 +1 @@
+Sono soddisfatti i requisti funzionali ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_36/wrong2.txt b/legacy/Data/ingsw/0721_36/wrong2.txt
new file mode 100644
index 0000000..7edd4bc
--- /dev/null
+++ b/legacy/Data/ingsw/0721_36/wrong2.txt
@@ -0,0 +1 @@
+Stiamo costruendo il sistema nel modo giusto ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_4/correct.txt b/legacy/Data/ingsw/0721_4/correct.txt
new file mode 100644
index 0000000..fe4a402
--- /dev/null
+++ b/legacy/Data/ingsw/0721_4/correct.txt
@@ -0,0 +1,21 @@
+
+model Env
+Integer x; // Pulsante premuto dall'utente (0 nessun pulsante)
+Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+algorithm
+when initial() then
+ state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+ x := 0;
+ r1024 := 0;
+elsewhen sample(0,1) then
+ (r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+ if (r1024 <= 0.5)
+ then x := 0;
+ else
+ (r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+ if (r1024 <= 0.4) then x := 1; else x:= 0; end if;
+ end if;
+end when;
+end Env;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_4/quest.txt b/legacy/Data/ingsw/0721_4/quest.txt
new file mode 100644
index 0000000..f50c002
--- /dev/null
+++ b/legacy/Data/ingsw/0721_4/quest.txt
@@ -0,0 +1,4 @@
+L'input ad un sistema è costituito da un utente (umano) che preme due pulsanti etichettati, rispettivamente, con 1 ed 2.
+L'utente può anche decidere di non premere alcun pulsante.
+Con probabilità 0.2 l'utente preme il pulsante 1, con probabilità 0.3 l'utente preme il pulsante 2, con probabilità 0.5 non fa nulla (pulsante 0 per convenzione).
+Quale dei seguenti modelli Modelica fornisce un modello ragionevole per l'utente di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_4/wrong1.txt b/legacy/Data/ingsw/0721_4/wrong1.txt
new file mode 100644
index 0000000..ad42984
--- /dev/null
+++ b/legacy/Data/ingsw/0721_4/wrong1.txt
@@ -0,0 +1,21 @@
+
+model Env
+Integer x; // Pulsante premuto dall'utente (0 nessun pulsante)
+Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+algorithm
+when initial() then
+ state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+ x := 0;
+ r1024 := 0;
+elsewhen sample(0,1) then
+ (r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+ if (r1024 <= 0.5)
+ then x := 0;
+ else
+ (r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+ if (r1024 <= 0.3) then x := 0; else x:= 1; end if;
+ end if;
+end when;
+end Env;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_4/wrong2.txt b/legacy/Data/ingsw/0721_4/wrong2.txt
new file mode 100644
index 0000000..bb62616
--- /dev/null
+++ b/legacy/Data/ingsw/0721_4/wrong2.txt
@@ -0,0 +1,21 @@
+
+model Env
+Integer x; // Pulsante premuto dall'utente (0 nessun pulsante)
+Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+algorithm
+when initial() then
+ state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+ x := 0;
+ r1024 := 0;
+elsewhen sample(0,1) then
+ (r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+ if (r1024 <= 0.5)
+ then x := 0;
+ else
+ (r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+ if (r1024 <= 0.2) then x := 1; else x:= 0; end if;
+ end if;
+end when;
+end Env;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_5/correct.txt b/legacy/Data/ingsw/0721_5/correct.txt
new file mode 100644
index 0000000..0902686
--- /dev/null
+++ b/legacy/Data/ingsw/0721_5/correct.txt
@@ -0,0 +1 @@
+Requisito funzionale.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_5/quest.txt b/legacy/Data/ingsw/0721_5/quest.txt
new file mode 100644
index 0000000..c5dbb4e
--- /dev/null
+++ b/legacy/Data/ingsw/0721_5/quest.txt
@@ -0,0 +1,2 @@
+"Ogni giorno, per ciascuna clinica, il sistema genererà una lista dei pazienti che hanno un appuntamento quel giorno."
+La frase precedente è un esempio di:
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_5/wrong1.txt b/legacy/Data/ingsw/0721_5/wrong1.txt
new file mode 100644
index 0000000..396c8d3
--- /dev/null
+++ b/legacy/Data/ingsw/0721_5/wrong1.txt
@@ -0,0 +1 @@
+Requisito di performance.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_5/wrong2.txt b/legacy/Data/ingsw/0721_5/wrong2.txt
new file mode 100644
index 0000000..6084c49
--- /dev/null
+++ b/legacy/Data/ingsw/0721_5/wrong2.txt
@@ -0,0 +1 @@
+Requisito non-funzionale.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_6/correct.txt b/legacy/Data/ingsw/0721_6/correct.txt
new file mode 100644
index 0000000..fc3d081
--- /dev/null
+++ b/legacy/Data/ingsw/0721_6/correct.txt
@@ -0,0 +1,14 @@
+
+class System
+Real x; // MB in buffer
+Real u; // input pulse
+initial equation
+x = 3;
+u = 0;
+equation
+when sample(0, 1) then
+ u = 1 - pre(u);
+end when;
+der(x) = 2*u - 1.0;
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_6/quest.txt b/legacy/Data/ingsw/0721_6/quest.txt
new file mode 100644
index 0000000..40a0c99
--- /dev/null
+++ b/legacy/Data/ingsw/0721_6/quest.txt
@@ -0,0 +1 @@
+Un I/O buffer è alimentato da una componente che fornisce un input periodico di periodo 2 secondi. Durante la prima met� del periodo, l'input rate è 2MB/s mentre durante la seconda metà del periodo l'input rate è 0. Quindi l'input rate medio è di 1MB/s. L' I/O buffer, a sua volta, alimenta una componente che richiede (in media) 1MB/s. Quale dei seguenti modelli Modelica è un modello ragionevole per il sistema descritto sopra ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_6/wrong1.txt b/legacy/Data/ingsw/0721_6/wrong1.txt
new file mode 100644
index 0000000..eeb1bba
--- /dev/null
+++ b/legacy/Data/ingsw/0721_6/wrong1.txt
@@ -0,0 +1,14 @@
+
+class System
+Real x; // MB in buffer
+Real u; // input pulse
+initial equation
+x = 3;
+u = 0;
+equation
+when sample(0, 1) then
+ u = 1 - pre(u);
+end when;
+der(x) = 2*u - 2.0;
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_6/wrong2.txt b/legacy/Data/ingsw/0721_6/wrong2.txt
new file mode 100644
index 0000000..eb68041
--- /dev/null
+++ b/legacy/Data/ingsw/0721_6/wrong2.txt
@@ -0,0 +1,14 @@
+
+class System
+Real x; // MB in buffer
+Real u; // input pulse
+initial equation
+x = 3;
+u = 0;
+equation
+when sample(0, 1) then
+ u = 1 - pre(u);
+end when;
+der(x) = 2*u + 1.0;
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_8/correct.txt b/legacy/Data/ingsw/0721_8/correct.txt
new file mode 100644
index 0000000..99b5226
--- /dev/null
+++ b/legacy/Data/ingsw/0721_8/correct.txt
@@ -0,0 +1,35 @@
+
+model System
+parameter Integer F1 = 1;
+parameter Integer F2 = 2;
+parameter Integer F3 = 3;
+parameter Integer End = 4;
+parameter Real p = 0.3;
+parameter Real A[4, 4] =
+[
+p, 1-p, 0, 0;
+p, 0, 1-p, 0;
+p, 0, 0, 1-p;
+0, 0, 0, 1
+];
+Integer x; Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+algorithm
+when initial() then
+ state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+ x := F1;
+ r1024 := 0;
+elsewhen sample(0,1) then
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+if (r1024 <= A[x, F1]) then
+ x := F1;
+ elseif (r1024 <= A[x, F1] + A[x, F2]) then
+ x := F2;
+ elseif (r1024 <= A[x, F1] + A[x, F2] + A[x, F3]) then
+ x := F3;
+ else
+ x := End;
+end if;
+end when;
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_8/quest.txt b/legacy/Data/ingsw/0721_8/quest.txt
new file mode 100644
index 0000000..ebf5ec9
--- /dev/null
+++ b/legacy/Data/ingsw/0721_8/quest.txt
@@ -0,0 +1,4 @@
+img=https://i.imgur.com/rw4Tvcj.png
+
+Si consideri la seguente Markov Chain:
+Quale dei seguenti modelli Modelica fornisce un modello ragionevole per la Markov Chain di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_8/wrong1.txt b/legacy/Data/ingsw/0721_8/wrong1.txt
new file mode 100644
index 0000000..75546bd
--- /dev/null
+++ b/legacy/Data/ingsw/0721_8/wrong1.txt
@@ -0,0 +1,35 @@
+
+model System
+parameter Integer F1 = 1;
+parameter Integer F2 = 2;
+parameter Integer F3 = 3;
+parameter Integer End = 4;
+parameter Real p = 0.3;
+parameter Real A[4, 4] =
+[
+p, 0 , 1-p, 0;
+p, 1-p, 0, 0;
+p, 0, 0, 1-p;
+0, 0, 0, 1
+];
+Integer x; Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+algorithm
+when initial() then
+state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+x := F1;
+r1024 := 0;
+elsewhen sample(0,1) then
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+if (r1024 <= A[x, F1]) then
+ x := F1;
+ elseif (r1024 <= A[x, F1] + A[x, F2]) then
+ x := F2;
+ elseif (r1024 <= A[x, F1] + A[x, F2] + A[x, F3]) then
+ x := F3;
+ else
+ x := End;
+end if;
+end when;
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_8/wrong2.txt b/legacy/Data/ingsw/0721_8/wrong2.txt
new file mode 100644
index 0000000..ed6823c
--- /dev/null
+++ b/legacy/Data/ingsw/0721_8/wrong2.txt
@@ -0,0 +1,35 @@
+
+model System
+parameter Integer F1 = 1;
+parameter Integer F2 = 2;
+parameter Integer F3 = 3;
+parameter Integer End = 4;
+parameter Real p = 0.3;
+parameter Real A[4, 4] =
+[
+p, 0, 1-p, 0;
+0, p, 1-p, 0;
+p, 0, 0, 1-p;
+0, 0, 0, 1
+];
+Integer x; Real r1024;
+Integer state1024[Modelica.Math.Random.Generators.Xorshift1024star.nState];
+algorithm
+when initial() then
+state1024 := Modelica.Math.Random.Generators.Xorshift1024star.initialState(614657, 30020);
+x := F1;
+r1024 := 0;
+elsewhen sample(0,1) then
+(r1024,state1024) := Modelica.Math.Random.Generators.Xorshift1024star.random(pre(state1024));
+if (r1024 <= A[x, F1]) then
+ x := F1;
+ elseif (r1024 <= A[x, F1] + A[x, F2]) then
+ x := F2;
+ elseif (r1024 <= A[x, F1] + A[x, F2] + A[x, F3]) then
+ x := F3;
+ else
+ x := End;
+end if;
+end when;
+end System;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_1/correct.txt b/legacy/Data/ingsw/0722_1/correct.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/0722_1/correct.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_1/quest.txt b/legacy/Data/ingsw/0722_1/quest.txt
new file mode 100644
index 0000000..e6594c7
--- /dev/null
+++ b/legacy/Data/ingsw/0722_1/quest.txt
@@ -0,0 +1,19 @@
+img=https://i.imgur.com/HZd8X10.png
+La state coverage di un insieme di test cases (cioè sequenze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+
+
+Si consideri il seguente insieme di test cases:
+
+
+
+Test case 1: act0 act0 act2 act0 act0 act0 act2 act1 act2 act0 act2 act2 act2 act2 act0 act0 act1 act2 act2 act0 act2 act0 act2 act1 act0 act2 act1 act2 act2 act0 act2
+
+Test case 2: act2 act2 act1 act0 act0 act0 act0 act2 act2 act1 act2
+
+Test case 3: act2 act2 act2 act1 act0 act2 act2 act0 act2
+
+
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_1/wrong 1.txt b/legacy/Data/ingsw/0722_1/wrong 1.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0722_1/wrong 1.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_1/wrong 2.txt b/legacy/Data/ingsw/0722_1/wrong 2.txt
new file mode 100644
index 0000000..a8aead7
--- /dev/null
+++ b/legacy/Data/ingsw/0722_1/wrong 2.txt
@@ -0,0 +1 @@
+State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_10/correct.txt b/legacy/Data/ingsw/0722_10/correct.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0722_10/correct.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_10/quest.txt b/legacy/Data/ingsw/0722_10/quest.txt
new file mode 100644
index 0000000..c18ff48
--- /dev/null
+++ b/legacy/Data/ingsw/0722_10/quest.txt
@@ -0,0 +1,20 @@
+img=https://i.imgur.com/pz1HiRX.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 act2
+
+Test case 2: act0 act1 act1 act1 act2 act2 act1 act0 act1
+
+Test case 3: act0 act0
+
+
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_10/wrong 1.txt b/legacy/Data/ingsw/0722_10/wrong 1.txt
new file mode 100644
index 0000000..52f25fe
--- /dev/null
+++ b/legacy/Data/ingsw/0722_10/wrong 1.txt
@@ -0,0 +1 @@
+70%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_10/wrong 2.txt b/legacy/Data/ingsw/0722_10/wrong 2.txt
new file mode 100644
index 0000000..1e091a3
--- /dev/null
+++ b/legacy/Data/ingsw/0722_10/wrong 2.txt
@@ -0,0 +1 @@
+90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_11/correct.txt b/legacy/Data/ingsw/0722_11/correct.txt
new file mode 100644
index 0000000..f293f3e
--- /dev/null
+++ b/legacy/Data/ingsw/0722_11/correct.txt
@@ -0,0 +1 @@
+(a = 6, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 0)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_11/quest.txt b/legacy/Data/ingsw/0722_11/quest.txt
new file mode 100644
index 0000000..709cf96
--- /dev/null
+++ b/legacy/Data/ingsw/0722_11/quest.txt
@@ -0,0 +1,22 @@
+Una Condition è una proposizione booleana, cioè una espressione con valore booleano che non può essere decomposta
+in espressioni boolean più semplici. Ad esempio, (x + y <= 3) è una condition.
+
+Una Decision è una espressione booleana composta da conditions e zero o più operatori booleani. Ad esempio, sono decisions:
+(x + y <= 3)
+((x + y <= 3) || (x - y > 7))
+Un insieme di test cases T soddisfa il criterio di Condition/Decision coverage se tutte le seguenti condizioni sono soddisfatte:
+
+1) Ciascun punto di entrata ed uscita nel programma è eseguito in almeno un test;
+2) Per ogni decision d nel programma, per ogni condition c in d, esiste un test in T in cui c è true ed un test in T in cui c è false.
+3) Per ogni decision d nel programma, esiste un test in T in cui d è true ed un test in T in cui d è false.
+
+Si consideri la seguente funzione:
+int f(int a, int b, int c)
+{ if ( (a + b >= 6) && (b - c <= 1) )
+ return (1); // punto di uscita 1
+ else if ((b - c <= 1) || (b + c >= 5))
+ then return (2); // punto di uscita 2
+ else return (3); // punto di uscita 3
+}
+
+Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_11/wrong 1.txt b/legacy/Data/ingsw/0722_11/wrong 1.txt
new file mode 100644
index 0000000..eafabb1
--- /dev/null
+++ b/legacy/Data/ingsw/0722_11/wrong 1.txt
@@ -0,0 +1 @@
+(a = 6, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 2)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_11/wrong 2.txt b/legacy/Data/ingsw/0722_11/wrong 2.txt
new file mode 100644
index 0000000..fc010a3
--- /dev/null
+++ b/legacy/Data/ingsw/0722_11/wrong 2.txt
@@ -0,0 +1 @@
+(a = 5, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 0)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_12/correct.txt b/legacy/Data/ingsw/0722_12/correct.txt
new file mode 100644
index 0000000..8785661
--- /dev/null
+++ b/legacy/Data/ingsw/0722_12/correct.txt
@@ -0,0 +1 @@
+{x = -200, x = -50, x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_12/quest.txt b/legacy/Data/ingsw/0722_12/quest.txt
new file mode 100644
index 0000000..58ef38e
--- /dev/null
+++ b/legacy/Data/ingsw/0722_12/quest.txt
@@ -0,0 +1,11 @@
+Il partition coverage di un insieme di test cases è la percentuale di elementi della partition inclusi nei test cases. La partition è una partizione finita dell'insieme di input della funzione che si sta testando.
+
+Si consideri la seguente funzione C:
+
+int f1(int x) { return (x + 7); }
+
+Si vuole testare la funzione f1(). A tal fine l'insieme degli interi viene partizionato come segue:
+
+{(-inf, -101], [-100, -1], {0}, [1, 500], [501, +inf)}
+
+Quale dei seguenti test cases consegue una partition coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_12/wrong 1.txt b/legacy/Data/ingsw/0722_12/wrong 1.txt
new file mode 100644
index 0000000..a6df32d
--- /dev/null
+++ b/legacy/Data/ingsw/0722_12/wrong 1.txt
@@ -0,0 +1 @@
+{x = -200, x = -150, x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_12/wrong 2.txt b/legacy/Data/ingsw/0722_12/wrong 2.txt
new file mode 100644
index 0000000..0aaedb8
--- /dev/null
+++ b/legacy/Data/ingsw/0722_12/wrong 2.txt
@@ -0,0 +1 @@
+{x = -200, x = -50, x = 0, x = 100, x = 500}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_13/correct.txt b/legacy/Data/ingsw/0722_13/correct.txt
new file mode 100644
index 0000000..b110af1
--- /dev/null
+++ b/legacy/Data/ingsw/0722_13/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_13/quest.txt b/legacy/Data/ingsw/0722_13/quest.txt
new file mode 100644
index 0000000..83987bd
--- /dev/null
+++ b/legacy/Data/ingsw/0722_13/quest.txt
@@ -0,0 +1,15 @@
+img=https://i.imgur.com/dMvnEEi.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 act2 act2 act0
+
+Test case 2: act0 act1 act2 act0 act2
+
+Test case 3: act2 act2 act2 act2
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_13/wrong 1.txt b/legacy/Data/ingsw/0722_13/wrong 1.txt
new file mode 100644
index 0000000..eb5e1cd
--- /dev/null
+++ b/legacy/Data/ingsw/0722_13/wrong 1.txt
@@ -0,0 +1 @@
+Transition coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_13/wrong 2.txt b/legacy/Data/ingsw/0722_13/wrong 2.txt
new file mode 100644
index 0000000..cf27703
--- /dev/null
+++ b/legacy/Data/ingsw/0722_13/wrong 2.txt
@@ -0,0 +1 @@
+Transition coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_14/correct.txt b/legacy/Data/ingsw/0722_14/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0722_14/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_14/quest.txt b/legacy/Data/ingsw/0722_14/quest.txt
new file mode 100644
index 0000000..f3d1bcd
--- /dev/null
+++ b/legacy/Data/ingsw/0722_14/quest.txt
@@ -0,0 +1,17 @@
+Il branch coverage di un insieme di test cases è la percentuale di branch del programma che sono attraversati da almeno un test case.
+
+Si consideri la seguente funzione C:
+
+-----------
+
+int f(int x, int y) {
+
+ if (x - y <= 2) { if (x + y >= 1) return (1); else return (2); }
+
+ else {if (x + 2*y >= 5) return (3); else return (4); }
+
+ } /* f() */
+
+Si considerino i seguenti test cases: {x=1, y=2}, {x=0, y=0}, {x=5, y=0}, {x=3, y=0}.
+
+Quale delle seguenti è la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_14/wrong 1.txt b/legacy/Data/ingsw/0722_14/wrong 1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0722_14/wrong 1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_14/wrong 2.txt b/legacy/Data/ingsw/0722_14/wrong 2.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0722_14/wrong 2.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_15/correct.txt b/legacy/Data/ingsw/0722_15/correct.txt
new file mode 100644
index 0000000..973ef63
--- /dev/null
+++ b/legacy/Data/ingsw/0722_15/correct.txt
@@ -0,0 +1 @@
+State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_15/quest.txt b/legacy/Data/ingsw/0722_15/quest.txt
new file mode 100644
index 0000000..035eb2b
--- /dev/null
+++ b/legacy/Data/ingsw/0722_15/quest.txt
@@ -0,0 +1,16 @@
+img=https://i.imgur.com/wYIAk1e.png
+La state coverage di un insieme di test cases (cioè sequeze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+
+
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act1 act0 act2 act0
+
+Test case 2: act0 act1 act2 act2 act0
+
+
+Test case 3: act0 act0 act0
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_15/wrong 1.txt b/legacy/Data/ingsw/0722_15/wrong 1.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/0722_15/wrong 1.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_15/wrong 2.txt b/legacy/Data/ingsw/0722_15/wrong 2.txt
new file mode 100644
index 0000000..a8aead7
--- /dev/null
+++ b/legacy/Data/ingsw/0722_15/wrong 2.txt
@@ -0,0 +1 @@
+State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_16/correct.txt b/legacy/Data/ingsw/0722_16/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0722_16/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_16/quest.txt b/legacy/Data/ingsw/0722_16/quest.txt
new file mode 100644
index 0000000..12ae518
--- /dev/null
+++ b/legacy/Data/ingsw/0722_16/quest.txt
@@ -0,0 +1,17 @@
+Il branch coverage di un insieme di test cases è la percentuale di branch del programma che sono attraversati da almeno un test case.
+
+Si consideri la seguente funzione C:
+
+-----------
+
+int f(int x, int y) {
+
+ if (x - y <= 0) { if (x + y >= 2) return (1); else return (2); }
+
+ else {if (2*x + y >= 1) return (3); else return (4); }
+
+ } /* f() */
+
+Si considerino i seguenti test cases: {x=1, y=1}, {x=0, y=0}, {x=1, y=0}, {x=0, y=-1}.
+
+Quale delle seguenti è la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_16/wrong 1.txt b/legacy/Data/ingsw/0722_16/wrong 1.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0722_16/wrong 1.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_16/wrong 2.txt b/legacy/Data/ingsw/0722_16/wrong 2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0722_16/wrong 2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_17/correct.txt b/legacy/Data/ingsw/0722_17/correct.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0722_17/correct.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_17/quest.txt b/legacy/Data/ingsw/0722_17/quest.txt
new file mode 100644
index 0000000..3150037
--- /dev/null
+++ b/legacy/Data/ingsw/0722_17/quest.txt
@@ -0,0 +1,16 @@
+img=https://i.imgur.com/ixzrFpG.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 act1 act1
+
+Test case 2: act1 act2 act1 act1 act0 act0 act0 act1 act2 act1 act2 act1 act2 act2 act0 act2 act0 act1 act2 act2 act0 act2 act2 act2
+
+Test case 3: act0 act1 act1 act0 act2 act2 act0 act2 act0 act2 act0 act2 act0 act0 act0 act0 act0 act0 act1 act1 act2
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_17/wrong 1.txt b/legacy/Data/ingsw/0722_17/wrong 1.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0722_17/wrong 1.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_17/wrong 2.txt b/legacy/Data/ingsw/0722_17/wrong 2.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0722_17/wrong 2.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_18/correct.txt b/legacy/Data/ingsw/0722_18/correct.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/0722_18/correct.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_18/quest.txt b/legacy/Data/ingsw/0722_18/quest.txt
new file mode 100644
index 0000000..ca50f58
--- /dev/null
+++ b/legacy/Data/ingsw/0722_18/quest.txt
@@ -0,0 +1,16 @@
+img=https://i.imgur.com/a7JeI7m.png
+La state coverage di un insieme di test cases (cioè sequeze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act1 act2 act2 act2 act2 act0 act2
+
+Test case 2: act2 act0 act0 act2 act0
+
+Test case 3: act2 act2 act0 act2 act2 act0
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_18/wrong 1.txt b/legacy/Data/ingsw/0722_18/wrong 1.txt
new file mode 100644
index 0000000..f6a4b07
--- /dev/null
+++ b/legacy/Data/ingsw/0722_18/wrong 1.txt
@@ -0,0 +1 @@
+State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_18/wrong 2.txt b/legacy/Data/ingsw/0722_18/wrong 2.txt
new file mode 100644
index 0000000..a8aead7
--- /dev/null
+++ b/legacy/Data/ingsw/0722_18/wrong 2.txt
@@ -0,0 +1 @@
+State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_19/correct.txt b/legacy/Data/ingsw/0722_19/correct.txt
new file mode 100644
index 0000000..8b0c318
--- /dev/null
+++ b/legacy/Data/ingsw/0722_19/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_19/quest.txt b/legacy/Data/ingsw/0722_19/quest.txt
new file mode 100644
index 0000000..a412231
--- /dev/null
+++ b/legacy/Data/ingsw/0722_19/quest.txt
@@ -0,0 +1,17 @@
+img=https://i.imgur.com/Rd4gO4k.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: act0 act2 act1 act2
+
+Test case 2: act2 act2 act1 act2 act2
+
+
+Test case 3: act2 act1 act0 act2
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_19/wrong 1.txt b/legacy/Data/ingsw/0722_19/wrong 1.txt
new file mode 100644
index 0000000..eb5e1cd
--- /dev/null
+++ b/legacy/Data/ingsw/0722_19/wrong 1.txt
@@ -0,0 +1 @@
+Transition coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_19/wrong 2.txt b/legacy/Data/ingsw/0722_19/wrong 2.txt
new file mode 100644
index 0000000..a29d476
--- /dev/null
+++ b/legacy/Data/ingsw/0722_19/wrong 2.txt
@@ -0,0 +1 @@
+Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_2/correct.txt b/legacy/Data/ingsw/0722_2/correct.txt
new file mode 100644
index 0000000..7d0c43c
--- /dev/null
+++ b/legacy/Data/ingsw/0722_2/correct.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x > 0) && (y > 0) && ((x > 1) || (y > 1)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_2/quest.txt b/legacy/Data/ingsw/0722_2/quest.txt
new file mode 100644
index 0000000..8210340
--- /dev/null
+++ b/legacy/Data/ingsw/0722_2/quest.txt
@@ -0,0 +1,7 @@
+Pre-condizioni, invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in ). In particolare, assert(expre) non fa nulla se l'espressione expre vale TRUE (cioè non è 0), stampa un messaggio di errore su stderr e abortisce l'esecuzione del programma altrimenti.
+
+Si consideri la funzione C
+
+int f(in x, int y) { ..... }
+
+Quale delle seguenti assert esprime la pre-condizione che entrambi gli argomenti di f sono positivi ed almeno uno di loro è maggiore di 1 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_2/wrong 1.txt b/legacy/Data/ingsw/0722_2/wrong 1.txt
new file mode 100644
index 0000000..392cc67
--- /dev/null
+++ b/legacy/Data/ingsw/0722_2/wrong 1.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x >= 0) && (y >= 0) && ((x > 1) || (y > 1)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_2/wrong 2.txt b/legacy/Data/ingsw/0722_2/wrong 2.txt
new file mode 100644
index 0000000..2fde3f0
--- /dev/null
+++ b/legacy/Data/ingsw/0722_2/wrong 2.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x > 0) && (y > 0) && (x > 1) && (y > 1) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_20/correct.txt b/legacy/Data/ingsw/0722_20/correct.txt
new file mode 100644
index 0000000..973ef63
--- /dev/null
+++ b/legacy/Data/ingsw/0722_20/correct.txt
@@ -0,0 +1 @@
+State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_20/quest.txt b/legacy/Data/ingsw/0722_20/quest.txt
new file mode 100644
index 0000000..afddbb1
--- /dev/null
+++ b/legacy/Data/ingsw/0722_20/quest.txt
@@ -0,0 +1,15 @@
+img=https://i.imgur.com/dzwfqoB.png
+La state coverage di un insieme di test cases (cioè sequenze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+
+
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act0 act1 act2 act2 act2 act1 act1 act0 act0 act0 act0 act0 act1
+
+Test case 2: act1
+
+Test case 3: act0 act1 act2 act0 act2 act2 act2 act2 act0 act1
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_20/wrong 1.txt b/legacy/Data/ingsw/0722_20/wrong 1.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0722_20/wrong 1.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_20/wrong 2.txt b/legacy/Data/ingsw/0722_20/wrong 2.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/0722_20/wrong 2.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_21/correct.txt b/legacy/Data/ingsw/0722_21/correct.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0722_21/correct.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_21/quest.txt b/legacy/Data/ingsw/0722_21/quest.txt
new file mode 100644
index 0000000..37d7e62
--- /dev/null
+++ b/legacy/Data/ingsw/0722_21/quest.txt
@@ -0,0 +1,20 @@
+img=https://i.imgur.com/wVYqOVj.png
+La state coverage di un insieme di test cases (cioè sequenze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+
+
+
+Test case 1: act0 act2 act2 act1 act2 act1 act2 act0 act1
+
+Test case 2: act0 act2 act0
+
+Test case 3: act1 act1 act2
+
+
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_21/wrong 1.txt b/legacy/Data/ingsw/0722_21/wrong 1.txt
new file mode 100644
index 0000000..f6a4b07
--- /dev/null
+++ b/legacy/Data/ingsw/0722_21/wrong 1.txt
@@ -0,0 +1 @@
+State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_21/wrong 2.txt b/legacy/Data/ingsw/0722_21/wrong 2.txt
new file mode 100644
index 0000000..90b2f35
--- /dev/null
+++ b/legacy/Data/ingsw/0722_21/wrong 2.txt
@@ -0,0 +1 @@
+State coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_22/correct.txt b/legacy/Data/ingsw/0722_22/correct.txt
new file mode 100644
index 0000000..f6a4b07
--- /dev/null
+++ b/legacy/Data/ingsw/0722_22/correct.txt
@@ -0,0 +1 @@
+State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_22/quest.txt b/legacy/Data/ingsw/0722_22/quest.txt
new file mode 100644
index 0000000..fdca1b9
--- /dev/null
+++ b/legacy/Data/ingsw/0722_22/quest.txt
@@ -0,0 +1,16 @@
+img=https://i.imgur.com/zkjv6a7.png
+La state coverage di un insieme di test cases (cioè sequeze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+
+
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act2 act1 act2 act2 act1 act0 act1 act2 act2
+
+Test case 2: act0 act0 act2
+
+
+Test case 3: act2 act0 act2
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_22/wrong 1.txt b/legacy/Data/ingsw/0722_22/wrong 1.txt
new file mode 100644
index 0000000..1c07658
--- /dev/null
+++ b/legacy/Data/ingsw/0722_22/wrong 1.txt
@@ -0,0 +1 @@
+State coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_22/wrong 2.txt b/legacy/Data/ingsw/0722_22/wrong 2.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/0722_22/wrong 2.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_23/correct.txt b/legacy/Data/ingsw/0722_23/correct.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0722_23/correct.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_23/quest.txt b/legacy/Data/ingsw/0722_23/quest.txt
new file mode 100644
index 0000000..2e81fc7
--- /dev/null
+++ b/legacy/Data/ingsw/0722_23/quest.txt
@@ -0,0 +1,15 @@
+Il partition coverage di un insieme di test cases è la percentuale di elementi della partition inclusi nei test cases. La partition è una partizione finita dell'insieme di input della funzione che si sta testando.
+
+Si consideri la seguente funzione C:
+
+int f1(int x) { return (2*x); }
+
+Si vuole testare la funzione f1(). A tal fine l'insieme degli interi viene partizionato come segue:
+
+{(-inf, -11], [-10, -1], {0}, [1, 50], [51, +inf)}
+
+Si consideri il seguente insieme di test cases:
+
+{x=-100, x= 40, x=100}
+
+Quale delle seguenti è la partition coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_23/wrong 1.txt b/legacy/Data/ingsw/0722_23/wrong 1.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0722_23/wrong 1.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_23/wrong 2.txt b/legacy/Data/ingsw/0722_23/wrong 2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0722_23/wrong 2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_24/correct.txt b/legacy/Data/ingsw/0722_24/correct.txt
new file mode 100644
index 0000000..a40ea7d
--- /dev/null
+++ b/legacy/Data/ingsw/0722_24/correct.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 5, c = 0), (a=50, b = 3, c = 0).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_24/quest.txt b/legacy/Data/ingsw/0722_24/quest.txt
new file mode 100644
index 0000000..5b1bcf2
--- /dev/null
+++ b/legacy/Data/ingsw/0722_24/quest.txt
@@ -0,0 +1,22 @@
+Una Condition è una proposizione booleana, cioè una espressione con valore booleano che non può essere decomposta
+in espressioni boolean più semplici. Ad esempio, (x + y <= 3) è una condition.
+
+Una Decision è una espressione booleana composta da conditions e zero o più operatori booleani. Ad esempio, sono decisions:
+(x + y <= 3)
+((x + y <= 3) || (x - y > 7))
+Un insieme di test cases T soddisfa il criterio di Condition/Decision coverage se tutte le seguenti condizioni sono soddisfatte:
+
+1) Ciascun punto di entrata ed uscita nel programma è eseguito in almeno un test;
+2) Per ogni decision d nel programma, per ogni condition c in d, esiste un test in T in cui c è true ed un test in T in cui c è false.
+3) Per ogni decision d nel programma, esiste un test in T in cui d è true ed un test in T in cui d è false.
+
+Si consideri la seguente funzione:
+int f(int a, int b, int c)
+{ if ( (a >= 100) && (b - c <= 1) )
+ return (1); // punto di uscita 1
+ else if ((b - c <= 1) || (b + c >= 5)
+)
+ then return (2); // punto di uscita 2
+ else return (3); // punto di uscita 3
+}
+ Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_24/wrong 1.txt b/legacy/Data/ingsw/0722_24/wrong 1.txt
new file mode 100644
index 0000000..5b77112
--- /dev/null
+++ b/legacy/Data/ingsw/0722_24/wrong 1.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 5, c = 0), (a=50, b = 0, c = 5).
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_24/wrong 2.txt b/legacy/Data/ingsw/0722_24/wrong 2.txt
new file mode 100644
index 0000000..abe0eaa
--- /dev/null
+++ b/legacy/Data/ingsw/0722_24/wrong 2.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 4, c = 0), (a=200, b = 4, c = 0)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_25/correct.txt b/legacy/Data/ingsw/0722_25/correct.txt
new file mode 100644
index 0000000..39d8c13
--- /dev/null
+++ b/legacy/Data/ingsw/0722_25/correct.txt
@@ -0,0 +1,9 @@
+int f(in x, int y)
+
+{
+
+assert( (x >= 0) && (y >= 0) && ((x > 0) || (y > 0)) );
+
+.....
+
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_25/quest.txt b/legacy/Data/ingsw/0722_25/quest.txt
new file mode 100644
index 0000000..23565d6
--- /dev/null
+++ b/legacy/Data/ingsw/0722_25/quest.txt
@@ -0,0 +1,7 @@
+Pre-condizioni, invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in ). In particolare, assert(expre) non fa nulla se l'espressione expre vale TRUE (cioè non è 0), stampa un messaggio di errore su stderr e abortisce l'esecuzione del programma altrimenti.
+
+Si consideri la funzione C
+
+int f(in x, int y) { ..... }
+
+Quale delle seguenti assert esprime la pre-condizione che entrambi gli argomenti di f sono non-negativi ed almeno uno di loro è positivo ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_25/wrong 1.txt b/legacy/Data/ingsw/0722_25/wrong 1.txt
new file mode 100644
index 0000000..c5c0179
--- /dev/null
+++ b/legacy/Data/ingsw/0722_25/wrong 1.txt
@@ -0,0 +1,9 @@
+int f(in x, int y)
+
+{
+
+assert( (x > 0) && (y > 0) && ((x > 1) || (y > 1)) );
+
+.....
+
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_25/wrong 2.txt b/legacy/Data/ingsw/0722_25/wrong 2.txt
new file mode 100644
index 0000000..e4e10cc
--- /dev/null
+++ b/legacy/Data/ingsw/0722_25/wrong 2.txt
@@ -0,0 +1,9 @@
+int f(in x, int y)
+
+{
+
+assert( (x >= 0) && (y >= 0) && ((x > 1) || (y > 1)) );
+
+.....
+
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_26/correct.txt b/legacy/Data/ingsw/0722_26/correct.txt
new file mode 100644
index 0000000..7311d41
--- /dev/null
+++ b/legacy/Data/ingsw/0722_26/correct.txt
@@ -0,0 +1 @@
+Test set: {x=1, y=1}, {x=0, y=0}, {x=2, y=1}, {x=2, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_26/quest.txt b/legacy/Data/ingsw/0722_26/quest.txt
new file mode 100644
index 0000000..78ad81f
--- /dev/null
+++ b/legacy/Data/ingsw/0722_26/quest.txt
@@ -0,0 +1,15 @@
+Il branch coverage di un insieme di test cases è la percentuale di branch del programma che sono attraversati da almeno un test case.
+
+Si consideri la seguente funzione C:
+
+-----------
+
+int f(int x, int y) {
+
+ if (x - y <= 0) { if (x + y >= 1) return (1); else return (2); }
+
+ else {if (2*x + y >= 5) return (3); else return (4); }
+
+ } /* f() */
+
+Quale dei seguenti test sets consegue una branch coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_26/wrong 1.txt b/legacy/Data/ingsw/0722_26/wrong 1.txt
new file mode 100644
index 0000000..7e48e4f
--- /dev/null
+++ b/legacy/Data/ingsw/0722_26/wrong 1.txt
@@ -0,0 +1 @@
+Test set: {x=1, y=1}, {x=0, y=0}, {x=2, y=1}, {x=2, y=3}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_26/wrong 2.txt b/legacy/Data/ingsw/0722_26/wrong 2.txt
new file mode 100644
index 0000000..3e327ab
--- /dev/null
+++ b/legacy/Data/ingsw/0722_26/wrong 2.txt
@@ -0,0 +1 @@
+Test set: {x=1, y=1}, {x=2, y=2}, {x=2, y=1}, {x=2, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_3/correct.txt b/legacy/Data/ingsw/0722_3/correct.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0722_3/correct.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_3/quest.txt b/legacy/Data/ingsw/0722_3/quest.txt
new file mode 100644
index 0000000..ac6007d
--- /dev/null
+++ b/legacy/Data/ingsw/0722_3/quest.txt
@@ -0,0 +1,15 @@
+img=https://i.imgur.com/K7pm0xk.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: act0 act2 act1 act2 act2 act2 act0 act1 act2 act2 act2
+
+Test case 2: act0 act1 act2 act2 act1 act2 act0 act2 act2 act2 act0
+
+Test case 3: act2 act2 act0 act2 act1 act0 act2 act0
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_3/wrong 1.txt b/legacy/Data/ingsw/0722_3/wrong 1.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0722_3/wrong 1.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_3/wrong 2.txt b/legacy/Data/ingsw/0722_3/wrong 2.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0722_3/wrong 2.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_4/correct.txt b/legacy/Data/ingsw/0722_4/correct.txt
new file mode 100644
index 0000000..1e091a3
--- /dev/null
+++ b/legacy/Data/ingsw/0722_4/correct.txt
@@ -0,0 +1 @@
+90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_4/quest.txt b/legacy/Data/ingsw/0722_4/quest.txt
new file mode 100644
index 0000000..681243a
--- /dev/null
+++ b/legacy/Data/ingsw/0722_4/quest.txt
@@ -0,0 +1,15 @@
+img=https://i.imgur.com/IAPlGNV.png
+La state coverage di un insieme di test cases (cioè sequeze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+
+
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act1 act1 act0 act1 act1 act2 act0
+
+Test case 2: act2 act0 act0
+
+Test case 3: act1 act1 act2 act0 act0
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_4/wrong 1.txt b/legacy/Data/ingsw/0722_4/wrong 1.txt
new file mode 100644
index 0000000..52f25fe
--- /dev/null
+++ b/legacy/Data/ingsw/0722_4/wrong 1.txt
@@ -0,0 +1 @@
+70%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_4/wrong 2.txt b/legacy/Data/ingsw/0722_4/wrong 2.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0722_4/wrong 2.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_5/correct.txt b/legacy/Data/ingsw/0722_5/correct.txt
new file mode 100644
index 0000000..cf27703
--- /dev/null
+++ b/legacy/Data/ingsw/0722_5/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_5/quest.txt b/legacy/Data/ingsw/0722_5/quest.txt
new file mode 100644
index 0000000..5201b57
--- /dev/null
+++ b/legacy/Data/ingsw/0722_5/quest.txt
@@ -0,0 +1,17 @@
+img=https://i.imgur.com/4nez8mZ.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 act2
+
+Test case 2: act0 act2 act2 act1 act2 act1 act1 act1 act2 act2 act2 act2 act2
+
+Test case 3: act2 act2 act2 act0 act1 act0
+
+
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_5/wrong 1.txt b/legacy/Data/ingsw/0722_5/wrong 1.txt
new file mode 100644
index 0000000..2d5aeb0
--- /dev/null
+++ b/legacy/Data/ingsw/0722_5/wrong 1.txt
@@ -0,0 +1 @@
+Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_5/wrong 2.txt b/legacy/Data/ingsw/0722_5/wrong 2.txt
new file mode 100644
index 0000000..eb5e1cd
--- /dev/null
+++ b/legacy/Data/ingsw/0722_5/wrong 2.txt
@@ -0,0 +1 @@
+Transition coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_6/correct.txt b/legacy/Data/ingsw/0722_6/correct.txt
new file mode 100644
index 0000000..8d957c2
--- /dev/null
+++ b/legacy/Data/ingsw/0722_6/correct.txt
@@ -0,0 +1 @@
+45%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_6/quest.txt b/legacy/Data/ingsw/0722_6/quest.txt
new file mode 100644
index 0000000..363e53e
--- /dev/null
+++ b/legacy/Data/ingsw/0722_6/quest.txt
@@ -0,0 +1,15 @@
+img=https://i.imgur.com/gNFBVuc.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: act0 act1 act0 act2 act2 act1 act2 act2 act2 act2 act2 act0 act0
+
+Test case 2: act2
+
+Test case 3: act2
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_6/wrong 1.txt b/legacy/Data/ingsw/0722_6/wrong 1.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0722_6/wrong 1.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_6/wrong 2.txt b/legacy/Data/ingsw/0722_6/wrong 2.txt
new file mode 100644
index 0000000..1e091a3
--- /dev/null
+++ b/legacy/Data/ingsw/0722_6/wrong 2.txt
@@ -0,0 +1 @@
+90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_7/correct.txt b/legacy/Data/ingsw/0722_7/correct.txt
new file mode 100644
index 0000000..711ba55
--- /dev/null
+++ b/legacy/Data/ingsw/0722_7/correct.txt
@@ -0,0 +1 @@
+40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_7/quest.txt b/legacy/Data/ingsw/0722_7/quest.txt
new file mode 100644
index 0000000..b33abf0
--- /dev/null
+++ b/legacy/Data/ingsw/0722_7/quest.txt
@@ -0,0 +1,14 @@
+img=https://i.imgur.com/uEiyXTN.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 act2 act2 act2 act0 act1 act2 act0
+
+Test case 2: act1 act2
+
+Test case 3: act2 act0
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_7/wrong 1.txt b/legacy/Data/ingsw/0722_7/wrong 1.txt
new file mode 100644
index 0000000..1e091a3
--- /dev/null
+++ b/legacy/Data/ingsw/0722_7/wrong 1.txt
@@ -0,0 +1 @@
+90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_7/wrong 2.txt b/legacy/Data/ingsw/0722_7/wrong 2.txt
new file mode 100644
index 0000000..52f25fe
--- /dev/null
+++ b/legacy/Data/ingsw/0722_7/wrong 2.txt
@@ -0,0 +1 @@
+70%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_8/correct.txt b/legacy/Data/ingsw/0722_8/correct.txt
new file mode 100644
index 0000000..31a01d5
--- /dev/null
+++ b/legacy/Data/ingsw/0722_8/correct.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=0, y=0}, {x=15, y=0}, {x=9, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_8/quest.txt b/legacy/Data/ingsw/0722_8/quest.txt
new file mode 100644
index 0000000..462c3bb
--- /dev/null
+++ b/legacy/Data/ingsw/0722_8/quest.txt
@@ -0,0 +1,15 @@
+Il branch coverage di un insieme di test cases è la percentuale di branch del programma che sono attraversati da almeno un test case.
+
+Si consideri la seguente funzione C:
+
+-----------
+
+int f(int x, int y) {
+
+ if (x - y <= 6) { if (x + y >= 3) return (1); else return (2); }
+
+ else {if (x + 2*y >= 15) return (3); else return (4); }
+
+ } /* f() */
+
+Quale dei seguenti test sets consegue una branch coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_8/wrong 1.txt b/legacy/Data/ingsw/0722_8/wrong 1.txt
new file mode 100644
index 0000000..549dba8
--- /dev/null
+++ b/legacy/Data/ingsw/0722_8/wrong 1.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=0, y=0}, {x=15, y=0}, {x=10, y=3}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_8/wrong 2.txt b/legacy/Data/ingsw/0722_8/wrong 2.txt
new file mode 100644
index 0000000..0c564f7
--- /dev/null
+++ b/legacy/Data/ingsw/0722_8/wrong 2.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=2, y=1}, {x=15, y=0}, {x=9, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_9/correct.txt b/legacy/Data/ingsw/0722_9/correct.txt
new file mode 100644
index 0000000..f6a4b07
--- /dev/null
+++ b/legacy/Data/ingsw/0722_9/correct.txt
@@ -0,0 +1 @@
+State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_9/quest.txt b/legacy/Data/ingsw/0722_9/quest.txt
new file mode 100644
index 0000000..2b0b595
--- /dev/null
+++ b/legacy/Data/ingsw/0722_9/quest.txt
@@ -0,0 +1,16 @@
+img=https://i.imgur.com/l0OUTrQ.png
+La state coverage di un insieme di test cases (cioè sequenze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+
+Si consideri il seguente insieme di test cases:
+
+
+Test case 1: act2 act2 act2 act1 act2 act1 act2 act2 act1
+
+Test case 2: act2 act2 act0 act1 act1 act2 act0 act0 act2 act0 act2 act2 act2 act0 act0 act0 act2 act2 act0 act2 act2 act2 act1 act2 act2 act1
+
+Test case 3: act2 act0 act2 act1 act2 act1 act0 act2 act2 act0 act0 act2 act1
+
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_9/wrong 1.txt b/legacy/Data/ingsw/0722_9/wrong 1.txt
new file mode 100644
index 0000000..1c07658
--- /dev/null
+++ b/legacy/Data/ingsw/0722_9/wrong 1.txt
@@ -0,0 +1 @@
+State coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_9/wrong 2.txt b/legacy/Data/ingsw/0722_9/wrong 2.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0722_9/wrong 2.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_10/correct.txt b/legacy/Data/ingsw/0922_10/correct.txt
new file mode 100644
index 0000000..cefc84a
--- /dev/null
+++ b/legacy/Data/ingsw/0922_10/correct.txt
@@ -0,0 +1,69 @@
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_10/quest.txt b/legacy/Data/ingsw/0922_10/quest.txt
new file mode 100644
index 0000000..9dd6e3b
--- /dev/null
+++ b/legacy/Data/ingsw/0922_10/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/okpLYQL.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_10/wrong 1.txt b/legacy/Data/ingsw/0922_10/wrong 1.txt
new file mode 100644
index 0000000..cc2b129
--- /dev/null
+++ b/legacy/Data/ingsw/0922_10/wrong 1.txt
@@ -0,0 +1,67 @@
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_10/wrong 2.txt b/legacy/Data/ingsw/0922_10/wrong 2.txt
new file mode 100644
index 0000000..f0f54bf
--- /dev/null
+++ b/legacy/Data/ingsw/0922_10/wrong 2.txt
@@ -0,0 +1,69 @@
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_11/correct.txt b/legacy/Data/ingsw/0922_11/correct.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0922_11/correct.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_11/quest.txt b/legacy/Data/ingsw/0922_11/quest.txt
new file mode 100644
index 0000000..55e0e6a
--- /dev/null
+++ b/legacy/Data/ingsw/0922_11/quest.txt
@@ -0,0 +1,19 @@
+img=https://i.imgur.com/im1GU0x.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 act1 act2 act2
+
+Test case 2: act2 act2 act1 act2 act1 act2 act1 act2 act1 act2 act2 act1 act1 act2 act1 act2 act2 act2
+
+Test case 3: act2 act2 act0
+
+
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_11/wrong 1.txt b/legacy/Data/ingsw/0922_11/wrong 1.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0922_11/wrong 1.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_11/wrong 2.txt b/legacy/Data/ingsw/0922_11/wrong 2.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/0922_11/wrong 2.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_12/correct.txt b/legacy/Data/ingsw/0922_12/correct.txt
new file mode 100644
index 0000000..1e091a3
--- /dev/null
+++ b/legacy/Data/ingsw/0922_12/correct.txt
@@ -0,0 +1 @@
+90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_12/quest.txt b/legacy/Data/ingsw/0922_12/quest.txt
new file mode 100644
index 0000000..dd553a4
--- /dev/null
+++ b/legacy/Data/ingsw/0922_12/quest.txt
@@ -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?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_12/wrong 1.txt b/legacy/Data/ingsw/0922_12/wrong 1.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0922_12/wrong 1.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_12/wrong 2.txt b/legacy/Data/ingsw/0922_12/wrong 2.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0922_12/wrong 2.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_13/correct.txt b/legacy/Data/ingsw/0922_13/correct.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/0922_13/correct.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_13/quest.txt b/legacy/Data/ingsw/0922_13/quest.txt
new file mode 100644
index 0000000..7e33553
--- /dev/null
+++ b/legacy/Data/ingsw/0922_13/quest.txt
@@ -0,0 +1,15 @@
+img=https://i.imgur.com/em6ovKG.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
+
+Test case 2: act2 act1 act2 act0 act0 act0 act1 act0 act0 act1 act0
+
+Test case 3: act2 act0
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_13/wrong 1.txt b/legacy/Data/ingsw/0922_13/wrong 1.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0922_13/wrong 1.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_13/wrong 2.txt b/legacy/Data/ingsw/0922_13/wrong 2.txt
new file mode 100644
index 0000000..f91ad01
--- /dev/null
+++ b/legacy/Data/ingsw/0922_13/wrong 2.txt
@@ -0,0 +1 @@
+35%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_14/correct.txt b/legacy/Data/ingsw/0922_14/correct.txt
new file mode 100644
index 0000000..7734d60
--- /dev/null
+++ b/legacy/Data/ingsw/0922_14/correct.txt
@@ -0,0 +1,71 @@
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_14/quest.txt b/legacy/Data/ingsw/0922_14/quest.txt
new file mode 100644
index 0000000..6afe072
--- /dev/null
+++ b/legacy/Data/ingsw/0922_14/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/512MuK3.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_14/wrong 1.txt b/legacy/Data/ingsw/0922_14/wrong 1.txt
new file mode 100644
index 0000000..fd1c3a4
--- /dev/null
+++ b/legacy/Data/ingsw/0922_14/wrong 1.txt
@@ -0,0 +1,71 @@
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
+
diff --git a/legacy/Data/ingsw/0922_14/wrong 2.txt b/legacy/Data/ingsw/0922_14/wrong 2.txt
new file mode 100644
index 0000000..763d3a6
--- /dev/null
+++ b/legacy/Data/ingsw/0922_14/wrong 2.txt
@@ -0,0 +1,69 @@
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_15/correct.txt b/legacy/Data/ingsw/0922_15/correct.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0922_15/correct.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_15/quest.txt b/legacy/Data/ingsw/0922_15/quest.txt
new file mode 100644
index 0000000..a64d8e6
--- /dev/null
+++ b/legacy/Data/ingsw/0922_15/quest.txt
@@ -0,0 +1,16 @@
+img=https://i.imgur.com/02dquYj.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: act0
+
+Test case 2: act1 act0 act2 act2 act2 act0 act2 act1 act2 act0 act1 act0
+
+Test case 3: act2 act0
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_15/wrong 1.txt b/legacy/Data/ingsw/0922_15/wrong 1.txt
new file mode 100644
index 0000000..7b19605
--- /dev/null
+++ b/legacy/Data/ingsw/0922_15/wrong 1.txt
@@ -0,0 +1 @@
+75%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_15/wrong 2.txt b/legacy/Data/ingsw/0922_15/wrong 2.txt
new file mode 100644
index 0000000..1e091a3
--- /dev/null
+++ b/legacy/Data/ingsw/0922_15/wrong 2.txt
@@ -0,0 +1 @@
+90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_16/correct.txt b/legacy/Data/ingsw/0922_16/correct.txt
new file mode 100644
index 0000000..8dd7202
--- /dev/null
+++ b/legacy/Data/ingsw/0922_16/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/Zzrmwyx.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_16/quest.txt b/legacy/Data/ingsw/0922_16/quest.txt
new file mode 100644
index 0000000..df0415d
--- /dev/null
+++ b/legacy/Data/ingsw/0922_16/quest.txt
@@ -0,0 +1,75 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente ?
+
+
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_16/wrong 1.txt b/legacy/Data/ingsw/0922_16/wrong 1.txt
new file mode 100644
index 0000000..db7cce6
--- /dev/null
+++ b/legacy/Data/ingsw/0922_16/wrong 1.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/3ANMdkr.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_16/wrong 2.txt b/legacy/Data/ingsw/0922_16/wrong 2.txt
new file mode 100644
index 0000000..f0634e5
--- /dev/null
+++ b/legacy/Data/ingsw/0922_16/wrong 2.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/2RoLmLS.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_17/correct.txt b/legacy/Data/ingsw/0922_17/correct.txt
new file mode 100644
index 0000000..9a7cc7e
--- /dev/null
+++ b/legacy/Data/ingsw/0922_17/correct.txt
@@ -0,0 +1,69 @@
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 2;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_17/quest.txt b/legacy/Data/ingsw/0922_17/quest.txt
new file mode 100644
index 0000000..5ebf9be
--- /dev/null
+++ b/legacy/Data/ingsw/0922_17/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/WSvoelw.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_17/wrong 1.txt b/legacy/Data/ingsw/0922_17/wrong 1.txt
new file mode 100644
index 0000000..b635e9d
--- /dev/null
+++ b/legacy/Data/ingsw/0922_17/wrong 1.txt
@@ -0,0 +1,74 @@
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_17/wrong 2.txt b/legacy/Data/ingsw/0922_17/wrong 2.txt
new file mode 100644
index 0000000..7006918
--- /dev/null
+++ b/legacy/Data/ingsw/0922_17/wrong 2.txt
@@ -0,0 +1,69 @@
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_18/correct.txt b/legacy/Data/ingsw/0922_18/correct.txt
new file mode 100644
index 0000000..9667516
--- /dev/null
+++ b/legacy/Data/ingsw/0922_18/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/WRn8QOi.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_18/quest.txt b/legacy/Data/ingsw/0922_18/quest.txt
new file mode 100644
index 0000000..3d86edf
--- /dev/null
+++ b/legacy/Data/ingsw/0922_18/quest.txt
@@ -0,0 +1,75 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente ?
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_18/wrong 1.txt b/legacy/Data/ingsw/0922_18/wrong 1.txt
new file mode 100644
index 0000000..a9214bc
--- /dev/null
+++ b/legacy/Data/ingsw/0922_18/wrong 1.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/oUj28ho.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_18/wrong 2.txt b/legacy/Data/ingsw/0922_18/wrong 2.txt
new file mode 100644
index 0000000..2a58fb7
--- /dev/null
+++ b/legacy/Data/ingsw/0922_18/wrong 2.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/eVnEYDY.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_3/correct.txt b/legacy/Data/ingsw/0922_3/correct.txt
new file mode 100644
index 0000000..faa122e
--- /dev/null
+++ b/legacy/Data/ingsw/0922_3/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/VgLa2I6.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_3/quest.txt b/legacy/Data/ingsw/0922_3/quest.txt
new file mode 100644
index 0000000..7159aee
--- /dev/null
+++ b/legacy/Data/ingsw/0922_3/quest.txt
@@ -0,0 +1,77 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente ?
+
+
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_3/wrong 1.txt b/legacy/Data/ingsw/0922_3/wrong 1.txt
new file mode 100644
index 0000000..6e77050
--- /dev/null
+++ b/legacy/Data/ingsw/0922_3/wrong 1.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/5MjNRI5.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_3/wrong 2.txt b/legacy/Data/ingsw/0922_3/wrong 2.txt
new file mode 100644
index 0000000..c7e9639
--- /dev/null
+++ b/legacy/Data/ingsw/0922_3/wrong 2.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/ugOv25D.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_4/correct.txt b/legacy/Data/ingsw/0922_4/correct.txt
new file mode 100644
index 0000000..7b19605
--- /dev/null
+++ b/legacy/Data/ingsw/0922_4/correct.txt
@@ -0,0 +1 @@
+75%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_4/quest.txt b/legacy/Data/ingsw/0922_4/quest.txt
new file mode 100644
index 0000000..2eeb93f
--- /dev/null
+++ b/legacy/Data/ingsw/0922_4/quest.txt
@@ -0,0 +1,16 @@
+img=https://i.imgur.com/PkKCYTb.png
+La state coverage di un insieme di test cases (cioè sequenze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+
+
+
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act2 act0 act1 act1 act0 act2 act1 act2 act2 act1 act2 act0 act1 act2 act0 act2 act2 act0 act1 act1 act2 act2 act0 act0 act2 act2 act2 act0 act2 act0 act1 act1 act0 act2 act1 act2 act1 act0 act0 act0 act0 act2 act2 act1 act1 act1 act1 act0
+
+Test case 2: act1 act2 act0 act2 act2 act1 act1 act0 act1 act2 act2 act0
+
+Test case 3: act1 act1 act2 act0 act1 act0
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_4/wrong 1.txt b/legacy/Data/ingsw/0922_4/wrong 1.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/0922_4/wrong 1.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_4/wrong 2.txt b/legacy/Data/ingsw/0922_4/wrong 2.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/0922_4/wrong 2.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_5/correct.txt b/legacy/Data/ingsw/0922_5/correct.txt
new file mode 100644
index 0000000..e0afa1b
--- /dev/null
+++ b/legacy/Data/ingsw/0922_5/correct.txt
@@ -0,0 +1,67 @@
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_5/quest.txt b/legacy/Data/ingsw/0922_5/quest.txt
new file mode 100644
index 0000000..6cbb6d3
--- /dev/null
+++ b/legacy/Data/ingsw/0922_5/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/XthureL.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_5/wrong 1.txt b/legacy/Data/ingsw/0922_5/wrong 1.txt
new file mode 100644
index 0000000..53db382
--- /dev/null
+++ b/legacy/Data/ingsw/0922_5/wrong 1.txt
@@ -0,0 +1,69 @@
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_5/wrong 2.txt b/legacy/Data/ingsw/0922_5/wrong 2.txt
new file mode 100644
index 0000000..11f8d0b
--- /dev/null
+++ b/legacy/Data/ingsw/0922_5/wrong 2.txt
@@ -0,0 +1,71 @@
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_6/correct.txt b/legacy/Data/ingsw/0922_6/correct.txt
new file mode 100644
index 0000000..d494d0a
--- /dev/null
+++ b/legacy/Data/ingsw/0922_6/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/2GmgSsg.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_6/quest.txt b/legacy/Data/ingsw/0922_6/quest.txt
new file mode 100644
index 0000000..daf5598
--- /dev/null
+++ b/legacy/Data/ingsw/0922_6/quest.txt
@@ -0,0 +1,73 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente ?
+
+
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_6/wrong 1.txt b/legacy/Data/ingsw/0922_6/wrong 1.txt
new file mode 100644
index 0000000..2a0dce8
--- /dev/null
+++ b/legacy/Data/ingsw/0922_6/wrong 1.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/vB4iDg8.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_6/wrong 2.txt b/legacy/Data/ingsw/0922_6/wrong 2.txt
new file mode 100644
index 0000000..e4e9137
--- /dev/null
+++ b/legacy/Data/ingsw/0922_6/wrong 2.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/5Mtuh64.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_7/correct.txt b/legacy/Data/ingsw/0922_7/correct.txt
new file mode 100644
index 0000000..fae4f5e
--- /dev/null
+++ b/legacy/Data/ingsw/0922_7/correct.txt
@@ -0,0 +1 @@
+State coverage: 85%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_7/quest.txt b/legacy/Data/ingsw/0922_7/quest.txt
new file mode 100644
index 0000000..d94d7c9
--- /dev/null
+++ b/legacy/Data/ingsw/0922_7/quest.txt
@@ -0,0 +1,15 @@
+img=https://i.imgur.com/YoZA1G0.png
+La state coverage di un insieme di test cases (cioè sequenze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+
+
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act1 act2 act2 act1 act2 act1 act1 act0 act1 act2 act0 act1 act2 act1 act2 act1 act0 act0 act2 act2 act0 act1 act1 act2 act2 act2 act0 act1 act2 act2 act1
+
+Test case 2: act1 act2 act0 act0 act2 act2 act2 act2 act2 act1 act2 act0 act0 act2 act1 act2 act2 act2 act0 act0 act2 act1 act2 act2 act2 act0 act0 act1
+
+Test case 3: act1 act1
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_7/wrong 1.txt b/legacy/Data/ingsw/0922_7/wrong 1.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0922_7/wrong 1.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_7/wrong 2.txt b/legacy/Data/ingsw/0922_7/wrong 2.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/0922_7/wrong 2.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_8/correct.txt b/legacy/Data/ingsw/0922_8/correct.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0922_8/correct.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_8/quest.txt b/legacy/Data/ingsw/0922_8/quest.txt
new file mode 100644
index 0000000..983cffc
--- /dev/null
+++ b/legacy/Data/ingsw/0922_8/quest.txt
@@ -0,0 +1,18 @@
+img=https://i.imgur.com/PqUZdeV.png
+La state coverage di un insieme di test cases (cioè sequenze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+
+
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act0 act2
+
+Test case 2: act0 act0 act1 act1 act0 act1 act2 act0 act0 act1 act1 act2 act1 act2 act0 act0 act0 act2
+
+
+Test case 3: act2 act0 act1 act2 act2
+
+
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_8/wrong 1.txt b/legacy/Data/ingsw/0922_8/wrong 1.txt
new file mode 100644
index 0000000..973ef63
--- /dev/null
+++ b/legacy/Data/ingsw/0922_8/wrong 1.txt
@@ -0,0 +1 @@
+State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_8/wrong 2.txt b/legacy/Data/ingsw/0922_8/wrong 2.txt
new file mode 100644
index 0000000..f6a4b07
--- /dev/null
+++ b/legacy/Data/ingsw/0922_8/wrong 2.txt
@@ -0,0 +1 @@
+State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_9/correct.txt b/legacy/Data/ingsw/0922_9/correct.txt
new file mode 100644
index 0000000..973ef63
--- /dev/null
+++ b/legacy/Data/ingsw/0922_9/correct.txt
@@ -0,0 +1 @@
+State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_9/quest.txt b/legacy/Data/ingsw/0922_9/quest.txt
new file mode 100644
index 0000000..13fde42
--- /dev/null
+++ b/legacy/Data/ingsw/0922_9/quest.txt
@@ -0,0 +1,17 @@
+img=https://i.imgur.com/dIi2Wn7.png
+La state coverage di un insieme di test cases (cioè sequenze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+
+
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act0 act0 act2 act1 act2 act0 act2 act0 act0 act0 act0 act0 act2
+
+Test case 2: act1 act2 act1 act2 act0 act2 act1 act2 act2
+
+Test case 3: act2
+
+
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_9/wrong 1.txt b/legacy/Data/ingsw/0922_9/wrong 1.txt
new file mode 100644
index 0000000..f6a4b07
--- /dev/null
+++ b/legacy/Data/ingsw/0922_9/wrong 1.txt
@@ -0,0 +1 @@
+State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0922_9/wrong 2.txt b/legacy/Data/ingsw/0922_9/wrong 2.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/0922_9/wrong 2.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/10/correct.txt b/legacy/Data/ingsw/10/correct.txt
new file mode 100644
index 0000000..00cf334
--- /dev/null
+++ b/legacy/Data/ingsw/10/correct.txt
@@ -0,0 +1 @@
+La risposta corretta è: La variabile x è nell'intervallo [1, 4] oppure nell'intervallo [15, 20]
\ No newline at end of file
diff --git a/legacy/Data/ingsw/10/quest.txt b/legacy/Data/ingsw/10/quest.txt
new file mode 100644
index 0000000..6befac6
--- /dev/null
+++ b/legacy/Data/ingsw/10/quest.txt
@@ -0,0 +1,26 @@
+Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato:
+
+block Monitor
+
+input Real x;
+output Boolean y;
+Boolean w;
+
+initial equation
+
+y = false;
+
+equation
+
+w = ((x < 1) or (x > 4)) and ((x < 15) or (x > 20));
+
+algorithm
+
+when edge(w) then
+y := true;
+end when;
+
+end Monitor;
+
+
+Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/10/wrong 2.txt b/legacy/Data/ingsw/10/wrong 2.txt
new file mode 100644
index 0000000..fe0ce72
--- /dev/null
+++ b/legacy/Data/ingsw/10/wrong 2.txt
@@ -0,0 +1 @@
+La variabile x è fuori dall'intervallo [1, 4] e fuori dall'intervallo [15, 20]
\ No newline at end of file
diff --git a/legacy/Data/ingsw/10/wrong.txt b/legacy/Data/ingsw/10/wrong.txt
new file mode 100644
index 0000000..5303e44
--- /dev/null
+++ b/legacy/Data/ingsw/10/wrong.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [1, 4] e fuori dall'intervallo [15, 20]
\ No newline at end of file
diff --git a/legacy/Data/ingsw/11/correct.txt b/legacy/Data/ingsw/11/correct.txt
new file mode 100644
index 0000000..c24cae9
--- /dev/null
+++ b/legacy/Data/ingsw/11/correct.txt
@@ -0,0 +1 @@
+A*(2 + p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/11/quest.txt b/legacy/Data/ingsw/11/quest.txt
new file mode 100644
index 0000000..77a393f
--- /dev/null
+++ b/legacy/Data/ingsw/11/quest.txt
@@ -0,0 +1,4 @@
+Si consideri un software costituito da due fasi F1 ed F2 ciascuna di costo A. Con probabilità p la fase F1 deve essere ripetuta (a
+causa di change requests) e con probabilità (1 - p) si passa alla fase F2 e poi al completamento (End) dello sviluppo. Qual'eè il
+costo atteso per lo sviluppo del software seguendo il processo sopra descritto ?
+Scegli un'alternativa:
diff --git a/legacy/Data/ingsw/11/wrong 2.txt b/legacy/Data/ingsw/11/wrong 2.txt
new file mode 100644
index 0000000..6e771e9
--- /dev/null
+++ b/legacy/Data/ingsw/11/wrong 2.txt
@@ -0,0 +1 @@
+A*(1 + p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/11/wrong.txt b/legacy/Data/ingsw/11/wrong.txt
new file mode 100644
index 0000000..a9b1c29
--- /dev/null
+++ b/legacy/Data/ingsw/11/wrong.txt
@@ -0,0 +1 @@
+3*A*p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_1/correct.txt b/legacy/Data/ingsw/1122_1/correct.txt
new file mode 100644
index 0000000..fd39f0f
--- /dev/null
+++ b/legacy/Data/ingsw/1122_1/correct.txt
@@ -0,0 +1,44 @@
+
+block FSA // Finite State Automaton
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+
+algorithm
+
+
+when initial() then
+x := 0;
+
+
+elsewhen sample(0,T) then
+
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+else x := pre(x); // default
+end if;
+
+
+end when;
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_1/quest.txt b/legacy/Data/ingsw/1122_1/quest.txt
new file mode 100644
index 0000000..df0e6be
--- /dev/null
+++ b/legacy/Data/ingsw/1122_1/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/jS97TUd.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_1/wrong 1.txt b/legacy/Data/ingsw/1122_1/wrong 1.txt
new file mode 100644
index 0000000..febcca9
--- /dev/null
+++ b/legacy/Data/ingsw/1122_1/wrong 1.txt
@@ -0,0 +1,77 @@
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_1/wrong 2.txt b/legacy/Data/ingsw/1122_1/wrong 2.txt
new file mode 100644
index 0000000..94279c9
--- /dev/null
+++ b/legacy/Data/ingsw/1122_1/wrong 2.txt
@@ -0,0 +1,67 @@
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_10/correct.txt b/legacy/Data/ingsw/1122_10/correct.txt
new file mode 100644
index 0000000..e940faa
--- /dev/null
+++ b/legacy/Data/ingsw/1122_10/correct.txt
@@ -0,0 +1,5 @@
+int f(in x, int y)
+{
+assert( (x >= 0) && (y >= 0) && ((x > 3) || (y > 3)) );
+.....
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_10/quest.txt b/legacy/Data/ingsw/1122_10/quest.txt
new file mode 100644
index 0000000..c939cfb
--- /dev/null
+++ b/legacy/Data/ingsw/1122_10/quest.txt
@@ -0,0 +1,7 @@
+Pre-condizioni, invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in ). In particolare, assert(expre) non fa nulla se l'espressione expre vale TRUE (cioè non è 0), stampa un messaggio di errore su stderr e abortisce l'esecuzione del programma altrimenti.
+
+Si consideri la funzione C
+
+int f(int x, int y) { ..... }
+
+Quale delle seguenti assert esprime la pre-condizione che entrambi gli argomenti di f sono non-negativi ed almeno uno di loro è maggiore di 3?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_10/wrong 1.txt b/legacy/Data/ingsw/1122_10/wrong 1.txt
new file mode 100644
index 0000000..03abba5
--- /dev/null
+++ b/legacy/Data/ingsw/1122_10/wrong 1.txt
@@ -0,0 +1,10 @@
+
+int f(in x, int y)
+
+{
+
+assert( (x >= 0) && (y >= 0) && ((x >= 3) || (y >= 3)) );
+
+.....
+
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_10/wrong 2.txt b/legacy/Data/ingsw/1122_10/wrong 2.txt
new file mode 100644
index 0000000..a820d7a
--- /dev/null
+++ b/legacy/Data/ingsw/1122_10/wrong 2.txt
@@ -0,0 +1,9 @@
+int f(in x, int y)
+
+{
+
+assert( (x > 0) && (y > 0) && ((x >= 3) || (y > 3)) );
+
+.....
+
+}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_11/correct.txt b/legacy/Data/ingsw/1122_11/correct.txt
new file mode 100644
index 0000000..e74b1fc
--- /dev/null
+++ b/legacy/Data/ingsw/1122_11/correct.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x > y) then (z == x) else (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_11/quest.txt b/legacy/Data/ingsw/1122_11/quest.txt
new file mode 100644
index 0000000..b46cb2b
--- /dev/null
+++ b/legacy/Data/ingsw/1122_11/quest.txt
@@ -0,0 +1,17 @@
+Un test oracle per un programma P è una funzione booleana che ha come inputs gli inputs ed outputs di P e ritorna true se e solo se il valore di output di P (con i dati inputs) è quello atteso dalle specifiche.
+
+Si consideri la seguente funzione C:
+
+-----------
+
+int f(int x, int y) {
+
+int z = x;
+
+while ( (x <= z) && (z <= y) ) { z = z + 1; }
+
+return (z);
+
+}
+
+Siano x, y, gli inputs del programma (f nel nostro caso) e z l'output. Assumendo il programma corretto, quale delle seguenti funzioni booleane F(x, y, z) è un test oracle per la funzione f.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_11/wrong 1.txt b/legacy/Data/ingsw/1122_11/wrong 1.txt
new file mode 100644
index 0000000..d63544a
--- /dev/null
+++ b/legacy/Data/ingsw/1122_11/wrong 1.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x > y) then (z == x + 1) else (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_11/wrong 2.txt b/legacy/Data/ingsw/1122_11/wrong 2.txt
new file mode 100644
index 0000000..1753a91
--- /dev/null
+++ b/legacy/Data/ingsw/1122_11/wrong 2.txt
@@ -0,0 +1 @@
+F(x, y, z) = (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_12/correct.txt b/legacy/Data/ingsw/1122_12/correct.txt
new file mode 100644
index 0000000..95722a4
--- /dev/null
+++ b/legacy/Data/ingsw/1122_12/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/toYPiWs.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_12/quest.txt b/legacy/Data/ingsw/1122_12/quest.txt
new file mode 100644
index 0000000..464b817
--- /dev/null
+++ b/legacy/Data/ingsw/1122_12/quest.txt
@@ -0,0 +1,76 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente?
+
+
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_12/wrong 1.txt b/legacy/Data/ingsw/1122_12/wrong 1.txt
new file mode 100644
index 0000000..c737a86
--- /dev/null
+++ b/legacy/Data/ingsw/1122_12/wrong 1.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/0yWuing.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_12/wrong 2.txt b/legacy/Data/ingsw/1122_12/wrong 2.txt
new file mode 100644
index 0000000..27b6d1e
--- /dev/null
+++ b/legacy/Data/ingsw/1122_12/wrong 2.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/AmIbYTU.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_13/correct.txt b/legacy/Data/ingsw/1122_13/correct.txt
new file mode 100644
index 0000000..f2bb2d0
--- /dev/null
+++ b/legacy/Data/ingsw/1122_13/correct.txt
@@ -0,0 +1 @@
+0.12
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_13/quest.txt b/legacy/Data/ingsw/1122_13/quest.txt
new file mode 100644
index 0000000..d57a552
--- /dev/null
+++ b/legacy/Data/ingsw/1122_13/quest.txt
@@ -0,0 +1,8 @@
+img=https://i.imgur.com/pBLLwD1.png
+Un processo software può essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del prcoesso software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilità della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+
+Ad esempio lo state diagram in figura rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.4 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilità 0.2 di dover essere ripetuta (a causa di errori).
+
+Uno scenario è una sequenza di stati.
+
+Qual è la probabilità dello scenario: 1, 3, 4? In altri terminti, qual è la probabilità che non sia necessario ripetere la seconda fase (ma non la prima)?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_13/wrong 1.txt b/legacy/Data/ingsw/1122_13/wrong 1.txt
new file mode 100644
index 0000000..b7bbee2
--- /dev/null
+++ b/legacy/Data/ingsw/1122_13/wrong 1.txt
@@ -0,0 +1 @@
+0.32
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_13/wrong 2.txt b/legacy/Data/ingsw/1122_13/wrong 2.txt
new file mode 100644
index 0000000..2a47a95
--- /dev/null
+++ b/legacy/Data/ingsw/1122_13/wrong 2.txt
@@ -0,0 +1 @@
+0.08
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_14/correct.txt b/legacy/Data/ingsw/1122_14/correct.txt
new file mode 100644
index 0000000..97f2744
--- /dev/null
+++ b/legacy/Data/ingsw/1122_14/correct.txt
@@ -0,0 +1,19 @@
+
+#define n 1000
+int TestOracle1(int *A, int *B)
+{
+int i, j, D[n];
+//init
+
+for (i = 0; i < n; i++) D[i] = -1;
+
+// B is ordered
+for (i = 0; i < n; i++) { for (j = i+1; j < n; j++) {if (B[j] < B[i]) {retun (0);}}}
+// B is a permutation of A
+for (i = 0; i < n; i++) { for (j = 0; j < n; j++) {if ((A[i] == B[j]) && (D[j] == -1)) {C[i][j] = 1; D[j] = 1; break;}
+
+for (i = 0; i < n; i++) {if (D[i] == -1) return (0);}
+// B ok
+return (1);
+}
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_14/quest.txt b/legacy/Data/ingsw/1122_14/quest.txt
new file mode 100644
index 0000000..bd20578
--- /dev/null
+++ b/legacy/Data/ingsw/1122_14/quest.txt
@@ -0,0 +1,7 @@
+Un test oracle per un programma P è una funzione booleana che ha come inputs gli inputs ed outputs di P e ritorna true se e solo se il valore di output di P (con i dati inputs) è quello atteso dalle specifiche.
+
+Si consideri la seguente specifica funzionale per la funzione f.
+
+La funzione f(int *A, int *B) prende come input un vettore A di dimensione n ritorna come output un vettore B ottenuto ordinando gli elementi di A in ordine crescente.
+
+Quale delle seguenti funzioni è un test oracle per la funzione f?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_14/wrong 1.txt b/legacy/Data/ingsw/1122_14/wrong 1.txt
new file mode 100644
index 0000000..189d31d
--- /dev/null
+++ b/legacy/Data/ingsw/1122_14/wrong 1.txt
@@ -0,0 +1,29 @@
+
+#define n 1000
+
+int TestOracle2(int *A, int *B)
+
+{
+
+int i, j, D[n];
+
+//init
+
+for (i = 0; i < n; i++) D[i] = -1;
+
+// B is ordered
+
+for (i = 0; i < n; i++) { for (j = i+1; j < n; j++) {if (B[j] < B[i]) {retun (0);}}}
+
+// B is a permutation of A
+
+for (i = 0; i < n; i++) { for (j = 0; j < n; j++) {if ((A[i] == B[j]) && (D[j] == -1)) {C[i][j] = 1; break;}
+
+for (i = 0; i < n; i++) {if (D[i] == -1) return (0);}
+
+// B ok
+
+return (1);
+
+}
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_14/wrong 2.txt b/legacy/Data/ingsw/1122_14/wrong 2.txt
new file mode 100644
index 0000000..4a9e2c8
--- /dev/null
+++ b/legacy/Data/ingsw/1122_14/wrong 2.txt
@@ -0,0 +1,29 @@
+
+#define n 1000
+
+int TestOracle3(int *A, int *B)
+
+{
+
+int i, j, D[n];
+
+//init
+
+for (i = 0; i < n; i++) D[i] = -1;
+
+// B is ordered
+
+for (i = 0; i < n; i++) { for (j = i+1; j < n; j++) {if (B[j] < B[i]) {retun (0);}}}
+
+// B is a permutation of A
+
+for (i = 0; i < n; i++) { for (j = 0; j < n; j++) {if (A[i] == B[j]) {C[i][j] = 1; D[j] = 1; break;}
+
+for (i = 0; i < n; i++) {if (D[i] == -1) return (0);}
+
+// B ok
+
+return (1);
+
+}
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_15/correct.txt b/legacy/Data/ingsw/1122_15/correct.txt
new file mode 100644
index 0000000..1a8a508
--- /dev/null
+++ b/legacy/Data/ingsw/1122_15/correct.txt
@@ -0,0 +1 @@
+State coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_15/quest.txt b/legacy/Data/ingsw/1122_15/quest.txt
new file mode 100644
index 0000000..0d7fe08
--- /dev/null
+++ b/legacy/Data/ingsw/1122_15/quest.txt
@@ -0,0 +1,12 @@
+img=https://i.imgur.com/mMq2O4x.png
+La state coverage di un insieme di test cases (cioè sequenze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act1 act2 act0
+
+Test case 2: act0 act1 act0 act0
+
+Test case 3: act1 act0 act2 act2 act0
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_15/wrong 1.txt b/legacy/Data/ingsw/1122_15/wrong 1.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/1122_15/wrong 1.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_15/wrong 2.txt b/legacy/Data/ingsw/1122_15/wrong 2.txt
new file mode 100644
index 0000000..973ef63
--- /dev/null
+++ b/legacy/Data/ingsw/1122_15/wrong 2.txt
@@ -0,0 +1 @@
+State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_16/correct.txt b/legacy/Data/ingsw/1122_16/correct.txt
new file mode 100644
index 0000000..7a6c6b9
--- /dev/null
+++ b/legacy/Data/ingsw/1122_16/correct.txt
@@ -0,0 +1 @@
+300000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_16/quest.txt b/legacy/Data/ingsw/1122_16/quest.txt
new file mode 100644
index 0000000..db10798
--- /dev/null
+++ b/legacy/Data/ingsw/1122_16/quest.txt
@@ -0,0 +1,7 @@
+Il rischio R può essere calcolato come R = P*C, dove P è la probabilità dell'evento avverso (software failure nel nostro contesto) e C è il costo dell'occorrenza dell'evento avverso.
+
+Assumiamo che la probabilità P sia legata al costo di sviluppo S dalla formula
+
+P = 10^{(-b*S)} (cioè 10 elevato alla (-b*S))
+
+dove b è una opportuna costante note da dati storici aziendali. Si assuma che b = 0.0001, C = 1000000, ed il rischio ammesso è R = 1000. Quale dei seguenti valori meglio approssima il costo S per lo sviluppo del software in questione.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_16/wrong 1.txt b/legacy/Data/ingsw/1122_16/wrong 1.txt
new file mode 100644
index 0000000..2df501e
--- /dev/null
+++ b/legacy/Data/ingsw/1122_16/wrong 1.txt
@@ -0,0 +1 @@
+500000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_16/wrong 2.txt b/legacy/Data/ingsw/1122_16/wrong 2.txt
new file mode 100644
index 0000000..997967b
--- /dev/null
+++ b/legacy/Data/ingsw/1122_16/wrong 2.txt
@@ -0,0 +1 @@
+700000 EUR
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_19/correct.txt b/legacy/Data/ingsw/1122_19/correct.txt
new file mode 100644
index 0000000..e0bba82
--- /dev/null
+++ b/legacy/Data/ingsw/1122_19/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/EDqWXLf.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_19/quest.txt b/legacy/Data/ingsw/1122_19/quest.txt
new file mode 100644
index 0000000..28aa70c
--- /dev/null
+++ b/legacy/Data/ingsw/1122_19/quest.txt
@@ -0,0 +1,75 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente?
+
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_19/wrong 1.txt b/legacy/Data/ingsw/1122_19/wrong 1.txt
new file mode 100644
index 0000000..75dcbd7
--- /dev/null
+++ b/legacy/Data/ingsw/1122_19/wrong 1.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/u6No1XI.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_19/wrong 2.txt b/legacy/Data/ingsw/1122_19/wrong 2.txt
new file mode 100644
index 0000000..5e5c30f
--- /dev/null
+++ b/legacy/Data/ingsw/1122_19/wrong 2.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/SLOrqrl.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_2/correct.txt b/legacy/Data/ingsw/1122_2/correct.txt
new file mode 100644
index 0000000..ad21063
--- /dev/null
+++ b/legacy/Data/ingsw/1122_2/correct.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) and (delay(x, 10) > 1) and (y < 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_2/quest.txt b/legacy/Data/ingsw/1122_2/quest.txt
new file mode 100644
index 0000000..2ef9a23
--- /dev/null
+++ b/legacy/Data/ingsw/1122_2/quest.txt
@@ -0,0 +1,9 @@
+Si consideri il seguente requisito:
+
+RQ: Dopo 40 unità di tempo dall'inizio dell'esecuzione vale la seguente proprietà:
+
+se 10 unità di tempo nel passato x era maggiore di 1 allora ora y è nonegativa.
+
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time <= w e ritorna il valore che z aveva al tempo (time - w), se time = w.
+
+Quale dei seguenti monitor meglio descrive il requisito RQ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_2/wrong 1.txt b/legacy/Data/ingsw/1122_2/wrong 1.txt
new file mode 100644
index 0000000..b0c70b4
--- /dev/null
+++ b/legacy/Data/ingsw/1122_2/wrong 1.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+
+initial equation
+
+wy = false;
+equation
+wz = (time > 40) and (delay(x, 10) > 1) and (y >= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_2/wrong 2.txt b/legacy/Data/ingsw/1122_2/wrong 2.txt
new file mode 100644
index 0000000..50c4137
--- /dev/null
+++ b/legacy/Data/ingsw/1122_2/wrong 2.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+
+initial equation
+
+wy = false;
+equation
+wz = (time > 40) or (delay(x, 10) > 1) or (y < 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_20/correct.txt b/legacy/Data/ingsw/1122_20/correct.txt
new file mode 100644
index 0000000..81a4b93
--- /dev/null
+++ b/legacy/Data/ingsw/1122_20/correct.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x >= 0) then (z == pow(y, x)) else (z == 1)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_20/quest.txt b/legacy/Data/ingsw/1122_20/quest.txt
new file mode 100644
index 0000000..139b0a2
--- /dev/null
+++ b/legacy/Data/ingsw/1122_20/quest.txt
@@ -0,0 +1,19 @@
+Un test oracle per un programma P è una funzione booleana che ha come inputs gli inputs ed outputs di P e ritorna true se e solo se il valore di output di P (con i dati inputs) è quello atteso dalle specifiche.
+
+Si consideri la seguente funzione C:
+
+-----------
+
+int f(int x, int y) {
+
+int z, k;
+
+z = 1; k = 0;
+
+while (k < x) { z = y*z; k = k + 1; }
+
+return (z);
+
+}
+
+Siano x, y, gli inputs del programma (f nel nostro caso) e z l'output. Assumendo il programma corretto, quale delle seguenti funzioni booleane F(x, y, z) è un test oracle per la funzione f.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_20/wrong 1.txt b/legacy/Data/ingsw/1122_20/wrong 1.txt
new file mode 100644
index 0000000..f52d5ae
--- /dev/null
+++ b/legacy/Data/ingsw/1122_20/wrong 1.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x >= 0) then (z == pow(y, x)) else (z == y)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_20/wrong 2.txt b/legacy/Data/ingsw/1122_20/wrong 2.txt
new file mode 100644
index 0000000..d246b94
--- /dev/null
+++ b/legacy/Data/ingsw/1122_20/wrong 2.txt
@@ -0,0 +1 @@
+F(x, y, z) = if (x >= 0) then (z == pow(y, x)) else (z == 0)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_21/correct.txt b/legacy/Data/ingsw/1122_21/correct.txt
new file mode 100644
index 0000000..e582263
--- /dev/null
+++ b/legacy/Data/ingsw/1122_21/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 0) and ((x >= 5) or (x <= 0)) and ((x >= 15) or (x <= 10)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_21/quest.txt b/legacy/Data/ingsw/1122_21/quest.txt
new file mode 100644
index 0000000..9f10cbc
--- /dev/null
+++ b/legacy/Data/ingsw/1122_21/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+
+RQ1: Durante l'esecuzione del programma (cioè per tutti gli istanti di tempo positivi) la variabile x è sempre nell'intervallo [0, 5] oppure [10, 15]
+
+Quale dei seguenti monitor meglio descrive il requisito RQ1 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_21/wrong 1.txt b/legacy/Data/ingsw/1122_21/wrong 1.txt
new file mode 100644
index 0000000..93791b3
--- /dev/null
+++ b/legacy/Data/ingsw/1122_21/wrong 1.txt
@@ -0,0 +1,19 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+
+initial equation
+
+y = false;
+equation
+z = (time > 0) and ( ((x >= 0) and (x <= 5)) or ((x >= 10) and (x <= 15)) );
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_21/wrong 2.txt b/legacy/Data/ingsw/1122_21/wrong 2.txt
new file mode 100644
index 0000000..826c225
--- /dev/null
+++ b/legacy/Data/ingsw/1122_21/wrong 2.txt
@@ -0,0 +1,19 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+
+initial equation
+
+y = false;
+equation
+z = (time > 0) and ((x >= 0) or (x <= 5)) and ((x >= 10) or (x <= 15)) );
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_22/correct.txt b/legacy/Data/ingsw/1122_22/correct.txt
new file mode 100644
index 0000000..b110af1
--- /dev/null
+++ b/legacy/Data/ingsw/1122_22/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_22/quest.txt b/legacy/Data/ingsw/1122_22/quest.txt
new file mode 100644
index 0000000..a116140
--- /dev/null
+++ b/legacy/Data/ingsw/1122_22/quest.txt
@@ -0,0 +1,14 @@
+img=https://i.imgur.com/VZQnGCY.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 act2 act0 act1
+
+Test case 2: act1 act0 act1 act1 act2 act2 act0
+
+Test case 3: act1 act2 act0 act0
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_22/wrong 1.txt b/legacy/Data/ingsw/1122_22/wrong 1.txt
new file mode 100644
index 0000000..cf27703
--- /dev/null
+++ b/legacy/Data/ingsw/1122_22/wrong 1.txt
@@ -0,0 +1 @@
+Transition coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_22/wrong 2.txt b/legacy/Data/ingsw/1122_22/wrong 2.txt
new file mode 100644
index 0000000..eb5e1cd
--- /dev/null
+++ b/legacy/Data/ingsw/1122_22/wrong 2.txt
@@ -0,0 +1 @@
+Transition coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_23/correct.txt b/legacy/Data/ingsw/1122_23/correct.txt
new file mode 100644
index 0000000..37bad47
--- /dev/null
+++ b/legacy/Data/ingsw/1122_23/correct.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [0, 5]
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_23/quest.txt b/legacy/Data/ingsw/1122_23/quest.txt
new file mode 100644
index 0000000..63f2e9f
--- /dev/null
+++ b/legacy/Data/ingsw/1122_23/quest.txt
@@ -0,0 +1,29 @@
+Si consideri il monitor seguente che ritorna true appena i requisiti per il sistema monitorato sono violati.
+
+block Monitor
+
+input Real x;
+
+output Boolean y;
+
+Boolean w;
+
+initial equation
+
+y = false;
+
+equation
+
+w = ((x < 0) or (x > 5));
+
+algorithm
+
+when edge(w) then
+
+y := true;
+
+end when;
+
+end Monitor;
+
+Quale delle seguenti affermazioni meglio descrive il requisito monitorato.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_23/wrong 1.txt b/legacy/Data/ingsw/1122_23/wrong 1.txt
new file mode 100644
index 0000000..6fa1af9
--- /dev/null
+++ b/legacy/Data/ingsw/1122_23/wrong 1.txt
@@ -0,0 +1 @@
+La variabile x è fuori dall'intervallo [0, 5]
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_23/wrong 2.txt b/legacy/Data/ingsw/1122_23/wrong 2.txt
new file mode 100644
index 0000000..b383e07
--- /dev/null
+++ b/legacy/Data/ingsw/1122_23/wrong 2.txt
@@ -0,0 +1 @@
+La variable x è minore di 0
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_24/correct.txt b/legacy/Data/ingsw/1122_24/correct.txt
new file mode 100644
index 0000000..293ebbc
--- /dev/null
+++ b/legacy/Data/ingsw/1122_24/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 10) and (x >= 10) and (x <= 20) and ((y < 0.5*x) or (y > 0.7*x)) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_24/quest.txt b/legacy/Data/ingsw/1122_24/quest.txt
new file mode 100644
index 0000000..0accc5f
--- /dev/null
+++ b/legacy/Data/ingsw/1122_24/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+
+RQ: Dopo 10 unità di tempo dall'inizio dell'esecuzione vale la seguente proprietà: se la variabile x è nell'intervallo [10, 20] allora la variabile y è compresa tra il 50% di x ed il 70% di x.
+
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_24/wrong 1.txt b/legacy/Data/ingsw/1122_24/wrong 1.txt
new file mode 100644
index 0000000..835a5ac
--- /dev/null
+++ b/legacy/Data/ingsw/1122_24/wrong 1.txt
@@ -0,0 +1,19 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+
+initial equation
+
+wy = false;
+equation
+wz = (time > 10) and (x >= 10) and (x <= 20) and (y >= 0.5*x) and (y <= 0.7*x) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_24/wrong 2.txt b/legacy/Data/ingsw/1122_24/wrong 2.txt
new file mode 100644
index 0000000..5a7d171
--- /dev/null
+++ b/legacy/Data/ingsw/1122_24/wrong 2.txt
@@ -0,0 +1,19 @@
+
+class Monitor
+
+InputReal x, y; // plant output
+OutputBoolean wy;
+
+Boolean wz;
+
+initial equation
+
+wy = false;
+equation
+wz = (time > 10) and ((x < 10) or (x > 20)) and ((y < 0.5*x) or (y > 0.7*x)) ;
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_25/correct.txt b/legacy/Data/ingsw/1122_25/correct.txt
new file mode 100644
index 0000000..b9f32a6
--- /dev/null
+++ b/legacy/Data/ingsw/1122_25/correct.txt
@@ -0,0 +1 @@
+c(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_25/quest.txt b/legacy/Data/ingsw/1122_25/quest.txt
new file mode 100644
index 0000000..4087608
--- /dev/null
+++ b/legacy/Data/ingsw/1122_25/quest.txt
@@ -0,0 +1,10 @@
+img=https://i.imgur.com/jQT3J83.png
+Si consideri il processo software con due fasi (0 ed 1) rappresentato con la Markov chain in figura. Lo stato iniziale 0 e p è in (0, 1). Il costo dello stato (fase) x è c(x). La fase 0 è la fase di design, che ha probabilità p di dover essere ripetuta causa errori. La fase 1 rappreenta il completamento del processo software, e quindi c(1) = 0.
+
+Il costo di una istanza del processo software descritto sopra è la somma dei costi degli stati attraversati (tenendo presente che si parte sempre dallo stato 0.
+
+Quindi il costo C(X) della sequenza di stati X = x(0), x(1), x(2), .... è C(X) = c(x(0)) + c(x(1)) + c(x(2)) + ...
+
+Ad esempio se X = 0, 1 abbiamo C(X) = c(0) + c(1) = c(0) (poichè c(1) = 0).
+
+Quale delle seguenti formule calcola il valore atteso del costo per completare il processo software di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_25/wrong 1.txt b/legacy/Data/ingsw/1122_25/wrong 1.txt
new file mode 100644
index 0000000..3143da9
--- /dev/null
+++ b/legacy/Data/ingsw/1122_25/wrong 1.txt
@@ -0,0 +1 @@
+c(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_25/wrong 2.txt b/legacy/Data/ingsw/1122_25/wrong 2.txt
new file mode 100644
index 0000000..b9f32a6
--- /dev/null
+++ b/legacy/Data/ingsw/1122_25/wrong 2.txt
@@ -0,0 +1 @@
+c(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_26/correct.txt b/legacy/Data/ingsw/1122_26/correct.txt
new file mode 100644
index 0000000..2f4c4c9
--- /dev/null
+++ b/legacy/Data/ingsw/1122_26/correct.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=0, y=0}, {x=15, y=0}, {x=9, y=0}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_26/quest.txt b/legacy/Data/ingsw/1122_26/quest.txt
new file mode 100644
index 0000000..514a3fa
--- /dev/null
+++ b/legacy/Data/ingsw/1122_26/quest.txt
@@ -0,0 +1,15 @@
+Il branch coverage di un insieme di test cases è la percentuale di branch del programma che sono attraversati da almeno un test case.
+
+Si consideri la seguente funzione C:
+
+-----------
+
+int f(int x, int y) {
+
+ if (x - y - 6 <= 0) { if (x + y - 3 >= 0) return (1); else return (2); }
+
+ else {if (x + 2*y -15 >= 0) return (3); else return (4); }
+
+ } /* f() */
+
+Quale dei seguenti test sets consegue una branch coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_26/wrong 1.txt b/legacy/Data/ingsw/1122_26/wrong 1.txt
new file mode 100644
index 0000000..a82e779
--- /dev/null
+++ b/legacy/Data/ingsw/1122_26/wrong 1.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=2, y=1}, {x=15, y=0}, {x=9, y=0}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_26/wrong 2.txt b/legacy/Data/ingsw/1122_26/wrong 2.txt
new file mode 100644
index 0000000..82d4c38
--- /dev/null
+++ b/legacy/Data/ingsw/1122_26/wrong 2.txt
@@ -0,0 +1 @@
+Test set: {x=3, y=6}, {x=0, y=0}, {x=15, y=0}, {x=10, y=3}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_27/correct.txt b/legacy/Data/ingsw/1122_27/correct.txt
new file mode 100644
index 0000000..8b0c318
--- /dev/null
+++ b/legacy/Data/ingsw/1122_27/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_27/quest.txt b/legacy/Data/ingsw/1122_27/quest.txt
new file mode 100644
index 0000000..59f8742
--- /dev/null
+++ b/legacy/Data/ingsw/1122_27/quest.txt
@@ -0,0 +1,13 @@
+img=https://i.imgur.com/TXCFgeI.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 act2 act0
+
+Test case 2: act2 act2 act2 act2 act2 act2 act0
+
+Test case 3: act2 act0 act2 act0 act1 act2 act2 act2 act2 act2 act1 act0 act0 act2 act2 act2 act1 act2 act2 act2 act2 act2 act1 act2 act2 act2 act0
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_27/wrong 1.txt b/legacy/Data/ingsw/1122_27/wrong 1.txt
new file mode 100644
index 0000000..2ca9276
--- /dev/null
+++ b/legacy/Data/ingsw/1122_27/wrong 1.txt
@@ -0,0 +1 @@
+Transition coverage: 35%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_27/wrong 2.txt b/legacy/Data/ingsw/1122_27/wrong 2.txt
new file mode 100644
index 0000000..6da4c51
--- /dev/null
+++ b/legacy/Data/ingsw/1122_27/wrong 2.txt
@@ -0,0 +1 @@
+Transition coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_28/correct.txt b/legacy/Data/ingsw/1122_28/correct.txt
new file mode 100644
index 0000000..c3fc7c1
--- /dev/null
+++ b/legacy/Data/ingsw/1122_28/correct.txt
@@ -0,0 +1,9 @@
+
+int f(in x, int y)
+
+{
+int z, w;
+assert( (z + w < 1) || (z + w > 7));
+.....
+}
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_28/quest.txt b/legacy/Data/ingsw/1122_28/quest.txt
new file mode 100644
index 0000000..733c0cb
--- /dev/null
+++ b/legacy/Data/ingsw/1122_28/quest.txt
@@ -0,0 +1,7 @@
+Pre-condizioni, invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in ). In particolare, assert(expre) non fa nulla se l'espressione expre vale TRUE (cioè non è 0), stampa un messaggio di errore su stderr e abortisce l'esecuzione del programma altrimenti.
+
+Si consideri la funzione C
+
+int f(int x, int y) { ..... }
+
+Quale delle seguenti assert esprime l'invariante che le variabili locali z e w di f() hanno somma minore di 1 oppure maggiore di 7 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_28/wrong 1.txt b/legacy/Data/ingsw/1122_28/wrong 1.txt
new file mode 100644
index 0000000..1b8fa8b
--- /dev/null
+++ b/legacy/Data/ingsw/1122_28/wrong 1.txt
@@ -0,0 +1,13 @@
+
+int f(in x, int y)
+
+{
+
+int z, w;
+
+assert( (z + w <= 1) || (z + w >= 7));
+
+.....
+
+}
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_28/wrong 2.txt b/legacy/Data/ingsw/1122_28/wrong 2.txt
new file mode 100644
index 0000000..b0705b4
--- /dev/null
+++ b/legacy/Data/ingsw/1122_28/wrong 2.txt
@@ -0,0 +1,13 @@
+
+int f(in x, int y)
+
+{
+
+int z, w;
+
+assert( (z + w > 1) || (z + w < 7));
+
+.....
+
+}
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_29/correct.txt b/legacy/Data/ingsw/1122_29/correct.txt
new file mode 100644
index 0000000..2d46409
--- /dev/null
+++ b/legacy/Data/ingsw/1122_29/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/SXM3yWp.png
diff --git a/legacy/Data/ingsw/1122_29/quest.txt b/legacy/Data/ingsw/1122_29/quest.txt
new file mode 100644
index 0000000..52863ce
--- /dev/null
+++ b/legacy/Data/ingsw/1122_29/quest.txt
@@ -0,0 +1,70 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente ?
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_29/wrong 1.txt b/legacy/Data/ingsw/1122_29/wrong 1.txt
new file mode 100644
index 0000000..b008b75
--- /dev/null
+++ b/legacy/Data/ingsw/1122_29/wrong 1.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/CeDe2lF.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_29/wrong 2.txt b/legacy/Data/ingsw/1122_29/wrong 2.txt
new file mode 100644
index 0000000..861967c
--- /dev/null
+++ b/legacy/Data/ingsw/1122_29/wrong 2.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/HBR1EoE.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_3/correct.txt b/legacy/Data/ingsw/1122_3/correct.txt
new file mode 100644
index 0000000..6d02149
--- /dev/null
+++ b/legacy/Data/ingsw/1122_3/correct.txt
@@ -0,0 +1 @@
+Requisito funzionale
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_3/quest.txt b/legacy/Data/ingsw/1122_3/quest.txt
new file mode 100644
index 0000000..ddcf7c8
--- /dev/null
+++ b/legacy/Data/ingsw/1122_3/quest.txt
@@ -0,0 +1,3 @@
+"Ogni giorno, per ciascuna clinica, il sistema genererà una lista dei pazienti che hanno un appuntamento quel giorno."
+
+La frase precedente è un esempio di:
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_3/wrong 1.txt b/legacy/Data/ingsw/1122_3/wrong 1.txt
new file mode 100644
index 0000000..fb5bb3e
--- /dev/null
+++ b/legacy/Data/ingsw/1122_3/wrong 1.txt
@@ -0,0 +1 @@
+Requisito non-funzionale
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_3/wrong 2.txt b/legacy/Data/ingsw/1122_3/wrong 2.txt
new file mode 100644
index 0000000..2c39a1a
--- /dev/null
+++ b/legacy/Data/ingsw/1122_3/wrong 2.txt
@@ -0,0 +1 @@
+Requisito di performance
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_30/correct.txt b/legacy/Data/ingsw/1122_30/correct.txt
new file mode 100644
index 0000000..2a2ecea
--- /dev/null
+++ b/legacy/Data/ingsw/1122_30/correct.txt
@@ -0,0 +1 @@
+time(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_30/quest.txt b/legacy/Data/ingsw/1122_30/quest.txt
new file mode 100644
index 0000000..8b8cea7
--- /dev/null
+++ b/legacy/Data/ingsw/1122_30/quest.txt
@@ -0,0 +1,10 @@
+img=https://i.imgur.com/jQT3J83.png
+Si consideri il processo software con due fasi (0 ed 1) rappresentato con la Markov chain in figura. Lo stato iniziale 0 e p è in (0, 1). Il tempo necessario per completare la fase x è time(x). La fase 0 è la fase di design, che ha probabilità p di dover essere ripetuta causa errori. La fase 1 rappreenta il completamento del processo software, e quindi time(1) = 0.
+
+Il tempo di una istanza del processo software descritto sopra è la somma dei tempi degli stati (fasi) attraversati (tenendo presente che si parte sempre dallo stato 0.
+
+Quindi il costo Time(X) della sequenza di stati X = x(0), x(1), x(2), .... è Time(X) = time(x(0)) + time(x(1)) + time(x(2)) + ...
+
+Ad esempio se X = 0, 1 abbiamo Time(X) = time(0) + time(1) = time(0) (poichè time(1) = 0).
+
+Quale delle seguenti formule calcola il valore atteso del costo per completare il processo software di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_30/wrong 1.txt b/legacy/Data/ingsw/1122_30/wrong 1.txt
new file mode 100644
index 0000000..9927a93
--- /dev/null
+++ b/legacy/Data/ingsw/1122_30/wrong 1.txt
@@ -0,0 +1 @@
+time(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_30/wrong 2.txt b/legacy/Data/ingsw/1122_30/wrong 2.txt
new file mode 100644
index 0000000..d68fd15
--- /dev/null
+++ b/legacy/Data/ingsw/1122_30/wrong 2.txt
@@ -0,0 +1 @@
+time(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_31/correct.txt b/legacy/Data/ingsw/1122_31/correct.txt
new file mode 100644
index 0000000..a98afd2
--- /dev/null
+++ b/legacy/Data/ingsw/1122_31/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+initial equation
+y = false;
+equation
+z = (time > 20) and ((x >= 30) or (x <= 20)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_31/quest.txt b/legacy/Data/ingsw/1122_31/quest.txt
new file mode 100644
index 0000000..7314e2c
--- /dev/null
+++ b/legacy/Data/ingsw/1122_31/quest.txt
@@ -0,0 +1,5 @@
+Si consideri il seguente requisito:
+
+RQ1: Dopo 20 unità di tempo dall'inizio dell'esecuzione la variabile x è sempre nell'intervallo [20, 30] .
+
+Quale dei seguenti monitor meglio descrive il requisito RQ1 ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_31/wrong 1.txt b/legacy/Data/ingsw/1122_31/wrong 1.txt
new file mode 100644
index 0000000..8f1589e
--- /dev/null
+++ b/legacy/Data/ingsw/1122_31/wrong 1.txt
@@ -0,0 +1,19 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+
+initial equation
+
+y = false;
+equation
+z = (time > 20) and (x >= 20) and (x <= 30) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_31/wrong 2.txt b/legacy/Data/ingsw/1122_31/wrong 2.txt
new file mode 100644
index 0000000..8fd5deb
--- /dev/null
+++ b/legacy/Data/ingsw/1122_31/wrong 2.txt
@@ -0,0 +1,19 @@
+
+class Monitor
+
+InputReal x; // plant output
+OutputBoolean y;
+
+Boolean z;
+
+initial equation
+
+y = false;
+equation
+z = (time > 20) or ((x >= 20) and (x <= 30)) ;
+algorithm
+when edge(z) then
+y := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_33/correct.txt b/legacy/Data/ingsw/1122_33/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/1122_33/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_33/quest.txt b/legacy/Data/ingsw/1122_33/quest.txt
new file mode 100644
index 0000000..6283906
--- /dev/null
+++ b/legacy/Data/ingsw/1122_33/quest.txt
@@ -0,0 +1,17 @@
+Il branch coverage di un insieme di test cases è la percentuale di branch del programma che sono attraversati da almeno un test case.
+
+Si consideri la seguente funzione C:
+
+-----------
+
+int f(int x, int y) {
+
+ if (x - y - 2 <= 0) { if (x + y - 1 >= 0) return (1); else return (2); }
+
+ else {if (x + 2*y - 5 >= 0) return (3); else return (4); }
+
+ } /* f() */
+
+Si considerino i seguenti test cases: {x=1, y=2}, {x=0, y=0}, {x=5, y=0}, {x=3, y=0}.
+
+Quale delle seguenti è la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_33/wrong 1.txt b/legacy/Data/ingsw/1122_33/wrong 1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/1122_33/wrong 1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_33/wrong 2.txt b/legacy/Data/ingsw/1122_33/wrong 2.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/1122_33/wrong 2.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_34/correct.txt b/legacy/Data/ingsw/1122_34/correct.txt
new file mode 100644
index 0000000..bc5692f
--- /dev/null
+++ b/legacy/Data/ingsw/1122_34/correct.txt
@@ -0,0 +1 @@
+State coverage: 87%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_34/quest.txt b/legacy/Data/ingsw/1122_34/quest.txt
new file mode 100644
index 0000000..09970ee
--- /dev/null
+++ b/legacy/Data/ingsw/1122_34/quest.txt
@@ -0,0 +1,13 @@
+img=https://i.imgur.com/cXPjiw9.png
+La state coverage di un insieme di test cases (cioè sequenze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act2 act1 act1 act2 act1 act1 act0
+
+Test case 2: act2 act0 act2 act2 act1 act1 act0 act2 act2 act2 act0
+
+Test case 3: act1 act2 act2 act2 act1 act0 act1 act2 act2 act0
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_34/wrong 1.txt b/legacy/Data/ingsw/1122_34/wrong 1.txt
new file mode 100644
index 0000000..1a8a508
--- /dev/null
+++ b/legacy/Data/ingsw/1122_34/wrong 1.txt
@@ -0,0 +1 @@
+State coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_34/wrong 2.txt b/legacy/Data/ingsw/1122_34/wrong 2.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/1122_34/wrong 2.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_35/correct.txt b/legacy/Data/ingsw/1122_35/correct.txt
new file mode 100644
index 0000000..98939be
--- /dev/null
+++ b/legacy/Data/ingsw/1122_35/correct.txt
@@ -0,0 +1 @@
+1/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_35/quest.txt b/legacy/Data/ingsw/1122_35/quest.txt
new file mode 100644
index 0000000..215b21b
--- /dev/null
+++ b/legacy/Data/ingsw/1122_35/quest.txt
@@ -0,0 +1,3 @@
+img=https://i.imgur.com/jQT3J83.png
+Si consideri la Markov chain in figura con stato iniziale 0 e p in (0, 1). Quale delle seguenti formule calcola il valore atteso del numero di transizioni necessarie per lasciare lo stato 0.
+
diff --git a/legacy/Data/ingsw/1122_35/wrong 1.txt b/legacy/Data/ingsw/1122_35/wrong 1.txt
new file mode 100644
index 0000000..56ea6ac
--- /dev/null
+++ b/legacy/Data/ingsw/1122_35/wrong 1.txt
@@ -0,0 +1 @@
+1/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_35/wrong 2.txt b/legacy/Data/ingsw/1122_35/wrong 2.txt
new file mode 100644
index 0000000..db2276d
--- /dev/null
+++ b/legacy/Data/ingsw/1122_35/wrong 2.txt
@@ -0,0 +1 @@
+(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_36/correct.txt b/legacy/Data/ingsw/1122_36/correct.txt
new file mode 100644
index 0000000..a66c9ae
--- /dev/null
+++ b/legacy/Data/ingsw/1122_36/correct.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 5, c = 0), (a=50, b = 3, c = 0)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_36/quest.txt b/legacy/Data/ingsw/1122_36/quest.txt
new file mode 100644
index 0000000..da5d010
--- /dev/null
+++ b/legacy/Data/ingsw/1122_36/quest.txt
@@ -0,0 +1,26 @@
+Una Condition è una proposizione booleana, cioè una espressione con valore booleano che non può essere decomposta in espressioni boolean più semplici. Ad esempio, (x + y <= 3) è una condition.
+
+Una Decision è una espressione booleana composta da conditions e zero o più operatori booleani. Ad esempio, sono decisions:
+
+(x + y <= 3)
+((x + y <= 3) || (x - y > 7))
+
+
+Un insieme di test cases T soddisfa il criterio di Condition/Decision coverage se tutte le seguenti condizioni sono soddisfatte:
+
+1) Ciascun punto di entrata ed uscita nel programma è eseguito in almeno un test;
+2) Per ogni decision d nel programma, per ogni condition c in d, esiste un test in T in cui c è true ed un test in T in cui c è false.
+3) Per ogni decision d nel programma, esiste un test in T in cui d è true ed un test in T in cui d è false.
+
+Si consideri la seguente funzione:
+
+int f(int a, int b, int c)
+{ if ( (a - 100 >= 0) && (b - c - 1 <= 0) )
+ return (1); // punto di uscita 1
+ else if ((b - c - 1 <= 0) || (b + c - 5 >= 0)
+)
+ then return (2); // punto di uscita 2
+ else return (3); // punto di uscita 3
+}
+
+Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_36/wrong 1.txt b/legacy/Data/ingsw/1122_36/wrong 1.txt
new file mode 100644
index 0000000..abe0eaa
--- /dev/null
+++ b/legacy/Data/ingsw/1122_36/wrong 1.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 4, c = 0), (a=200, b = 4, c = 0)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_36/wrong 2.txt b/legacy/Data/ingsw/1122_36/wrong 2.txt
new file mode 100644
index 0000000..ea25d73
--- /dev/null
+++ b/legacy/Data/ingsw/1122_36/wrong 2.txt
@@ -0,0 +1 @@
+(a=200, b = 0, c = 1), (a=50, b = 5, c = 0), (a=50, b = 0, c = 5)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_37/correct.txt b/legacy/Data/ingsw/1122_37/correct.txt
new file mode 100644
index 0000000..deba1f5
--- /dev/null
+++ b/legacy/Data/ingsw/1122_37/correct.txt
@@ -0,0 +1,17 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+
+initial equation
+
+wy = false;
+equation
+wz = (time > 60) and (delay(x, 10) > 0) and (y >= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_37/quest.txt b/legacy/Data/ingsw/1122_37/quest.txt
new file mode 100644
index 0000000..843e4e9
--- /dev/null
+++ b/legacy/Data/ingsw/1122_37/quest.txt
@@ -0,0 +1,9 @@
+Si consideri il seguente requisito:
+
+RQ: Dopo 60 unità di tempo dall'inizio dell'esecuzione vale la seguente proprietà:
+
+se 10 unità di tempo nel passato x era maggiore di 0 allora ora y è negativa.
+
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time <= w e ritorna il valore che z aveva al tempo (time - w), se time = w.
+
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_37/wrong 1.txt b/legacy/Data/ingsw/1122_37/wrong 1.txt
new file mode 100644
index 0000000..6a0d3e9
--- /dev/null
+++ b/legacy/Data/ingsw/1122_37/wrong 1.txt
@@ -0,0 +1,19 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+
+initial equation
+
+wy = false;
+equation
+
+wz = (time > 60) and (delay(x, 10) <= 0) and (y >= 0);
+
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_37/wrong 2.txt b/legacy/Data/ingsw/1122_37/wrong 2.txt
new file mode 100644
index 0000000..f2a9214
--- /dev/null
+++ b/legacy/Data/ingsw/1122_37/wrong 2.txt
@@ -0,0 +1,20 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+
+initial equation
+
+wy = false;
+equation
+
+wz = (time > 60) or (delay(x, 10) > 0) or (y >= 0);
+
+
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_38/correct.txt b/legacy/Data/ingsw/1122_38/correct.txt
new file mode 100644
index 0000000..a7029bc
--- /dev/null
+++ b/legacy/Data/ingsw/1122_38/correct.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [1, 4] oppure nell'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_38/quest.txt b/legacy/Data/ingsw/1122_38/quest.txt
new file mode 100644
index 0000000..24d3f68
--- /dev/null
+++ b/legacy/Data/ingsw/1122_38/quest.txt
@@ -0,0 +1,29 @@
+Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato.
+
+block Monitor
+
+input Real x;
+
+output Boolean y;
+
+Boolean w;
+
+initial equation
+
+y = false;
+
+equation
+
+w = ((x < 1) or (x > 4)) and ((x < 15) or (x > 20));
+
+algorithm
+
+when edge(w) then
+
+y := true;
+
+end when;
+
+end Monitor;
+
+Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_38/wrong 1.txt b/legacy/Data/ingsw/1122_38/wrong 1.txt
new file mode 100644
index 0000000..710b111
--- /dev/null
+++ b/legacy/Data/ingsw/1122_38/wrong 1.txt
@@ -0,0 +1 @@
+La variabile x è fuori dall'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_38/wrong 2.txt b/legacy/Data/ingsw/1122_38/wrong 2.txt
new file mode 100644
index 0000000..a82929b
--- /dev/null
+++ b/legacy/Data/ingsw/1122_38/wrong 2.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_39/correct.txt b/legacy/Data/ingsw/1122_39/correct.txt
new file mode 100644
index 0000000..8bec3c6
--- /dev/null
+++ b/legacy/Data/ingsw/1122_39/correct.txt
@@ -0,0 +1 @@
+{x=1, y=1}, {x=0, y=0}, {x=2, y=1}, {x=2, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_39/quest.txt b/legacy/Data/ingsw/1122_39/quest.txt
new file mode 100644
index 0000000..5826af4
--- /dev/null
+++ b/legacy/Data/ingsw/1122_39/quest.txt
@@ -0,0 +1,14 @@
+Il branch coverage di un insieme di test cases è la percentuale di branch del programma che sono attraversati da almeno un test case.
+
+Si consideri la seguente funzione C:
+-----------
+
+int f(int x, int y) {
+
+ if (x - y <= 0) { if (x + y - 1 >= 0) return (1); else return (2); }
+
+ else {if (2*x + y - 5 >= 0) return (3); else return (4); }
+
+ } /* f() */
+
+Quale dei seguenti test sets consegue una branch coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_39/wrong 1.txt b/legacy/Data/ingsw/1122_39/wrong 1.txt
new file mode 100644
index 0000000..08bfca1
--- /dev/null
+++ b/legacy/Data/ingsw/1122_39/wrong 1.txt
@@ -0,0 +1 @@
+{x=1, y=1}, {x=0, y=0}, {x=2, y=1}, {x=2, y=3}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_39/wrong 2.txt b/legacy/Data/ingsw/1122_39/wrong 2.txt
new file mode 100644
index 0000000..256a361
--- /dev/null
+++ b/legacy/Data/ingsw/1122_39/wrong 2.txt
@@ -0,0 +1 @@
+{x=1, y=1}, {x=2, y=2}, {x=2, y=1}, {x=2, y=0}.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_4/correct.txt b/legacy/Data/ingsw/1122_4/correct.txt
new file mode 100644
index 0000000..9ddc3d7
--- /dev/null
+++ b/legacy/Data/ingsw/1122_4/correct.txt
@@ -0,0 +1,45 @@
+
+block FSA // Finite State Automaton
+
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+
+algorithm
+
+
+when initial() then
+x := 0;
+
+
+elsewhen sample(0,T) then
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 2;
+else x := pre(x); // default
+end if;
+
+
+end when;
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_4/quest.txt b/legacy/Data/ingsw/1122_4/quest.txt
new file mode 100644
index 0000000..4181719
--- /dev/null
+++ b/legacy/Data/ingsw/1122_4/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/1yUsW7d.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_4/wrong 1.txt b/legacy/Data/ingsw/1122_4/wrong 1.txt
new file mode 100644
index 0000000..c92e243
--- /dev/null
+++ b/legacy/Data/ingsw/1122_4/wrong 1.txt
@@ -0,0 +1,67 @@
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 2;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_4/wrong 2.txt b/legacy/Data/ingsw/1122_4/wrong 2.txt
new file mode 100644
index 0000000..ef7bdb0
--- /dev/null
+++ b/legacy/Data/ingsw/1122_4/wrong 2.txt
@@ -0,0 +1,69 @@
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_40/correct.txt b/legacy/Data/ingsw/1122_40/correct.txt
new file mode 100644
index 0000000..6b560cf
--- /dev/null
+++ b/legacy/Data/ingsw/1122_40/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 25%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_40/quest.txt b/legacy/Data/ingsw/1122_40/quest.txt
new file mode 100644
index 0000000..62c01e2
--- /dev/null
+++ b/legacy/Data/ingsw/1122_40/quest.txt
@@ -0,0 +1,13 @@
+img=https://i.imgur.com/ZjBToOi.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
+
+Test case 2: act1 act0 act1 act2 act1 act0 act0 act0
+
+
+Test case 3: act0 act0
+
+Quale delle seguenti è la migliore stima della transition coverage per i test cases di cui sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_40/wrong 1.txt b/legacy/Data/ingsw/1122_40/wrong 1.txt
new file mode 100644
index 0000000..d4b5815
--- /dev/null
+++ b/legacy/Data/ingsw/1122_40/wrong 1.txt
@@ -0,0 +1 @@
+Transition coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_40/wrong 2.txt b/legacy/Data/ingsw/1122_40/wrong 2.txt
new file mode 100644
index 0000000..8b0c318
--- /dev/null
+++ b/legacy/Data/ingsw/1122_40/wrong 2.txt
@@ -0,0 +1 @@
+Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_42/correct.txt b/legacy/Data/ingsw/1122_42/correct.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/1122_42/correct.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_42/quest.txt b/legacy/Data/ingsw/1122_42/quest.txt
new file mode 100644
index 0000000..67b07dc
--- /dev/null
+++ b/legacy/Data/ingsw/1122_42/quest.txt
@@ -0,0 +1,17 @@
+Il branch coverage di un insieme di test cases è la percentuale di branch del programma che sono attraversati da almeno un test case.
+
+Si consideri la seguente funzione C:
+
+-----------
+
+int f(int x, int y) {
+
+ if (x - y <= 0) { if (x + y - 2>= 0) return (1); else return (2); }
+
+ else {if (2*x + y - 1>= 0) return (3); else return (4); }
+
+ } /* f() */
+
+Si considerino i seguenti test cases: {x=1, y=1}, {x=0, y=0}, {x=1, y=0}, {x=0, y=-1}.
+
+Quale delle seguenti è la branch coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_42/wrong 1.txt b/legacy/Data/ingsw/1122_42/wrong 1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/1122_42/wrong 1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_42/wrong 2.txt b/legacy/Data/ingsw/1122_42/wrong 2.txt
new file mode 100644
index 0000000..23e721f
--- /dev/null
+++ b/legacy/Data/ingsw/1122_42/wrong 2.txt
@@ -0,0 +1 @@
+50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_43/correct.txt b/legacy/Data/ingsw/1122_43/correct.txt
new file mode 100644
index 0000000..bc5692f
--- /dev/null
+++ b/legacy/Data/ingsw/1122_43/correct.txt
@@ -0,0 +1 @@
+State coverage: 87%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_43/quest.txt b/legacy/Data/ingsw/1122_43/quest.txt
new file mode 100644
index 0000000..1045bb8
--- /dev/null
+++ b/legacy/Data/ingsw/1122_43/quest.txt
@@ -0,0 +1,11 @@
+img=https://i.imgur.com/5ZmMM3r.png
+La state coverage di un insieme di test cases (cioè sequenze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act0 act2 act2 act1 act2 act2 act0 act2 act2 act0 act2 act0 act0 act2 act2 act2 act2 act1
+
+Test case 2: act2 act1 act0 act2 act2 act0 act0 act1
+
+Test case 3: act0 act1 act0 act0 act0 act2 act1 act0 act2 act2 act2 act0 act1
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_43/wrong 1.txt b/legacy/Data/ingsw/1122_43/wrong 1.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/1122_43/wrong 1.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_43/wrong 2.txt b/legacy/Data/ingsw/1122_43/wrong 2.txt
new file mode 100644
index 0000000..1a8a508
--- /dev/null
+++ b/legacy/Data/ingsw/1122_43/wrong 2.txt
@@ -0,0 +1 @@
+State coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_44/correct.txt b/legacy/Data/ingsw/1122_44/correct.txt
new file mode 100644
index 0000000..2fd674f
--- /dev/null
+++ b/legacy/Data/ingsw/1122_44/correct.txt
@@ -0,0 +1 @@
+60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_44/quest.txt b/legacy/Data/ingsw/1122_44/quest.txt
new file mode 100644
index 0000000..6428a0e
--- /dev/null
+++ b/legacy/Data/ingsw/1122_44/quest.txt
@@ -0,0 +1,15 @@
+Il partition coverage di un insieme di test cases è la percentuale di elementi della partition inclusi nei test cases. La partition è una partizione finita dell'insieme di input della funzione che si sta testando.
+
+Si consideri la seguente funzione C:
+
+int f1(int x) { return (2*x); }
+
+Si vuole testare la funzione f1(). A tal fine l'insieme degli interi viene partizionato come segue:
+
+{(-inf, -11], [-10, -1], {0}, [1, 50], [51, +inf)}
+
+Si consideri il seguente insieme di test cases:
+
+{x=-20, x= 10, x=60}
+
+Quale delle seguenti è la partition coverage conseguita?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_44/wrong 1.txt b/legacy/Data/ingsw/1122_44/wrong 1.txt
new file mode 100644
index 0000000..a2507e5
--- /dev/null
+++ b/legacy/Data/ingsw/1122_44/wrong 1.txt
@@ -0,0 +1 @@
+80%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_44/wrong 2.txt b/legacy/Data/ingsw/1122_44/wrong 2.txt
new file mode 100644
index 0000000..95bc750
--- /dev/null
+++ b/legacy/Data/ingsw/1122_44/wrong 2.txt
@@ -0,0 +1 @@
+100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_45/correct.txt b/legacy/Data/ingsw/1122_45/correct.txt
new file mode 100644
index 0000000..3fb437d
--- /dev/null
+++ b/legacy/Data/ingsw/1122_45/correct.txt
@@ -0,0 +1 @@
+0.56
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_45/quest.txt b/legacy/Data/ingsw/1122_45/quest.txt
new file mode 100644
index 0000000..1454704
--- /dev/null
+++ b/legacy/Data/ingsw/1122_45/quest.txt
@@ -0,0 +1,8 @@
+img=https://i.imgur.com/47sr1ne.png
+Un processo software può essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del prcoesso software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilità della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+
+Ad esempio lo state diagram in figura rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.3 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilità 0.2 di dover essere ripetuta (a causa di errori).
+
+Uno scenario è una sequenza di stati.
+
+Qual è la probabilità dello scenario: 1, 3 ? In altri terminti, qual è la probabilità che non sia necessario ripetere nessuna fase?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_45/wrong 1.txt b/legacy/Data/ingsw/1122_45/wrong 1.txt
new file mode 100644
index 0000000..fc54e00
--- /dev/null
+++ b/legacy/Data/ingsw/1122_45/wrong 1.txt
@@ -0,0 +1 @@
+0.24
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_45/wrong 2.txt b/legacy/Data/ingsw/1122_45/wrong 2.txt
new file mode 100644
index 0000000..c64601b
--- /dev/null
+++ b/legacy/Data/ingsw/1122_45/wrong 2.txt
@@ -0,0 +1 @@
+0.14
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_46/correct.txt b/legacy/Data/ingsw/1122_46/correct.txt
new file mode 100644
index 0000000..973ef63
--- /dev/null
+++ b/legacy/Data/ingsw/1122_46/correct.txt
@@ -0,0 +1 @@
+State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_46/quest.txt b/legacy/Data/ingsw/1122_46/quest.txt
new file mode 100644
index 0000000..5bf1a08
--- /dev/null
+++ b/legacy/Data/ingsw/1122_46/quest.txt
@@ -0,0 +1,14 @@
+La state coverage di un insieme di test cases (cioè sequenze di inputs) per uno state diagram è la percentuale di stati (inclusi START ed END) raggiunti almeno una volta.
+
+Si consideri lo state diagram in figura
+Si consideri il seguente insieme di test cases:
+
+Test case 1: act2 act1 act1
+
+Test case 2: act0 act0 act2 act1
+
+Test case 3: act2 act0 act2 act2 act0
+
+
+
+Quale delle seguenti è la migliore stima della state coverage per i test cases di cui sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_46/wrong 1.txt b/legacy/Data/ingsw/1122_46/wrong 1.txt
new file mode 100644
index 0000000..d4625fd
--- /dev/null
+++ b/legacy/Data/ingsw/1122_46/wrong 1.txt
@@ -0,0 +1 @@
+State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_46/wrong 2.txt b/legacy/Data/ingsw/1122_46/wrong 2.txt
new file mode 100644
index 0000000..4e45af2
--- /dev/null
+++ b/legacy/Data/ingsw/1122_46/wrong 2.txt
@@ -0,0 +1 @@
+State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_47/correct.txt b/legacy/Data/ingsw/1122_47/correct.txt
new file mode 100644
index 0000000..475d1ef
--- /dev/null
+++ b/legacy/Data/ingsw/1122_47/correct.txt
@@ -0,0 +1 @@
+{x = -150, x = -40, x = 0, x = 200, x = 600}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_47/quest.txt b/legacy/Data/ingsw/1122_47/quest.txt
new file mode 100644
index 0000000..3631f63
--- /dev/null
+++ b/legacy/Data/ingsw/1122_47/quest.txt
@@ -0,0 +1,11 @@
+Il partition coverage di un insieme di test cases è la percentuale di elementi della partition inclusi nei test cases. La partition è una partizione finita dell'insieme di input della funzione che si sta testando.
+
+Si consideri la seguente funzione C:
+
+int f1(int x) { return (x + 7); }
+
+Si vuole testare la funzione f1(). A tal fine l'insieme degli interi viene partizionato come segue:
+
+{(-inf, -101], [-100, -1], {0}, [1, 500], [501, +inf)}
+
+Quale dei seguenti test cases consegue una partition coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_47/wrong 1.txt b/legacy/Data/ingsw/1122_47/wrong 1.txt
new file mode 100644
index 0000000..0aaedb8
--- /dev/null
+++ b/legacy/Data/ingsw/1122_47/wrong 1.txt
@@ -0,0 +1 @@
+{x = -200, x = -50, x = 0, x = 100, x = 500}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_47/wrong 2.txt b/legacy/Data/ingsw/1122_47/wrong 2.txt
new file mode 100644
index 0000000..a6df32d
--- /dev/null
+++ b/legacy/Data/ingsw/1122_47/wrong 2.txt
@@ -0,0 +1 @@
+{x = -200, x = -150, x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_48/correct.txt b/legacy/Data/ingsw/1122_48/correct.txt
new file mode 100644
index 0000000..f293f3e
--- /dev/null
+++ b/legacy/Data/ingsw/1122_48/correct.txt
@@ -0,0 +1 @@
+(a = 6, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 0)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_48/quest.txt b/legacy/Data/ingsw/1122_48/quest.txt
new file mode 100644
index 0000000..4fc3c18
--- /dev/null
+++ b/legacy/Data/ingsw/1122_48/quest.txt
@@ -0,0 +1,24 @@
+Una Condition è una proposizione booleana, cioè una espressione con valore booleano che non può essere decomposta in espressioni boolean più semplici. Ad esempio, (x + y <= 3)
è una condition.
+
+Una Decision è una espressione booleana composta da conditions e zero o più operatori booleani. Ad esempio, sono decisions:
+
+(x + y <= 3)
+((x + y <= 3) || (x - y > 7))
+
+Un insieme di test cases T soddisfa il criterio di Condition/Decision coverage se tutte le seguenti condizioni sono soddisfatte:
+
+1) Ciascun punto di entrata ed uscita nel programma è eseguito in almeno un test;
+2) Per ogni decision d nel programma, per ogni condition c in d, esiste un test in T in cui c è true ed un test in T in cui c è false.
+3) Per ogni decision d nel programma, esiste un test in T in cui d è true ed un test in T in cui d è false.
+
+Si consideri la seguente funzione:
+
+int f(int a, int b, int c)
+{ if ( (a + b - 6 >= 0) && (b - c - 1 <= 0) )
+ return (1); // punto di uscita 1
+ else if ((b - c - 1 <= 0) || (b + c - 5 >= 0))
+ then return (2); // punto di uscita 2
+ else return (3); // punto di uscita 3
+}
+ Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage ?
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_48/wrong 1.txt b/legacy/Data/ingsw/1122_48/wrong 1.txt
new file mode 100644
index 0000000..fc010a3
--- /dev/null
+++ b/legacy/Data/ingsw/1122_48/wrong 1.txt
@@ -0,0 +1 @@
+(a = 5, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 0)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_48/wrong 2.txt b/legacy/Data/ingsw/1122_48/wrong 2.txt
new file mode 100644
index 0000000..eafabb1
--- /dev/null
+++ b/legacy/Data/ingsw/1122_48/wrong 2.txt
@@ -0,0 +1 @@
+(a = 6, b = 0, c = 1), (a = 0, b = 5, c = 0), (a = 0, b = 3, c = 2)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_49/correct.txt b/legacy/Data/ingsw/1122_49/correct.txt
new file mode 100644
index 0000000..d4b5815
--- /dev/null
+++ b/legacy/Data/ingsw/1122_49/correct.txt
@@ -0,0 +1 @@
+Transition coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_49/quest.txt b/legacy/Data/ingsw/1122_49/quest.txt
new file mode 100644
index 0000000..e591c8c
--- /dev/null
+++ b/legacy/Data/ingsw/1122_49/quest.txt
@@ -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?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_49/wrong 1.txt b/legacy/Data/ingsw/1122_49/wrong 1.txt
new file mode 100644
index 0000000..eb5e1cd
--- /dev/null
+++ b/legacy/Data/ingsw/1122_49/wrong 1.txt
@@ -0,0 +1 @@
+Transition coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_49/wrong 2.txt b/legacy/Data/ingsw/1122_49/wrong 2.txt
new file mode 100644
index 0000000..8b0c318
--- /dev/null
+++ b/legacy/Data/ingsw/1122_49/wrong 2.txt
@@ -0,0 +1 @@
+Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_5/correct.txt b/legacy/Data/ingsw/1122_5/correct.txt
new file mode 100644
index 0000000..f64e200
--- /dev/null
+++ b/legacy/Data/ingsw/1122_5/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/t6Yscfv.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_5/quest.txt b/legacy/Data/ingsw/1122_5/quest.txt
new file mode 100644
index 0000000..bcbb3d8
--- /dev/null
+++ b/legacy/Data/ingsw/1122_5/quest.txt
@@ -0,0 +1,68 @@
+Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente?
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_5/wrong 1.txt b/legacy/Data/ingsw/1122_5/wrong 1.txt
new file mode 100644
index 0000000..03aeaee
--- /dev/null
+++ b/legacy/Data/ingsw/1122_5/wrong 1.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/AZ8nnvv.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_5/wrong 2.txt b/legacy/Data/ingsw/1122_5/wrong 2.txt
new file mode 100644
index 0000000..ade29f4
--- /dev/null
+++ b/legacy/Data/ingsw/1122_5/wrong 2.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/flqJ7iy.png
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_50/correct.txt b/legacy/Data/ingsw/1122_50/correct.txt
new file mode 100644
index 0000000..7470aaf
--- /dev/null
+++ b/legacy/Data/ingsw/1122_50/correct.txt
@@ -0,0 +1,69 @@
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_50/quest.txt b/legacy/Data/ingsw/1122_50/quest.txt
new file mode 100644
index 0000000..971e607
--- /dev/null
+++ b/legacy/Data/ingsw/1122_50/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/fyv5jqF.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_50/wrong 1.txt b/legacy/Data/ingsw/1122_50/wrong 1.txt
new file mode 100644
index 0000000..e77e043
--- /dev/null
+++ b/legacy/Data/ingsw/1122_50/wrong 1.txt
@@ -0,0 +1,69 @@
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_50/wrong 2.txt b/legacy/Data/ingsw/1122_50/wrong 2.txt
new file mode 100644
index 0000000..03c4dea
--- /dev/null
+++ b/legacy/Data/ingsw/1122_50/wrong 2.txt
@@ -0,0 +1,71 @@
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 1;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 2;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 1;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_6/correct.txt b/legacy/Data/ingsw/1122_6/correct.txt
new file mode 100644
index 0000000..cf8581f
--- /dev/null
+++ b/legacy/Data/ingsw/1122_6/correct.txt
@@ -0,0 +1 @@
+Costruire un prototipo, metterlo in esercizio ed accertarsi che i porti i benefici attesi
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_6/quest.txt b/legacy/Data/ingsw/1122_6/quest.txt
new file mode 100644
index 0000000..b17d629
--- /dev/null
+++ b/legacy/Data/ingsw/1122_6/quest.txt
@@ -0,0 +1 @@
+Quali delle seguenti attività può contribuire a validare i requisiti di un sistema?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_6/wrong 1.txt b/legacy/Data/ingsw/1122_6/wrong 1.txt
new file mode 100644
index 0000000..2cddbca
--- /dev/null
+++ b/legacy/Data/ingsw/1122_6/wrong 1.txt
@@ -0,0 +1 @@
+Costruire un prototipo e valutarne attentamente le performance
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_6/wrong 2.txt b/legacy/Data/ingsw/1122_6/wrong 2.txt
new file mode 100644
index 0000000..04f8a5e
--- /dev/null
+++ b/legacy/Data/ingsw/1122_6/wrong 2.txt
@@ -0,0 +1 @@
+Costruire un prototipo e testarlo a fondo per evidenziare subito errori di implementazione
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_7/correct.txt b/legacy/Data/ingsw/1122_7/correct.txt
new file mode 100644
index 0000000..ce9968f
--- /dev/null
+++ b/legacy/Data/ingsw/1122_7/correct.txt
@@ -0,0 +1 @@
+0.28
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_7/quest.txt b/legacy/Data/ingsw/1122_7/quest.txt
new file mode 100644
index 0000000..8db1ade
--- /dev/null
+++ b/legacy/Data/ingsw/1122_7/quest.txt
@@ -0,0 +1,10 @@
+img=https://i.imgur.com/5TP66IN.png
+Un processo software può essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del processo software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilità della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+
+Ad esempio lo state diagram in figura rappresenta un processo software con 2 fasi F1 ed F2.
+F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR.
+F1 ha una probabilita dello 0.4 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilità 0.3 di dover essere ripetuta (a causa di errori).
+
+Uno scenario è una sequenza di stati.
+
+Qual è la probabilità dello scenario: 1, 2, 3? In altri terminti, qual è la probabilità che non sia necessario ripetere la prima fase (ma non la seconda)?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_7/wrong 1.txt b/legacy/Data/ingsw/1122_7/wrong 1.txt
new file mode 100644
index 0000000..e8f9017
--- /dev/null
+++ b/legacy/Data/ingsw/1122_7/wrong 1.txt
@@ -0,0 +1 @@
+0.42
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_7/wrong 2.txt b/legacy/Data/ingsw/1122_7/wrong 2.txt
new file mode 100644
index 0000000..f2bb2d0
--- /dev/null
+++ b/legacy/Data/ingsw/1122_7/wrong 2.txt
@@ -0,0 +1 @@
+0.12
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_8/correct.txt b/legacy/Data/ingsw/1122_8/correct.txt
new file mode 100644
index 0000000..1c7da8c
--- /dev/null
+++ b/legacy/Data/ingsw/1122_8/correct.txt
@@ -0,0 +1 @@
+0.03
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_8/quest.txt b/legacy/Data/ingsw/1122_8/quest.txt
new file mode 100644
index 0000000..1f66143
--- /dev/null
+++ b/legacy/Data/ingsw/1122_8/quest.txt
@@ -0,0 +1,8 @@
+img=https://i.imgur.com/5TP66IN.png
+Un processo software può essere rappesentato con uno state diagram in cui gli stati rappresentano le fasi (e loro iterazioni) del prcoesso software e gli archi le transizioni da una fase all'altra. Gli archi sono etichettati con le probabilità della transizione e gli stati sono etichettati con il costo per lasciare lo stato.
+
+Ad esempio lo state diagram in figura rappresenta un processo software con 2 fasi F1 ed F2. F1 ha costo 10000 EUR ed F2 ha costo 1000 EUR. F1 ha una probabilita dello 0.3 di dover essere ripetuta (a causa di errori) ed F2 ha una probabilità 0.1 di dover essere ripetuta (a causa di errori).
+
+Uno scenario è una sequenza di stati.
+
+Qual è la probabilità dello scenario: 1, 2, 3, 4 ? In altri terminti, qual è la probabilità che sia necessario ripetere sia la fase 1 che la fase 2?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_8/wrong 1.txt b/legacy/Data/ingsw/1122_8/wrong 1.txt
new file mode 100644
index 0000000..7eb6830
--- /dev/null
+++ b/legacy/Data/ingsw/1122_8/wrong 1.txt
@@ -0,0 +1 @@
+0.27
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_8/wrong 2.txt b/legacy/Data/ingsw/1122_8/wrong 2.txt
new file mode 100644
index 0000000..8a346b7
--- /dev/null
+++ b/legacy/Data/ingsw/1122_8/wrong 2.txt
@@ -0,0 +1 @@
+0.07
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_9/correct.txt b/legacy/Data/ingsw/1122_9/correct.txt
new file mode 100644
index 0000000..a7a3133
--- /dev/null
+++ b/legacy/Data/ingsw/1122_9/correct.txt
@@ -0,0 +1,44 @@
+
+block FSA // Finite State Automaton
+
+
+/* connector declarations outside this block:
+connector InputInteger = input Integer;
+connector OutputInteger = output Integer;
+*/
+
+
+InputInteger u; // external input
+OutputInteger x; // state
+parameter Real T = 1;
+
+
+algorithm
+
+
+when initial() then
+x := 0;
+
+
+elsewhen sample(0,T) then
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 0;
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 0;
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 3;
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 1;
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 0;
+else x := pre(x); // default
+end if;
+
+
+end when;
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_9/quest.txt b/legacy/Data/ingsw/1122_9/quest.txt
new file mode 100644
index 0000000..0e4c593
--- /dev/null
+++ b/legacy/Data/ingsw/1122_9/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/Jq6EzV9.png
+Quale dei seguenti modelli Modelica rappresenta lo state diagram in figura?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_9/wrong 1.txt b/legacy/Data/ingsw/1122_9/wrong 1.txt
new file mode 100644
index 0000000..ea67dd7
--- /dev/null
+++ b/legacy/Data/ingsw/1122_9/wrong 1.txt
@@ -0,0 +1,71 @@
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 2;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 0) then x := 3;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 2;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 1;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 1;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 3;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_9/wrong 2.txt b/legacy/Data/ingsw/1122_9/wrong 2.txt
new file mode 100644
index 0000000..578bb6b
--- /dev/null
+++ b/legacy/Data/ingsw/1122_9/wrong 2.txt
@@ -0,0 +1,76 @@
+
+
+block FSA // Finite State Automaton
+
+
+
+/* connector declarations outside this block:
+
+connector InputInteger = input Integer;
+
+connector OutputInteger = output Integer;
+
+*/
+
+
+
+InputInteger u; // external input
+
+OutputInteger x; // state
+
+parameter Real T = 1;
+
+
+
+algorithm
+
+
+
+when initial() then
+
+x := 0;
+
+
+
+elsewhen sample(0,T) then
+
+
+
+if (pre(x) == 0) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 0) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 0) and (pre(u) == 2) then x := 4;
+
+elseif (pre(x) == 1) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 1) and (pre(u) == 2) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 2) and (pre(u) == 1) then x := 3;
+
+elseif (pre(x) == 2) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 3) and (pre(u) == 0) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 1) then x := 4;
+
+elseif (pre(x) == 3) and (pre(u) == 2) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 0) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 1) then x := 0;
+
+elseif (pre(x) == 4) and (pre(u) == 2) then x := 2;
+
+else x := pre(x); // default
+
+end if;
+
+
+
+end when;
+
+end FSA;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/12/correct.txt b/legacy/Data/ingsw/12/correct.txt
new file mode 100644
index 0000000..3769c66
--- /dev/null
+++ b/legacy/Data/ingsw/12/correct.txt
@@ -0,0 +1 @@
+Sviluppo plan-driven
\ No newline at end of file
diff --git a/legacy/Data/ingsw/12/quest.txt b/legacy/Data/ingsw/12/quest.txt
new file mode 100644
index 0000000..48d53db
--- /dev/null
+++ b/legacy/Data/ingsw/12/quest.txt
@@ -0,0 +1,2 @@
+Si pianifica di sviluppare un software gestionale per una università. Considerando che questo può essere considerato un
+sistema mission-critical, quali dei seguenti modelli di processi software generici è più adatto per lo sviluppo di tale software
\ No newline at end of file
diff --git a/legacy/Data/ingsw/12/wrong 2.txt b/legacy/Data/ingsw/12/wrong 2.txt
new file mode 100644
index 0000000..9d2b250
--- /dev/null
+++ b/legacy/Data/ingsw/12/wrong 2.txt
@@ -0,0 +1 @@
+Sviluppo Iterativo
\ No newline at end of file
diff --git a/legacy/Data/ingsw/12/wrong.txt b/legacy/Data/ingsw/12/wrong.txt
new file mode 100644
index 0000000..541e265
--- /dev/null
+++ b/legacy/Data/ingsw/12/wrong.txt
@@ -0,0 +1 @@
+Sviluppo Agile
\ No newline at end of file
diff --git a/legacy/Data/ingsw/16/correct.txt b/legacy/Data/ingsw/16/correct.txt
new file mode 100644
index 0000000..445c2fd
--- /dev/null
+++ b/legacy/Data/ingsw/16/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/5gsmkFI.png
diff --git a/legacy/Data/ingsw/16/quest.txt b/legacy/Data/ingsw/16/quest.txt
new file mode 100644
index 0000000..ce9037d
--- /dev/null
+++ b/legacy/Data/ingsw/16/quest.txt
@@ -0,0 +1,3 @@
+img=https://i.imgur.com/sB0yXg9.png
+Lo State Diagram in figura descrive (in modo semplificato) una macchina distributrice di bevande. Quale dei
+seguenti Sequence Diagram è consistente con lo State Diagram in figura ?
diff --git a/legacy/Data/ingsw/16/wrong 2.txt b/legacy/Data/ingsw/16/wrong 2.txt
new file mode 100644
index 0000000..d880802
--- /dev/null
+++ b/legacy/Data/ingsw/16/wrong 2.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/oqO8kfc.png
diff --git a/legacy/Data/ingsw/16/wrong.txt b/legacy/Data/ingsw/16/wrong.txt
new file mode 100644
index 0000000..79ee317
--- /dev/null
+++ b/legacy/Data/ingsw/16/wrong.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/kAJWpZb.png
diff --git a/legacy/Data/ingsw/17/correct.txt b/legacy/Data/ingsw/17/correct.txt
new file mode 100644
index 0000000..5aeccb4
--- /dev/null
+++ b/legacy/Data/ingsw/17/correct.txt
@@ -0,0 +1,25 @@
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Integer x0 = 0;
+parameter Integer xmax = 100;
+OutputInteger x;
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+if (x < xmax)
+then
+if (myrandom() <= 0.9)
+then
+if (myrandom() <= 0.8)
+then
+x := x + 1;
+else
+x := max(0, x - 1);
+end if;
+else
+x := max(0, x - 1);
+end if;
+end if;
+end when;
+end MarkovChain;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/17/quest.txt b/legacy/Data/ingsw/17/quest.txt
new file mode 100644
index 0000000..ff93c6c
--- /dev/null
+++ b/legacy/Data/ingsw/17/quest.txt
@@ -0,0 +1,10 @@
+Un'azienda decide di organizzare il processo di sviluppo di un grosso software in 101 phasi sequenziali, numerate da 0 a 100. La
+phase 0 è quella iniziale. La phase 100 è quella finale in cui lo sviluppo è completato. Tutte le fasi hanno circa la stessa durata.
+Alla fine di ogni fase viene eseguita una batteria di tests. I risultati del testing possono essere:
+a) si può passare alla fase successiva;
+b) bisogna ripetere la fase corrente;
+c) bisogna rivedere il lavoro fatto nella fase precedente (reworking).
+Dai dati storici è noto che la probabilità del caso a) è 0.72, del caso b) è 0.18 e del caso c) è 0.1.
+Allo scopo di stimare attraverso una simulazione MonteCarlo il valore atteso del tempo di completamento del progetto viene
+realizzato un modello Modelica del processo di sviluppo descritto sopra.
+Quale dei seguenti modelli Modelica modella correttamente il processo di sviluppo descritto sopra?
diff --git a/legacy/Data/ingsw/17/wrong 2.txt b/legacy/Data/ingsw/17/wrong 2.txt
new file mode 100644
index 0000000..5ab3880
--- /dev/null
+++ b/legacy/Data/ingsw/17/wrong 2.txt
@@ -0,0 +1,19 @@
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Integer x0 = 0;
+parameter Integer xmax = 100;
+OutputInteger x;
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+if (x < xmax)
+then
+if (myrandom() <= 0.8)
+then
+if (myrandom() <= 0.9)
+then
+x := x + 1;
+else
+x := max(0, x - 1);
+end if;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/17/wrong.txt b/legacy/Data/ingsw/17/wrong.txt
new file mode 100644
index 0000000..12836de
--- /dev/null
+++ b/legacy/Data/ingsw/17/wrong.txt
@@ -0,0 +1,25 @@
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Integer x0 = 0;
+parameter Integer xmax = 100;
+OutputInteger x;
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+if (x < xmax)
+then
+if (myrandom() <= 0.9)
+then
+if (myrandom() <= 0.72)
+then
+x := x + 1;
+else
+x := max(0, x - 1);
+end if;
+else
+x := max(0, x - 1);
+end if;
+end if;
+end when;
+end MarkovChain;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/19/correct.txt b/legacy/Data/ingsw/19/correct.txt
new file mode 100644
index 0000000..0465ee7
--- /dev/null
+++ b/legacy/Data/ingsw/19/correct.txt
@@ -0,0 +1 @@
+Costruire un modello di simulazione per i principali aspetti dei processi di business dell'azienda e per il sistema software da realizzare e valutare le migliorie apportate dal sistema software ai processi di business dell'azienda mediante simulazione
diff --git a/legacy/Data/ingsw/19/quest.txt b/legacy/Data/ingsw/19/quest.txt
new file mode 100644
index 0000000..b8d789e
--- /dev/null
+++ b/legacy/Data/ingsw/19/quest.txt
@@ -0,0 +1,2 @@
+Una azienda finanziaria desidera costruire un sistema software per ottimizzare i processi di business. Quali delle seguenti
+attività può contribuire a validare i requisiti del sistema ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/19/wrong 2.txt b/legacy/Data/ingsw/19/wrong 2.txt
new file mode 100644
index 0000000..43fd110
--- /dev/null
+++ b/legacy/Data/ingsw/19/wrong 2.txt
@@ -0,0 +1 @@
+Costruire un prototipo del sistema e valutarne i requisiti non funzionali usando i dati storici dall'azienda
diff --git a/legacy/Data/ingsw/19/wrong.txt b/legacy/Data/ingsw/19/wrong.txt
new file mode 100644
index 0000000..1aa1cd5
--- /dev/null
+++ b/legacy/Data/ingsw/19/wrong.txt
@@ -0,0 +1 @@
+Costruire un prototipo del sistema e testarlo rispetto ai requisiti funzionali usando i dati storici dall'azienda.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/2/correct.txt b/legacy/Data/ingsw/2/correct.txt
new file mode 100644
index 0000000..23cbd0e
--- /dev/null
+++ b/legacy/Data/ingsw/2/correct.txt
@@ -0,0 +1 @@
+6*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/2/quest.txt b/legacy/Data/ingsw/2/quest.txt
new file mode 100644
index 0000000..78e700c
--- /dev/null
+++ b/legacy/Data/ingsw/2/quest.txt
@@ -0,0 +1,2 @@
+Si consideri un software sviluppato seguendo un approccio plan-driven implementato con tre fasi: F1, F2, F3 ciascuna con costo A. Le "change request" possono arrivare solo al fine di una fase e provocano la ripetizione (con relativo costo) di tutte le fasi che precedono. Si assuma che dopo la fase F3 (cioè al termine dello sviluppo) arriva una change request. Qual è il costo totale per lo sviluppo del software in questione.
+Scegli un'alternativa:
\ No newline at end of file
diff --git a/legacy/Data/ingsw/2/wrong 2.txt b/legacy/Data/ingsw/2/wrong 2.txt
new file mode 100644
index 0000000..489e74c
--- /dev/null
+++ b/legacy/Data/ingsw/2/wrong 2.txt
@@ -0,0 +1 @@
+5*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/2/wrong.txt b/legacy/Data/ingsw/2/wrong.txt
new file mode 100644
index 0000000..63ca2eb
--- /dev/null
+++ b/legacy/Data/ingsw/2/wrong.txt
@@ -0,0 +1 @@
+4*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/20/correct.txt b/legacy/Data/ingsw/20/correct.txt
new file mode 100644
index 0000000..375f7c5
--- /dev/null
+++ b/legacy/Data/ingsw/20/correct.txt
@@ -0,0 +1,47 @@
+: block CoffeeMachine
+parameter Real T = 1; // clock
+InputInteger Customer2Machine;
+OutputInteger Machine2Customer;
+/*
+0: nop
+1: enough coins inserted
+2: drink dispensed
+3: done
+*/
+Integer state;
+/*
+0: waiting for coins
+1: waiting for selection
+2: dispensing
+3: refund/change
+*/
+algorithm
+when initial() then
+state := 0;
+Machine2Customer := 0;
+elsewhen sample(0, T) then
+if (pre(state) == 0) and (Customer2Machine == 1)
+then // customer has inserted enough coins
+state := 1;
+Machine2Customer := 1;
+elseif (pre(state) == 1) and (Customer2Machine == 2) // drink selected
+then // drink selected
+state := 2; // dispensing drink
+Machine2Customer := 0;
+elseif (pre(state) == 1) and (Customer2Machine == 3) // cancel transaction
+then // refund
+state := 3; // refund/change
+Machine2Customer := 0;
+elseif (pre(state) == 2) // drink dispensed
+then // drink dispensed
+state := 3;
+Machine2Customer := 2;
+elseif (pre(state) == 3) // refund/change
+then // refund
+state := 0;
+Machine2Customer := 3; // done
+else state := pre(state);
+Machine2Customer := pre(Machine2Customer);
+end if;
+end when;
+end CoffeeMachine;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/20/quest.txt b/legacy/Data/ingsw/20/quest.txt
new file mode 100644
index 0000000..1fb3954
--- /dev/null
+++ b/legacy/Data/ingsw/20/quest.txt
@@ -0,0 +1,3 @@
+img=https://i.imgur.com/Wk63xgA.png
+Lo state diagram in figura descrive (in modo semplificato) una macchina distributrice di bevande. Quale dei seguenti
+modelli Modelica è plausibile per lo state diagram in figura?
diff --git a/legacy/Data/ingsw/20/wrong 2.txt b/legacy/Data/ingsw/20/wrong 2.txt
new file mode 100644
index 0000000..43c9f97
--- /dev/null
+++ b/legacy/Data/ingsw/20/wrong 2.txt
@@ -0,0 +1,47 @@
+block CoffeeMachine
+parameter Real T = 1; // clock
+InputInteger Customer2Machine;
+OutputInteger Machine2Customer;
+/*
+0: nop
+1: enough coins inserted
+2: drink dispensed
+3: done
+*/
+Integer state;
+/*
+0: waiting for coins
+1: waiting for selection
+2: dispensing
+3: refund/change
+*/
+algorithm
+when initial() then
+state := 0;
+Machine2Customer := 0;
+elsewhen sample(0, T) then
+if (pre(state) == 0) and (Customer2Machine == 1)
+then // customer has inserted enough coins
+state := 1;
+Machine2Customer := 1;
+elseif (pre(state) == 1) and (Customer2Machine == 2) // drink selected
+then // drink selected
+state := 2; // dispensing drink
+Machine2Customer := 0;
+elseif (pre(state) == 1) and (Customer2Machine == 3) // cancel transaction
+then // refund
+state := 3; // refund/change
+Machine2Customer := 0;
+elseif (pre(state) == 2) // drink dispensed
+then // drink dispensed
+state := 0;
+Machine2Customer := 2;
+elseif (pre(state) == 3) // refund/change
+then // refund
+state := 0;
+Machine2Customer := 3; // done
+else state := pre(state);
+Machine2Customer := pre(Machine2Customer);
+end if;
+end when;
+end CoffeeMachine;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/20/wrong.txt b/legacy/Data/ingsw/20/wrong.txt
new file mode 100644
index 0000000..4e53f48
--- /dev/null
+++ b/legacy/Data/ingsw/20/wrong.txt
@@ -0,0 +1,47 @@
+block CoffeeMachine
+parameter Real T = 1; // clock
+InputInteger Customer2Machine;
+OutputInteger Machine2Customer;
+/*
+0: nop
+1: enough coins inserted
+2: drink dispensed
+3: done
+*/
+Integer state;
+/*
+0: waiting for coins
+1: waiting for selection
+2: dispensing
+3: refund/change
+*/
+algorithm
+when initial() then
+state := 0;
+Machine2Customer := 0;
+elsewhen sample(0, T) then
+if (pre(state) == 0) and (Customer2Machine == 1)
+then // customer has inserted enough coins
+state := 1;
+Machine2Customer := 1;
+elseif (pre(state) == 1) and (Customer2Machine == 2) // drink selected
+then // drink selected
+state := 2; // dispensing drink
+Machine2Customer := 0;
+elseif (pre(state) == 1) and (Customer2Machine == 3) // cancel transaction
+then // refund
+state := 0; // refund/change
+Machine2Customer := 0;
+elseif (pre(state) == 2) // drink dispensed
+then // drink dispensed
+state := 3;
+Machine2Customer := 2;
+elseif (pre(state) == 3) // refund/change
+then // refund
+state := 0;
+Machine2Customer := 3; // done
+else state := pre(state);
+Machine2Customer := pre(Machine2Customer);
+end if;
+end when;
+end CoffeeMachine;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/21/correct.txt b/legacy/Data/ingsw/21/correct.txt
new file mode 100644
index 0000000..60eaa92
--- /dev/null
+++ b/legacy/Data/ingsw/21/correct.txt
@@ -0,0 +1 @@
+Una volta selezionato il piatto di mare da preparare, la preparazione del pesce e del contorno procedono in parallelo.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/21/quest.txt b/legacy/Data/ingsw/21/quest.txt
new file mode 100644
index 0000000..7799f39
--- /dev/null
+++ b/legacy/Data/ingsw/21/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/jHN6wRm.png
+Quale delle seguenti frasi è corretta riguardo all'activity diagram in figura ?
diff --git a/legacy/Data/ingsw/21/wrong 2.txt b/legacy/Data/ingsw/21/wrong 2.txt
new file mode 100644
index 0000000..06a3fbf
--- /dev/null
+++ b/legacy/Data/ingsw/21/wrong 2.txt
@@ -0,0 +1 @@
+Una volta selezionato il piatto di mare da preparare, la preparazione del pesce e del contorno procedono in sequenza.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/21/wrong.txt b/legacy/Data/ingsw/21/wrong.txt
new file mode 100644
index 0000000..3e13d27
--- /dev/null
+++ b/legacy/Data/ingsw/21/wrong.txt
@@ -0,0 +1 @@
+Una volta selezionato il piatto di mare da preparare, la stessa persona prepara prima il pesce e poi il contorno.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/22/correct.txt b/legacy/Data/ingsw/22/correct.txt
new file mode 100644
index 0000000..2d1c2f0
--- /dev/null
+++ b/legacy/Data/ingsw/22/correct.txt
@@ -0,0 +1,23 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Real x0 = 1;
+OutputReal x;
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+if (myrandom() <= 0.9)
+then
+if (myrandom() <= 0.7)
+then
+x := 1.1*x;
+else
+x := 0.9*x;
+end if;
+else
+x := 0.73*x;
+end if;
+end when;
+end MarkovChain;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/22/quest.txt b/legacy/Data/ingsw/22/quest.txt
new file mode 100644
index 0000000..fcc9ac9
--- /dev/null
+++ b/legacy/Data/ingsw/22/quest.txt
@@ -0,0 +1,5 @@
+L'input di un sistema software è costituito da un sensore che ogni unità di tempo (ad esempio, un secondo) invia un numero
+reale. Con probabilità 0.63 il valore inviato in una unità di tempo è maggiore del 10% rispetto quello inviato nell'unità di tempo
+precedente. Con probabilità 0.1 è inferiore del 27% rispetto al valore inviato nell'unità di tempo precedente. Con probabilità 0.27
+è inferiore del 10% rispetto quello inviato nell'unità di tempo precedente.
+Quale dei seguenti modelli Modelica modella correttamente l'environment descritto sopra
\ No newline at end of file
diff --git a/legacy/Data/ingsw/22/wrong 2.txt b/legacy/Data/ingsw/22/wrong 2.txt
new file mode 100644
index 0000000..40720c0
--- /dev/null
+++ b/legacy/Data/ingsw/22/wrong 2.txt
@@ -0,0 +1,21 @@
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Real x0 = 1;
+OutputReal x;
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+if (myrandom() <= 0.7)
+then
+if (myrandom() <= 0.9)
+then
+x := 1.1*x;
+else
+x := 0.9*x;
+end if;
+else
+x := 0.73*x;
+end if;
+end when;
+end MarkovChain;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/22/wrong.txt b/legacy/Data/ingsw/22/wrong.txt
new file mode 100644
index 0000000..eba6b6d
--- /dev/null
+++ b/legacy/Data/ingsw/22/wrong.txt
@@ -0,0 +1,23 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Real x0 = 1;
+OutputReal x;
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+if (myrandom() <= 0.9)
+then
+if (myrandom() <= 0.7)
+then
+x := 0.9*x;
+else
+x := 01.1*x;
+end if;
+else
+x := 0.73*x;
+end if;
+end when;
+end MarkovChain;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/24/correct.txt b/legacy/Data/ingsw/24/correct.txt
new file mode 100644
index 0000000..c7c83e5
--- /dev/null
+++ b/legacy/Data/ingsw/24/correct.txt
@@ -0,0 +1 @@
+3*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/24/quest.txt b/legacy/Data/ingsw/24/quest.txt
new file mode 100644
index 0000000..1e2f071
--- /dev/null
+++ b/legacy/Data/ingsw/24/quest.txt
@@ -0,0 +1,2 @@
+Si consideri un software sviluppato seguendo un approccio iterativo implementato con tre fasi: F1, F2, F3. Ciascuna fase ha
+costo A. Qual'e' il costo dello sviluppo dell'intero software?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/24/wrong 2.txt b/legacy/Data/ingsw/24/wrong 2.txt
new file mode 100644
index 0000000..ff38c25
--- /dev/null
+++ b/legacy/Data/ingsw/24/wrong 2.txt
@@ -0,0 +1 @@
+2*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/24/wrong.txt b/legacy/Data/ingsw/24/wrong.txt
new file mode 100644
index 0000000..8c7e5a6
--- /dev/null
+++ b/legacy/Data/ingsw/24/wrong.txt
@@ -0,0 +1 @@
+A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/25/correct.txt b/legacy/Data/ingsw/25/correct.txt
new file mode 100644
index 0000000..1c03108
--- /dev/null
+++ b/legacy/Data/ingsw/25/correct.txt
@@ -0,0 +1 @@
+Costruire un prototipo, eseguirlo usando dati storici dai log di produzione e valutare la capacità del prototipo di ridurre gli scarti.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/25/quest.txt b/legacy/Data/ingsw/25/quest.txt
new file mode 100644
index 0000000..bf0f99b
--- /dev/null
+++ b/legacy/Data/ingsw/25/quest.txt
@@ -0,0 +1,3 @@
+Una azienda manifatturiera desidera costruire un sistema software per monitorare (attraverso sensori) la produzione al fine di
+ridurre gli scarti. Quali delle seguenti attività contribuisce a validare i requisiti del sistema.
+Scegli un'alternativa:
\ No newline at end of file
diff --git a/legacy/Data/ingsw/25/wrong 2.txt b/legacy/Data/ingsw/25/wrong 2.txt
new file mode 100644
index 0000000..5187be2
--- /dev/null
+++ b/legacy/Data/ingsw/25/wrong 2.txt
@@ -0,0 +1 @@
+Costruire un prototipo, eseguirlo usando dati storici dai log di produzione e valutarne le performance.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/25/wrong.txt b/legacy/Data/ingsw/25/wrong.txt
new file mode 100644
index 0000000..52330c1
--- /dev/null
+++ b/legacy/Data/ingsw/25/wrong.txt
@@ -0,0 +1 @@
+Costruire un prototipo, eseguirlo usando dati storici dai log di produzione ed identificare errori di implementazione.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/26/correct.txt b/legacy/Data/ingsw/26/correct.txt
new file mode 100644
index 0000000..e13eda2
--- /dev/null
+++ b/legacy/Data/ingsw/26/correct.txt
@@ -0,0 +1 @@
+Accertarsi che i requisiti definiscano un sistema che risolve il problema che l'utente pianifica di risolvere.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/26/quest.txt b/legacy/Data/ingsw/26/quest.txt
new file mode 100644
index 0000000..3cb2d1f
--- /dev/null
+++ b/legacy/Data/ingsw/26/quest.txt
@@ -0,0 +1,2 @@
+Quali delle seguenti attività è parte del processo di validazione dei requisiti ?
+Scegli un'alternativa:
\ No newline at end of file
diff --git a/legacy/Data/ingsw/26/wrong 2.txt b/legacy/Data/ingsw/26/wrong 2.txt
new file mode 100644
index 0000000..b24f900
--- /dev/null
+++ b/legacy/Data/ingsw/26/wrong 2.txt
@@ -0,0 +1 @@
+Accertarsi che il sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/26/wrong.txt b/legacy/Data/ingsw/26/wrong.txt
new file mode 100644
index 0000000..884d6b1
--- /dev/null
+++ b/legacy/Data/ingsw/26/wrong.txt
@@ -0,0 +1 @@
+Accertarsi che l'architettura del sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/32/correct.txt b/legacy/Data/ingsw/32/correct.txt
new file mode 100644
index 0000000..90c1575
--- /dev/null
+++ b/legacy/Data/ingsw/32/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/qKyYHVj.png
diff --git a/legacy/Data/ingsw/32/quest.txt b/legacy/Data/ingsw/32/quest.txt
new file mode 100644
index 0000000..f0c9221
--- /dev/null
+++ b/legacy/Data/ingsw/32/quest.txt
@@ -0,0 +1,3 @@
+Si consideri un software sviluppato seguendo un approccio plan-driven implementato con tre fasi: F1, F2, F3. Dopo ogni fase
+c'e' una probabilità p di dover ripeter la fase precedente ed una probabilità (1 - p) di passare alla fase successiva (sino ad arrivare
+al termine dello sviluppo). Quale delle seguenti catene di Markov modella il processo software descritto sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/32/wrong 2.txt b/legacy/Data/ingsw/32/wrong 2.txt
new file mode 100644
index 0000000..54e368c
--- /dev/null
+++ b/legacy/Data/ingsw/32/wrong 2.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/5I3NjLb.png
diff --git a/legacy/Data/ingsw/32/wrong.txt b/legacy/Data/ingsw/32/wrong.txt
new file mode 100644
index 0000000..c3a4d99
--- /dev/null
+++ b/legacy/Data/ingsw/32/wrong.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/NDNLPgt.png
diff --git a/legacy/Data/ingsw/33/correct.txt b/legacy/Data/ingsw/33/correct.txt
new file mode 100644
index 0000000..ddb0d65
--- /dev/null
+++ b/legacy/Data/ingsw/33/correct.txt
@@ -0,0 +1 @@
+La variabile x è nell'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/33/quest.txt b/legacy/Data/ingsw/33/quest.txt
new file mode 100644
index 0000000..4ea55e0
--- /dev/null
+++ b/legacy/Data/ingsw/33/quest.txt
@@ -0,0 +1,17 @@
+Si consideri il monitor seguente che ritorna true appena i requisiti per il sistema monitorato sono violati.
+
+block Monitor
+input Real x;
+output Boolean y;
+Boolean w;
+initial equation
+y = false;
+equation
+w = ((x < 0) or (x > 5));
+algorithm
+when edge(w) then
+y := true;
+end when;
+end Monitor;
+
+Quale delle seguenti affermazioni meglio descrive il requisito monitorato.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/33/wrong 2.txt b/legacy/Data/ingsw/33/wrong 2.txt
new file mode 100644
index 0000000..7c7a691
--- /dev/null
+++ b/legacy/Data/ingsw/33/wrong 2.txt
@@ -0,0 +1 @@
+La variable x è minore di 0.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/33/wrong.txt b/legacy/Data/ingsw/33/wrong.txt
new file mode 100644
index 0000000..3e05ae7
--- /dev/null
+++ b/legacy/Data/ingsw/33/wrong.txt
@@ -0,0 +1 @@
+La variabile x è fuori dall'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/ingsw/34/correct.txt b/legacy/Data/ingsw/34/correct.txt
new file mode 100644
index 0000000..3f7adfb
--- /dev/null
+++ b/legacy/Data/ingsw/34/correct.txt
@@ -0,0 +1,21 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Real x0 = 0;
+OutputReal x;
+Integer countdown;
+algorithm
+when initial() then
+x := x0;
+countdown := 0;
+elsewhen sample(0, 1) then
+if (countdown <= 0)
+then
+countdown := 1 + integer(floor(10*myrandom()));
+x := 1 - pre(x);
+else
+countdown := countdown - 1;
+end if;
+end when;
+end MarkovChain;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/34/quest.txt b/legacy/Data/ingsw/34/quest.txt
new file mode 100644
index 0000000..0ba09fa
--- /dev/null
+++ b/legacy/Data/ingsw/34/quest.txt
@@ -0,0 +1,3 @@
+L'input di un sistema software è costituito da una sequenza di 0 (false) ed 1 (true). Ad uno 0 segue un 1 ed ad un 1 segue uno 0.
+Il tempo tra un valore di input e l'altro è un valore random compreso tra 1 e 10 unità di tempo.
+Quale dei seguenti modelli Modelica modella meglio l'environment descritto sopra.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/34/wrong 2.txt b/legacy/Data/ingsw/34/wrong 2.txt
new file mode 100644
index 0000000..25f1613
--- /dev/null
+++ b/legacy/Data/ingsw/34/wrong 2.txt
@@ -0,0 +1,22 @@
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Real x0 = 0;
+OutputReal x;
+Integer countdown;
+algorithm
+when initial() then
+x := x0;
+countdown := 0;
+elsewhen sample(0, 10) then
+if (countdown <= 0)
+then
+countdown := 1 + integer(floor(myrandom()));
+x := 1 - pre(x);
+Domanda 35
+Risposta non data
+Punteggio max.: 1,00
+else
+countdown := countdown - 1;
+end if;
+end when;
+end MarkovChain;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/34/wrong.txt b/legacy/Data/ingsw/34/wrong.txt
new file mode 100644
index 0000000..4fb78cc
--- /dev/null
+++ b/legacy/Data/ingsw/34/wrong.txt
@@ -0,0 +1,19 @@
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Real x0 = 0;
+OutputReal x;
+Integer countdown;
+algorithm
+when initial() then
+x := x0;
+countdown := 0;
+elsewhen sample(0, 1) then
+if (countdown >= 0)
+then
+countdown := 1 + integer(floor(10*myrandom()));
+x := 1 - pre(x);
+else
+countdown := countdown - 1;
+end if;
+end when;
+end MarkovChain;
\ No newline at end of file
diff --git a/legacy/Data/ingsw/35/correct.txt b/legacy/Data/ingsw/35/correct.txt
new file mode 100644
index 0000000..3a0f9a1
--- /dev/null
+++ b/legacy/Data/ingsw/35/correct.txt
@@ -0,0 +1 @@
+Stiamo costruendo il sistema giusto ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/35/quest.txt b/legacy/Data/ingsw/35/quest.txt
new file mode 100644
index 0000000..9af583e
--- /dev/null
+++ b/legacy/Data/ingsw/35/quest.txt
@@ -0,0 +1 @@
+La validazione risponde alla seguente domanda:
\ No newline at end of file
diff --git a/legacy/Data/ingsw/35/wrong 2.txt b/legacy/Data/ingsw/35/wrong 2.txt
new file mode 100644
index 0000000..6633b8c
--- /dev/null
+++ b/legacy/Data/ingsw/35/wrong 2.txt
@@ -0,0 +1 @@
+Sono soddisfatti i requisti funzionali ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/35/wrong.txt b/legacy/Data/ingsw/35/wrong.txt
new file mode 100644
index 0000000..7edd4bc
--- /dev/null
+++ b/legacy/Data/ingsw/35/wrong.txt
@@ -0,0 +1 @@
+Stiamo costruendo il sistema nel modo giusto ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/39/correct.txt b/legacy/Data/ingsw/39/correct.txt
new file mode 100644
index 0000000..634f690
--- /dev/null
+++ b/legacy/Data/ingsw/39/correct.txt
@@ -0,0 +1 @@
+Il performance testing è tipicamente eseguito una volta che il sistema è stato completamento integrato
\ No newline at end of file
diff --git a/legacy/Data/ingsw/39/quest.txt b/legacy/Data/ingsw/39/quest.txt
new file mode 100644
index 0000000..4a711a4
--- /dev/null
+++ b/legacy/Data/ingsw/39/quest.txt
@@ -0,0 +1 @@
+Quale delle seguenti affermazioni è vera riguardo al performance testing?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/39/wrong 2.txt b/legacy/Data/ingsw/39/wrong 2.txt
new file mode 100644
index 0000000..74c1239
--- /dev/null
+++ b/legacy/Data/ingsw/39/wrong 2.txt
@@ -0,0 +1 @@
+Il performance testing è tipicamente eseguito su un prototipo del sistema
\ No newline at end of file
diff --git a/legacy/Data/ingsw/39/wrong.txt b/legacy/Data/ingsw/39/wrong.txt
new file mode 100644
index 0000000..bd881bc
--- /dev/null
+++ b/legacy/Data/ingsw/39/wrong.txt
@@ -0,0 +1 @@
+Il performance testing è tipicamente eseguito solo sulle componenti del sistema prima dell'integrazione.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/4/correct.txt b/legacy/Data/ingsw/4/correct.txt
new file mode 100644
index 0000000..6e771e9
--- /dev/null
+++ b/legacy/Data/ingsw/4/correct.txt
@@ -0,0 +1 @@
+A*(1 + p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/4/quest.txt b/legacy/Data/ingsw/4/quest.txt
new file mode 100644
index 0000000..07df0c7
--- /dev/null
+++ b/legacy/Data/ingsw/4/quest.txt
@@ -0,0 +1 @@
+Si consideri un software costituito da due fasi F1 ed F2 ciascuna di costo A. Con probabilità p la fase F1 deve essere ripetuta (a causa di change requests) e con probabilità (1 - p) si passa alla fase F2 e poi al completamento (End) dello sviluppo. Qual'è il costo atteso per lo sviluppo del software seguendo il processo sopra descritto?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/4/wrong 2.txt b/legacy/Data/ingsw/4/wrong 2.txt
new file mode 100644
index 0000000..a9b1c29
--- /dev/null
+++ b/legacy/Data/ingsw/4/wrong 2.txt
@@ -0,0 +1 @@
+3*A*p
\ No newline at end of file
diff --git a/legacy/Data/ingsw/4/wrong.txt b/legacy/Data/ingsw/4/wrong.txt
new file mode 100644
index 0000000..c24cae9
--- /dev/null
+++ b/legacy/Data/ingsw/4/wrong.txt
@@ -0,0 +1 @@
+A*(2 + p)
\ No newline at end of file
diff --git a/legacy/Data/ingsw/43/correct.txt b/legacy/Data/ingsw/43/correct.txt
new file mode 100644
index 0000000..c4cb236
--- /dev/null
+++ b/legacy/Data/ingsw/43/correct.txt
@@ -0,0 +1,15 @@
+
+lass Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) and (delay(x, 10) > 1) and (y < 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/43/quest.txt b/legacy/Data/ingsw/43/quest.txt
new file mode 100644
index 0000000..71eee89
--- /dev/null
+++ b/legacy/Data/ingsw/43/quest.txt
@@ -0,0 +1,6 @@
+Si consideri il seguente requisito:
+RQ: Dopo 40 unità di tempo dall'inizio dell'esecuzione vale la seguente proprietà:
+se 10 unità di tempo nel passato x era maggiore di 1 allora ora y è nonegativa.
+Tenendo presente che, al tempo time, delay(z, w) ritorna 0 se time <= w e ritorna il valore che z aveva al tempo (time - w), se
+time = w.
+Quale dei seguenti monitor meglio descrive il requisito RQ ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/43/wrong 2.txt b/legacy/Data/ingsw/43/wrong 2.txt
new file mode 100644
index 0000000..98b6414
--- /dev/null
+++ b/legacy/Data/ingsw/43/wrong 2.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) and (delay(x, 10) > 1) and (y >= 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/43/wrong.txt b/legacy/Data/ingsw/43/wrong.txt
new file mode 100644
index 0000000..a4ee4fb
--- /dev/null
+++ b/legacy/Data/ingsw/43/wrong.txt
@@ -0,0 +1,15 @@
+
+class Monitor
+InputReal x, y;
+OutputBoolean wy;
+Boolean wz;
+initial equation
+wy = false;
+equation
+wz = (time > 40) and (delay(x, 10) > 1) and (y < 0);
+algorithm
+when edge(wz) then
+wy := true;
+end when;
+end Monitor;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/44/correct.txt b/legacy/Data/ingsw/44/correct.txt
new file mode 100644
index 0000000..aa45c64
--- /dev/null
+++ b/legacy/Data/ingsw/44/correct.txt
@@ -0,0 +1,20 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Integer x0 = 0;
+parameter Integer xmax = 100;
+OutputInteger x; // Connector
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+if (x < xmax)
+then
+if (myrandom() <= 0.8)
+then
+x := x + 1;
+end if;
+end if;
+end when;
+end MarkovChain;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/44/quest.txt b/legacy/Data/ingsw/44/quest.txt
new file mode 100644
index 0000000..18bac37
--- /dev/null
+++ b/legacy/Data/ingsw/44/quest.txt
@@ -0,0 +1,8 @@
+Un'azienda decide di organizzare il processo di sviluppo di un grosso software in 101 phasi sequenziali, numerate da 0 a 100. La
+phase 0 è quella iniziale. La phase 100 è quella finale in cui lo sviluppo è completato. Tutte le fasi hanno circa la stessa durata.
+Si decide di realizzare un approccio incrementale in cui, alla fine di ogni fase, si passa alla fase successiva solo nel caso in cui
+tutti i test per la fase vengono superati. In caso contrario bisogna ripetere la phase. Dai dati storici è noto che la probabilità che
+il team di sviluppo passi da una fase a quella successiva è 0.8.
+Allo scopo di stimare attraverso una simulazione MonteCarlo il valore atteso del tempo di completamento del progetto viene
+realizzato un modello Modelica delo processo di sviluppo descritto sopra.
+Quale dei seguenti modelli Modelica modella correttamente il processo di sviluppo descritto sopra?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/44/wrong 2.txt b/legacy/Data/ingsw/44/wrong 2.txt
new file mode 100644
index 0000000..2e82c1c
--- /dev/null
+++ b/legacy/Data/ingsw/44/wrong 2.txt
@@ -0,0 +1,20 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Integer x0 = 0;
+parameter Integer xmax = 100;
+OutputInteger x; // Connector
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+if (x < xmax)
+then
+if (myrandom() >= 0.8)
+then
+x := x + 1;
+end if;
+end if;
+end when;
+end MarkovChain;
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/44/wrong.txt b/legacy/Data/ingsw/44/wrong.txt
new file mode 100644
index 0000000..75b3383
--- /dev/null
+++ b/legacy/Data/ingsw/44/wrong.txt
@@ -0,0 +1,22 @@
+
+block MarkovChain
+//external function myrandom() returns a random real number in [0, 1]
+parameter Integer x0 = 0;
+parameter Integer xmax = 100;
+OutputInteger x; // Connector
+algorithm
+when initial() then
+x := x0;
+elsewhen sample(0, 1) then
+if (x < xmax)
+then
+if (myrandom() <= 0.8)
+then
+x := x + 1;
+else
+x := x - 1;
+end if;
+end if;
+end when;
+end MarkovChain
+
\ No newline at end of file
diff --git a/legacy/Data/ingsw/45/correct.txt b/legacy/Data/ingsw/45/correct.txt
new file mode 100644
index 0000000..19d3060
--- /dev/null
+++ b/legacy/Data/ingsw/45/correct.txt
@@ -0,0 +1 @@
+Layred architecture.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/45/quest.txt b/legacy/Data/ingsw/45/quest.txt
new file mode 100644
index 0000000..e43794a
--- /dev/null
+++ b/legacy/Data/ingsw/45/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/7DG7vhi.png
+Quale pattern architetturale meglio descrive l'architettura in figura ?
diff --git a/legacy/Data/ingsw/45/wrong 2.txt b/legacy/Data/ingsw/45/wrong 2.txt
new file mode 100644
index 0000000..fd0a8b5
--- /dev/null
+++ b/legacy/Data/ingsw/45/wrong 2.txt
@@ -0,0 +1 @@
+Model View Controller
\ No newline at end of file
diff --git a/legacy/Data/ingsw/45/wrong.txt b/legacy/Data/ingsw/45/wrong.txt
new file mode 100644
index 0000000..9266c1a
--- /dev/null
+++ b/legacy/Data/ingsw/45/wrong.txt
@@ -0,0 +1 @@
+Pipe and filter architecture.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/46/correct.txt b/legacy/Data/ingsw/46/correct.txt
new file mode 100644
index 0000000..4a45407
--- /dev/null
+++ b/legacy/Data/ingsw/46/correct.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/cMy78HJ.png
diff --git a/legacy/Data/ingsw/46/quest.txt b/legacy/Data/ingsw/46/quest.txt
new file mode 100644
index 0000000..20c9a97
--- /dev/null
+++ b/legacy/Data/ingsw/46/quest.txt
@@ -0,0 +1,3 @@
+Si consideri un software sviluppato seguendo un approccio plan-driven implementato con tre fasi: F1, F2, F3. Le "change
+requests" arrivano con probabilità p dopo ciascuna fase e provocano la ripetizione (con relativo costo) di tutte le fasi che
+precedono. Quali delle seguenti catene di Markov modella lo sviluppo software descritto.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/46/wrong 2.txt b/legacy/Data/ingsw/46/wrong 2.txt
new file mode 100644
index 0000000..5b7d09a
--- /dev/null
+++ b/legacy/Data/ingsw/46/wrong 2.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/7lOYboM.png
diff --git a/legacy/Data/ingsw/46/wrong.txt b/legacy/Data/ingsw/46/wrong.txt
new file mode 100644
index 0000000..50bd343
--- /dev/null
+++ b/legacy/Data/ingsw/46/wrong.txt
@@ -0,0 +1 @@
+img=https://i.imgur.com/4gXreOh.png
diff --git a/legacy/Data/ingsw/47/correct.txt b/legacy/Data/ingsw/47/correct.txt
new file mode 100644
index 0000000..c8bbd53
--- /dev/null
+++ b/legacy/Data/ingsw/47/correct.txt
@@ -0,0 +1 @@
+Una volta selezionata la bevanda non è possibile cancellare l'operazione
\ No newline at end of file
diff --git a/legacy/Data/ingsw/47/quest.txt b/legacy/Data/ingsw/47/quest.txt
new file mode 100644
index 0000000..193a65f
--- /dev/null
+++ b/legacy/Data/ingsw/47/quest.txt
@@ -0,0 +1,3 @@
+img=https://i.imgur.com/qNh120A.png
+Lo State Diagram in figura descrive (in modo semplificato) una macchina distributrice di bevande. Quale delle seguenti
+frasi è corretta riguardo allo State Diagram in figura ?
diff --git a/legacy/Data/ingsw/47/wrong 2.txt b/legacy/Data/ingsw/47/wrong 2.txt
new file mode 100644
index 0000000..bc8629f
--- /dev/null
+++ b/legacy/Data/ingsw/47/wrong 2.txt
@@ -0,0 +1 @@
+La macchina non dà resto
\ No newline at end of file
diff --git a/legacy/Data/ingsw/47/wrong.txt b/legacy/Data/ingsw/47/wrong.txt
new file mode 100644
index 0000000..5d317c8
--- /dev/null
+++ b/legacy/Data/ingsw/47/wrong.txt
@@ -0,0 +1 @@
+Una volta inserite monete per due bevande è possibile ottenerle senza reinserire le monete.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/48/correct.txt b/legacy/Data/ingsw/48/correct.txt
new file mode 100644
index 0000000..455d534
--- /dev/null
+++ b/legacy/Data/ingsw/48/correct.txt
@@ -0,0 +1 @@
+Are we building the system right?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/48/quest.txt b/legacy/Data/ingsw/48/quest.txt
new file mode 100644
index 0000000..b7e0b09
--- /dev/null
+++ b/legacy/Data/ingsw/48/quest.txt
@@ -0,0 +1 @@
+Verification answers the following question:
\ No newline at end of file
diff --git a/legacy/Data/ingsw/48/wrong 2.txt b/legacy/Data/ingsw/48/wrong 2.txt
new file mode 100644
index 0000000..87e99c2
--- /dev/null
+++ b/legacy/Data/ingsw/48/wrong 2.txt
@@ -0,0 +1 @@
+Are we building the right system?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/48/wrong.txt b/legacy/Data/ingsw/48/wrong.txt
new file mode 100644
index 0000000..ddc2301
--- /dev/null
+++ b/legacy/Data/ingsw/48/wrong.txt
@@ -0,0 +1 @@
+Is the system cost reasonable for the intended market ?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/49/correct.txt b/legacy/Data/ingsw/49/correct.txt
new file mode 100644
index 0000000..88f9125
--- /dev/null
+++ b/legacy/Data/ingsw/49/correct.txt
@@ -0,0 +1 @@
+Requisito utente.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/49/quest.txt b/legacy/Data/ingsw/49/quest.txt
new file mode 100644
index 0000000..e544e9e
--- /dev/null
+++ b/legacy/Data/ingsw/49/quest.txt
@@ -0,0 +1 @@
+Si consideri il seguente requisito: "Il sistema fornisce l'elenco dei clienti in ordine alfabetico". Di che tipo di requisito si tratta?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/49/wrong 2.txt b/legacy/Data/ingsw/49/wrong 2.txt
new file mode 100644
index 0000000..6084c49
--- /dev/null
+++ b/legacy/Data/ingsw/49/wrong 2.txt
@@ -0,0 +1 @@
+Requisito non-funzionale.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/49/wrong.txt b/legacy/Data/ingsw/49/wrong.txt
new file mode 100644
index 0000000..4cae0da
--- /dev/null
+++ b/legacy/Data/ingsw/49/wrong.txt
@@ -0,0 +1 @@
+Requisito di sistema.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/5/correct.txt b/legacy/Data/ingsw/5/correct.txt
new file mode 100644
index 0000000..58964fc
--- /dev/null
+++ b/legacy/Data/ingsw/5/correct.txt
@@ -0,0 +1 @@
+Se ci sono abbastanza monete è sempre possibile ottenere la bevanda selezionata
\ No newline at end of file
diff --git a/legacy/Data/ingsw/5/quest.txt b/legacy/Data/ingsw/5/quest.txt
new file mode 100644
index 0000000..4ce9b89
--- /dev/null
+++ b/legacy/Data/ingsw/5/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/2gg5nIM.png
+Lo State Diagram in figura descrive (in modo semplificato) una macchina distributrice di bevande. Quale delle seguenti frasi è corretta riguardo allo State Diagram in figura?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/5/wrong 2.txt b/legacy/Data/ingsw/5/wrong 2.txt
new file mode 100644
index 0000000..a75a40c
--- /dev/null
+++ b/legacy/Data/ingsw/5/wrong 2.txt
@@ -0,0 +1 @@
+Una volta inserite le monete bisogna necessariamente consumare almeno una bevanda
\ No newline at end of file
diff --git a/legacy/Data/ingsw/5/wrong.txt b/legacy/Data/ingsw/5/wrong.txt
new file mode 100644
index 0000000..e47f380
--- /dev/null
+++ b/legacy/Data/ingsw/5/wrong.txt
@@ -0,0 +1 @@
+Anche se ci sono abbastanza monete potrebbe non essere possibile ottenere la bevanda selezionata
\ No newline at end of file
diff --git a/legacy/Data/ingsw/50/correct.txt b/legacy/Data/ingsw/50/correct.txt
new file mode 100644
index 0000000..bb086af
--- /dev/null
+++ b/legacy/Data/ingsw/50/correct.txt
@@ -0,0 +1 @@
+l paziente richiede al client una visita con uno specifico medico e, dopo una verifica sul database, riceve conferma dal client della disponibilità o meno del medico richiesto.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/50/quest.txt b/legacy/Data/ingsw/50/quest.txt
new file mode 100644
index 0000000..7816962
--- /dev/null
+++ b/legacy/Data/ingsw/50/quest.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/0OTH4Yw.png
+Quale delle seguenti frasi è corretta riguardo al Sequence Diagram in figura?
diff --git a/legacy/Data/ingsw/50/wrong 2.txt b/legacy/Data/ingsw/50/wrong 2.txt
new file mode 100644
index 0000000..d61601e
--- /dev/null
+++ b/legacy/Data/ingsw/50/wrong 2.txt
@@ -0,0 +1 @@
+Periodicamente il client comunica ai pazienti le disponibilità dei medici.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/50/wrong.txt b/legacy/Data/ingsw/50/wrong.txt
new file mode 100644
index 0000000..dd9b316
--- /dev/null
+++ b/legacy/Data/ingsw/50/wrong.txt
@@ -0,0 +1 @@
+Il paziente richiede al server una visita con uno specifico medico e, dopo una verifica sul database, riceve conferma dal server della disponibilità o meno del medico richiesto.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/69420/correct.txt b/legacy/Data/ingsw/69420/correct.txt
new file mode 100644
index 0000000..431a7c5
--- /dev/null
+++ b/legacy/Data/ingsw/69420/correct.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/a8kMXoW.png
+Serafina che tagga Sabrina
\ No newline at end of file
diff --git a/legacy/Data/ingsw/69420/quest.txt b/legacy/Data/ingsw/69420/quest.txt
new file mode 100644
index 0000000..8fa4d25
--- /dev/null
+++ b/legacy/Data/ingsw/69420/quest.txt
@@ -0,0 +1 @@
+Chi insegna questo corso?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/69420/wrong 2.txt b/legacy/Data/ingsw/69420/wrong 2.txt
new file mode 100644
index 0000000..670e7eb
--- /dev/null
+++ b/legacy/Data/ingsw/69420/wrong 2.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/F4evurl.jpg
+Gioele che tagga Sabrina
\ No newline at end of file
diff --git a/legacy/Data/ingsw/69420/wrong 3.txt b/legacy/Data/ingsw/69420/wrong 3.txt
new file mode 100644
index 0000000..673514a
--- /dev/null
+++ b/legacy/Data/ingsw/69420/wrong 3.txt
@@ -0,0 +1,2 @@
+img=https://i.imgur.com/qyKmPIA.png
+Deco che disegna un Hentai in aula studio
\ No newline at end of file
diff --git a/legacy/Data/ingsw/69420/wrong.txt b/legacy/Data/ingsw/69420/wrong.txt
new file mode 100644
index 0000000..6e6963e
--- /dev/null
+++ b/legacy/Data/ingsw/69420/wrong.txt
@@ -0,0 +1,2 @@
+img=https://corsidilaurea.uniroma1.it/sites/default/files/styles/user_picture/public/pictures/picture-23550-1602857792.jpg
+Tronci
\ No newline at end of file
diff --git a/legacy/Data/ingsw/8/correct.txt b/legacy/Data/ingsw/8/correct.txt
new file mode 100644
index 0000000..b3843cf
--- /dev/null
+++ b/legacy/Data/ingsw/8/correct.txt
@@ -0,0 +1 @@
+1.5*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/8/quest.txt b/legacy/Data/ingsw/8/quest.txt
new file mode 100644
index 0000000..e4ebc4a
--- /dev/null
+++ b/legacy/Data/ingsw/8/quest.txt
@@ -0,0 +1 @@
+Si consideri un software sviluppato seguendo un approccio plan-driven implementato con due fasi: F1, F2. La fase F1 ha costo A e la fase F2 ha costo il 50% di A. Qual'e' il costo dello sviluppo del software?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/8/wrong 2.txt b/legacy/Data/ingsw/8/wrong 2.txt
new file mode 100644
index 0000000..8c7e5a6
--- /dev/null
+++ b/legacy/Data/ingsw/8/wrong 2.txt
@@ -0,0 +1 @@
+A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/8/wrong.txt b/legacy/Data/ingsw/8/wrong.txt
new file mode 100644
index 0000000..54d2e91
--- /dev/null
+++ b/legacy/Data/ingsw/8/wrong.txt
@@ -0,0 +1 @@
+0.5*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/9/correct.txt b/legacy/Data/ingsw/9/correct.txt
new file mode 100644
index 0000000..e86ff88
--- /dev/null
+++ b/legacy/Data/ingsw/9/correct.txt
@@ -0,0 +1 @@
+1/1000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/9/quest.txt b/legacy/Data/ingsw/9/quest.txt
new file mode 100644
index 0000000..7cae29d
--- /dev/null
+++ b/legacy/Data/ingsw/9/quest.txt
@@ -0,0 +1 @@
+Il rischio R può essere calcolato come R = P*C, dove P è la probabilità dell'evento avverso (software failure nel nostro contesto) e C è il costo dell'occorrenza dell'evento avverso. Si consideri un software il cui costo per la failure è C = 1000000 EUR. Volendo un rischio non superiore a 1000 EUR quale è il valore massimo della probabilità di failure P accettabile?
\ No newline at end of file
diff --git a/legacy/Data/ingsw/9/wrong 2.txt b/legacy/Data/ingsw/9/wrong 2.txt
new file mode 100644
index 0000000..78abc32
--- /dev/null
+++ b/legacy/Data/ingsw/9/wrong 2.txt
@@ -0,0 +1 @@
+1/100
\ No newline at end of file
diff --git a/legacy/Data/ingsw/9/wrong.txt b/legacy/Data/ingsw/9/wrong.txt
new file mode 100644
index 0000000..bb7060e
--- /dev/null
+++ b/legacy/Data/ingsw/9/wrong.txt
@@ -0,0 +1 @@
+1/10
\ No newline at end of file
diff --git a/legacy/Data/motd.txt b/legacy/Data/motd.txt
new file mode 100644
index 0000000..4451483
--- /dev/null
+++ b/legacy/Data/motd.txt
@@ -0,0 +1,36 @@
+"Benvenuto 👑
+Con questo bot puoi esercitarti con le domande di alcuni esami del corso di Informatica! 🤞.
+
+✅ Il bot è mantenuto da @notherealmarco con l'aiuto di alcuni studenti del corso, un enorme grazie a @simone_s0, @loryspat, @Deco71, @mmatex123ab, Raffaele Ruggeri e sicuramente ne scordo qualcuno, perdonatemi 😢
+
+ℹ️ Sistemi Operativi I si riferisce al corso del prof. Melatti (canale I)
+
+ℹ️ Sistemi Operativi II si riferisce al corso del prof. Casalicchio (canale II)
+
+ℹ️ OGA si riferisce al corso della prof.ssa Castaldo
+
+ℹ️ Ingegneria del Software si riferisce al corso del prof. Tronci
+
+ℹ️ Sicurezza si riferisce al corso tenuto dal prof. Casalicchio. Le domande presenti sono prese dai test ufficiali forniti dagli autori del libro (versione inglese)
+
+Per contribuire (aggiungere o correggere domande), il bot si sincronizza con il seguente repository:
+https://github.com/appinfosapienza/so-un-bot
+Pull requests sono ben accette! 🫂❤️
+
+🆘 Per segnalare errori, per proporre nuove domande 🙏, o semplicemente se questo bot ti fa schifo 😢, non esitare a contattarmi: @notherealmarco
+(Oppure puoi correggere errori in autonomia inviando una PR al repository GitHub)
+
+⭕️ Informativa sulla privacy:
+Il bot, per garantire il corretto funzionamento, potrebbe memorizzare il vostro ID utente Telegram in modo permanente.
+Dati sulle risposte date NON vengono in alcun modo memorizzati in modo permanente e persistono in memoria RAM solo durante l'esecuzione di un quiz.
+
+👷♀️Per avviare un modulo puoi utilizzare i seguenti comandi:
+/so1 (SO Modulo I)
+/so2 (SO Modulo II)
+/ogas (quiz OGAS)
+/ingsw (Ingegneria del Software)
+/sicurezza (Sicurezza ⚠️)
+
+N.B. I corsi relativi all'Università di Venezia sono stati trasferiti al bot @so_1_unive_bot, mantenuto da @WAPEETY
+
+Per cambiare modulo puoi usare il comando /leave
diff --git a/Dockerfile b/legacy/Dockerfile
similarity index 100%
rename from Dockerfile
rename to legacy/Dockerfile
diff --git a/README.md b/legacy/README.md
similarity index 100%
rename from README.md
rename to legacy/README.md
diff --git a/Utils/check-ingsw-photos.sh b/legacy/Utils/check-ingsw-photos.sh
similarity index 100%
rename from Utils/check-ingsw-photos.sh
rename to legacy/Utils/check-ingsw-photos.sh
diff --git a/Utils/find_duplicates.py b/legacy/Utils/find_duplicates.py
similarity index 100%
rename from Utils/find_duplicates.py
rename to legacy/Utils/find_duplicates.py
diff --git a/Utils/make_questions.py b/legacy/Utils/make_questions.py
similarity index 100%
rename from Utils/make_questions.py
rename to legacy/Utils/make_questions.py
diff --git a/Utils/moodle-scraper/README.md b/legacy/Utils/moodle-scraper/README.md
similarity index 100%
rename from Utils/moodle-scraper/README.md
rename to legacy/Utils/moodle-scraper/README.md
diff --git a/Utils/moodle-scraper/scraper.py b/legacy/Utils/moodle-scraper/scraper.py
similarity index 100%
rename from Utils/moodle-scraper/scraper.py
rename to legacy/Utils/moodle-scraper/scraper.py
diff --git a/docker-compose.yml b/legacy/docker-compose.yml
similarity index 100%
rename from docker-compose.yml
rename to legacy/docker-compose.yml
diff --git a/scripts/docker-compose.yml b/scripts/docker-compose.yml
new file mode 100644
index 0000000..acc5bbf
--- /dev/null
+++ b/scripts/docker-compose.yml
@@ -0,0 +1,15 @@
+# The configuration used to deploy the bot on the production server
+# You can adapt it to create your own instance
+version: '3.8'
+services:
+ pim-a-bot:
+ image: 'wapeety/pim-a-bot:latest'
+ container_name: so-un-bot
+ restart: unless-stopped
+ environment:
+ - API_KEY=${TELEGRAM_TOKEN}
+ - ADMIN_ID=${TELEGRAM_ADMIN_ID}
+ volumes:
+ - "../data/questions:/app/data/questions"
+ - "../data/config:/app/data/config"
+ - "${ACL_DIR}:/app/data"