diff --git a/legacy/Bot/AccessControl/AccessManager.cs b/legacy/Bot/AccessControl/AccessManager.cs
deleted file mode 100644
index 56dfe09..0000000
--- a/legacy/Bot/AccessControl/AccessManager.cs
+++ /dev/null
@@ -1,90 +0,0 @@
-using Newtonsoft.Json;
-using Telegram.Bot;
-using Telegram.Bot.Types;
-using Telegram.Bot.Types.ReplyMarkups;
-
-namespace SoUnBot.AccessControl
-{
-    public class AccessManager
-    {
-        private string _acl_path;
-        private Dictionary<long, HashSet<string>> _acl;
-        public long AdminId { get; private set; }
-
-        public AccessManager(string aclPath, long adminId)
-        {
-            _acl_path = aclPath;
-            AdminId = adminId;
-            if (!System.IO.File.Exists(aclPath + "/acl.json"))
-            {
-                _acl = new Dictionary<long, HashSet<string>>();
-                return;
-            }
-            var json = System.IO.File.ReadAllText(aclPath + "/acl.json");
-            _acl = JsonConvert.DeserializeObject<Dictionary<long, HashSet<string>>>(json) ??  new Dictionary<long, HashSet<string>>();;
-        }
-
-        public long[] Users()
-        {
-            return _acl.Keys.ToArray();
-        }
-
-        private void SaveToJson()
-        {
-            var json = JsonConvert.SerializeObject(_acl);
-            System.IO.File.WriteAllText(_acl_path + "/acl.json", json);
-        }
-
-        public void GrantPermission(long uid, string perm)
-        {
-            if (_acl.ContainsKey(uid)) _acl[uid].Add(perm);
-            else _acl.Add(uid, new HashSet<string> { perm });
-            SaveToJson();
-        }
-
-        public bool RevokePermission(long uid, string perm)
-        {
-            if (_acl.ContainsKey(uid)) _acl[uid].Remove(perm);
-            else return false;
-            SaveToJson();
-            return true;
-        }
-
-        public bool CheckPermission(long uid, string perm)
-        {
-            return _acl.ContainsKey(uid) ? _acl[uid].Contains(perm) : false;
-        }
-
-        public bool CheckPermission(User user, string perm, ITelegramBotClient client)
-        {
-            var uid = user.Id;
-            var hasPerm = _acl.ContainsKey(uid) ? _acl[uid].Contains(perm) : false;
-            if (hasPerm) return true;
-            client.SendTextMessageAsync(
-                chatId: uid,
-                text: $"ACM\nNon hai l'accesso a `{ perm }`. Puoi richiederlo ad un amministratore usando il pulsante qui sotto",
-                replyMarkup: new InlineKeyboardMarkup(InlineKeyboardButton.WithCallbackData("🔆 Richiedi accesso"))
-                );
-            return false;
-        }
-        public void AskPermission(User user, string perm, ITelegramBotClient client)
-        {
-            /*InlineKeyboardButton[][] ik = new InlineKeyboardButton[][]
-            {
-                new InlineKeyboardButton[]
-                {
-                    new InlineKeyboardButton("✅ Grant")
-                },
-                new InlineKeyboardButton[]
-                {
-                    new InlineKeyboardButton("❌ Deny")
-                }
-            };*/
-            client.SendTextMessageAsync(
-                chatId: AdminId,
-                text: $"ACM: { user.Id }\nL'utente { user.FirstName } { user.LastName } @{ user.Username }\nHa richiesto l'accesso a: { perm }",
-                replyMarkup: new InlineKeyboardMarkup(InlineKeyboardButton.WithCallbackData("✅ Grant"))
-                );
-        }
-    }
-}
diff --git a/legacy/Bot/ModuleLoader/IModule.cs b/legacy/Bot/ModuleLoader/IModule.cs
deleted file mode 100644
index c345889..0000000
--- a/legacy/Bot/ModuleLoader/IModule.cs
+++ /dev/null
@@ -1,12 +0,0 @@
-using Telegram.Bot;
-using Telegram.Bot.Types;
-
-namespace SoUnBot.ModuleLoader
-{
-    public interface IModule
-    {
-        public string Cmd();
-        public string GetName();
-        public void ProcessUpdate(ITelegramBotClient botClient, Update update, CancellationToken cancellationToken);
-    }
-}
diff --git a/legacy/Bot/ModuleLoader/ModuleLoader.cs b/legacy/Bot/ModuleLoader/ModuleLoader.cs
deleted file mode 100644
index b111afd..0000000
--- a/legacy/Bot/ModuleLoader/ModuleLoader.cs
+++ /dev/null
@@ -1,18 +0,0 @@
-namespace SoUnBot.ModuleLoader
-{
-    public class ModuleLoader
-    {
-        public Dictionary<string, IModule> Modules { get; private set; }
-
-        public ModuleLoader()
-        {
-            Modules = new Dictionary<string, IModule>();
-        }
-
-        public void LoadModule(IModule module)
-        {
-            if (Modules == null) Modules = new Dictionary<string, IModule>();
-            Modules.Add(module.Cmd(), module);
-        }
-    }
-}
diff --git a/legacy/Bot/Modules/OttoLinux/BotGame.cs b/legacy/Bot/Modules/OttoLinux/BotGame.cs
deleted file mode 100644
index 13e250c..0000000
--- a/legacy/Bot/Modules/OttoLinux/BotGame.cs
+++ /dev/null
@@ -1,565 +0,0 @@
-using System.Collections;
-using Newtonsoft.Json;
-using SoUnBot.AccessControl;
-using SoUnBot.ModuleLoader;
-using Telegram.Bot;
-using Telegram.Bot.Types;
-using Telegram.Bot.Types.Enums;
-using Telegram.Bot.Types.InputFiles;
-using Telegram.Bot.Types.ReplyMarkups;
-using File = System.IO.File;
-
-namespace SoUnBot.Modules.OttoLinux
-{
-    public class BotGame : IModule
-    {
-        private AccessManager _accessManager;
-        private List<Question> _questions;
-        private string _questionsPath;
-        private string _name;
-        private bool _lock;
-        private string _imgBaseDir;
-
-        private Dictionary<long, OttoScore> _scores;
-        private Dictionary<long, Question> _playingQuestions;
-        private Dictionary<long, List<int>> _playedQuestions;
-        private Dictionary<Question, OttoScore> _questionStats;
-
-        private static Random _rng = new Random();
-
-        public BotGame(AccessManager accessManager, string name, string path, bool locke, string imgBaseDir, int version = 1)
-        {
-            _accessManager = accessManager;
-            _questionsPath = path;
-            _name = name;
-            _lock = locke;
-            _imgBaseDir = imgBaseDir;
-
-            _questions = new List<Question>();
-            _scores = new Dictionary<long, OttoScore>();
-            _playingQuestions = new Dictionary<long, Question>();
-            _questionStats = new Dictionary<Question, OttoScore>();
-            _playedQuestions = new Dictionary<long, List<int>>();
-
-            if (version == 2) LoadQuestionsV2();
-            else if (version == 3) LoadQuestionsJSON();
-            else LoadQuestions();
-        }
-        public BotGame(AccessManager accessManager)
-        {
-            _accessManager = accessManager;
-            _questions = new List<Question>();
-            _scores = new Dictionary<long, OttoScore>();
-            _playingQuestions = new Dictionary<long, Question>();
-            _questionStats = new Dictionary<Question, OttoScore>();
-            _playedQuestions = new Dictionary<long, List<int>>();
-
-            LoadQuestions();
-        }
-        private void LoadQuestions()
-        {
-            var lines = System.IO.File.ReadAllLines(_questionsPath);
-            Question cur = null;
-            var preEmpty = true;
-            foreach (var line in lines)
-            {
-                if (line.Equals("")) preEmpty = true;
-                else preEmpty = false;
-                if (line.StartsWith(">")) cur.AddAnswer(line.Substring(2), false);
-                else if (line.StartsWith("v")) cur.AddAnswer(line.Substring(2), true);
-                else
-                {
-                    if (!preEmpty && cur != null)
-                    {
-                        cur.Append("\n" + line);
-                        continue;
-                    }
-                    if (cur != null) _questions.Add(cur);
-                    cur = new Question(line);
-                }
-            }
-            _questions.Add(cur);
-            SanitizeQuestions();
-        }
-
-        private void LoadQuestionsV2()
-        {
-            var questions = System.IO.Directory.GetFileSystemEntries(_questionsPath);
-            foreach (var questPath in questions)
-            {
-                var quest = System.IO.File.ReadAllText(questPath + "/quest.txt");
-
-                if (quest.StartsWith("img=")) quest = quest.Insert(quest.IndexOf("\n") + 1, questPath.Split(new char[] { '/', '\\' }).Last() + ". ");
-                else quest = questPath.Split(new char[] { '/', '\\' }).Last() + ". " + quest;
-
-                Question cur = new Question(quest);
-
-                var shuffledAnsPaths = Directory.GetFiles(questPath).OrderBy(a => _rng.Next()).ToArray();
-
-                foreach (var ansPath in shuffledAnsPaths)
-                {
-                    if (ansPath.EndsWith("quest.txt")) continue;
-                    if (ansPath.EndsWith(".png")) continue;
-
-                    var ans = System.IO.File.ReadAllText(ansPath);
-                    if (ansPath.EndsWith("correct.txt")) cur.AddAnswer(ans, true);
-                    else cur.AddAnswer(ans, false);
-                }
-                _questions.Add(cur);
-            }
-            SanitizeQuestions();
-        }
-
-        private void LoadQuestionsJSON()
-        {
-            var json = System.IO.File.ReadAllText(_questionsPath);
-            var quests = JsonConvert.DeserializeObject<Question[]>(json);
-            if (quests != null) _questions = quests.ToList();
-        }
-
-        private void SanitizeQuestions()
-        {
-            var invalidQuestions = new List<Question>();
-            foreach (var qst in _questions)
-            {
-                while (qst.Quest.StartsWith("\n")) qst.Quest = qst.Quest.Substring(1);
-                for (int i = 0; i < qst.Answers.Count; i++)
-                {
-                    while (qst.Answers[i].StartsWith("\n")) qst.Answers[i] = qst.Answers[i].Substring(1);
-                }
-                if (qst.Quest == "")
-                {
-                    invalidQuestions.Add(qst);
-                    Console.WriteLine("an empty question was found, skipping it");
-                }
-                else if(qst.Answers.Count == 0)
-                {
-                    invalidQuestions.Add(qst);
-                    Console.WriteLine($"The following question: {qst.Quest} \nhas no answers, skipping it");
-                }
-            }
-            _questions = _questions.Except(invalidQuestions).ToList();
-        }
-
-        public Question PickRandomQuestion(long player, ITelegramBotClient botClient)
-        {
-            //WebRequest w = WebRequest.Create($"https://www.random.org/integers/?num=1&min=1&max={_questions.Count - 1 }&col=1&base=10&format=plain&rnd=new");
-            //w.Method = "GET";
-
-            //var number = int.Parse(new StreamReader(w.GetResponse().GetResponseStream()).ReadToEnd());
-            var number = _rng.Next(0, _questions.Count - 1);
-            while (_questions[number].Quest == "")
-            {
-                number = _rng.Next(0, _questions.Count - 1);
-            }
-
-            if (!_playedQuestions.ContainsKey(player)) _playedQuestions.Add(player, new List<int>());
-
-            if (_playedQuestions[player].Count >= _questions.Count)
-            {
-                _playedQuestions[player].Clear();
-                botClient.SendTextMessageAsync(
-                    chatId: player,
-                    text: $"🥳🥳🥳 Congratulazioni! Hai risposto a tutte le {_questions.Count} domande!"
-                    );
-            }
-
-            while (_playedQuestions[player].Contains(number))
-            {
-                if (number < _questions.Count - 1) number++;
-                else number = 0;
-            }
-            _playedQuestions[player].Add(number);
-
-            return _questions[number];
-        }
-
-        public string Cmd()
-        {
-            return GetName();
-        }
-
-        async void IModule.ProcessUpdate(ITelegramBotClient botClient, Update update, CancellationToken cancellationToken)
-        {
-            var uid = update.Message.From.Id;
-
-            if (_lock)
-            {
-                if (!_accessManager.CheckPermission(update.Message.From, Cmd(), botClient)) return;
-            }
-            else
-            {
-                if (!_accessManager.CheckPermission(uid, Cmd()))
-                {
-                    _accessManager.GrantPermission(uid, Cmd());
-                    await botClient.SendTextMessageAsync(
-                    chatId: _accessManager.AdminId,
-                    text: $"ACM: { update.Message.From.Id }\nL'utente { update.Message.From.FirstName } { update.Message.From.LastName } @{ update.Message.From.Username }\nHa iniziato a usare il bot."
-                    );
-                }
-            }
-
-            //if (!scores.Keys.Contains(uid))
-            //{
-            //    await botClient.SendTextMessageAsync(
-            //    chatId: _acm.AdminId,
-            //    text: $"ACM: { update.Message.From.Id }\nL'utente { update.Message.From.FirstName } { update.Message.From.LastName } @{ update.Message.From.Username }\nHa iniziato a usare il bot."
-            //    );
-            //}
-
-            if (update.Type != UpdateType.Message)
-                return;
-            if (update.Message!.Type != MessageType.Text)
-                return;
-
-            if (update.Message.Text.StartsWith("/qsc"))
-            {
-                int number = 1;
-                if (update.Message.Text.Length > 4) int.TryParse(update.Message.Text.Substring(5), out number);
-
-                var mostCorrect = _questionStats.GroupBy(e => e.Value.Correct).ToDictionary(e => e.Key, t => t.Select(r => r.Key).ToArray());
-
-                var c = 0;
-                foreach (var item in mostCorrect.Keys.OrderByDescending(i => i))
-                {
-                    if (c == number) break;
-                    var msg = mostCorrect[item].Select(q => q.Quest.Substring(0, 30)).Aggregate((a, b) => a + "\n\n" + b);
-
-                    await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: $"✅ Risposte indovinate {item} volte:\n{msg}");
-
-                    c++;
-                }
-
-                return;
-            }
-
-            if (update.Message.Text.StartsWith("/qsw"))
-            {
-                int number = 1;
-                if (update.Message.Text.Length > 4) int.TryParse(update.Message.Text.Substring(5), out number);
-
-                var mostWrong = _questionStats.GroupBy(e => e.Value.Wrong).ToDictionary(e => e.Key, t => t.Select(r => r.Key).ToArray());
-
-                var c = 0;
-                foreach (var item in mostWrong.Keys.OrderByDescending(i => i))
-                {
-                    if (c == number) break;
-                    var msg = mostWrong[item].Select(q => q.Quest.Substring(0, 30)).Aggregate((a, b) => a + "\n\n" + b);
-
-                    await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: $"❌ Risposte sbagliate {item} volte:\n{msg}");
-
-                    c++;
-                }
-
-                return;
-            }
-
-            if (update.Message.Text.StartsWith("/qsb"))
-            {
-                int number = 1;
-                if (update.Message.Text.Length > 4) int.TryParse(update.Message.Text.Substring(5), out number);
-
-                var mostBlank = _questionStats.GroupBy(e => e.Value.Blank).ToDictionary(e => e.Key, t => t.Select(r => r.Key).ToArray());
-
-                var c = 0;
-                foreach (var item in mostBlank.Keys.OrderByDescending(i => i))
-                {
-                    if (c == number) break;
-                    var msg = mostBlank[item].Select(q => q.Quest.Substring(0, 30)).Aggregate((a, b) => a + "\n\n" + b);
-
-                    await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: $"🟡 Risposte non date {item} volte:\n{msg}");
-
-                    c++;
-                }
-                return;
-            }
-
-            if (update.Message.Text.Equals("/rsp"))
-            {
-                if (!_playedQuestions.ContainsKey(uid))
-                {
-                    await botClient.SendTextMessageAsync(
-                        chatId: uid,
-                        text: "❌ Non c'è niente da eliminare!");
-                    return;
-                }
-                _playedQuestions[uid].Clear();
-                await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: "✅ Memoria eliminata!");
-                return;
-            }
-
-            if ((!_playingQuestions.ContainsKey(uid)) || update.Message.Text == GetName().ToLower() || update.Message.Text == "/" + GetName().ToLower() || update.Message.Text == "/reset" || update.Message.Text == "/restart")
-            {
-                if (_scores.ContainsKey(update.Message.From.Id)) _scores[update.Message.From.Id] = new OttoScore();
-                else _scores.Add(update.Message.From.Id, new OttoScore());
-
-                SendRandomQuestion(update.Message.From.Id, botClient, cancellationToken);
-                return;
-            }
-
-            var cur = _playingQuestions[uid];
-            var wrongMsg = "🟡 La risposta corretta era la " + (cur.Correct + 1) + " ☹️";
-
-            if (update.Message.Text == "n" || update.Message.Text == "Passa")
-            {
-                _scores[uid].Blank += 1;
-                _questionStats[cur].Blank += 1;
-
-                await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: wrongMsg
-                );
-
-                SendRandomQuestion(uid, botClient, cancellationToken);
-                return;
-            }
-
-            //todo try parse
-
-            var pick = -1;
-            if (!int.TryParse(update.Message.Text, out pick))
-            {
-                await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: "❓ scusa, non ho capito 😭");
-                await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: "⭕️ per uscire da 8linux, scrivi /leave");
-                return;
-            }
-            pick -= 1;
-
-
-            if (pick == _playingQuestions[uid].Correct)
-            {
-                await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: "✅ Risposta esatta!");
-
-                _scores[uid].Correct += 1;
-                _questionStats[cur].Correct += 1;
-            }
-            else
-            {
-                await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: "❌ Risposta errata!");
-                await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: wrongMsg);
-
-                _scores[uid].Wrong += 1;
-                _questionStats[cur].Wrong += 1;
-            }
-            SendStats(uid, botClient, cancellationToken);
-            await Task.Delay(400);
-            SendRandomQuestion(uid, botClient, cancellationToken);
-        }
-
-        private async void SendRandomQuestion(long uid, ITelegramBotClient botClient, CancellationToken cancellationToken)
-        {
-            var qst = PickRandomQuestion(uid, botClient);
-
-            try
-            {
-                if (qst.Quest.Length <= 40)
-                {
-                    Console.WriteLine("Sto inviando la domanda " + qst.Quest + " a " + uid);
-                }
-                else
-                {
-                    Console.WriteLine("Sto inviando la domanda " + qst.Quest.Substring(0, 40) + " a " + uid);
-                }
-            }
-            catch(Exception e)
-            {
-                botClient.SendTextMessageAsync(
-                    chatId: _accessManager.AdminId,
-                    text: $"Question is malformed -> {qst.Quest} \n {e.Message}"
-                );
-                return;
-            }
-
-            if (!_questionStats.ContainsKey(qst)) _questionStats.Add(qst, new OttoScore());
-
-            if (_playingQuestions.ContainsKey(uid)) _playingQuestions[uid] = qst;
-            else _playingQuestions.Add(uid, qst);
-
-            string answers = "";
-            List<KeyboardButton> kbs = new List<KeyboardButton>();
-
-            bool splitAns = false;
-            foreach (var ans in qst.Answers)
-                if ((ans.Contains("\n") && ans.Substring(ans.IndexOf("\n")).Length > 1 ) || ans.Contains("img=")) splitAns = true;
-
-            var corry = qst.Answers[qst.Correct];
-
-            for (int i = 0; i < qst.Answers.Count; i++)
-            {
-                if (!splitAns) answers += (i + 1) + ". " + qst.Answers[i] + "\n\n";
-                kbs.Add((i + 1).ToString());
-            }
-
-            KeyboardButton[] fr = kbs.ToArray();
-
-            ReplyKeyboardMarkup replyKeyboardMarkup = new(new[]
-            {
-                fr,
-                new KeyboardButton[] { "Passa" },
-            })
-            {
-                ResizeKeyboard = true
-            };
-
-            string quest = qst.Quest;
-            if (!string.IsNullOrEmpty(qst.Image))
-            {
-                try
-                {
-                    if (qst.Image.Contains("http"))
-                    {
-                        await botClient.SendPhotoAsync(
-                            chatId: uid,
-                            photo: qst.Image);
-                    }
-                    else
-                    {
-                        await botClient.SendPhotoAsync(
-                            chatId: uid,
-                            photo: File.OpenRead(_imgBaseDir + "/" + qst.Image));
-                    }
-                }
-                catch(Exception e)
-                {
-                    CatchParsingError(botClient, quest, uid, e);
-                }
-            }
-            if (qst.Quest.StartsWith("img="))
-            {
-                try
-                {
-                    if (qst.Image.Contains("http"))
-                    {
-                        await botClient.SendPhotoAsync(
-                            chatId: uid,
-                            photo: quest.Substring(4).Split('\n')[0]);
-                    }
-                    else
-                    {
-                        await botClient.SendPhotoAsync(
-                            chatId: uid,
-                            photo: File.OpenRead(_imgBaseDir + "/" + quest.Substring(4).Split('\n')[0]));
-                    }
-                }
-                catch(Exception e)
-                {
-                    CatchParsingError(botClient, quest, uid, e);
-                }
-
-                quest = quest.Substring(quest.IndexOf('\n') + 1);
-            }
-            try
-            {
-                Message sentMessage = await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: "📎 " + PrepareHtml(quest) + "\n\n" + PrepareHtml(answers),
-                    replyMarkup: replyKeyboardMarkup,
-                    parseMode: ParseMode.Html
-                );
-            }
-            catch (Exception e) { CatchParsingError(botClient, quest, uid, e); }
-
-            if (splitAns)
-            {
-                for (int i = 0; i < qst.Answers.Count; i++)
-                {
-                    await Task.Delay(350);
-                    if (qst.Answers[i].StartsWith("img="))
-                    {
-                        try
-                        {
-                            if (qst.Image.Contains("http"))
-                            {
-                                await botClient.SendPhotoAsync(
-                                    chatId: uid,
-                                    photo: qst.Answers[i].Split('\n')[0].Substring(4));
-                            }
-                            else
-                            {
-                                await botClient.SendPhotoAsync(
-                                    chatId: uid,
-                                    photo: File.OpenRead(_imgBaseDir + "/" + qst.Answers[i].Split('\n')[0].Substring(4)));
-                            }
-                        }
-                        catch(Exception e)
-                        {
-                            CatchParsingError(botClient, "[R] " + qst.Answers[i].Substring(0, 20) + " -> " + quest, uid, e);
-                        }
-                    }
-                    else
-                    {
-                        Message sentMessage = await botClient.SendTextMessageAsync(
-                        chatId: uid,
-                        text: "✏️ Risposta " + PrepareHtml((i + 1) + ":\n" + qst.Answers[i]),
-                        replyMarkup: replyKeyboardMarkup,
-                        parseMode: ParseMode.Html
-                    );
-                    }
-                }
-            }
-        }
-
-        private async void CatchParsingError(ITelegramBotClient botClient, string quest, long uid, Exception e)
-        {
-            await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: "❌ Cercavo di inviarti una domanda ma si è verificato un errore anomalo nel parsing. Per favore, invia /restart per resettarmi.\nL'errore verrà automaticamente segnalato (visto che tecnologia avanzatissima?)"
-                );
-            await botClient.SendTextMessageAsync(
-                chatId: uid,
-                text: $"❌ La domanda {quest.Substring(0, 60)} è rotta.\nSi è verificato {e.Message}"
-            );
-        }
-
-        private static string PrepareHtml(string s)
-        {
-            return s.Replace("<", "&lt;")
-                .Replace(">", "&gt;")
-                .Replace("&lt;code&gt;", "<code>")
-                .Replace("&lt;/code&gt;", "</code>")
-                .Replace("&lt;pre&gt;", "<pre>")
-                .Replace("&lt;/pre&gt;", "</pre>")
-                .Replace("&lt;b&gt;", "<b>")
-                .Replace("&lt;/b&gt;", "</b>");
-        }
-
-        private async void SendStats(long uid, ITelegramBotClient botClient, CancellationToken cancellationToken)
-        {
-            var stats = _scores[uid];
-
-            var total = stats.Correct + stats.Wrong + stats.Blank;
-
-            await botClient.SendTextMessageAsync(
-                chatId: uid,
-                text: stats.Correct + " corrette (" + ((float)stats.Correct / (float)total) * 100f + "%)\n" + stats.Wrong + " errate (" + ((float)stats.Wrong / (float)total) * 100f + "%)\n" + stats.Blank + " non date (" + ((float)stats.Blank / (float)total) * 100f + "%)\n");
-        }
-
-        public string GetName()
-        {
-            return _name;
-        }
-
-        public List<Question> GetQuestions()
-        {
-            return _questions;
-        }
-    }
-}
\ No newline at end of file
diff --git a/legacy/Bot/Modules/OttoLinux/OttoReverse.cs b/legacy/Bot/Modules/OttoLinux/OttoReverse.cs
deleted file mode 100644
index 266b0a1..0000000
--- a/legacy/Bot/Modules/OttoLinux/OttoReverse.cs
+++ /dev/null
@@ -1,197 +0,0 @@
-// This feature is not maintained anymore
-// it has been commented as it depends on the old project structure
-
-/** using HomeBot.ACL;
-using HomeBot.ModuleLoader;
-using System.Net;
-using Telegram.Bot;
-using Telegram.Bot.Types;
-using Telegram.Bot.Types.Enums;
-using Telegram.Bot.Types.ReplyMarkups;
-
-namespace HomeBot.Modules.OttoLinux
-{
-    public class OttoReverse : IModule
-    {
-        private List<Question> _questions;
-        private string NAME = "8reverse";
-        private bool LOCK = false;
-
-        public OttoReverse(string name, List<Question> questions, bool lck)
-        {
-            _questions = questions;
-            LOCK = lck;
-            NAME = name;
-
-            Thread thread = new Thread(() => new WebReverse(GetMatch));
-            thread.Start();
-        }
-
-        public string Cmd()
-        {
-            return GetName();
-        }
-
-        public List<Question> GetMatch(string qst)
-        {
-            var m = qst
-                .Replace("\n", "")
-                .Replace("\r", "")
-                .Replace("<pre>", "")
-                .Replace("<code>", "")
-                .Replace("</pre>", "")
-                .Replace("</code>", "")
-                .Replace("'", "")
-                .Replace("à", "a")
-                .Replace("è", "e")
-                .Replace("é", "e")
-                .Replace("ì", "i")
-                .Replace("ò", "o")
-                .Replace("ù", "u")
-                .Replace(" ", "")
-                .Replace(" ", "")
-                .ToLower();
-
-            var filtered = _questions.FindAll((Question q) =>
-            {
-                return q.Quest
-                .Replace("\n", "")
-                .Replace("\r", "")
-                .Replace("<pre>", "")
-                .Replace("<code>", "")
-                .Replace("</pre>", "")
-                .Replace("</code>", "")
-                .Replace("'", "")
-                .Replace("à", "a")
-                .Replace("è", "e")
-                .Replace("é", "e")
-                .Replace("ì", "i")
-                .Replace("ò", "o")
-                .Replace("ù", "u")
-                .Replace(" ", "")
-                .Replace(" ", "")
-                .ToLower()
-                .Contains(m);
-            });
-
-            return filtered;
-        }
-
-        async void IModule.ProcessUpdate(ITelegramBotClient botClient, Update update, CancellationToken cancellationToken)
-        {
-            var uid = update.Message.Chat.Id;
-
-            if (LOCK)
-            {
-                if (!ACM.CheckPermission(update.Message.From, Cmd(), botClient)) return;
-            }
-            else
-            {
-                if (!ACM.CheckPermission(uid, Cmd()))
-                {
-                    ACM.GrantPermission(uid, Cmd());
-                    await botClient.SendTextMessageAsync(
-                    chatId: _acm.AdminId,
-                    text: $"ACM: {update.Message.From.Id}\nL'utente {update.Message.From.FirstName} {update.Message.From.LastName} @{update.Message.From.Username}\nHa iniziato a usare il bot."
-                    );
-                }
-            }
-
-            if (update.Type != UpdateType.Message)
-                return;
-            if (update.Message!.Type != MessageType.Text)
-                return;
-
-            if (update.Message.Text.Equals("/" + NAME))
-            {
-                await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: $"🤫 Hai appena scoperto una funzione nascosta! 🤐🥶"
-                );
-                return;
-            }
-
-            var m = update.Message.Text
-                .Replace("\n", "")
-                .Replace("\r", "")
-                .Replace("<pre>", "")
-                .Replace("<code>", "")
-                .Replace("</pre>", "")
-                .Replace("</code>", "")
-                .Replace("'", "")
-                .Replace("à", "a")
-                .Replace("è", "e")
-                .Replace("é", "e")
-                .Replace("ì", "i")
-                .Replace("ò", "o")
-                .Replace("ù", "u")
-                .Replace(" ", "")
-                .Replace(" ", "")
-                .ToLower();
-
-            if (string.IsNullOrEmpty(m)) return;
-
-            var filtered = _questions.FindAll((Question q) =>
-            {
-                return q.Quest
-                .Replace("\n", "")
-                .Replace("\r", "")
-                .Replace("<pre>", "")
-                .Replace("<code>", "")
-                .Replace("</pre>", "")
-                .Replace("</code>", "")
-                .Replace("'", "")
-                .Replace("à", "a")
-                .Replace("è", "e")
-                .Replace("é", "e")
-                .Replace("ì", "i")
-                .Replace("ò", "o")
-                .Replace("ù", "u")
-                .Replace(" ", "")
-                .Replace(" ", "")
-                .ToLower()
-                .Contains(m);
-            });
-
-            if (!filtered.Any())
-                await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: $"❌ No match :("
-                );
-            else
-                await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: $"✅ Found {filtered.Count} matches!"
-                );
-
-            foreach (var q in filtered)
-            {
-                await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: $"❓ Possible match:\n\n{q.Quest}"
-                );
-                await Task.Delay(250);
-                await botClient.SendTextMessageAsync(
-                    chatId: uid,
-                    text: $"✅ Correct answare for the match:\n\n{q.Answers[q.Correct]}"
-                );
-                await Task.Delay(500);
-            }
-        }
-
-        public string GetName()
-        {
-            return NAME;
-        }
-
-        public void ProcessUpdate(ITelegramBotClient botClient, global::Telegram.Bot.Types.Update update, CancellationToken cancellationToken)
-        {
-            throw new NotImplementedException();
-        }
-
-        public List<Question> GetQuestions()
-        {
-            return _questions;
-        }
-    }
-} **/
\ No newline at end of file
diff --git a/legacy/Bot/Modules/OttoLinux/OttoScore.cs b/legacy/Bot/Modules/OttoLinux/OttoScore.cs
deleted file mode 100644
index 7c18bc9..0000000
--- a/legacy/Bot/Modules/OttoLinux/OttoScore.cs
+++ /dev/null
@@ -1,16 +0,0 @@
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
-
-namespace SoUnBot.Modules.OttoLinux
-{
-    public class OttoScore
-    {
-        public int Score { get; set; }
-        public int Correct { get; set; }
-        public int Wrong { get; set; }
-        public int Blank { get; set; }
-    }
-}
diff --git a/legacy/Bot/Modules/OttoLinux/PhotoServer.cs b/legacy/Bot/Modules/OttoLinux/PhotoServer.cs
deleted file mode 100644
index 3560439..0000000
--- a/legacy/Bot/Modules/OttoLinux/PhotoServer.cs
+++ /dev/null
@@ -1,66 +0,0 @@
-// This feature is not maintained anymore
-// it was exposing a webserver returning a json with all the questions and answers.
-// It was originally intended for a web version of the bot, but was never completed.
-
-using System.Net;
-
-namespace SoUnBot.Modules.OttoLinux
-{
-    public class PhotoServer
-    {
-        public PhotoServer(string baseDir)
-        {
-            using var listener = new HttpListener();
-            listener.Prefixes.Add("http://+:8001/");
-            listener.Start();
-            Console.WriteLine("PhotoServer is listening on port 8001...");
-
-            while (true)
-            {
-                HttpListenerContext ctx = listener.GetContext();
-                using HttpListenerResponse resp = ctx.Response;
-
-                resp.StatusCode = (int)HttpStatusCode.OK;
-                resp.StatusDescription = "Status OK";
-                resp.AddHeader("Access-Control-Allow-Origin", "*");
-                resp.AddHeader("Access-Control-Allow-Headers", "*");
-                resp.AddHeader("Access-Control-Allow-Methods", "GET");
-
-                if (ctx.Request.Url == null)
-                {
-                    resp.StatusCode = (int)HttpStatusCode.BadRequest;
-                    continue;
-                }
-
-                if (!File.Exists(baseDir + "/" + ctx.Request.Url.AbsolutePath))
-                {
-                    resp.StatusCode = (int)HttpStatusCode.NotFound;
-                    continue;
-                }
-
-                if (ctx.Request.Url.AbsolutePath.EndsWith("png"))
-                {
-                    resp.AddHeader("Content-Type", "image/png");
-                }
-                else if (ctx.Request.Url.AbsolutePath.EndsWith("jpg"))
-                {
-                    resp.AddHeader("Content-Type", "image/jpeg");
-                }
-                else
-                {
-                    resp.StatusCode = (int)HttpStatusCode.BadRequest;
-                    continue;
-                }
-
-                byte[] buffer = File.ReadAllBytes(baseDir + "/" + ctx.Request.Url.AbsolutePath);
-                resp.ContentLength64 = buffer.Length;
-
-                using Stream ros = resp.OutputStream;
-                try
-                {
-                    ros.Write(buffer, 0, buffer.Length);
-                } catch { }
-            }
-        }
-    }
-}
diff --git a/legacy/Bot/Modules/OttoLinux/Question.cs b/legacy/Bot/Modules/OttoLinux/Question.cs
deleted file mode 100644
index c168f53..0000000
--- a/legacy/Bot/Modules/OttoLinux/Question.cs
+++ /dev/null
@@ -1,39 +0,0 @@
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
-using Newtonsoft.Json;
-
-namespace SoUnBot.Modules.OttoLinux
-{
-    public class Question
-    {
-        [JsonProperty("quest")]
-        public String Quest { get; set; }
-        [JsonProperty("answers")]
-        public List<string> Answers { get; }
-        [JsonProperty("correct")]
-        public int Correct { get; private set; }
-        [JsonProperty("image")]
-        public string Image { get; private set; }
-
-        public Question(String quest)
-        {
-            Quest = quest;
-            Answers = new List<string>();
-            Correct = 0;
-        }
-
-        public void AddAnswer(String answer, bool correct)
-        {
-            Answers.Add(answer);
-            Correct = correct ? Answers.Count - 1 : Correct;
-        }
-
-        public void Append(String quest)
-        {
-            Quest += quest;
-        }
-    }
-}
diff --git a/legacy/Bot/Modules/OttoLinux/WebReverse.cs b/legacy/Bot/Modules/OttoLinux/WebReverse.cs
deleted file mode 100644
index 7588394..0000000
--- a/legacy/Bot/Modules/OttoLinux/WebReverse.cs
+++ /dev/null
@@ -1,57 +0,0 @@
-// This feature is not maintained anymore
-// it was exposing a webserver returning a json with all the questions and answers.
-// It was originally intended for a web version of the bot, but was never completed.
-
-/**using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
-using System.Net;
-using Newtonsoft.Json;
-
-namespace SoUnBot.Modules.OttoLinux
-{
-    internal class WebReverse
-    {
-        public WebReverse(Func<string, List<Question>> match)
-        {
-            using var listener = new HttpListener();
-            listener.Prefixes.Add("http://+:8001/");
-
-            listener.Start();
-
-            Console.WriteLine("Listening on port 8001...");
-
-            string pre = "";
-
-            while (true)
-            {
-                HttpListenerContext ctx = listener.GetContext();
-                using HttpListenerResponse resp = ctx.Response;
-
-                resp.StatusCode = (int)HttpStatusCode.OK;
-                resp.StatusDescription = "Status OK";
-                resp.AddHeader("Access-Control-Allow-Origin", "*");
-                resp.AddHeader("Access-Control-Allow-Headers", "*");
-                resp.AddHeader("Access-Control-Allow-Methods", "POST");
-                resp.AddHeader("Content-Type", "application/json");
-
-                var body = new StreamReader(ctx.Request.InputStream).ReadToEnd();
-                //if (body.Equals("")) body = pre;
-                pre = body;
-
-                string data = JsonConvert.SerializeObject(match(pre));
-                byte[] buffer = Encoding.UTF8.GetBytes(data);
-                resp.ContentLength64 = buffer.Length;
-
-                using Stream ros = resp.OutputStream;
-                try
-                {
-                    ros.Write(buffer, 0, buffer.Length);
-                } catch { }
-            }
-        }
-    }
-}
-**/
\ No newline at end of file
diff --git a/legacy/Bot/Program.cs b/legacy/Bot/Program.cs
deleted file mode 100644
index df62d5b..0000000
--- a/legacy/Bot/Program.cs
+++ /dev/null
@@ -1,60 +0,0 @@
-using SoUnBot.AccessControl;
-using SoUnBot.ModuleLoader;
-using SoUnBot.Modules.OttoLinux;
-using SoUnBot.Telegram;
-
-string dataPath = Environment.GetEnvironmentVariable("DATA_PATH") ?? "BotData";
-string aclPath = Environment.GetEnvironmentVariable("ACL_PATH") ?? "BotData/ACL";
-string tgToken = Environment.GetEnvironmentVariable("TELEGRAM_TOKEN") ?? "this-string-is-not-a-token";
-string tgAdminId = Environment.GetEnvironmentVariable("TELEGRAM_ADMIN_ID") ?? "000000";
-string imagesPath = dataPath + "/Images";
-
-Console.WriteLine("Welcome to SO un bot!");
-
-long tgAdminLong;
-if (!long.TryParse(tgAdminId, out tgAdminLong))
-{
-    Console.WriteLine("Telegram Admin ID is invalid or unset");
-    return;
-}
-
-var acl = new AccessManager(aclPath, tgAdminLong);
-var moduleLoader = new ModuleLoader();
-
-try
-{
-    foreach (string f in Directory.GetFiles(dataPath + "/Questions"))
-    {
-        if (f.EndsWith("txt"))
-        {
-            Console.WriteLine("Loading module " + Path.GetFileNameWithoutExtension(f));
-            moduleLoader.LoadModule(new BotGame(acl, Path.GetFileNameWithoutExtension(f), f, false, imagesPath));
-        }
-        else if (f.EndsWith("json"))
-        {
-            Console.WriteLine("Loading module " + Path.GetFileNameWithoutExtension(f));
-            moduleLoader.LoadModule(new BotGame(acl, Path.GetFileNameWithoutExtension(f), f, false, imagesPath, 3));
-        }
-        else
-        {
-            Console.WriteLine("Skipping " + Path.GetFileName(f) + " as the file extension is not supported");
-        }
-    }
-    foreach (string d in Directory.GetDirectories(dataPath + "/Questions"))
-    {
-        Console.WriteLine("Loading module " + Path.GetFileName(d));
-        moduleLoader.LoadModule(new BotGame(acl, Path.GetFileName(d), d, false, imagesPath, 2));
-    }
-}
-catch (System.Exception ex)
-{
-    Console.WriteLine("There was an issue loading the module: " + ex.Message);
-    return;
-}
-
-Console.WriteLine("Starting Telegram bot listener...");
-new TelegramBot(tgToken, acl, dataPath + "/motd.txt", moduleLoader.Modules);
-
-// worst way ever to keep the main thread running, I know
-while (true)
-    Thread.Sleep(10000);
\ No newline at end of file
diff --git a/legacy/Bot/SoUnBot.csproj b/legacy/Bot/SoUnBot.csproj
deleted file mode 100644
index bfb530b..0000000
--- a/legacy/Bot/SoUnBot.csproj
+++ /dev/null
@@ -1,16 +0,0 @@
-<Project Sdk="Microsoft.NET.Sdk">
-
-  <PropertyGroup>
-    <OutputType>Exe</OutputType>
-    <TargetFramework>net8.0</TargetFramework>
-    <ImplicitUsings>enable</ImplicitUsings>
-    <Nullable>enable</Nullable>
-  </PropertyGroup>
-
-  <ItemGroup>
-    <PackageReference Include="Newtonsoft.Json" Version="13.0.1" />
-    <PackageReference Include="Telegram.Bot" Version="17.0.0" />
-    <PackageReference Include="Telegram.Bot.Extensions.Polling" Version="1.0.0" />
-  </ItemGroup>
-
-</Project>
diff --git a/legacy/Bot/Telegram/TelegramBot.cs b/legacy/Bot/Telegram/TelegramBot.cs
deleted file mode 100644
index 7aa3099..0000000
--- a/legacy/Bot/Telegram/TelegramBot.cs
+++ /dev/null
@@ -1,199 +0,0 @@
-using SoUnBot.AccessControl;
-using SoUnBot.ModuleLoader;
-using Telegram.Bot;
-using Telegram.Bot.Exceptions;
-using Telegram.Bot.Extensions.Polling;
-using Telegram.Bot.Types;
-using Telegram.Bot.Types.Enums;
-using Telegram.Bot.Types.ReplyMarkups;
-
-namespace SoUnBot.Telegram
-{
-    internal class TelegramBot
-    {
-        private AccessManager _accessManager;
-        private string _moth_path;
-
-        private Dictionary<string, IModule> _modules;
-        public TelegramBotClient BotClient { get; private set; }
-        private Dictionary<long, IModule> _usersContext;
-
-        public TelegramBot(string token, AccessManager accessManager, string motd_path, Dictionary<string, IModule> modules)
-        {
-            _accessManager = accessManager;
-            _moth_path = motd_path;
-            _modules = modules;
-            _usersContext = new Dictionary<long, IModule>();
-            BotClient = new TelegramBotClient(token);
-
-            using var cts = new CancellationTokenSource();
-
-            // StartReceiving does not block the caller thread. Receiving is done on the ThreadPool.
-            var receiverOptions = new ReceiverOptions
-            {
-                AllowedUpdates = { } // receive all update types
-            };
-            BotClient.StartReceiving(
-                HandleUpdateAsync,
-                HandleErrorAsync,
-                receiverOptions,
-                cancellationToken: cts.Token);
-
-            GetMe();
-        }
-
-        private async void GetMe()
-        {
-            var me = await BotClient.GetMeAsync();
-            Console.WriteLine($"Start listening for @{me.Username}");
-        }
-
-        async Task HandleUpdateAsync(ITelegramBotClient botClient, Update update, CancellationToken cancellationToken)
-        {
-            try
-            {
-                            long chatId;
-
-            if (update.Type == UpdateType.CallbackQuery)
-            {
-                chatId = update.CallbackQuery.From.Id;
-                if (update.CallbackQuery.Message.Text.StartsWith("ACM: ") && update.CallbackQuery.Data.Contains("Grant"))
-                {
-                    long uid = int.Parse(update.CallbackQuery.Message.Text.Substring(5).Split('\n')[0]);
-                    string perm = update.CallbackQuery.Message.Text.Split("Ha richiesto l'accesso a: ")[1];
-                    _accessManager.GrantPermission(uid, perm);
-
-                    await botClient.AnswerCallbackQueryAsync(
-                        update.CallbackQuery.Id,
-                        "Successo!"
-                        );
-                    await botClient.SendTextMessageAsync(
-                        uid,
-                        "✅ Congratulazioni! Hai ottenuto l'accesso a: " + perm
-                        );
-                    return;
-                }
-                if (update.CallbackQuery.Message.Text.StartsWith("ACM") && update.CallbackQuery.Data.Contains("🔆 Richiedi accesso"))
-                {
-                    string perm = update.CallbackQuery.Message.Text.Split('`')[1];
-                    _accessManager.AskPermission(update.CallbackQuery.From, perm, botClient);
-                    await botClient.AnswerCallbackQueryAsync(
-                        update.CallbackQuery.Id,
-                        "Richiesta effettuata"
-                        );
-                    await botClient.EditMessageTextAsync(
-                        update.CallbackQuery.From.Id,
-                        update.CallbackQuery.Message.MessageId,
-                        update.CallbackQuery.Message.Text,
-                        replyMarkup: new InlineKeyboardMarkup(InlineKeyboardButton.WithCallbackData("Richiesto 〽️"))
-                        );
-                    return;
-                }
-                if (update.CallbackQuery.Message.Text.StartsWith("ACM")) {
-                    return;
-                }
-            }
-
-            if (update.Type != UpdateType.Message) // this is temp
-                return;
-            if (update.Message!.Type != MessageType.Text)
-                return;
-
-            chatId = update.Message.Chat.Id;
-
-            if (update.Type == UpdateType.Message && update.Message!.Type == MessageType.Text && update.Message.Text.StartsWith("/spam"))
-            {
-                if (!_accessManager.CheckPermission(update.Message.From, "global.spam", botClient)) return;
-
-                await botClient.SendTextMessageAsync(
-                        chatId: chatId,
-                        text: "Invio annuncio in corso...");
-                new Thread(() => 
-                {
-                    Thread.CurrentThread.IsBackground = true; 
-                    SendToEveryone(botClient, chatId, update.Message.Text.Substring(6));
-                }).Start();
-                return;
-            }
-
-            if (update.Type == UpdateType.Message && update.Message!.Type == MessageType.Text && update.Message.Text == "/leave")
-            {
-                _usersContext.Remove(chatId);
-            }
-
-            if (_usersContext.ContainsKey(chatId))
-            {
-                _usersContext[chatId].ProcessUpdate(botClient, update, cancellationToken);
-                return;
-            }
-
-            if (update.Type == UpdateType.Message && update.Message!.Type == MessageType.Text)
-            {
-                var msg = update.Message.Text.StartsWith("/") ? update.Message.Text.Substring(1) : update.Message.Text;
-                if (_modules.ContainsKey(msg))
-                {
-                    _usersContext.Add(chatId, _modules[msg]);
-                    _modules[msg].ProcessUpdate(botClient, update, cancellationToken);
-                    return;
-                }
-            }
-
-            string validModules = _modules.Keys.Select(i => "/" + i).Aggregate((a, b) => a + "\n" + b);
-
-            var motd = System.IO.File.ReadAllText(_moth_path);
-
-            // Echo received message text
-            Message sentMessage = await botClient.SendTextMessageAsync(
-                chatId: chatId,
-                text: motd);
-            }
-            catch(Exception e)
-            {
-                Console.WriteLine("Error handling the update: " + e.Message);
-            }
-        }
-
-        async Task HandleErrorAsync(ITelegramBotClient botClient, Exception exception, CancellationToken cancellationToken)
-        {
-            if (exception is ApiRequestException apiRequestException)
-            {
-                await botClient.SendTextMessageAsync(_accessManager.AdminId, apiRequestException.ToString());
-            }
-
-            // Restart the bot (otherwise it would become an amoeba)
-            using var cts = new CancellationTokenSource();
-            var receiverOptions = new ReceiverOptions
-            {
-                AllowedUpdates = { }
-            };
-            BotClient.StartReceiving(
-                HandleUpdateAsync,
-                HandleErrorAsync,
-                receiverOptions,
-                cancellationToken: cts.Token);
-        }
-
-        private async void SendToEveryone(ITelegramBotClient botClient, long chatId, string text)
-        {
-            foreach (long user in _accessManager.Users())
-            {
-                try
-                {
-                    Console.WriteLine("Sto spammando a" + user.ToString());
-                    await botClient.SendTextMessageAsync(
-                        chatId: user,
-                        text: text
-                    );
-                    await Task.Delay(100);
-                }
-                catch
-                {
-                    Console.WriteLine("Ho fallito");
-                }
-            }
-            await botClient.SendTextMessageAsync(
-                chatId: chatId,
-                text: "✅ Annunciato a tutti!");
-        }
-    }
-}
diff --git a/legacy/Bot/bin/Debug/net8.0/JetBrains.Annotations.dll b/legacy/Bot/bin/Debug/net8.0/JetBrains.Annotations.dll
deleted file mode 100755
index 6361fca..0000000
Binary files a/legacy/Bot/bin/Debug/net8.0/JetBrains.Annotations.dll and /dev/null differ
diff --git a/legacy/Bot/bin/Debug/net8.0/Newtonsoft.Json.dll b/legacy/Bot/bin/Debug/net8.0/Newtonsoft.Json.dll
deleted file mode 100755
index 1ffeabe..0000000
Binary files a/legacy/Bot/bin/Debug/net8.0/Newtonsoft.Json.dll and /dev/null differ
diff --git a/legacy/Bot/bin/Debug/net8.0/SoUnBot b/legacy/Bot/bin/Debug/net8.0/SoUnBot
deleted file mode 100755
index 7a3aa7b..0000000
Binary files a/legacy/Bot/bin/Debug/net8.0/SoUnBot and /dev/null differ
diff --git a/legacy/Bot/bin/Debug/net8.0/SoUnBot.deps.json b/legacy/Bot/bin/Debug/net8.0/SoUnBot.deps.json
deleted file mode 100644
index 7582c96..0000000
--- a/legacy/Bot/bin/Debug/net8.0/SoUnBot.deps.json
+++ /dev/null
@@ -1,104 +0,0 @@
-{
-  "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
deleted file mode 100644
index 0b65b96..0000000
Binary files a/legacy/Bot/bin/Debug/net8.0/SoUnBot.dll and /dev/null differ
diff --git a/legacy/Bot/bin/Debug/net8.0/SoUnBot.pdb b/legacy/Bot/bin/Debug/net8.0/SoUnBot.pdb
deleted file mode 100644
index 8281c26..0000000
Binary files a/legacy/Bot/bin/Debug/net8.0/SoUnBot.pdb and /dev/null differ
diff --git a/legacy/Bot/bin/Debug/net8.0/SoUnBot.runtimeconfig.json b/legacy/Bot/bin/Debug/net8.0/SoUnBot.runtimeconfig.json
deleted file mode 100644
index becfaea..0000000
--- a/legacy/Bot/bin/Debug/net8.0/SoUnBot.runtimeconfig.json
+++ /dev/null
@@ -1,12 +0,0 @@
-{
-  "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
deleted file mode 100755
index 67e11a1..0000000
Binary files a/legacy/Bot/bin/Debug/net8.0/Telegram.Bot.Extensions.Polling.dll and /dev/null differ
diff --git a/legacy/Bot/bin/Debug/net8.0/Telegram.Bot.dll b/legacy/Bot/bin/Debug/net8.0/Telegram.Bot.dll
deleted file mode 100755
index 3e19fe1..0000000
Binary files a/legacy/Bot/bin/Debug/net8.0/Telegram.Bot.dll and /dev/null 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
deleted file mode 100644
index 2217181..0000000
--- a/legacy/Bot/obj/Debug/net8.0/.NETCoreApp,Version=v8.0.AssemblyAttributes.cs
+++ /dev/null
@@ -1,4 +0,0 @@
-// <autogenerated />
-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
deleted file mode 100644
index 7ef4872..0000000
--- a/legacy/Bot/obj/Debug/net8.0/SoUnBot.AssemblyInfo.cs
+++ /dev/null
@@ -1,22 +0,0 @@
-//------------------------------------------------------------------------------
-// <auto-generated>
-//     This code was generated by a tool.
-//
-//     Changes to this file may cause incorrect behavior and will be lost if
-//     the code is regenerated.
-// </auto-generated>
-//------------------------------------------------------------------------------
-
-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
deleted file mode 100644
index 2cfa414..0000000
--- a/legacy/Bot/obj/Debug/net8.0/SoUnBot.AssemblyInfoInputs.cache
+++ /dev/null
@@ -1 +0,0 @@
-3680e5812d66c6777eb08b0e2862f4230324a1c5273b0801b0700e9dd5595131
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.GeneratedMSBuildEditorConfig.editorconfig b/legacy/Bot/obj/Debug/net8.0/SoUnBot.GeneratedMSBuildEditorConfig.editorconfig
deleted file mode 100644
index fe34a67..0000000
--- a/legacy/Bot/obj/Debug/net8.0/SoUnBot.GeneratedMSBuildEditorConfig.editorconfig
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 8578f3d..0000000
--- a/legacy/Bot/obj/Debug/net8.0/SoUnBot.GlobalUsings.g.cs
+++ /dev/null
@@ -1,8 +0,0 @@
-// <auto-generated/>
-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
deleted file mode 100644
index b28c592..0000000
Binary files a/legacy/Bot/obj/Debug/net8.0/SoUnBot.assets.cache and /dev/null 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
deleted file mode 100644
index 72ef4e6..0000000
Binary files a/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.AssemblyReference.cache and /dev/null differ
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.CopyComplete b/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.CopyComplete
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.CoreCompileInputs.cache b/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.CoreCompileInputs.cache
deleted file mode 100644
index d8d035c..0000000
--- a/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.CoreCompileInputs.cache
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1c743c7..0000000
--- a/legacy/Bot/obj/Debug/net8.0/SoUnBot.csproj.FileListAbsolute.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-/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
deleted file mode 100644
index 0b65b96..0000000
Binary files a/legacy/Bot/obj/Debug/net8.0/SoUnBot.dll and /dev/null differ
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.genruntimeconfig.cache b/legacy/Bot/obj/Debug/net8.0/SoUnBot.genruntimeconfig.cache
deleted file mode 100644
index c5c3993..0000000
--- a/legacy/Bot/obj/Debug/net8.0/SoUnBot.genruntimeconfig.cache
+++ /dev/null
@@ -1 +0,0 @@
-7855311d295825590d1f2d744602bb1f5d081ad75841f435f06048bdf5846452
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.pdb b/legacy/Bot/obj/Debug/net8.0/SoUnBot.pdb
deleted file mode 100644
index 8281c26..0000000
Binary files a/legacy/Bot/obj/Debug/net8.0/SoUnBot.pdb and /dev/null differ
diff --git a/legacy/Bot/obj/Debug/net8.0/SoUnBot.sourcelink.json b/legacy/Bot/obj/Debug/net8.0/SoUnBot.sourcelink.json
deleted file mode 100644
index 75ffa21..0000000
--- a/legacy/Bot/obj/Debug/net8.0/SoUnBot.sourcelink.json
+++ /dev/null
@@ -1 +0,0 @@
-{"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
deleted file mode 100755
index 7a3aa7b..0000000
Binary files a/legacy/Bot/obj/Debug/net8.0/apphost and /dev/null differ
diff --git a/legacy/Bot/obj/Debug/net8.0/ref/SoUnBot.dll b/legacy/Bot/obj/Debug/net8.0/ref/SoUnBot.dll
deleted file mode 100644
index e575ec3..0000000
Binary files a/legacy/Bot/obj/Debug/net8.0/ref/SoUnBot.dll and /dev/null differ
diff --git a/legacy/Bot/obj/Debug/net8.0/refint/SoUnBot.dll b/legacy/Bot/obj/Debug/net8.0/refint/SoUnBot.dll
deleted file mode 100644
index e575ec3..0000000
Binary files a/legacy/Bot/obj/Debug/net8.0/refint/SoUnBot.dll and /dev/null differ
diff --git a/legacy/Bot/obj/SoUnBot.csproj.nuget.dgspec.json b/legacy/Bot/obj/SoUnBot.csproj.nuget.dgspec.json
deleted file mode 100644
index 244f051..0000000
--- a/legacy/Bot/obj/SoUnBot.csproj.nuget.dgspec.json
+++ /dev/null
@@ -1,81 +0,0 @@
-{
-  "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
deleted file mode 100644
index 311e8bb..0000000
--- a/legacy/Bot/obj/SoUnBot.csproj.nuget.g.props
+++ /dev/null
@@ -1,15 +0,0 @@
-<?xml version="1.0" encoding="utf-8" standalone="no"?>
-<Project ToolsVersion="14.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
-  <PropertyGroup Condition=" '$(ExcludeRestorePackageImports)' != 'true' ">
-    <RestoreSuccess Condition=" '$(RestoreSuccess)' == '' ">True</RestoreSuccess>
-    <RestoreTool Condition=" '$(RestoreTool)' == '' ">NuGet</RestoreTool>
-    <ProjectAssetsFile Condition=" '$(ProjectAssetsFile)' == '' ">$(MSBuildThisFileDirectory)project.assets.json</ProjectAssetsFile>
-    <NuGetPackageRoot Condition=" '$(NuGetPackageRoot)' == '' ">/home/marco/.nuget/packages/</NuGetPackageRoot>
-    <NuGetPackageFolders Condition=" '$(NuGetPackageFolders)' == '' ">/home/marco/.nuget/packages/</NuGetPackageFolders>
-    <NuGetProjectStyle Condition=" '$(NuGetProjectStyle)' == '' ">PackageReference</NuGetProjectStyle>
-    <NuGetToolVersion Condition=" '$(NuGetToolVersion)' == '' ">6.9.1</NuGetToolVersion>
-  </PropertyGroup>
-  <ItemGroup Condition=" '$(ExcludeRestorePackageImports)' != 'true' ">
-    <SourceRoot Include="/home/marco/.nuget/packages/" />
-  </ItemGroup>
-</Project>
\ 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
deleted file mode 100644
index 3dc06ef..0000000
--- a/legacy/Bot/obj/SoUnBot.csproj.nuget.g.targets
+++ /dev/null
@@ -1,2 +0,0 @@
-<?xml version="1.0" encoding="utf-8" standalone="no"?>
-<Project ToolsVersion="14.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003" />
\ No newline at end of file
diff --git a/legacy/Bot/obj/project.assets.json b/legacy/Bot/obj/project.assets.json
deleted file mode 100644
index c6e325b..0000000
--- a/legacy/Bot/obj/project.assets.json
+++ /dev/null
@@ -1,280 +0,0 @@
-{
-  "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
deleted file mode 100644
index 5f88de5..0000000
--- a/legacy/Bot/obj/project.nuget.cache
+++ /dev/null
@@ -1,15 +0,0 @@
-{
-  "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
deleted file mode 100644
index fe4ca64..0000000
--- a/legacy/Bot/obj/project.packagespec.json
+++ /dev/null
@@ -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","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
deleted file mode 100644
index d8bcafa..0000000
--- a/legacy/Bot/obj/rider.project.model.nuget.info
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d8bcafa..0000000
--- a/legacy/Bot/obj/rider.project.restore.info
+++ /dev/null
@@ -1 +0,0 @@
-17116412128528733
\ No newline at end of file
diff --git a/legacy/Bot/run.sh b/legacy/Bot/run.sh
deleted file mode 100644
index 41847e2..0000000
--- a/legacy/Bot/run.sh
+++ /dev/null
@@ -1,5 +0,0 @@
-git pull origin main
-docker stop SOBOT
-docker rm SOBOT
-docker build -t sobot3 .
-docker run -d --name='SOBOT' --net='bridge' -e TZ="Europe/Berlin" -e HOST_OS="Unraid" -e HOST_HOSTNAME="Tower" -e HOST_CONTAINERNAME="SOBOT" -l net.unraid.docker.managed=dockerman -p 8001:8001 -v '/mnt/user/SSD/sobot_data':'/App/ACL':'rw' 'sobot3:latest'
diff --git a/legacy/Data/Images/25.png b/legacy/Data/Images/25.png
deleted file mode 100644
index 891c1f2..0000000
Binary files a/legacy/Data/Images/25.png and /dev/null differ
diff --git a/legacy/Data/Images/26.png b/legacy/Data/Images/26.png
deleted file mode 100644
index 2d7a7a1..0000000
Binary files a/legacy/Data/Images/26.png and /dev/null differ
diff --git a/legacy/Data/Images/27.png b/legacy/Data/Images/27.png
deleted file mode 100644
index 257136b..0000000
Binary files a/legacy/Data/Images/27.png and /dev/null differ
diff --git a/legacy/Data/Images/35.png b/legacy/Data/Images/35.png
deleted file mode 100644
index ed4809e..0000000
Binary files a/legacy/Data/Images/35.png and /dev/null differ
diff --git a/legacy/Data/Images/36.png b/legacy/Data/Images/36.png
deleted file mode 100644
index 24c2f6f..0000000
Binary files a/legacy/Data/Images/36.png and /dev/null differ
diff --git a/legacy/Data/Images/37.png b/legacy/Data/Images/37.png
deleted file mode 100644
index 8f35dcb..0000000
Binary files a/legacy/Data/Images/37.png and /dev/null differ
diff --git a/legacy/Data/Images/38.png b/legacy/Data/Images/38.png
deleted file mode 100644
index 1f779c5..0000000
Binary files a/legacy/Data/Images/38.png and /dev/null differ
diff --git a/legacy/Data/Images/39.png b/legacy/Data/Images/39.png
deleted file mode 100644
index e8f9709..0000000
Binary files a/legacy/Data/Images/39.png and /dev/null differ
diff --git a/legacy/Data/Images/40.png b/legacy/Data/Images/40.png
deleted file mode 100644
index 7b1d39a..0000000
Binary files a/legacy/Data/Images/40.png and /dev/null differ
diff --git a/legacy/Data/Images/56.png b/legacy/Data/Images/56.png
deleted file mode 100644
index bc1a3ec..0000000
Binary files a/legacy/Data/Images/56.png and /dev/null differ
diff --git a/legacy/Data/Images/57.png b/legacy/Data/Images/57.png
deleted file mode 100644
index 12582cd..0000000
Binary files a/legacy/Data/Images/57.png and /dev/null differ
diff --git a/legacy/Data/Images/58.png b/legacy/Data/Images/58.png
deleted file mode 100644
index 4cff19d..0000000
Binary files a/legacy/Data/Images/58.png and /dev/null differ
diff --git a/legacy/Data/Images/59.png b/legacy/Data/Images/59.png
deleted file mode 100644
index 4c61bc1..0000000
Binary files a/legacy/Data/Images/59.png and /dev/null differ
diff --git a/legacy/Data/Images/60.png b/legacy/Data/Images/60.png
deleted file mode 100644
index 8863227..0000000
Binary files a/legacy/Data/Images/60.png and /dev/null differ
diff --git a/legacy/Data/Images/61.png b/legacy/Data/Images/61.png
deleted file mode 100644
index 01f5d31..0000000
Binary files a/legacy/Data/Images/61.png and /dev/null differ
diff --git a/legacy/Data/Images/62.png b/legacy/Data/Images/62.png
deleted file mode 100644
index 2732e2e..0000000
Binary files a/legacy/Data/Images/62.png and /dev/null differ
diff --git a/legacy/Data/Images/FDS/1positive0negative.png b/legacy/Data/Images/FDS/1positive0negative.png
deleted file mode 100644
index a15d9ab..0000000
Binary files a/legacy/Data/Images/FDS/1positive0negative.png and /dev/null differ
diff --git a/legacy/Data/Images/FDS/accuracy80.png b/legacy/Data/Images/FDS/accuracy80.png
deleted file mode 100644
index 1198c63..0000000
Binary files a/legacy/Data/Images/FDS/accuracy80.png and /dev/null differ
diff --git a/legacy/Data/Images/FDS/matrixwhatcanwesay.png b/legacy/Data/Images/FDS/matrixwhatcanwesay.png
deleted file mode 100644
index ff485da..0000000
Binary files a/legacy/Data/Images/FDS/matrixwhatcanwesay.png and /dev/null differ
diff --git a/legacy/Data/Questions/Domande Sicurezza.old b/legacy/Data/Questions/Domande Sicurezza.old
deleted file mode 100644
index f9938ca..0000000
--- a/legacy/Data/Questions/Domande Sicurezza.old	
+++ /dev/null
@@ -1,229 +0,0 @@
-1) L'autenticazione dei messaggi consente di
-(scegli una o più alternative)
-> Garantire la segretezza del messaggio
-> Garantire il non-ripudio del mittente (non-repudiation of origin)
-> Verificare l'integrità del messaggio
-> le prime due sono corrette
-v le ultime due sono corrette
-> la prima e l'ultima sono corrette
-
-2) Possiamo affermare che un sistema è sicuro se, partendo da uno stato autorizzato non entra mai in uno stato non-autorizzato
-v V
-> F
-
-3) Una delle primarie assunzioni dell'anomaly detection è la seguente:
-Le attività normali e quelle anomale non hanno evidenze distinte
-> V
-v F
-
-4) L'SSL Handshake Protocol permette al client ed al server di negoziare l'algoritmo di cifratura e l'algoritmo MAC.
-v V
-> F
-
-5) Quale delle seguenti è una caratteristica di un certificato utente (user certificate) generato da una CA?
-> Le chiavi pubbliche utente che sono state certificate dalla CA sono disponibili in una directory accessibile a chiunque
-v Ogni utente con accesso alla chiave pubblica della CA può recuperare la chiave pubblica utente che è stata certificata OK
-> Ogni utente con accesso alla chiave pubblica della CA può modificare il certificato senza essere scoperto
-
-6) Si consideri il Role-Based Access Control:
-I ruoli (role) possono essere utilizzati per gestire un'assegnazione di permessi che soddisfi il principio del Least Privilege.
-v V
-> F
-
-7) Un sistema di Misuse detection è in grado di identificare anche attacchi sconosciuti a chi sviluppa i set di regole.
-> V
-v F
-
-8) Il principio del Fail-Safe Defaults asserisce che se un soggetto non ha accesso esplicito a un oggetto, dovrebbe essere garantito l'accesso a quell'oggetto. Scegli una risposta:
-> V
-v F
-
-9) La cifratura a chiave pubblica trova campo di applicazione nella firma digitale ma non è opportuno utilizzarla per lo scambio di chiavi.
-> V
-v F
-
-10) La crittografia offre protezione solo da attacchi di passivi
-> V
-v F
-
-11) Quale è la definizione corretta di Mandatory Access Control?
-v Un meccanismo di sistema, basato su regole, che controlla l'accesso ad oggetti e in cui gli utenti individuali non possono alterare la politica di accesso.
-> Un meccanismo di sistema, basato su regole, che controlla l'accesso ad oggetti e in cui gli utenti individuali possono alterare la politica di accesso ai loro oggetti.
-> Un meccanismo, basato sull'identità, che permette agli utenti individuali di controllare chi può accedere o no agli oggetti del sistema.
-
-12) Il principio di Separazione dei Privilegi (Separation of Privilege) prevede che vengano verificate più condizioni per concedere i privilegi e che due o più componenti lavorino insieme per imporre il livello di sicurezza desiderato.
-v V
-> F
-
-13) Quali dei seguenti criteri vengono utilizzati nel Attribute-based Access Control per autorizzare o negare un operazione su di un oggetto?
-(scegli una o più alternative)
-> Attributi assegnati del soggetto
-> Condizioni dell'ambiente
-> Tipo di operazione da effettuare 
-v le prime due sono corrette
-> le ultime due sono corrette
-> la prima e l'ultima sono corrette
-
-15) Considerando un sistema Firewall, quali delle seguenti affermazioni è corretta?
-> Il Firewall non penalizza le prestazioni
-v Il Firewall è un single-point-of-failure
-> Il firewall non è un single-point-of-failure
-
-16) Considerando un sistema Firewall, quali delle seguenti affermazioni è corretta?
-> Il firewall, tracciando il traffico in uscita ed in entrate, protegge anche dagli Insider-attacks.
-> Il firewall non è un single-point-of-failure.
-v Il firewall è il punto centrale per le decisioni relative alla sicurezza di una rete.
-
-17) Supponiamo di dover definire una politica che vieti ad un programma di accedere al file delle password /etc/passwd.
-Supponiamo anche di usare un linguaggio ad alto livello, e che i metodi del programma per accedere ai file sono i seguenti:
-<pre>
-class File {
-public file(String name); //Crea un file
-public String getfilename(); // Restituisce il nome di un file
-public char read(); //Accede ad un file in lettura
-}
-</pre>
-Quali delle seguenti politiche è corretta?
-> allow( |-> file.read) when (file.getfilename() == "/etc/passwd")
-> deny( |-> file.read) when (file.file(/etc/passwd) == true)
-v deny( |-> file.read) when (file.getfilename() == "/etc/passwd")
-
-18) Si supponga di utilizzare un controllo di accessi basato sui ruoli (RBAC) per gestire i permessi in un'azienda.
-Si supponga che il dipendente U1 abbia funzione F1 e F1 è associata al ruolo R1.
-Se U1 viene rimpiazzato dal dipendente U2 nella funzione F1 quale delle seguenti affermazioni è corretta?
-> Il fatto che U2 rimpiazzi U1 nella sua funzione F1 non ha alcuna relazione con l'assegnazione di U2 ad un ruolo.
-> U2 può avere tutti i permessi di U1 solo se viene creato un nuovo ruolo R2=R1 e U2 viene assegnato a R2.
-v U2 acquisisce automaticamente tutti i permessi di U1.
-
-19) Quale tra i seguenti NON è uno dei principi di progettazione sicura dei sistemi?
-v Separation of Responsibilities
-> Open Design
-> Economy of Mechanisms
-
-20) In un sistema di Verifica e Identificazione Biometrica, la fase di Verifica potrebbe dare un esito inconcludente.
-v V
-> F
-
-21) Una matrice di controllo degli accessi (Access Control Matrix) è definita da:
-soggetti (subjects) S = { s ,…,s }
-oggetti (objects) O = { o ,…,o }
-Diritti (rights) R = { r ,…,r }
-Quale è il significato di un elemento A[s, o ] = { r , ..., r } della matrice R?
-v Il soggetto s ha diritti r ,...,r sull'oggetto o
-> Il soggetto s può utilizzare le risorse r ,...,r dell'oggetto o
-> Il soggetto s non ha i diritti r ,...,r sull'oggetto o
-
-23) Il protocollo di Needham-Schroeder per la distribuzione delle chiavi non è vulnerabile ad attacchi di tipo Replay
-> V
-v F
-
-24) Quante chiavi usa un algoritmo a cifratura simmetrica?
-> Usa due chiavi, una per cifrare ed una per decifrare il messaggio
-v Usa una singola chiave sia per cifrare che per decifrare il messaggio
-> Il numero di chiavi utilizzate dipende dall'algoritmo scelto
-
-25) Una delle primarie assunzioni dell'anomaly detection è la seguente: Le attività normali e quelle anomale non hanno evidenze distinte
-> V
-v F
-
-26) Mettendo a confronto RSA e DES, quali delle seguenti affermazioni è corretta?
-> La dimensione delle chiavi in RSA è fissa e definita dallo standard KO
-v RSA può essere utilizzato per lo scambio di chiavi nella cifratura a blocchi simmetrica (DES)
-> RSA garantisce una velocità di cifratura (bit/sec) maggiore rispetto al DES
-
-
-27) SSL è un protocollo a tre livelli. Al livello più basso (sopra al TCP) abbiamo il SSL Record Protocol, al secondo livello abbiamo il protocollo SSL Change Cipher Spec, ed al livello più alto abbiamo l'SSL Handshake protocol
-> V
-v F
-
-28) Considerando il protocollo SSL, quali delle seguenti affermazioni è corretta?
-> SSL non usa certificati X.509 per l'autentiicazione
-> SSL richiede l'uso di IPSec
-v SSL usa RSA per la cifratura a chiave pubblica
-
-29) Quali problemi ha un Anomaly Detection System basato su di un modello di Markov?
-> Il profilo degli utenti può evolvere nel tempo e quindi bisogna pesare i dati in modo appropriato
-v Il sistema ha bisogno di apprendere quali sono le sequenze valide
-> Il sistema ha bisogno di apprendere quali sono le sequenze anomale
-
-30) Quale delle seguenti è una tecnica di crittoanalisi?
-v Chosen Ciphertext
-> Know Ciphertext
-> Known Chipherkey
-
-31) Assumiamo che:
-A = insieme degli stati del sistema
-B = insieme degli stati sicuri del sistema
-Se il meccanismo di sicurezza applicato al sistema è tale che A è contenuto, ma non uguale a B, che tipo di meccanismo di sicurezza abbiamo?
-> Ampio
-> Preciso
-v Sicuro
-
-32) Quali tra i seguenti NON è un parametro SSL negoziato mediante il protocollo di handshake?
-> master secret
-v Kerberos TGS ticket
-> X.509 public-key certificate of peer
-
-33) Nella modalità Trasporto, IPSec usa
-AH per autenticare il payload IP
-ESP per cifrare il payload IP: se si usa IPv4 non viene cifrato l'header; se si usa IPv6 viene cifrato l'extension header.
-v V
-> F
-
-34) Nella modalità Trasporto, IPSec usa:
-AH per autenticare il payload IP
-ESP per cifrare l'inner IP packet (che include anche l'header)
-> Vero
-v Falso
-
-35) Assumiamo che:
-A = insieme degli stati del sistema
-B = insieme degli stati sicuri del sistema
-Se il meccanismo di sicurezza applicato al sistema è tale che A è uguale a B, che tipo di meccanismo di sicurezza abbiamo?
-> Ampio
-v Preciso
-> Sicuro
-
-36) Quali delle seguenti liste contiene solo parametri SSL negoziati mediante il protocollo di handshake?
-v session ID; compression algorithm; master secret OK
-> master secret; X.509 public-key certificate of peer; client_write_key
-> Change Cipher Spec; Alert; X.509 public-key certificate of peer
-
-img=https://i.imgur.com/iwCvLLu.png%
-37) Si consideri la seguente regola di firewall: quale delle seguenti affermazioni è corretta?
-v Solo il traffico generato da un host interno al firewall è ammesso verso la porta 25 di un host qualsiasi; Solo il traffico che appartiene ad una connessione già instaurata sulla porta 25 è ammesso indipendentemente dalla provenienza/destinazione.
-> Il traffico generato da un host interno al firewall verso la porta 25 è bloccato a meno che non appartenga ad una connessione già esistente.
-> Solo il traffico sulla porta 25 è ammesso indipendentemente dalla sorgente/destinazione, e dal tipo di messaggio.
-
-38) Un sistema Firewall è definito dagli RFC 2828 e 2979.
-Quali delle seguenti proprietà dovrebbe avere un Firewall?
-> Se nella rete delimitata dal Firewall ci sono sistemi non critici, il loro traffico può aggirare il Firewall.
-v Il Firewall deve essere immune alla penetrazione, facendo uso di un sistema trusted equipaggiato come un sistema operativo sicuro.
-> Le politiche di sicurezza del Firewall hanno il compito di re-indirizzare (re-routing) il traffico non sensibile proveniente dalla rete protetta in modo che il Firewall stesso non sia sovraccaricato inutilmente.
-
-39) Quale delle seguenti non è una tecnica di crittoanalisi?
-> Chosen Ciphertext
-> Known Plaintext
-v Know Ciphertext
-
-40) Un sistema crittografico (Criptosystem) è definito dalla quintupla (E, D, M, K, C) dove
-M insieme dei plaintexts
-K insieme delle chiavi
-C insieme ciphertexts
-E funzione di cifratura (encryption functions)
-D funzione di decifratura (decryption functions)
-Quale è la definizione corretta di E?
-> <code>E = { Ec : M --> K | c in C}</code>
-> <code>E = { Ek : C --> M | k in K}</code>
-v <code>E = { Ek : M --> C | k in K}</code>
-
-La cifratura a chiave pubblica può essere utilizzata per garantire la confidenzialità (confidentiality) o integrità/autenticazione (integrity/authentication) del messaggio, ma non entrambe.
-> V
-v F
-
-41) Tre approcci alternativi all'utenticazione di un messaggio sono:
-cifratura del messaggio
-calcolo di una hash function del messaggio
-calcolo di una keyed hash functions del messaggio
-v V
-> F
diff --git a/legacy/Data/Questions/diritto_unive_inf.txt b/legacy/Data/Questions/diritto_unive_inf.txt
deleted file mode 100644
index 471e4e7..0000000
--- a/legacy/Data/Questions/diritto_unive_inf.txt
+++ /dev/null
@@ -1,331 +0,0 @@
-1) Esiste un codice di diritto dell’informatica?
-v No.
-> Si
-
-2) Cosa si intende con principio di neutralità della rete?
-> Che opera nella rete non deve discriminare politicamente
-v Che chi opera nella rete non deve discriminare tra tecnologie di accesso.
-> Che chi opera nella rete non deve discriminare i consumatori
-
-3) Quando in Italia la riservatezza è divenuto diritto tutelato delle leggi? 
-> A metà degli anni ‘70
-v A metà degli anni ‘90
-> Dal 2023
-
-4) Perché di solito un internet provider non chiede un canone all’utente?
-> Perché vende le informazioni sugli interessi dell'utente
-> Perché riceve dallo Stato un apposito finanziamento per far funzionare l rete
-v Perché ricava gli utili da altri servizi che offre agli utenti
-
-5) Un file è un documento valido?
-> Si
-v Si ma solo se firmato digitalmente.
-> No
-
-6) Cosa è la dematerializzazione dei titoli finanziari?
-> Il fatto che ormai nessuno è più interessato a questi documenti
-> Il fatto che si sta passando dalla moneta cartacea a quella digitale (bitcoins e simili)
-v Il fatto che i titoli di carta sono stati sostituiti da scritturazioni elettroniche.
-
-7) Cos’è l’informatizzazione dei registri immobiliari?  
-> Il fatto che i registri di carta sono ora digitali
-v Il fatto che chiunque può accedere telematicamente ai registri digitali.
-> Il fatto che i notati si trasmettono gli atti ai registri in formato digitale
-
-8) I bitcoins sono una moneta?
-> Si, digitale
-> Si ma privata
-v No, sono un mezzo di scambio.
-
-9) Il commercio elettronico riguarda?
-v Consumatori e/o imprese.
-> solo i consumatori
-> solo le imprese
-
-10) Per effettuare una comunicazione commerciale:
-v occorre il preventivo consenso del destinatario.
-> occorre che siano dirette solo ad imprese, non a consumatori
-> occorre che chiariscano di essere comunicazioni commerciali
-
-11) A cosa servono i marchi di qualità?
-v Per attestare la qualità del prodotto
-> Per acquistare la fiducia dei cliente sulla bontà del prodotto
-> Per rispettare le norme sulla etichettatura dei prodotti
-
-12) Si possono utilizzare tecniche digitali per bloccare l’accesso a proprie opere d’ingegno?
-v Si sempre.
-> Si ma solo se sono opere che hanno carattere creativo
-> Si ogni volta che sono brevettate
-
-13) Esistono norme penali contro l’uso improprio del software?
-> Si ma riguardano solo gli hacker
-v Si ma riguardano solo la violazione del diritto d’autore.
-> Si e riguardano anche i mezzi di pagamento
-
-14) I provider devono controllare il materiale che viene inserito dagli utenti?
-> Si 
-> Si se si tratta di tutela dei minori o di terrorismo
-v No
-
-15) Quali regole disciplinano i social network?
-> Il contratto ed eventuali norme di legge
-v L’apposita disciplina legale e poi il contratto.
-> Non ci sono regole
-
-16) Da quando è la legge scritta a tutelare la privacy?
-> Dagli anni ‘50
-> Dagli anni ‘70
-v Dagli anni ‘90
-
-17) Chi è il "responsabile" nel trattamento dei dati personali?
-> Chi paga i danni se non ci sono le autorizzazioni
-v Chi è titolare delle modalità di trattamento
-> Chi fa apporre la firma per il consenso al soggetto interessato
-
-18) Dove si trovano le regole sulla trasparenza nelle comunicazioni elettroniche?
-v Nel codice delle telecomunicazioni
-> Nel codice penale
-> Nel codice civile
-
-19) Le regole del codice dell'amministrazione digitale sui documenti informatici valgono per i privati?
-v No
-> Si, ma solo se autorizzati
-> Si
-
-20) Si può imporre ad un'amministrazione di rispondere via pec alle istanze dei privati?
-v Si
-> No
-
-21) Quali mezzi di comunicazione hanno la data certa opponibile a tutti?
-> La mail e il fax
-> La pec
-v La pec ed il fax.
-
-22) Cosa è il processo civile telematico?
-v Il processo civile in cui il deposito degli atti avviene in forma telematica.
-> Il processo civile che ha per oggetto una lite informatica
-> Il fatto che nella società moderna vi è un processo di sostituzione della carta con il mezzo informatico
-
-23) Cos'è la moneta elettronica?
-> Il bitcoin
-> Carte di debito e di credito
-v Un valore monetario memorizzato elettronicamente.
-
-24) I bitcoins hanno valore stabile?
-> Tendenzialmente si
-v Tendenzialmente no;
-> Non esistono dati rilevati
-
-25) I pagamenti mediante bitcoins sono tracciati?
-v Si, ma non i loro autori
-> No
-> No ma sono tracciati i loro autori
-
-26) Si possono fornire ai consumatori beni non richiesti?
-v No, occorre un previo ordine di acquisto
-> No, a meno che il venditore li offra gratuitamente
-> No, a meno che il venditore si impegni a ritirarli gratuitamente a richiesta
-
-27) A cosa servono i marchi di qualità?
-v È una dichiarazione di un terzo circa l'affidabilità di un soggetto
-> È un marchio che protegge un software o un sito web
-> È un marchio rilasciato dallo stato ad imprenditori che hanno certe qualifiche
-
-28) Le banche dati sono tutelate?
-v Si sempre.
-> Si ogni volta che hanno carattere creativo
-> Si ogni volta che sono brevettate
-
-29) Esiste un' autorità centrale che governa Internet?
-> Si
-> Si ma non in Italia
-v No
-
-30) Cosa si intende per privacy?
-v Il diritto di mantenere il controllo sulle proprie informazioni
-> Il diritto alla proprietà privata
-> Il diritto alla non ingerenza nella sfera sessuale
-
-31) I privati possono raccogliere i dati personali altrui?
-> No
-> Si, ma solo se autorizzati
-v Si ma solo se non sono destinati alla diffusione.
-
-32) Quando non si adottano misure minime di sicurezza nella conservazione dei dati vi è una responsabilità?
-> Civile
-v Penale.
-> Amministrativa
-
-33) I documenti informatici?
-> Sono validi nei soli casi previsti dalla legge
-v Sono validi se con firma digitale.
-> Sono validi a tutti gli effetti
-
-34) Quando un documento inviato a mezzo posta certificata si considera consegnato?
-> Quando viene inviato dal proprio server
-v Quando arriva al server del destinatario
-> Quando viene letto dal destinatario
-
-35) Chi emette i bitcoins?
-> Le autorità dei vari paesi controllano le loro emissioni
-> Le banche centrali
-v Colui che li ha inventati
-
-36) I bitcoins sono convertibili in denaro?
-v Si
-> No
-> Solo se la conversione è autorizzata dalle banche centrali
-
-37) Il commercio elettronico disciplinato dal codice del consumo vale:
-> Per qualsiasi transazione effettuata con strumenti telematici
-> Per le transazioni con strumenti telematici tra consumatori
-v Per le transazioni con strumenti telematici tra consumatori ed imprese.
-
-38) In caso di acquisti online si può recedere dall'acquisto?
-> Per qualsiasi transazione effettuata con strumenti telematici
-> Per le transazioni con strumenti telematici tra consumatori
-v Per le transazioni con strumenti telematici tra consumatori ed imprese
-
-39) Il commercio elettronico disciplinato dalla disciplina delle società dell'informazione riguarda:
-v Qualsiasi transazione effettuata con strumenti telematici con imprese
-> Le transazioni con strumenti telematici tra consumatori
-> Le transazioni con strumenti telematici tra consumatori ed imprese
-
-40) Quando inizia il trattamento dei dati personali?
-> Da quando inizia la raccolta dei dati
-v Da quando l’interessato rilascia il consenso
-> Da quando i dati vengono elaborati
-
-41) I codici di autoregolamento sono obbligatori?
-> Si
-> Si, se lo dice la legge
-v No
-
-42) Scannerizzo ed appongo la mia firma ad un documento, questa è una firma elettronica avanzata?
-> Si
-> Si se poi non la contesto
-v No
-
-43) Si può concludere un contratto via mail?	
-v Si.
-> Si se poi non lo contestano
-> No
-
-> 44)Nei contratti a distanza con il consumatore, questi può recedere?	
-v Si, senza dare spiegazioni
-> Si ma solo per giusta causa
-> No
-
-45) Se compro il pc ed il software è in licenza:
-> posso acquistare il software pagando un ulteriore somma
-v Il software non è mio.
-> ho pagato e quindi anche il software è mio
-
-46) Cos’è il fascicolo telematico?
-v È il fascicolo digitale del processo civile.
-> Il fascicolo delle comunicazioni digitali con la pubblica amministrazione
-> Il fascicolo digitale dove l’università conserva tutti i dati dello studente
-
-47) Si può fare una copia di un programma che si ha in licenza?
-> Sì pagando un’apposita royalties
-> Si ma solo se pattuito all’inizio del contratto
-v Si ma senza commercializzarlo e per l’uso del programma stesso.
-
-48) Cosa è una wireless community network?
-> Un insieme di persone che sostiene il diritto alla libertà su internet
-v Un insieme di persone che crea una rete di comunicazioni wireless.
-> È un modo di designare gli utenti dei social network
-
-49) Le regole di comportamento previste nella piattaforma di un social network?
-> Non sono regole giuridiche
-> Sono regole locali
-v Sono regole contrattuali.
-
-50) Cliccando su accetto sull’iscrizione ad un social network si conclude un contratto?
-v Si
-> Si ma poi serve un documento scritto
-> No
-
-51) Quando sono protette le banche dati?
-> Sempre se hanno carattere creativo
-> Sempre se sono brevettate
-v Sempre se sono rese pubbliche.
-
-52) Cosa si intende per deterritorializzazione?
-> La perdita di sovranità derivante della tecnologia informatica.
-> Il fatto che tra gli stati stanno venendo meno i conflitti
-> Il fatto che ognuno può installare un provider nello stato che preferisce
-v Il fatto che gli stati non riescono a controllare gli illeciti compiuti in rete
-
-53) Un nome di dominio è un bene?
-v Si
-> No
-
-54) Un documento elettronico privo di firma digitale?
-v Non è valido
-> È valido
-> È valido ma un giudice può anche ritenerlo inidoneo.
-
-55) Un internet provider è responsabile degli insulti pubblici dai suoi utenti?
-v No se svolge un ruolo meramente passivo nelle loro attività.
-> No ma solo se ha messo delle regole contrattuali che li vietino
-> Si
-
-56) Cos’è il trattamento dei dati personali?
-> La raccolta dei dati personali di un soggetto tramite strumenti informatici
-v La raccolta, l’elaborazione e la conservazione dei dati personali di un soggetto tramite strumenti informatici.
-> Praticamente ogni attività che coinvolga i dati personali di un soggetto
-
-57) È legittimo prendere una decisione (es. di tipo contrattuale) automatizzata utilizzando un algoritmo?
-> Si
-v Si ma solo se vi è coinvolgimento umano nella decisione
-> No
-
-58) Le criptovalute sono monete?
-> Si
-v No, sono beni digitali.
-
-59) Cosa si intende con dematerializzazione?
-> il fatto che esistono beni immateriali
-v Il fatto che sempre più beni stanno assumendo forma digitale anziché materiale.
-> il fatto che nella legge si progetta la futura sostituzione di beni materiali con beni digitali
-
-60) Cosa vuol dire che il contratto è fonte delle regole?
-v Che molti rapporti digitali sono regolati quasi interamente da contratti , mancando regole specifiche.
-> che il contratto fa parte delle fonti legali di regole
-> che molti internet provider utilizzano regole uguali nei rapporti con gli utenti
-
-61) Cosa si intende con / cos'è il principio di neutralità tecnologica?
-> l’obbligo di utilizzare una medisca tecnologia informatica
-v L’obbligo di non discriminare tra diverse tecnologie.
-> il divieto di discriminazione di ogni tipo tramite social network
-
-62) Cos’è il digital divide?
-v La scarsa distribuzione di risorse e conoscenze informatiche.
-> L’utilizzo di pc e softwares non aggiornati
-> l’insieme dei rischi connessi all’utilizzo di strumenti informativi
-
-63) L’acquisto di competenze digitali:
-v È oggetto di leggi che lo agevolano.
-> dipende solo dalla volontà di ognuno
-> è affidato alle società che trattano big data
-
-64) Si può caricare su un social network l’immagine di una persona?
-> si sempre ma solo se è maggiorenne
-> si ma va tolta se lo chiede
-v Si ma dopo aver avuto il suo consenso.
-
-65) Il cyberbullismo: 
-> è una questione di maleducazione
-v È un comportamento vietato dalla legge
-> è un comportamento regolato dai singoli social network
-
-66) Cos’è lo SPID?
-v È un sistema pubblico di identificazione di oggetti.
-> è un sistema pubblico di attribuzione di posta certificata
-> è un sistema pubblico per accedere a determinati servizi di trading on line
-
-67) Cos’è un domicilio digitale?
-> l’indirizzo pec che indica dove siamo residenti
-> l'indirizzo pec che dobbiamo aver per i nostri rapporti con il fisco
-v L’indirizzo pec che vale per comunicazioni aventi valore legale.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_102/correct.txt b/legacy/Data/Questions/ingsw/0000_102/correct.txt
deleted file mode 100644
index 6613ca3..0000000
--- a/legacy/Data/Questions/ingsw/0000_102/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(a=100, b=false, c=true), (a=90, b=true, c=false)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_102/quest.txt b/legacy/Data/Questions/ingsw/0000_102/quest.txt
deleted file mode 100644
index e13f059..0000000
--- a/legacy/Data/Questions/ingsw/0000_102/quest.txt
+++ /dev/null
@@ -1,20 +0,0 @@
-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/Questions/ingsw/0000_102/wrong1.txt b/legacy/Data/Questions/ingsw/0000_102/wrong1.txt
deleted file mode 100644
index 9e9ca26..0000000
--- a/legacy/Data/Questions/ingsw/0000_102/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(a=100, b=false, c=false), (a=90, b=true, c=true)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_102/wrong2.txt b/legacy/Data/Questions/ingsw/0000_102/wrong2.txt
deleted file mode 100644
index 2a2414b..0000000
--- a/legacy/Data/Questions/ingsw/0000_102/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(a=100, b=false, c=true), (a=90, b=false, c=true)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_2/correct.txt b/legacy/Data/Questions/ingsw/0000_2/correct.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0000_2/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_2/quest.txt b/legacy/Data/Questions/ingsw/0000_2/quest.txt
deleted file mode 100644
index c5fe9fb..0000000
--- a/legacy/Data/Questions/ingsw/0000_2/quest.txt
+++ /dev/null
@@ -1,57 +0,0 @@
-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 <stdio.h>
-
-#include <stdlib.h>
-
-#include <assert.h>
-
-#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/Questions/ingsw/0000_2/wrong1.txt b/legacy/Data/Questions/ingsw/0000_2/wrong1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0000_2/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_2/wrong2.txt b/legacy/Data/Questions/ingsw/0000_2/wrong2.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0000_2/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_3/correct.txt b/legacy/Data/Questions/ingsw/0000_3/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0000_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_3/quest.txt b/legacy/Data/Questions/ingsw/0000_3/quest.txt
deleted file mode 100644
index ba81b1a..0000000
--- a/legacy/Data/Questions/ingsw/0000_3/quest.txt
+++ /dev/null
@@ -1,45 +0,0 @@
-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 <stdio.h>
-
-#include <stdlib.h>
-
-#include <assert.h>
-
-#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/Questions/ingsw/0000_3/wrong1.txt b/legacy/Data/Questions/ingsw/0000_3/wrong1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0000_3/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_3/wrong2.txt b/legacy/Data/Questions/ingsw/0000_3/wrong2.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0000_3/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_32/correct.txt b/legacy/Data/Questions/ingsw/0000_32/correct.txt
deleted file mode 100644
index 1ef5b94..0000000
--- a/legacy/Data/Questions/ingsw/0000_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0000_32/quest.txt b/legacy/Data/Questions/ingsw/0000_32/quest.txt
deleted file mode 100644
index f07b439..0000000
--- a/legacy/Data/Questions/ingsw/0000_32/quest.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-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/Questions/ingsw/0000_32/wrong1.txt b/legacy/Data/Questions/ingsw/0000_32/wrong1.txt
deleted file mode 100644
index 6946352..0000000
--- a/legacy/Data/Questions/ingsw/0000_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0000_32/wrong2.txt b/legacy/Data/Questions/ingsw/0000_32/wrong2.txt
deleted file mode 100644
index f9b6750..0000000
--- a/legacy/Data/Questions/ingsw/0000_32/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0000_4/correct.txt b/legacy/Data/Questions/ingsw/0000_4/correct.txt
deleted file mode 100644
index 998dfca..0000000
--- a/legacy/Data/Questions/ingsw/0000_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Customers should be closely involved throughout the development process.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_4/quest.txt b/legacy/Data/Questions/ingsw/0000_4/quest.txt
deleted file mode 100644
index 7d22084..0000000
--- a/legacy/Data/Questions/ingsw/0000_4/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Which of the following is an agile principle?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_4/wrong1.txt b/legacy/Data/Questions/ingsw/0000_4/wrong1.txt
deleted file mode 100644
index b34acfc..0000000
--- a/legacy/Data/Questions/ingsw/0000_4/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Customers should just provide requirements and verify them when the project is completed.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_4/wrong2.txt b/legacy/Data/Questions/ingsw/0000_4/wrong2.txt
deleted file mode 100644
index 9cfa092..0000000
--- a/legacy/Data/Questions/ingsw/0000_4/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Customers should not interfere with the software development.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_7/correct.txt b/legacy/Data/Questions/ingsw/0000_7/correct.txt
deleted file mode 100644
index ae41872..0000000
--- a/legacy/Data/Questions/ingsw/0000_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Testing interfaces for each component (i.e., integration of several units).
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_7/quest.txt b/legacy/Data/Questions/ingsw/0000_7/quest.txt
deleted file mode 100644
index 8632d4d..0000000
--- a/legacy/Data/Questions/ingsw/0000_7/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Component testing focuses on:
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_7/wrong1.txt b/legacy/Data/Questions/ingsw/0000_7/wrong1.txt
deleted file mode 100644
index c2fa097..0000000
--- a/legacy/Data/Questions/ingsw/0000_7/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Testing interactions among components (i.e., integration of several units).
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_7/wrong2.txt b/legacy/Data/Questions/ingsw/0000_7/wrong2.txt
deleted file mode 100644
index 85de863..0000000
--- a/legacy/Data/Questions/ingsw/0000_7/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Testing functionalities of individual program units, object classes or methods.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_8/correct.txt b/legacy/Data/Questions/ingsw/0000_8/correct.txt
deleted file mode 100644
index aef914a..0000000
--- a/legacy/Data/Questions/ingsw/0000_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che un sistema che soddisfa i requisiti risolve il problema del "customer".
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_8/quest.txt b/legacy/Data/Questions/ingsw/0000_8/quest.txt
deleted file mode 100644
index e821a05..0000000
--- a/legacy/Data/Questions/ingsw/0000_8/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0000_8/wrong1.txt b/legacy/Data/Questions/ingsw/0000_8/wrong1.txt
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/Questions/ingsw/0000_8/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0000_8/wrong2.txt b/legacy/Data/Questions/ingsw/0000_8/wrong2.txt
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/Questions/ingsw/0000_8/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_0/correct.txt b/legacy/Data/Questions/ingsw/0120_0/correct.txt
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/Questions/ingsw/0120_0/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_0/quest.txt b/legacy/Data/Questions/ingsw/0120_0/quest.txt
deleted file mode 100644
index 1b78d21..0000000
--- a/legacy/Data/Questions/ingsw/0120_0/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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/Questions/ingsw/0120_0/wrong1.txt b/legacy/Data/Questions/ingsw/0120_0/wrong1.txt
deleted file mode 100644
index 5464d05..0000000
--- a/legacy/Data/Questions/ingsw/0120_0/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 30%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_0/wrong2.txt b/legacy/Data/Questions/ingsw/0120_0/wrong2.txt
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/Questions/ingsw/0120_0/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_1/correct.txt b/legacy/Data/Questions/ingsw/0120_1/correct.txt
deleted file mode 100644
index 279908a..0000000
--- a/legacy/Data/Questions/ingsw/0120_1/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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 <pre 0.5*x) or (y > 0.7*x)) ;
-algorithm
-when edge(wz) then
-wy := true;
-end when;
-end Monitor;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_1/quest.txt b/legacy/Data/Questions/ingsw/0120_1/quest.txt
deleted file mode 100644
index 5922b9f..0000000
--- a/legacy/Data/Questions/ingsw/0120_1/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0120_1/wrong1.txt b/legacy/Data/Questions/ingsw/0120_1/wrong1.txt
deleted file mode 100644
index 867889a..0000000
--- a/legacy/Data/Questions/ingsw/0120_1/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_1/wrong2.txt b/legacy/Data/Questions/ingsw/0120_1/wrong2.txt
deleted file mode 100644
index a159504..0000000
--- a/legacy/Data/Questions/ingsw/0120_1/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_10/correct.txt b/legacy/Data/Questions/ingsw/0120_10/correct.txt
deleted file mode 100644
index fffebc7..0000000
--- a/legacy/Data/Questions/ingsw/0120_10/correct.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_10/quest.txt b/legacy/Data/Questions/ingsw/0120_10/quest.txt
deleted file mode 100644
index e11a044..0000000
--- a/legacy/Data/Questions/ingsw/0120_10/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0120_10/wrong1.txt b/legacy/Data/Questions/ingsw/0120_10/wrong1.txt
deleted file mode 100644
index c5ef6d8..0000000
--- a/legacy/Data/Questions/ingsw/0120_10/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_10/wrong2.txt b/legacy/Data/Questions/ingsw/0120_10/wrong2.txt
deleted file mode 100644
index 06e9d5a..0000000
--- a/legacy/Data/Questions/ingsw/0120_10/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_11/correct.txt b/legacy/Data/Questions/ingsw/0120_11/correct.txt
deleted file mode 100644
index 1a8a50a..0000000
--- a/legacy/Data/Questions/ingsw/0120_11/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_11/quest.txt b/legacy/Data/Questions/ingsw/0120_11/quest.txt
deleted file mode 100644
index 793b220..0000000
--- a/legacy/Data/Questions/ingsw/0120_11/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_11/wrong1.txt b/legacy/Data/Questions/ingsw/0120_11/wrong1.txt
deleted file mode 100644
index fac8307..0000000
--- a/legacy/Data/Questions/ingsw/0120_11/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_11/wrong2.txt b/legacy/Data/Questions/ingsw/0120_11/wrong2.txt
deleted file mode 100644
index 3fdb31e..0000000
--- a/legacy/Data/Questions/ingsw/0120_11/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_12/correct.txt b/legacy/Data/Questions/ingsw/0120_12/correct.txt
deleted file mode 100644
index b9f32a6..0000000
--- a/legacy/Data/Questions/ingsw/0120_12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-c(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_12/quest.txt b/legacy/Data/Questions/ingsw/0120_12/quest.txt
deleted file mode 100644
index aed3c79..0000000
--- a/legacy/Data/Questions/ingsw/0120_12/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0120_12/wrong1.txt b/legacy/Data/Questions/ingsw/0120_12/wrong1.txt
deleted file mode 100644
index 70022eb..0000000
--- a/legacy/Data/Questions/ingsw/0120_12/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-c(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_12/wrong2.txt b/legacy/Data/Questions/ingsw/0120_12/wrong2.txt
deleted file mode 100644
index 3143da9..0000000
--- a/legacy/Data/Questions/ingsw/0120_12/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-c(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_13/correct.txt b/legacy/Data/Questions/ingsw/0120_13/correct.txt
deleted file mode 100644
index e74b1fc..0000000
--- a/legacy/Data/Questions/ingsw/0120_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_13/quest.txt b/legacy/Data/Questions/ingsw/0120_13/quest.txt
deleted file mode 100644
index c1cd6d0..0000000
--- a/legacy/Data/Questions/ingsw/0120_13/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0120_13/wrong1.txt b/legacy/Data/Questions/ingsw/0120_13/wrong1.txt
deleted file mode 100644
index d63544a..0000000
--- a/legacy/Data/Questions/ingsw/0120_13/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_13/wrong2.txt b/legacy/Data/Questions/ingsw/0120_13/wrong2.txt
deleted file mode 100644
index 1753a91..0000000
--- a/legacy/Data/Questions/ingsw/0120_13/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-F(x, y, z) = (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_14/correct.txt b/legacy/Data/Questions/ingsw/0120_14/correct.txt
deleted file mode 100644
index 475d1ef..0000000
--- a/legacy/Data/Questions/ingsw/0120_14/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-{x = -150, x = -40,  x = 0, x = 200, x = 600}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_14/quest.txt b/legacy/Data/Questions/ingsw/0120_14/quest.txt
deleted file mode 100644
index 36947c2..0000000
--- a/legacy/Data/Questions/ingsw/0120_14/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0120_14/wrong1.txt b/legacy/Data/Questions/ingsw/0120_14/wrong1.txt
deleted file mode 100644
index a6df32d..0000000
--- a/legacy/Data/Questions/ingsw/0120_14/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -150,  x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_14/wrong2.txt b/legacy/Data/Questions/ingsw/0120_14/wrong2.txt
deleted file mode 100644
index 0aaedb8..0000000
--- a/legacy/Data/Questions/ingsw/0120_14/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -50,  x = 0, x = 100, x = 500}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_15/correct.txt b/legacy/Data/Questions/ingsw/0120_15/correct.txt
deleted file mode 100644
index aef914a..0000000
--- a/legacy/Data/Questions/ingsw/0120_15/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che un sistema che soddisfa i requisiti risolve il problema del "customer".
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_15/quest.txt b/legacy/Data/Questions/ingsw/0120_15/quest.txt
deleted file mode 100644
index 9af4805..0000000
--- a/legacy/Data/Questions/ingsw/0120_15/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_15/wrong1.txt b/legacy/Data/Questions/ingsw/0120_15/wrong1.txt
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/Questions/ingsw/0120_15/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_15/wrong2.txt b/legacy/Data/Questions/ingsw/0120_15/wrong2.txt
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/Questions/ingsw/0120_15/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_16/correct.txt b/legacy/Data/Questions/ingsw/0120_16/correct.txt
deleted file mode 100644
index 0902686..0000000
--- a/legacy/Data/Questions/ingsw/0120_16/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requisito funzionale.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_16/quest.txt b/legacy/Data/Questions/ingsw/0120_16/quest.txt
deleted file mode 100644
index f6839df..0000000
--- a/legacy/Data/Questions/ingsw/0120_16/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-"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/Questions/ingsw/0120_16/wrong1.txt b/legacy/Data/Questions/ingsw/0120_16/wrong1.txt
deleted file mode 100644
index 6084c49..0000000
--- a/legacy/Data/Questions/ingsw/0120_16/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requisito non-funzionale.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_16/wrong2.txt b/legacy/Data/Questions/ingsw/0120_16/wrong2.txt
deleted file mode 100644
index 396c8d3..0000000
--- a/legacy/Data/Questions/ingsw/0120_16/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requisito di performance.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_17/correct.txt b/legacy/Data/Questions/ingsw/0120_17/correct.txt
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/Questions/ingsw/0120_17/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.12
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_17/quest.txt b/legacy/Data/Questions/ingsw/0120_17/quest.txt
deleted file mode 100644
index fc7cc95..0000000
--- a/legacy/Data/Questions/ingsw/0120_17/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0120_17/wrong1.txt b/legacy/Data/Questions/ingsw/0120_17/wrong1.txt
deleted file mode 100644
index 2a47a95..0000000
--- a/legacy/Data/Questions/ingsw/0120_17/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.08
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_17/wrong2.txt b/legacy/Data/Questions/ingsw/0120_17/wrong2.txt
deleted file mode 100644
index b7bbee2..0000000
--- a/legacy/Data/Questions/ingsw/0120_17/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.32
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_18/correct.txt b/legacy/Data/Questions/ingsw/0120_18/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0120_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_18/quest.txt b/legacy/Data/Questions/ingsw/0120_18/quest.txt
deleted file mode 100644
index fd2ddc5..0000000
--- a/legacy/Data/Questions/ingsw/0120_18/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0120_18/wrong1.txt b/legacy/Data/Questions/ingsw/0120_18/wrong1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0120_18/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_18/wrong2.txt b/legacy/Data/Questions/ingsw/0120_18/wrong2.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0120_18/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_19/correct.txt b/legacy/Data/Questions/ingsw/0120_19/correct.txt
deleted file mode 100644
index e13eda2..0000000
--- a/legacy/Data/Questions/ingsw/0120_19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_19/quest.txt b/legacy/Data/Questions/ingsw/0120_19/quest.txt
deleted file mode 100644
index b59a64d..0000000
--- a/legacy/Data/Questions/ingsw/0120_19/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Quali delle seguenti attivit� � parte del processo di validazione dei requisiti ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_19/wrong1.txt b/legacy/Data/Questions/ingsw/0120_19/wrong1.txt
deleted file mode 100644
index b24f900..0000000
--- a/legacy/Data/Questions/ingsw/0120_19/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Accertarsi che il sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_19/wrong2.txt b/legacy/Data/Questions/ingsw/0120_19/wrong2.txt
deleted file mode 100644
index 884d6b1..0000000
--- a/legacy/Data/Questions/ingsw/0120_19/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Accertarsi che l'architettura del sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_2/correct.txt b/legacy/Data/Questions/ingsw/0120_2/correct.txt
deleted file mode 100644
index 2ca9276..0000000
--- a/legacy/Data/Questions/ingsw/0120_2/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 35%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_2/quest.txt b/legacy/Data/Questions/ingsw/0120_2/quest.txt
deleted file mode 100644
index 7cf45ee..0000000
--- a/legacy/Data/Questions/ingsw/0120_2/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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/Questions/ingsw/0120_2/wrong1.txt b/legacy/Data/Questions/ingsw/0120_2/wrong1.txt
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/Questions/ingsw/0120_2/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_2/wrong2.txt b/legacy/Data/Questions/ingsw/0120_2/wrong2.txt
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/Questions/ingsw/0120_2/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_20/correct.txt b/legacy/Data/Questions/ingsw/0120_20/correct.txt
deleted file mode 100644
index 7311d41..0000000
--- a/legacy/Data/Questions/ingsw/0120_20/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_20/quest.txt b/legacy/Data/Questions/ingsw/0120_20/quest.txt
deleted file mode 100644
index 173901c..0000000
--- a/legacy/Data/Questions/ingsw/0120_20/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/0120_20/wrong1.txt b/legacy/Data/Questions/ingsw/0120_20/wrong1.txt
deleted file mode 100644
index 3e327ab..0000000
--- a/legacy/Data/Questions/ingsw/0120_20/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_20/wrong2.txt b/legacy/Data/Questions/ingsw/0120_20/wrong2.txt
deleted file mode 100644
index 7e48e4f..0000000
--- a/legacy/Data/Questions/ingsw/0120_20/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_21/correct.txt b/legacy/Data/Questions/ingsw/0120_21/correct.txt
deleted file mode 100644
index 98939be..0000000
--- a/legacy/Data/Questions/ingsw/0120_21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-1/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_21/quest.txt b/legacy/Data/Questions/ingsw/0120_21/quest.txt
deleted file mode 100644
index 5e04a05..0000000
--- a/legacy/Data/Questions/ingsw/0120_21/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0120_21/wrong1.txt b/legacy/Data/Questions/ingsw/0120_21/wrong1.txt
deleted file mode 100644
index db2276d..0000000
--- a/legacy/Data/Questions/ingsw/0120_21/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_21/wrong2.txt b/legacy/Data/Questions/ingsw/0120_21/wrong2.txt
deleted file mode 100644
index 56ea6ac..0000000
--- a/legacy/Data/Questions/ingsw/0120_21/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-1/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_22/quest.txt b/legacy/Data/Questions/ingsw/0120_22/quest.txt
deleted file mode 100644
index 306d75a..0000000
--- a/legacy/Data/Questions/ingsw/0120_22/quest.txt
+++ /dev/null
@@ -1,32 +0,0 @@
-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/Questions/ingsw/0120_22/wrong1.txt b/legacy/Data/Questions/ingsw/0120_22/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0120_22/wrong2.txt b/legacy/Data/Questions/ingsw/0120_22/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0120_22/wrong3.txt b/legacy/Data/Questions/ingsw/0120_22/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0120_23/correct.txt b/legacy/Data/Questions/ingsw/0120_23/correct.txt
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/Questions/ingsw/0120_23/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_23/quest.txt b/legacy/Data/Questions/ingsw/0120_23/quest.txt
deleted file mode 100644
index 6f49368..0000000
--- a/legacy/Data/Questions/ingsw/0120_23/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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/Questions/ingsw/0120_23/wrong1.txt b/legacy/Data/Questions/ingsw/0120_23/wrong1.txt
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/Questions/ingsw/0120_23/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_23/wrong2.txt b/legacy/Data/Questions/ingsw/0120_23/wrong2.txt
deleted file mode 100644
index 5464d05..0000000
--- a/legacy/Data/Questions/ingsw/0120_23/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 30%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_24/correct.txt b/legacy/Data/Questions/ingsw/0120_24/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0120_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_24/quest.txt b/legacy/Data/Questions/ingsw/0120_24/quest.txt
deleted file mode 100644
index 702f202..0000000
--- a/legacy/Data/Questions/ingsw/0120_24/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0120_24/wrong1.txt b/legacy/Data/Questions/ingsw/0120_24/wrong1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0120_24/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_24/wrong2.txt b/legacy/Data/Questions/ingsw/0120_24/wrong2.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0120_24/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_25/quest.txt b/legacy/Data/Questions/ingsw/0120_25/quest.txt
deleted file mode 100644
index 5e6a3b5..0000000
--- a/legacy/Data/Questions/ingsw/0120_25/quest.txt
+++ /dev/null
@@ -1,37 +0,0 @@
-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/Questions/ingsw/0120_25/wrong1.txt b/legacy/Data/Questions/ingsw/0120_25/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0120_25/wrong2.txt b/legacy/Data/Questions/ingsw/0120_25/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0120_25/wrong3.txt b/legacy/Data/Questions/ingsw/0120_25/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0120_26/correct.txt b/legacy/Data/Questions/ingsw/0120_26/correct.txt
deleted file mode 100644
index 1c7da8c..0000000
--- a/legacy/Data/Questions/ingsw/0120_26/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.03
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_26/quest.txt b/legacy/Data/Questions/ingsw/0120_26/quest.txt
deleted file mode 100644
index 458f85c..0000000
--- a/legacy/Data/Questions/ingsw/0120_26/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0120_26/wrong1.txt b/legacy/Data/Questions/ingsw/0120_26/wrong1.txt
deleted file mode 100644
index 7eb6830..0000000
--- a/legacy/Data/Questions/ingsw/0120_26/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.27
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_26/wrong2.txt b/legacy/Data/Questions/ingsw/0120_26/wrong2.txt
deleted file mode 100644
index 8a346b7..0000000
--- a/legacy/Data/Questions/ingsw/0120_26/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.07
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_27/correct.txt b/legacy/Data/Questions/ingsw/0120_27/correct.txt
deleted file mode 100644
index 5f37ecc..0000000
--- a/legacy/Data/Questions/ingsw/0120_27/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_27/quest.txt b/legacy/Data/Questions/ingsw/0120_27/quest.txt
deleted file mode 100644
index 864cc93..0000000
--- a/legacy/Data/Questions/ingsw/0120_27/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0120_27/wrong1.txt b/legacy/Data/Questions/ingsw/0120_27/wrong1.txt
deleted file mode 100644
index 8856598..0000000
--- a/legacy/Data/Questions/ingsw/0120_27/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_27/wrong2.txt b/legacy/Data/Questions/ingsw/0120_27/wrong2.txt
deleted file mode 100644
index 2057e11..0000000
--- a/legacy/Data/Questions/ingsw/0120_27/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_28/quest.txt b/legacy/Data/Questions/ingsw/0120_28/quest.txt
deleted file mode 100644
index 5826ea3..0000000
--- a/legacy/Data/Questions/ingsw/0120_28/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0120_28/wrong1.txt b/legacy/Data/Questions/ingsw/0120_28/wrong1.txt
deleted file mode 100644
index bfb3c5d..0000000
--- a/legacy/Data/Questions/ingsw/0120_28/wrong1.txt
+++ /dev/null
@@ -1,38 +0,0 @@
-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/Questions/ingsw/0120_28/wrong2.txt b/legacy/Data/Questions/ingsw/0120_28/wrong2.txt
deleted file mode 100644
index c5d8c6b..0000000
--- a/legacy/Data/Questions/ingsw/0120_28/wrong2.txt
+++ /dev/null
@@ -1,33 +0,0 @@
-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/Questions/ingsw/0120_28/wrong3.txt b/legacy/Data/Questions/ingsw/0120_28/wrong3.txt
deleted file mode 100644
index 40db007..0000000
--- a/legacy/Data/Questions/ingsw/0120_28/wrong3.txt
+++ /dev/null
@@ -1,33 +0,0 @@
-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/Questions/ingsw/0120_29/correct.txt b/legacy/Data/Questions/ingsw/0120_29/correct.txt
deleted file mode 100644
index 080c618..0000000
--- a/legacy/Data/Questions/ingsw/0120_29/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_29/quest.txt b/legacy/Data/Questions/ingsw/0120_29/quest.txt
deleted file mode 100644
index 576af1a..0000000
--- a/legacy/Data/Questions/ingsw/0120_29/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0120_29/wrong1.txt b/legacy/Data/Questions/ingsw/0120_29/wrong1.txt
deleted file mode 100644
index 5ea42fe..0000000
--- a/legacy/Data/Questions/ingsw/0120_29/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_29/wrong2.txt b/legacy/Data/Questions/ingsw/0120_29/wrong2.txt
deleted file mode 100644
index a55c0a4..0000000
--- a/legacy/Data/Questions/ingsw/0120_29/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_3/correct.txt b/legacy/Data/Questions/ingsw/0120_3/correct.txt
deleted file mode 100644
index e940faa..0000000
--- a/legacy/Data/Questions/ingsw/0120_3/correct.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0120_3/quest.txt b/legacy/Data/Questions/ingsw/0120_3/quest.txt
deleted file mode 100644
index 2758118..0000000
--- a/legacy/Data/Questions/ingsw/0120_3/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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/Questions/ingsw/0120_3/wrong1.txt b/legacy/Data/Questions/ingsw/0120_3/wrong1.txt
deleted file mode 100644
index ad32d88..0000000
--- a/legacy/Data/Questions/ingsw/0120_3/wrong1.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0120_3/wrong2.txt b/legacy/Data/Questions/ingsw/0120_3/wrong2.txt
deleted file mode 100644
index 642ec6b..0000000
--- a/legacy/Data/Questions/ingsw/0120_3/wrong2.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0120_30/correct.txt b/legacy/Data/Questions/ingsw/0120_30/correct.txt
deleted file mode 100644
index a40ea7d..0000000
--- a/legacy/Data/Questions/ingsw/0120_30/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0120_30/quest.txt b/legacy/Data/Questions/ingsw/0120_30/quest.txt
deleted file mode 100644
index dbd72c0..0000000
--- a/legacy/Data/Questions/ingsw/0120_30/quest.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-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/Questions/ingsw/0120_30/wrong1.txt b/legacy/Data/Questions/ingsw/0120_30/wrong1.txt
deleted file mode 100644
index 5b77112..0000000
--- a/legacy/Data/Questions/ingsw/0120_30/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0120_30/wrong2.txt b/legacy/Data/Questions/ingsw/0120_30/wrong2.txt
deleted file mode 100644
index abe0eaa..0000000
--- a/legacy/Data/Questions/ingsw/0120_30/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0120_31/correct.txt b/legacy/Data/Questions/ingsw/0120_31/correct.txt
deleted file mode 100644
index 3bb4f54..0000000
--- a/legacy/Data/Questions/ingsw/0120_31/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 25%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_31/quest.txt b/legacy/Data/Questions/ingsw/0120_31/quest.txt
deleted file mode 100644
index 6c8f77e..0000000
--- a/legacy/Data/Questions/ingsw/0120_31/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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/Questions/ingsw/0120_31/wrong1.txt b/legacy/Data/Questions/ingsw/0120_31/wrong1.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0120_31/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_31/wrong2.txt b/legacy/Data/Questions/ingsw/0120_31/wrong2.txt
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/Questions/ingsw/0120_31/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_32/correct.txt b/legacy/Data/Questions/ingsw/0120_32/correct.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0120_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_32/quest.txt b/legacy/Data/Questions/ingsw/0120_32/quest.txt
deleted file mode 100644
index dcec721..0000000
--- a/legacy/Data/Questions/ingsw/0120_32/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/0120_32/wrong1.txt b/legacy/Data/Questions/ingsw/0120_32/wrong1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0120_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_32/wrong2.txt b/legacy/Data/Questions/ingsw/0120_32/wrong2.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0120_32/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_33/correct.txt b/legacy/Data/Questions/ingsw/0120_33/correct.txt
deleted file mode 100644
index a7029bc..0000000
--- a/legacy/Data/Questions/ingsw/0120_33/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [1, 4] oppure nell'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_33/quest.txt b/legacy/Data/Questions/ingsw/0120_33/quest.txt
deleted file mode 100644
index e5fbc81..0000000
--- a/legacy/Data/Questions/ingsw/0120_33/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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;
-</pre>
-Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_33/wrong1.txt b/legacy/Data/Questions/ingsw/0120_33/wrong1.txt
deleted file mode 100644
index a82929b..0000000
--- a/legacy/Data/Questions/ingsw/0120_33/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_33/wrong2.txt b/legacy/Data/Questions/ingsw/0120_33/wrong2.txt
deleted file mode 100644
index 710b111..0000000
--- a/legacy/Data/Questions/ingsw/0120_33/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_34/quest.txt b/legacy/Data/Questions/ingsw/0120_34/quest.txt
deleted file mode 100644
index 29d0647..0000000
--- a/legacy/Data/Questions/ingsw/0120_34/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0120_34/wrong1.txt b/legacy/Data/Questions/ingsw/0120_34/wrong1.txt
deleted file mode 100644
index 160702f..0000000
--- a/legacy/Data/Questions/ingsw/0120_34/wrong1.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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/Questions/ingsw/0120_34/wrong2.txt b/legacy/Data/Questions/ingsw/0120_34/wrong2.txt
deleted file mode 100644
index 3c05a37..0000000
--- a/legacy/Data/Questions/ingsw/0120_34/wrong2.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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/Questions/ingsw/0120_34/wrong3.txt b/legacy/Data/Questions/ingsw/0120_34/wrong3.txt
deleted file mode 100644
index bdfb644..0000000
--- a/legacy/Data/Questions/ingsw/0120_34/wrong3.txt
+++ /dev/null
@@ -1,37 +0,0 @@
-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/Questions/ingsw/0120_35/quest.txt b/legacy/Data/Questions/ingsw/0120_35/quest.txt
deleted file mode 100644
index 99379e6..0000000
--- a/legacy/Data/Questions/ingsw/0120_35/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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/Questions/ingsw/0120_35/wrong1.txt b/legacy/Data/Questions/ingsw/0120_35/wrong1.txt
deleted file mode 100644
index cbf1814..0000000
--- a/legacy/Data/Questions/ingsw/0120_35/wrong1.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0120_35/wrong2.txt b/legacy/Data/Questions/ingsw/0120_35/wrong2.txt
deleted file mode 100644
index 03b9f52..0000000
--- a/legacy/Data/Questions/ingsw/0120_35/wrong2.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0120_35/wrong3.txt b/legacy/Data/Questions/ingsw/0120_35/wrong3.txt
deleted file mode 100644
index 6fcb8b5..0000000
--- a/legacy/Data/Questions/ingsw/0120_35/wrong3.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0120_36/correct.txt b/legacy/Data/Questions/ingsw/0120_36/correct.txt
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/Questions/ingsw/0120_36/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_36/quest.txt b/legacy/Data/Questions/ingsw/0120_36/quest.txt
deleted file mode 100644
index 6f256c3..0000000
--- a/legacy/Data/Questions/ingsw/0120_36/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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/Questions/ingsw/0120_36/wrong1.txt b/legacy/Data/Questions/ingsw/0120_36/wrong1.txt
deleted file mode 100644
index 5464d05..0000000
--- a/legacy/Data/Questions/ingsw/0120_36/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 30%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_36/wrong2.txt b/legacy/Data/Questions/ingsw/0120_36/wrong2.txt
deleted file mode 100644
index cf27703..0000000
--- a/legacy/Data/Questions/ingsw/0120_36/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_37/correct.txt b/legacy/Data/Questions/ingsw/0120_37/correct.txt
deleted file mode 100644
index bc5692f..0000000
--- a/legacy/Data/Questions/ingsw/0120_37/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 87%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_37/quest.txt b/legacy/Data/Questions/ingsw/0120_37/quest.txt
deleted file mode 100644
index cdbc688..0000000
--- a/legacy/Data/Questions/ingsw/0120_37/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0120_37/wrong1.txt b/legacy/Data/Questions/ingsw/0120_37/wrong1.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0120_37/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_37/wrong2.txt b/legacy/Data/Questions/ingsw/0120_37/wrong2.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/0120_37/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_38/correct.txt b/legacy/Data/Questions/ingsw/0120_38/correct.txt
deleted file mode 100644
index 25ac15c..0000000
--- a/legacy/Data/Questions/ingsw/0120_38/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_38/quest.txt b/legacy/Data/Questions/ingsw/0120_38/quest.txt
deleted file mode 100644
index b420aaf..0000000
--- a/legacy/Data/Questions/ingsw/0120_38/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0120_38/wrong1.txt b/legacy/Data/Questions/ingsw/0120_38/wrong1.txt
deleted file mode 100644
index 157567e..0000000
--- a/legacy/Data/Questions/ingsw/0120_38/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_38/wrong2.txt b/legacy/Data/Questions/ingsw/0120_38/wrong2.txt
deleted file mode 100644
index d021c3b..0000000
--- a/legacy/Data/Questions/ingsw/0120_38/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_39/quest.txt b/legacy/Data/Questions/ingsw/0120_39/quest.txt
deleted file mode 100644
index 4777dbc..0000000
--- a/legacy/Data/Questions/ingsw/0120_39/quest.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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/Questions/ingsw/0120_39/wrong1.txt b/legacy/Data/Questions/ingsw/0120_39/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0120_39/wrong2.txt b/legacy/Data/Questions/ingsw/0120_39/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0120_39/wrong3.txt b/legacy/Data/Questions/ingsw/0120_39/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0120_4/correct.txt b/legacy/Data/Questions/ingsw/0120_4/correct.txt
deleted file mode 100644
index ddb0d65..0000000
--- a/legacy/Data/Questions/ingsw/0120_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_4/quest.txt b/legacy/Data/Questions/ingsw/0120_4/quest.txt
deleted file mode 100644
index d1cf8cb..0000000
--- a/legacy/Data/Questions/ingsw/0120_4/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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;
-</pre>
-Quale delle seguenti affermazioni meglio descrive il requisito monitorato.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_4/wrong1.txt b/legacy/Data/Questions/ingsw/0120_4/wrong1.txt
deleted file mode 100644
index 3e05ae7..0000000
--- a/legacy/Data/Questions/ingsw/0120_4/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è fuori dall'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_4/wrong2.txt b/legacy/Data/Questions/ingsw/0120_4/wrong2.txt
deleted file mode 100644
index 7c7a691..0000000
--- a/legacy/Data/Questions/ingsw/0120_4/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variable x è minore di 0.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_40/correct.txt b/legacy/Data/Questions/ingsw/0120_40/correct.txt
deleted file mode 100644
index 31a01d5..0000000
--- a/legacy/Data/Questions/ingsw/0120_40/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_40/quest.txt b/legacy/Data/Questions/ingsw/0120_40/quest.txt
deleted file mode 100644
index 74a4d32..0000000
--- a/legacy/Data/Questions/ingsw/0120_40/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/0120_40/wrong1.txt b/legacy/Data/Questions/ingsw/0120_40/wrong1.txt
deleted file mode 100644
index 549dba8..0000000
--- a/legacy/Data/Questions/ingsw/0120_40/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_40/wrong2.txt b/legacy/Data/Questions/ingsw/0120_40/wrong2.txt
deleted file mode 100644
index 0c564f7..0000000
--- a/legacy/Data/Questions/ingsw/0120_40/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_41/correct.txt b/legacy/Data/Questions/ingsw/0120_41/correct.txt
deleted file mode 100644
index 7a6c6b9..0000000
--- a/legacy/Data/Questions/ingsw/0120_41/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-300000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_41/quest.txt b/legacy/Data/Questions/ingsw/0120_41/quest.txt
deleted file mode 100644
index 47201e7..0000000
--- a/legacy/Data/Questions/ingsw/0120_41/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0120_41/wrong1.txt b/legacy/Data/Questions/ingsw/0120_41/wrong1.txt
deleted file mode 100644
index 997967b..0000000
--- a/legacy/Data/Questions/ingsw/0120_41/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-700000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_41/wrong2.txt b/legacy/Data/Questions/ingsw/0120_41/wrong2.txt
deleted file mode 100644
index 2df501e..0000000
--- a/legacy/Data/Questions/ingsw/0120_41/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-500000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_42/correct.txt b/legacy/Data/Questions/ingsw/0120_42/correct.txt
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/Questions/ingsw/0120_42/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_42/quest.txt b/legacy/Data/Questions/ingsw/0120_42/quest.txt
deleted file mode 100644
index 4650bbb..0000000
--- a/legacy/Data/Questions/ingsw/0120_42/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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/Questions/ingsw/0120_42/wrong1.txt b/legacy/Data/Questions/ingsw/0120_42/wrong1.txt
deleted file mode 100644
index 1c07658..0000000
--- a/legacy/Data/Questions/ingsw/0120_42/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_42/wrong2.txt b/legacy/Data/Questions/ingsw/0120_42/wrong2.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0120_42/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_43/quest.txt b/legacy/Data/Questions/ingsw/0120_43/quest.txt
deleted file mode 100644
index 8636c5a..0000000
--- a/legacy/Data/Questions/ingsw/0120_43/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0120_43/wrong1.txt b/legacy/Data/Questions/ingsw/0120_43/wrong1.txt
deleted file mode 100644
index 0ca6415..0000000
--- a/legacy/Data/Questions/ingsw/0120_43/wrong1.txt
+++ /dev/null
@@ -1,32 +0,0 @@
-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/Questions/ingsw/0120_43/wrong2.txt b/legacy/Data/Questions/ingsw/0120_43/wrong2.txt
deleted file mode 100644
index a5879aa..0000000
--- a/legacy/Data/Questions/ingsw/0120_43/wrong2.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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/Questions/ingsw/0120_43/wrong3.txt b/legacy/Data/Questions/ingsw/0120_43/wrong3.txt
deleted file mode 100644
index b4f56fb..0000000
--- a/legacy/Data/Questions/ingsw/0120_43/wrong3.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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/Questions/ingsw/0120_44/correct.txt b/legacy/Data/Questions/ingsw/0120_44/correct.txt
deleted file mode 100644
index 232aedf..0000000
--- a/legacy/Data/Questions/ingsw/0120_44/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0120_44/quest.txt b/legacy/Data/Questions/ingsw/0120_44/quest.txt
deleted file mode 100644
index e44e320..0000000
--- a/legacy/Data/Questions/ingsw/0120_44/quest.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-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/Questions/ingsw/0120_44/wrong1.txt b/legacy/Data/Questions/ingsw/0120_44/wrong1.txt
deleted file mode 100644
index 5d5c9a4..0000000
--- a/legacy/Data/Questions/ingsw/0120_44/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0120_44/wrong2.txt b/legacy/Data/Questions/ingsw/0120_44/wrong2.txt
deleted file mode 100644
index 2b6c292..0000000
--- a/legacy/Data/Questions/ingsw/0120_44/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0120_45/quest.txt b/legacy/Data/Questions/ingsw/0120_45/quest.txt
deleted file mode 100644
index 4818a62..0000000
--- a/legacy/Data/Questions/ingsw/0120_45/quest.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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/Questions/ingsw/0120_45/wrong1.txt b/legacy/Data/Questions/ingsw/0120_45/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0120_45/wrong2.txt b/legacy/Data/Questions/ingsw/0120_45/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0120_45/wrong3.txt b/legacy/Data/Questions/ingsw/0120_45/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0120_46/correct.txt b/legacy/Data/Questions/ingsw/0120_46/correct.txt
deleted file mode 100644
index 3fb437d..0000000
--- a/legacy/Data/Questions/ingsw/0120_46/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.56
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_46/quest.txt b/legacy/Data/Questions/ingsw/0120_46/quest.txt
deleted file mode 100644
index 6205846..0000000
--- a/legacy/Data/Questions/ingsw/0120_46/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0120_46/wrong1.txt b/legacy/Data/Questions/ingsw/0120_46/wrong1.txt
deleted file mode 100644
index c64601b..0000000
--- a/legacy/Data/Questions/ingsw/0120_46/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.14
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_46/wrong2.txt b/legacy/Data/Questions/ingsw/0120_46/wrong2.txt
deleted file mode 100644
index fc54e00..0000000
--- a/legacy/Data/Questions/ingsw/0120_46/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.24
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_47/correct.txt b/legacy/Data/Questions/ingsw/0120_47/correct.txt
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/Questions/ingsw/0120_47/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_47/quest.txt b/legacy/Data/Questions/ingsw/0120_47/quest.txt
deleted file mode 100644
index 7710e8f..0000000
--- a/legacy/Data/Questions/ingsw/0120_47/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_47/wrong1.txt b/legacy/Data/Questions/ingsw/0120_47/wrong1.txt
deleted file mode 100644
index 9e12d11..0000000
--- a/legacy/Data/Questions/ingsw/0120_47/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_47/wrong2.txt b/legacy/Data/Questions/ingsw/0120_47/wrong2.txt
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/Questions/ingsw/0120_47/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_48/correct.txt b/legacy/Data/Questions/ingsw/0120_48/correct.txt
deleted file mode 100644
index 519c7fd..0000000
--- a/legacy/Data/Questions/ingsw/0120_48/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_48/quest.txt b/legacy/Data/Questions/ingsw/0120_48/quest.txt
deleted file mode 100644
index 22c683f..0000000
--- a/legacy/Data/Questions/ingsw/0120_48/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0120_48/wrong1.txt b/legacy/Data/Questions/ingsw/0120_48/wrong1.txt
deleted file mode 100644
index 5229f7e..0000000
--- a/legacy/Data/Questions/ingsw/0120_48/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_48/wrong2.txt b/legacy/Data/Questions/ingsw/0120_48/wrong2.txt
deleted file mode 100644
index c2e617d..0000000
--- a/legacy/Data/Questions/ingsw/0120_48/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_49/correct.txt b/legacy/Data/Questions/ingsw/0120_49/correct.txt
deleted file mode 100644
index 2a2ecea..0000000
--- a/legacy/Data/Questions/ingsw/0120_49/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-time(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_49/quest.txt b/legacy/Data/Questions/ingsw/0120_49/quest.txt
deleted file mode 100644
index 2d6940a..0000000
--- a/legacy/Data/Questions/ingsw/0120_49/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0120_49/wrong1.txt b/legacy/Data/Questions/ingsw/0120_49/wrong1.txt
deleted file mode 100644
index d68fd15..0000000
--- a/legacy/Data/Questions/ingsw/0120_49/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-time(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_49/wrong2.txt b/legacy/Data/Questions/ingsw/0120_49/wrong2.txt
deleted file mode 100644
index 9927a93..0000000
--- a/legacy/Data/Questions/ingsw/0120_49/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-time(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_5/quest.txt b/legacy/Data/Questions/ingsw/0120_5/quest.txt
deleted file mode 100644
index 3e68301..0000000
--- a/legacy/Data/Questions/ingsw/0120_5/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0120_5/wrong1.txt b/legacy/Data/Questions/ingsw/0120_5/wrong1.txt
deleted file mode 100644
index 6c46c45..0000000
--- a/legacy/Data/Questions/ingsw/0120_5/wrong1.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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/Questions/ingsw/0120_5/wrong2.txt b/legacy/Data/Questions/ingsw/0120_5/wrong2.txt
deleted file mode 100644
index 39e7bfc..0000000
--- a/legacy/Data/Questions/ingsw/0120_5/wrong2.txt
+++ /dev/null
@@ -1,37 +0,0 @@
-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/Questions/ingsw/0120_5/wrong3.txt b/legacy/Data/Questions/ingsw/0120_5/wrong3.txt
deleted file mode 100644
index 93e29a3..0000000
--- a/legacy/Data/Questions/ingsw/0120_5/wrong3.txt
+++ /dev/null
@@ -1,28 +0,0 @@
-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/Questions/ingsw/0120_6/correct.txt b/legacy/Data/Questions/ingsw/0120_6/correct.txt
deleted file mode 100644
index 7c149d8..0000000
--- a/legacy/Data/Questions/ingsw/0120_6/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_6/quest.txt b/legacy/Data/Questions/ingsw/0120_6/quest.txt
deleted file mode 100644
index 8bba4b8..0000000
--- a/legacy/Data/Questions/ingsw/0120_6/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0120_6/wrong1.txt b/legacy/Data/Questions/ingsw/0120_6/wrong1.txt
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/Questions/ingsw/0120_6/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_6/wrong2.txt b/legacy/Data/Questions/ingsw/0120_6/wrong2.txt
deleted file mode 100644
index 3461684..0000000
--- a/legacy/Data/Questions/ingsw/0120_6/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che per ogni requisito sia stato implementato nel sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_7/correct.txt b/legacy/Data/Questions/ingsw/0120_7/correct.txt
deleted file mode 100644
index b559d4a..0000000
--- a/legacy/Data/Questions/ingsw/0120_7/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_7/quest.txt b/legacy/Data/Questions/ingsw/0120_7/quest.txt
deleted file mode 100644
index 031c331..0000000
--- a/legacy/Data/Questions/ingsw/0120_7/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0120_7/wrong1.txt b/legacy/Data/Questions/ingsw/0120_7/wrong1.txt
deleted file mode 100644
index 4b8db59..0000000
--- a/legacy/Data/Questions/ingsw/0120_7/wrong1.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_7/wrong2.txt b/legacy/Data/Questions/ingsw/0120_7/wrong2.txt
deleted file mode 100644
index 05ce544..0000000
--- a/legacy/Data/Questions/ingsw/0120_7/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0120_8/correct.txt b/legacy/Data/Questions/ingsw/0120_8/correct.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/0120_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_8/quest.txt b/legacy/Data/Questions/ingsw/0120_8/quest.txt
deleted file mode 100644
index 2809138..0000000
--- a/legacy/Data/Questions/ingsw/0120_8/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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/Questions/ingsw/0120_8/wrong1.txt b/legacy/Data/Questions/ingsw/0120_8/wrong1.txt
deleted file mode 100644
index 1a8a508..0000000
--- a/legacy/Data/Questions/ingsw/0120_8/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_8/wrong2.txt b/legacy/Data/Questions/ingsw/0120_8/wrong2.txt
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/Questions/ingsw/0120_8/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_9/correct.txt b/legacy/Data/Questions/ingsw/0120_9/correct.txt
deleted file mode 100644
index ce9968f..0000000
--- a/legacy/Data/Questions/ingsw/0120_9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.28
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_9/quest.txt b/legacy/Data/Questions/ingsw/0120_9/quest.txt
deleted file mode 100644
index 4962ecf..0000000
--- a/legacy/Data/Questions/ingsw/0120_9/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0120_9/wrong1.txt b/legacy/Data/Questions/ingsw/0120_9/wrong1.txt
deleted file mode 100644
index e8f9017..0000000
--- a/legacy/Data/Questions/ingsw/0120_9/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.42
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0120_9/wrong2.txt b/legacy/Data/Questions/ingsw/0120_9/wrong2.txt
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/Questions/ingsw/0120_9/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.12
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0121_34/correct.txt b/legacy/Data/Questions/ingsw/0121_34/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0121_34/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0121_34/quest.txt b/legacy/Data/Questions/ingsw/0121_34/quest.txt
deleted file mode 100644
index 6dbca93..0000000
--- a/legacy/Data/Questions/ingsw/0121_34/quest.txt
+++ /dev/null
@@ -1,53 +0,0 @@
-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 <stdio.h>
-
-#include <stdlib.h>
-
-#include <assert.h>
-
-#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/Questions/ingsw/0121_34/wrong1.txt b/legacy/Data/Questions/ingsw/0121_34/wrong1.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0121_34/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0121_34/wrong2.txt b/legacy/Data/Questions/ingsw/0121_34/wrong2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0121_34/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_0/correct.txt b/legacy/Data/Questions/ingsw/0210_0/correct.txt
deleted file mode 100644
index a40ea7d..0000000
--- a/legacy/Data/Questions/ingsw/0210_0/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0210_0/quest.txt b/legacy/Data/Questions/ingsw/0210_0/quest.txt
deleted file mode 100644
index 2d895ca..0000000
--- a/legacy/Data/Questions/ingsw/0210_0/quest.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-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/Questions/ingsw/0210_0/wrong1.txt b/legacy/Data/Questions/ingsw/0210_0/wrong1.txt
deleted file mode 100644
index abe0eaa..0000000
--- a/legacy/Data/Questions/ingsw/0210_0/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0210_0/wrong2.txt b/legacy/Data/Questions/ingsw/0210_0/wrong2.txt
deleted file mode 100644
index 5b77112..0000000
--- a/legacy/Data/Questions/ingsw/0210_0/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0210_1/quest.txt b/legacy/Data/Questions/ingsw/0210_1/quest.txt
deleted file mode 100644
index 89110fc..0000000
--- a/legacy/Data/Questions/ingsw/0210_1/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0210_1/wrong1.txt b/legacy/Data/Questions/ingsw/0210_1/wrong1.txt
deleted file mode 100644
index 0487745..0000000
--- a/legacy/Data/Questions/ingsw/0210_1/wrong1.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0210_1/wrong2.txt b/legacy/Data/Questions/ingsw/0210_1/wrong2.txt
deleted file mode 100644
index 6b9f4b0..0000000
--- a/legacy/Data/Questions/ingsw/0210_1/wrong2.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-output4);
-connect(sc1.output4, sc2.input4);
-connect(sc1.input5, sc
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_1/wrong3.txt b/legacy/Data/Questions/ingsw/0210_1/wrong3.txt
deleted file mode 100644
index bf32c35..0000000
--- a/legacy/Data/Questions/ingsw/0210_1/wrong3.txt
+++ /dev/null
@@ -1,40 +0,0 @@
-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/Questions/ingsw/0210_10/correct.txt b/legacy/Data/Questions/ingsw/0210_10/correct.txt
deleted file mode 100644
index ddb0d65..0000000
--- a/legacy/Data/Questions/ingsw/0210_10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_10/quest.txt b/legacy/Data/Questions/ingsw/0210_10/quest.txt
deleted file mode 100644
index d1cf8cb..0000000
--- a/legacy/Data/Questions/ingsw/0210_10/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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;
-</pre>
-Quale delle seguenti affermazioni meglio descrive il requisito monitorato.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_10/wrong1.txt b/legacy/Data/Questions/ingsw/0210_10/wrong1.txt
deleted file mode 100644
index 7c7a691..0000000
--- a/legacy/Data/Questions/ingsw/0210_10/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variable x è minore di 0.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_10/wrong2.txt b/legacy/Data/Questions/ingsw/0210_10/wrong2.txt
deleted file mode 100644
index 3e05ae7..0000000
--- a/legacy/Data/Questions/ingsw/0210_10/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è fuori dall'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_11/quest.txt b/legacy/Data/Questions/ingsw/0210_11/quest.txt
deleted file mode 100644
index 57dc789..0000000
--- a/legacy/Data/Questions/ingsw/0210_11/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0210_11/wrong1.txt b/legacy/Data/Questions/ingsw/0210_11/wrong1.txt
deleted file mode 100644
index 157d205..0000000
--- a/legacy/Data/Questions/ingsw/0210_11/wrong1.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0210_11/wrong2.txt b/legacy/Data/Questions/ingsw/0210_11/wrong2.txt
deleted file mode 100644
index 04886bb..0000000
--- a/legacy/Data/Questions/ingsw/0210_11/wrong2.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0210_11/wrong3.txt b/legacy/Data/Questions/ingsw/0210_11/wrong3.txt
deleted file mode 100644
index 903ba76..0000000
--- a/legacy/Data/Questions/ingsw/0210_11/wrong3.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0210_12/quest.txt b/legacy/Data/Questions/ingsw/0210_12/quest.txt
deleted file mode 100644
index 86ee3d4..0000000
--- a/legacy/Data/Questions/ingsw/0210_12/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0210_12/wrong1.txt b/legacy/Data/Questions/ingsw/0210_12/wrong1.txt
deleted file mode 100644
index c7f67fe..0000000
--- a/legacy/Data/Questions/ingsw/0210_12/wrong1.txt
+++ /dev/null
@@ -1,38 +0,0 @@
-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/Questions/ingsw/0210_12/wrong2.txt b/legacy/Data/Questions/ingsw/0210_12/wrong2.txt
deleted file mode 100644
index b84dfd6..0000000
--- a/legacy/Data/Questions/ingsw/0210_12/wrong2.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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/Questions/ingsw/0210_12/wrong3.txt b/legacy/Data/Questions/ingsw/0210_12/wrong3.txt
deleted file mode 100644
index 162b572..0000000
--- a/legacy/Data/Questions/ingsw/0210_12/wrong3.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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/Questions/ingsw/0210_13/correct.txt b/legacy/Data/Questions/ingsw/0210_13/correct.txt
deleted file mode 100644
index 25ac15c..0000000
--- a/legacy/Data/Questions/ingsw/0210_13/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0210_13/quest.txt b/legacy/Data/Questions/ingsw/0210_13/quest.txt
deleted file mode 100644
index b420aaf..0000000
--- a/legacy/Data/Questions/ingsw/0210_13/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0210_13/wrong1.txt b/legacy/Data/Questions/ingsw/0210_13/wrong1.txt
deleted file mode 100644
index d021c3b..0000000
--- a/legacy/Data/Questions/ingsw/0210_13/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0210_13/wrong2.txt b/legacy/Data/Questions/ingsw/0210_13/wrong2.txt
deleted file mode 100644
index 157567e..0000000
--- a/legacy/Data/Questions/ingsw/0210_13/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0210_14/correct.txt b/legacy/Data/Questions/ingsw/0210_14/correct.txt
deleted file mode 100644
index e74b1fc..0000000
--- a/legacy/Data/Questions/ingsw/0210_14/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_14/quest.txt b/legacy/Data/Questions/ingsw/0210_14/quest.txt
deleted file mode 100644
index c1cd6d0..0000000
--- a/legacy/Data/Questions/ingsw/0210_14/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0210_14/wrong1.txt b/legacy/Data/Questions/ingsw/0210_14/wrong1.txt
deleted file mode 100644
index d63544a..0000000
--- a/legacy/Data/Questions/ingsw/0210_14/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_14/wrong2.txt b/legacy/Data/Questions/ingsw/0210_14/wrong2.txt
deleted file mode 100644
index 1753a91..0000000
--- a/legacy/Data/Questions/ingsw/0210_14/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-F(x, y, z) = (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_15/correct.txt b/legacy/Data/Questions/ingsw/0210_15/correct.txt
deleted file mode 100644
index 519c7fd..0000000
--- a/legacy/Data/Questions/ingsw/0210_15/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0210_15/quest.txt b/legacy/Data/Questions/ingsw/0210_15/quest.txt
deleted file mode 100644
index 22c683f..0000000
--- a/legacy/Data/Questions/ingsw/0210_15/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0210_15/wrong1.txt b/legacy/Data/Questions/ingsw/0210_15/wrong1.txt
deleted file mode 100644
index 5229f7e..0000000
--- a/legacy/Data/Questions/ingsw/0210_15/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0210_15/wrong2.txt b/legacy/Data/Questions/ingsw/0210_15/wrong2.txt
deleted file mode 100644
index 2029293..0000000
--- a/legacy/Data/Questions/ingsw/0210_15/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_16/correct.txt b/legacy/Data/Questions/ingsw/0210_16/correct.txt
deleted file mode 100644
index 293ebbc..0000000
--- a/legacy/Data/Questions/ingsw/0210_16/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_16/quest.txt b/legacy/Data/Questions/ingsw/0210_16/quest.txt
deleted file mode 100644
index 5922b9f..0000000
--- a/legacy/Data/Questions/ingsw/0210_16/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0210_16/wrong1.txt b/legacy/Data/Questions/ingsw/0210_16/wrong1.txt
deleted file mode 100644
index d7890b2..0000000
--- a/legacy/Data/Questions/ingsw/0210_16/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_16/wrong2.txt b/legacy/Data/Questions/ingsw/0210_16/wrong2.txt
deleted file mode 100644
index d50b268..0000000
--- a/legacy/Data/Questions/ingsw/0210_16/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_17/correct.txt b/legacy/Data/Questions/ingsw/0210_17/correct.txt
deleted file mode 100644
index 2ca9276..0000000
--- a/legacy/Data/Questions/ingsw/0210_17/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 35%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_17/quest.txt b/legacy/Data/Questions/ingsw/0210_17/quest.txt
deleted file mode 100644
index 5fa40ee..0000000
--- a/legacy/Data/Questions/ingsw/0210_17/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0210_17/wrong1.txt b/legacy/Data/Questions/ingsw/0210_17/wrong1.txt
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/Questions/ingsw/0210_17/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_17/wrong2.txt b/legacy/Data/Questions/ingsw/0210_17/wrong2.txt
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/Questions/ingsw/0210_17/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_18/correct.txt b/legacy/Data/Questions/ingsw/0210_18/correct.txt
deleted file mode 100644
index 1a8a50a..0000000
--- a/legacy/Data/Questions/ingsw/0210_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_18/quest.txt b/legacy/Data/Questions/ingsw/0210_18/quest.txt
deleted file mode 100644
index 793b220..0000000
--- a/legacy/Data/Questions/ingsw/0210_18/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_18/wrong1.txt b/legacy/Data/Questions/ingsw/0210_18/wrong1.txt
deleted file mode 100644
index fac8307..0000000
--- a/legacy/Data/Questions/ingsw/0210_18/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_18/wrong2.txt b/legacy/Data/Questions/ingsw/0210_18/wrong2.txt
deleted file mode 100644
index 3fdb31e..0000000
--- a/legacy/Data/Questions/ingsw/0210_18/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_19/correct.txt b/legacy/Data/Questions/ingsw/0210_19/correct.txt
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/Questions/ingsw/0210_19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_19/quest.txt b/legacy/Data/Questions/ingsw/0210_19/quest.txt
deleted file mode 100644
index e786bcf..0000000
--- a/legacy/Data/Questions/ingsw/0210_19/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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/Questions/ingsw/0210_19/wrong1.txt b/legacy/Data/Questions/ingsw/0210_19/wrong1.txt
deleted file mode 100644
index 1c07658..0000000
--- a/legacy/Data/Questions/ingsw/0210_19/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_19/wrong2.txt b/legacy/Data/Questions/ingsw/0210_19/wrong2.txt
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/Questions/ingsw/0210_19/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_2/quest.txt b/legacy/Data/Questions/ingsw/0210_2/quest.txt
deleted file mode 100644
index f9f8976..0000000
--- a/legacy/Data/Questions/ingsw/0210_2/quest.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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/Questions/ingsw/0210_2/wrong1.txt b/legacy/Data/Questions/ingsw/0210_2/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0210_2/wrong2.txt b/legacy/Data/Questions/ingsw/0210_2/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0210_2/wrong3.txt b/legacy/Data/Questions/ingsw/0210_2/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0210_20/correct.txt b/legacy/Data/Questions/ingsw/0210_20/correct.txt
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/Questions/ingsw/0210_20/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_20/quest.txt b/legacy/Data/Questions/ingsw/0210_20/quest.txt
deleted file mode 100644
index 7710e8f..0000000
--- a/legacy/Data/Questions/ingsw/0210_20/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_20/wrong1.txt b/legacy/Data/Questions/ingsw/0210_20/wrong1.txt
deleted file mode 100644
index 9e12d11..0000000
--- a/legacy/Data/Questions/ingsw/0210_20/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_20/wrong2.txt b/legacy/Data/Questions/ingsw/0210_20/wrong2.txt
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/Questions/ingsw/0210_20/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_21/correct.txt b/legacy/Data/Questions/ingsw/0210_21/correct.txt
deleted file mode 100644
index ad21063..0000000
--- a/legacy/Data/Questions/ingsw/0210_21/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_21/quest.txt b/legacy/Data/Questions/ingsw/0210_21/quest.txt
deleted file mode 100644
index 031c331..0000000
--- a/legacy/Data/Questions/ingsw/0210_21/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0210_21/wrong1.txt b/legacy/Data/Questions/ingsw/0210_21/wrong1.txt
deleted file mode 100644
index b14ac60..0000000
--- a/legacy/Data/Questions/ingsw/0210_21/wrong1.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_21/wrong2.txt b/legacy/Data/Questions/ingsw/0210_21/wrong2.txt
deleted file mode 100644
index e4201ab..0000000
--- a/legacy/Data/Questions/ingsw/0210_21/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_22/correct.txt b/legacy/Data/Questions/ingsw/0210_22/correct.txt
deleted file mode 100644
index a7029bc..0000000
--- a/legacy/Data/Questions/ingsw/0210_22/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [1, 4] oppure nell'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_22/quest.txt b/legacy/Data/Questions/ingsw/0210_22/quest.txt
deleted file mode 100644
index e5fbc81..0000000
--- a/legacy/Data/Questions/ingsw/0210_22/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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;
-</pre>
-Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_22/wrong1.txt b/legacy/Data/Questions/ingsw/0210_22/wrong1.txt
deleted file mode 100644
index 710b111..0000000
--- a/legacy/Data/Questions/ingsw/0210_22/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_22/wrong2.txt b/legacy/Data/Questions/ingsw/0210_22/wrong2.txt
deleted file mode 100644
index a82929b..0000000
--- a/legacy/Data/Questions/ingsw/0210_22/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_23/correct.txt b/legacy/Data/Questions/ingsw/0210_23/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0210_23/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_23/quest.txt b/legacy/Data/Questions/ingsw/0210_23/quest.txt
deleted file mode 100644
index adede32..0000000
--- a/legacy/Data/Questions/ingsw/0210_23/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0210_23/wrong1.txt b/legacy/Data/Questions/ingsw/0210_23/wrong1.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0210_23/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_23/wrong2.txt b/legacy/Data/Questions/ingsw/0210_23/wrong2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0210_23/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_24/correct.txt b/legacy/Data/Questions/ingsw/0210_24/correct.txt
deleted file mode 100644
index 2a2ecea..0000000
--- a/legacy/Data/Questions/ingsw/0210_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-time(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_24/quest.txt b/legacy/Data/Questions/ingsw/0210_24/quest.txt
deleted file mode 100644
index d188da2..0000000
--- a/legacy/Data/Questions/ingsw/0210_24/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0210_24/wrong1.txt b/legacy/Data/Questions/ingsw/0210_24/wrong1.txt
deleted file mode 100644
index 9927a93..0000000
--- a/legacy/Data/Questions/ingsw/0210_24/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-time(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_24/wrong2.txt b/legacy/Data/Questions/ingsw/0210_24/wrong2.txt
deleted file mode 100644
index d68fd15..0000000
--- a/legacy/Data/Questions/ingsw/0210_24/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-time(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_25/correct.txt b/legacy/Data/Questions/ingsw/0210_25/correct.txt
deleted file mode 100644
index 43dc0c9..0000000
--- a/legacy/Data/Questions/ingsw/0210_25/correct.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0210_25/quest.txt b/legacy/Data/Questions/ingsw/0210_25/quest.txt
deleted file mode 100644
index f6744fd..0000000
--- a/legacy/Data/Questions/ingsw/0210_25/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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/Questions/ingsw/0210_25/wrong1.txt b/legacy/Data/Questions/ingsw/0210_25/wrong1.txt
deleted file mode 100644
index 6a97baf..0000000
--- a/legacy/Data/Questions/ingsw/0210_25/wrong1.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0210_25/wrong2.txt b/legacy/Data/Questions/ingsw/0210_25/wrong2.txt
deleted file mode 100644
index 3f63933..0000000
--- a/legacy/Data/Questions/ingsw/0210_25/wrong2.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0210_26/correct.txt b/legacy/Data/Questions/ingsw/0210_26/correct.txt
deleted file mode 100644
index b9f32a6..0000000
--- a/legacy/Data/Questions/ingsw/0210_26/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-c(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_26/quest.txt b/legacy/Data/Questions/ingsw/0210_26/quest.txt
deleted file mode 100644
index d318528..0000000
--- a/legacy/Data/Questions/ingsw/0210_26/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0210_26/wrong1.txt b/legacy/Data/Questions/ingsw/0210_26/wrong1.txt
deleted file mode 100644
index 3143da9..0000000
--- a/legacy/Data/Questions/ingsw/0210_26/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-c(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_26/wrong2.txt b/legacy/Data/Questions/ingsw/0210_26/wrong2.txt
deleted file mode 100644
index 70022eb..0000000
--- a/legacy/Data/Questions/ingsw/0210_26/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-c(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_27/quest.txt b/legacy/Data/Questions/ingsw/0210_27/quest.txt
deleted file mode 100644
index 75e942b..0000000
--- a/legacy/Data/Questions/ingsw/0210_27/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0210_27/wrong1.txt b/legacy/Data/Questions/ingsw/0210_27/wrong1.txt
deleted file mode 100644
index c296b22..0000000
--- a/legacy/Data/Questions/ingsw/0210_27/wrong1.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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/Questions/ingsw/0210_27/wrong2.txt b/legacy/Data/Questions/ingsw/0210_27/wrong2.txt
deleted file mode 100644
index d21df5d..0000000
--- a/legacy/Data/Questions/ingsw/0210_27/wrong2.txt
+++ /dev/null
@@ -1,32 +0,0 @@
-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/Questions/ingsw/0210_27/wrong3.txt b/legacy/Data/Questions/ingsw/0210_27/wrong3.txt
deleted file mode 100644
index 421d23f..0000000
--- a/legacy/Data/Questions/ingsw/0210_27/wrong3.txt
+++ /dev/null
@@ -1,37 +0,0 @@
-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/Questions/ingsw/0210_28/quest.txt b/legacy/Data/Questions/ingsw/0210_28/quest.txt
deleted file mode 100644
index 932f11d..0000000
--- a/legacy/Data/Questions/ingsw/0210_28/quest.txt
+++ /dev/null
@@ -1,38 +0,0 @@
-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/Questions/ingsw/0210_28/wrong1.txt b/legacy/Data/Questions/ingsw/0210_28/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0210_28/wrong2.txt b/legacy/Data/Questions/ingsw/0210_28/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0210_28/wrong3.txt b/legacy/Data/Questions/ingsw/0210_28/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0210_29/correct.txt b/legacy/Data/Questions/ingsw/0210_29/correct.txt
deleted file mode 100644
index 0902686..0000000
--- a/legacy/Data/Questions/ingsw/0210_29/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requisito funzionale.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_29/quest.txt b/legacy/Data/Questions/ingsw/0210_29/quest.txt
deleted file mode 100644
index f6839df..0000000
--- a/legacy/Data/Questions/ingsw/0210_29/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-"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/Questions/ingsw/0210_29/wrong1.txt b/legacy/Data/Questions/ingsw/0210_29/wrong1.txt
deleted file mode 100644
index 6084c49..0000000
--- a/legacy/Data/Questions/ingsw/0210_29/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requisito non-funzionale.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_29/wrong2.txt b/legacy/Data/Questions/ingsw/0210_29/wrong2.txt
deleted file mode 100644
index 396c8d3..0000000
--- a/legacy/Data/Questions/ingsw/0210_29/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requisito di performance.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_3/quest.txt b/legacy/Data/Questions/ingsw/0210_3/quest.txt
deleted file mode 100644
index 985c244..0000000
--- a/legacy/Data/Questions/ingsw/0210_3/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0210_3/wrong1.txt b/legacy/Data/Questions/ingsw/0210_3/wrong1.txt
deleted file mode 100644
index ed5ad19..0000000
--- a/legacy/Data/Questions/ingsw/0210_3/wrong1.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-#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/Questions/ingsw/0210_3/wrong2.txt b/legacy/Data/Questions/ingsw/0210_3/wrong2.txt
deleted file mode 100644
index 69b9722..0000000
--- a/legacy/Data/Questions/ingsw/0210_3/wrong2.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-#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/Questions/ingsw/0210_3/wrong3.txt b/legacy/Data/Questions/ingsw/0210_3/wrong3.txt
deleted file mode 100644
index a26ce6e..0000000
--- a/legacy/Data/Questions/ingsw/0210_3/wrong3.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-#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/Questions/ingsw/0210_30/correct.txt b/legacy/Data/Questions/ingsw/0210_30/correct.txt
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/Questions/ingsw/0210_30/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_30/quest.txt b/legacy/Data/Questions/ingsw/0210_30/quest.txt
deleted file mode 100644
index a27fc55..0000000
--- a/legacy/Data/Questions/ingsw/0210_30/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0210_30/wrong1.txt b/legacy/Data/Questions/ingsw/0210_30/wrong1.txt
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/Questions/ingsw/0210_30/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_30/wrong2.txt b/legacy/Data/Questions/ingsw/0210_30/wrong2.txt
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/Questions/ingsw/0210_30/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_31/correct.txt b/legacy/Data/Questions/ingsw/0210_31/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0210_31/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_31/quest.txt b/legacy/Data/Questions/ingsw/0210_31/quest.txt
deleted file mode 100644
index 65cfd2d..0000000
--- a/legacy/Data/Questions/ingsw/0210_31/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0210_31/wrong1.txt b/legacy/Data/Questions/ingsw/0210_31/wrong1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0210_31/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_31/wrong2.txt b/legacy/Data/Questions/ingsw/0210_31/wrong2.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0210_31/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_32/correct.txt b/legacy/Data/Questions/ingsw/0210_32/correct.txt
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/Questions/ingsw/0210_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_32/quest.txt b/legacy/Data/Questions/ingsw/0210_32/quest.txt
deleted file mode 100644
index cb591da..0000000
--- a/legacy/Data/Questions/ingsw/0210_32/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0210_32/wrong1.txt b/legacy/Data/Questions/ingsw/0210_32/wrong1.txt
deleted file mode 100644
index 1c07658..0000000
--- a/legacy/Data/Questions/ingsw/0210_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_32/wrong2.txt b/legacy/Data/Questions/ingsw/0210_32/wrong2.txt
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/Questions/ingsw/0210_32/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_33/correct.txt b/legacy/Data/Questions/ingsw/0210_33/correct.txt
deleted file mode 100644
index 1c7da8c..0000000
--- a/legacy/Data/Questions/ingsw/0210_33/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.03
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_33/quest.txt b/legacy/Data/Questions/ingsw/0210_33/quest.txt
deleted file mode 100644
index cf9113a..0000000
--- a/legacy/Data/Questions/ingsw/0210_33/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0210_33/wrong1.txt b/legacy/Data/Questions/ingsw/0210_33/wrong1.txt
deleted file mode 100644
index 7eb6830..0000000
--- a/legacy/Data/Questions/ingsw/0210_33/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.27
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_33/wrong2.txt b/legacy/Data/Questions/ingsw/0210_33/wrong2.txt
deleted file mode 100644
index 8a346b7..0000000
--- a/legacy/Data/Questions/ingsw/0210_33/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.07
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_34/quest.txt b/legacy/Data/Questions/ingsw/0210_34/quest.txt
deleted file mode 100644
index 33e1f49..0000000
--- a/legacy/Data/Questions/ingsw/0210_34/quest.txt
+++ /dev/null
@@ -1,34 +0,0 @@
-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/Questions/ingsw/0210_34/wrong1.txt b/legacy/Data/Questions/ingsw/0210_34/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0210_34/wrong2.txt b/legacy/Data/Questions/ingsw/0210_34/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0210_34/wrong3.txt b/legacy/Data/Questions/ingsw/0210_34/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0210_35/correct.txt b/legacy/Data/Questions/ingsw/0210_35/correct.txt
deleted file mode 100644
index 7c149d8..0000000
--- a/legacy/Data/Questions/ingsw/0210_35/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_35/quest.txt b/legacy/Data/Questions/ingsw/0210_35/quest.txt
deleted file mode 100644
index 8bba4b8..0000000
--- a/legacy/Data/Questions/ingsw/0210_35/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_35/wrong1.txt b/legacy/Data/Questions/ingsw/0210_35/wrong1.txt
deleted file mode 100644
index 3461684..0000000
--- a/legacy/Data/Questions/ingsw/0210_35/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che per ogni requisito sia stato implementato nel sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_35/wrong2.txt b/legacy/Data/Questions/ingsw/0210_35/wrong2.txt
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/Questions/ingsw/0210_35/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_36/correct.txt b/legacy/Data/Questions/ingsw/0210_36/correct.txt
deleted file mode 100644
index 3f63933..0000000
--- a/legacy/Data/Questions/ingsw/0210_36/correct.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0210_36/quest.txt b/legacy/Data/Questions/ingsw/0210_36/quest.txt
deleted file mode 100644
index 595ab5d..0000000
--- a/legacy/Data/Questions/ingsw/0210_36/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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/Questions/ingsw/0210_36/wrong1.txt b/legacy/Data/Questions/ingsw/0210_36/wrong1.txt
deleted file mode 100644
index 6a97baf..0000000
--- a/legacy/Data/Questions/ingsw/0210_36/wrong1.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0210_36/wrong2.txt b/legacy/Data/Questions/ingsw/0210_36/wrong2.txt
deleted file mode 100644
index e607157..0000000
--- a/legacy/Data/Questions/ingsw/0210_36/wrong2.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0210_37/quest.txt b/legacy/Data/Questions/ingsw/0210_37/quest.txt
deleted file mode 100644
index 5743032..0000000
--- a/legacy/Data/Questions/ingsw/0210_37/quest.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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/Questions/ingsw/0210_37/wrong1.txt b/legacy/Data/Questions/ingsw/0210_37/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0210_37/wrong2.txt b/legacy/Data/Questions/ingsw/0210_37/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0210_37/wrong3.txt b/legacy/Data/Questions/ingsw/0210_37/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0210_38/correct.txt b/legacy/Data/Questions/ingsw/0210_38/correct.txt
deleted file mode 100644
index 232aedf..0000000
--- a/legacy/Data/Questions/ingsw/0210_38/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0210_38/quest.txt b/legacy/Data/Questions/ingsw/0210_38/quest.txt
deleted file mode 100644
index b2bed72..0000000
--- a/legacy/Data/Questions/ingsw/0210_38/quest.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-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/Questions/ingsw/0210_38/wrong1.txt b/legacy/Data/Questions/ingsw/0210_38/wrong1.txt
deleted file mode 100644
index 2b6c292..0000000
--- a/legacy/Data/Questions/ingsw/0210_38/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0210_38/wrong2.txt b/legacy/Data/Questions/ingsw/0210_38/wrong2.txt
deleted file mode 100644
index 5d5c9a4..0000000
--- a/legacy/Data/Questions/ingsw/0210_38/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0210_39/correct.txt b/legacy/Data/Questions/ingsw/0210_39/correct.txt
deleted file mode 100644
index 8785661..0000000
--- a/legacy/Data/Questions/ingsw/0210_39/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -50,  x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_39/quest.txt b/legacy/Data/Questions/ingsw/0210_39/quest.txt
deleted file mode 100644
index 36947c2..0000000
--- a/legacy/Data/Questions/ingsw/0210_39/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0210_39/wrong1.txt b/legacy/Data/Questions/ingsw/0210_39/wrong1.txt
deleted file mode 100644
index 0aaedb8..0000000
--- a/legacy/Data/Questions/ingsw/0210_39/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -50,  x = 0, x = 100, x = 500}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_39/wrong2.txt b/legacy/Data/Questions/ingsw/0210_39/wrong2.txt
deleted file mode 100644
index a6df32d..0000000
--- a/legacy/Data/Questions/ingsw/0210_39/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -150,  x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_4/correct.txt b/legacy/Data/Questions/ingsw/0210_4/correct.txt
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/Questions/ingsw/0210_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_4/quest.txt b/legacy/Data/Questions/ingsw/0210_4/quest.txt
deleted file mode 100644
index 84d1f53..0000000
--- a/legacy/Data/Questions/ingsw/0210_4/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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/Questions/ingsw/0210_4/wrong1.txt b/legacy/Data/Questions/ingsw/0210_4/wrong1.txt
deleted file mode 100644
index 1a8a508..0000000
--- a/legacy/Data/Questions/ingsw/0210_4/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_4/wrong2.txt b/legacy/Data/Questions/ingsw/0210_4/wrong2.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/0210_4/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_40/correct.txt b/legacy/Data/Questions/ingsw/0210_40/correct.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/0210_40/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_40/quest.txt b/legacy/Data/Questions/ingsw/0210_40/quest.txt
deleted file mode 100644
index a550159..0000000
--- a/legacy/Data/Questions/ingsw/0210_40/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0210_40/wrong1.txt b/legacy/Data/Questions/ingsw/0210_40/wrong1.txt
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/Questions/ingsw/0210_40/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_40/wrong2.txt b/legacy/Data/Questions/ingsw/0210_40/wrong2.txt
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/Questions/ingsw/0210_40/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_41/correct.txt b/legacy/Data/Questions/ingsw/0210_41/correct.txt
deleted file mode 100644
index 5f76c88..0000000
--- a/legacy/Data/Questions/ingsw/0210_41/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 45%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_41/quest.txt b/legacy/Data/Questions/ingsw/0210_41/quest.txt
deleted file mode 100644
index cdbd481..0000000
--- a/legacy/Data/Questions/ingsw/0210_41/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0210_41/wrong1.txt b/legacy/Data/Questions/ingsw/0210_41/wrong1.txt
deleted file mode 100644
index 2ca9276..0000000
--- a/legacy/Data/Questions/ingsw/0210_41/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 35%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_41/wrong2.txt b/legacy/Data/Questions/ingsw/0210_41/wrong2.txt
deleted file mode 100644
index c376ef7..0000000
--- a/legacy/Data/Questions/ingsw/0210_41/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 55%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_42/quest.txt b/legacy/Data/Questions/ingsw/0210_42/quest.txt
deleted file mode 100644
index 8e91c31..0000000
--- a/legacy/Data/Questions/ingsw/0210_42/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0210_42/wrong1.txt b/legacy/Data/Questions/ingsw/0210_42/wrong1.txt
deleted file mode 100644
index 512c141..0000000
--- a/legacy/Data/Questions/ingsw/0210_42/wrong1.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0210_42/wrong2.txt b/legacy/Data/Questions/ingsw/0210_42/wrong2.txt
deleted file mode 100644
index 77d39c1..0000000
--- a/legacy/Data/Questions/ingsw/0210_42/wrong2.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-output1);
-connect(sc1.output1, sc2.input1);
-connect(sc1.input2, sc
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_42/wrong3.txt b/legacy/Data/Questions/ingsw/0210_42/wrong3.txt
deleted file mode 100644
index b9a8baf..0000000
--- a/legacy/Data/Questions/ingsw/0210_42/wrong3.txt
+++ /dev/null
@@ -1,39 +0,0 @@
-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/Questions/ingsw/0210_43/correct.txt b/legacy/Data/Questions/ingsw/0210_43/correct.txt
deleted file mode 100644
index 4c75070..0000000
--- a/legacy/Data/Questions/ingsw/0210_43/correct.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_43/quest.txt b/legacy/Data/Questions/ingsw/0210_43/quest.txt
deleted file mode 100644
index e11a044..0000000
--- a/legacy/Data/Questions/ingsw/0210_43/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0210_43/wrong1.txt b/legacy/Data/Questions/ingsw/0210_43/wrong1.txt
deleted file mode 100644
index 6dafe94..0000000
--- a/legacy/Data/Questions/ingsw/0210_43/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_43/wrong2.txt b/legacy/Data/Questions/ingsw/0210_43/wrong2.txt
deleted file mode 100644
index a3d79a4..0000000
--- a/legacy/Data/Questions/ingsw/0210_43/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_44/quest.txt b/legacy/Data/Questions/ingsw/0210_44/quest.txt
deleted file mode 100644
index 5c4c81d..0000000
--- a/legacy/Data/Questions/ingsw/0210_44/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0210_44/wrong1.txt b/legacy/Data/Questions/ingsw/0210_44/wrong1.txt
deleted file mode 100644
index 421b38f..0000000
--- a/legacy/Data/Questions/ingsw/0210_44/wrong1.txt
+++ /dev/null
@@ -1,34 +0,0 @@
-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/Questions/ingsw/0210_44/wrong2.txt b/legacy/Data/Questions/ingsw/0210_44/wrong2.txt
deleted file mode 100644
index f385f1c..0000000
--- a/legacy/Data/Questions/ingsw/0210_44/wrong2.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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/Questions/ingsw/0210_44/wrong3.txt b/legacy/Data/Questions/ingsw/0210_44/wrong3.txt
deleted file mode 100644
index 1034e02..0000000
--- a/legacy/Data/Questions/ingsw/0210_44/wrong3.txt
+++ /dev/null
@@ -1,32 +0,0 @@
-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/Questions/ingsw/0210_45/correct.txt b/legacy/Data/Questions/ingsw/0210_45/correct.txt
deleted file mode 100644
index 4a8e634..0000000
--- a/legacy/Data/Questions/ingsw/0210_45/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_45/quest.txt b/legacy/Data/Questions/ingsw/0210_45/quest.txt
deleted file mode 100644
index 576af1a..0000000
--- a/legacy/Data/Questions/ingsw/0210_45/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0210_45/wrong1.txt b/legacy/Data/Questions/ingsw/0210_45/wrong1.txt
deleted file mode 100644
index 68aa37a..0000000
--- a/legacy/Data/Questions/ingsw/0210_45/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_45/wrong2.txt b/legacy/Data/Questions/ingsw/0210_45/wrong2.txt
deleted file mode 100644
index a43796b..0000000
--- a/legacy/Data/Questions/ingsw/0210_45/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_46/correct.txt b/legacy/Data/Questions/ingsw/0210_46/correct.txt
deleted file mode 100644
index 001b1d9..0000000
--- a/legacy/Data/Questions/ingsw/0210_46/correct.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0210_46/quest.txt b/legacy/Data/Questions/ingsw/0210_46/quest.txt
deleted file mode 100644
index 9f5199d..0000000
--- a/legacy/Data/Questions/ingsw/0210_46/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0210_46/wrong1.txt b/legacy/Data/Questions/ingsw/0210_46/wrong1.txt
deleted file mode 100644
index fc95495..0000000
--- a/legacy/Data/Questions/ingsw/0210_46/wrong1.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0210_46/wrong2.txt b/legacy/Data/Questions/ingsw/0210_46/wrong2.txt
deleted file mode 100644
index eaf9272..0000000
--- a/legacy/Data/Questions/ingsw/0210_46/wrong2.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0210_47/correct.txt b/legacy/Data/Questions/ingsw/0210_47/correct.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0210_47/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_47/quest.txt b/legacy/Data/Questions/ingsw/0210_47/quest.txt
deleted file mode 100644
index 4344b75..0000000
--- a/legacy/Data/Questions/ingsw/0210_47/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/0210_47/wrong1.txt b/legacy/Data/Questions/ingsw/0210_47/wrong1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0210_47/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_47/wrong2.txt b/legacy/Data/Questions/ingsw/0210_47/wrong2.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0210_47/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_48/correct.txt b/legacy/Data/Questions/ingsw/0210_48/correct.txt
deleted file mode 100644
index 7311d41..0000000
--- a/legacy/Data/Questions/ingsw/0210_48/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_48/quest.txt b/legacy/Data/Questions/ingsw/0210_48/quest.txt
deleted file mode 100644
index d3a9fe2..0000000
--- a/legacy/Data/Questions/ingsw/0210_48/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/0210_48/wrong1.txt b/legacy/Data/Questions/ingsw/0210_48/wrong1.txt
deleted file mode 100644
index 7e48e4f..0000000
--- a/legacy/Data/Questions/ingsw/0210_48/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_48/wrong2.txt b/legacy/Data/Questions/ingsw/0210_48/wrong2.txt
deleted file mode 100644
index 3e327ab..0000000
--- a/legacy/Data/Questions/ingsw/0210_48/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_49/correct.txt b/legacy/Data/Questions/ingsw/0210_49/correct.txt
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/Questions/ingsw/0210_49/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_49/quest.txt b/legacy/Data/Questions/ingsw/0210_49/quest.txt
deleted file mode 100644
index 8cb7d37..0000000
--- a/legacy/Data/Questions/ingsw/0210_49/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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/Questions/ingsw/0210_49/wrong1.txt b/legacy/Data/Questions/ingsw/0210_49/wrong1.txt
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/Questions/ingsw/0210_49/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_49/wrong2.txt b/legacy/Data/Questions/ingsw/0210_49/wrong2.txt
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/Questions/ingsw/0210_49/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_5/correct.txt b/legacy/Data/Questions/ingsw/0210_5/correct.txt
deleted file mode 100644
index e582263..0000000
--- a/legacy/Data/Questions/ingsw/0210_5/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_5/quest.txt b/legacy/Data/Questions/ingsw/0210_5/quest.txt
deleted file mode 100644
index 864cc93..0000000
--- a/legacy/Data/Questions/ingsw/0210_5/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0210_5/wrong1.txt b/legacy/Data/Questions/ingsw/0210_5/wrong1.txt
deleted file mode 100644
index 0f38391..0000000
--- a/legacy/Data/Questions/ingsw/0210_5/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_5/wrong2.txt b/legacy/Data/Questions/ingsw/0210_5/wrong2.txt
deleted file mode 100644
index 590f7e1..0000000
--- a/legacy/Data/Questions/ingsw/0210_5/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_6/correct.txt b/legacy/Data/Questions/ingsw/0210_6/correct.txt
deleted file mode 100644
index c37d6ae..0000000
--- a/legacy/Data/Questions/ingsw/0210_6/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_6/quest.txt b/legacy/Data/Questions/ingsw/0210_6/quest.txt
deleted file mode 100644
index 003d1dd..0000000
--- a/legacy/Data/Questions/ingsw/0210_6/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0210_6/wrong1.txt b/legacy/Data/Questions/ingsw/0210_6/wrong1.txt
deleted file mode 100644
index 14bd900..0000000
--- a/legacy/Data/Questions/ingsw/0210_6/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_6/wrong2.txt b/legacy/Data/Questions/ingsw/0210_6/wrong2.txt
deleted file mode 100644
index edea147..0000000
--- a/legacy/Data/Questions/ingsw/0210_6/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0210_7/correct.txt b/legacy/Data/Questions/ingsw/0210_7/correct.txt
deleted file mode 100644
index 31a01d5..0000000
--- a/legacy/Data/Questions/ingsw/0210_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_7/quest.txt b/legacy/Data/Questions/ingsw/0210_7/quest.txt
deleted file mode 100644
index d649932..0000000
--- a/legacy/Data/Questions/ingsw/0210_7/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/0210_7/wrong1.txt b/legacy/Data/Questions/ingsw/0210_7/wrong1.txt
deleted file mode 100644
index 549dba8..0000000
--- a/legacy/Data/Questions/ingsw/0210_7/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_7/wrong2.txt b/legacy/Data/Questions/ingsw/0210_7/wrong2.txt
deleted file mode 100644
index 0c564f7..0000000
--- a/legacy/Data/Questions/ingsw/0210_7/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_8/correct.txt b/legacy/Data/Questions/ingsw/0210_8/correct.txt
deleted file mode 100644
index 81a4b93..0000000
--- a/legacy/Data/Questions/ingsw/0210_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_8/quest.txt b/legacy/Data/Questions/ingsw/0210_8/quest.txt
deleted file mode 100644
index 236ccc7..0000000
--- a/legacy/Data/Questions/ingsw/0210_8/quest.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-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/Questions/ingsw/0210_8/wrong1.txt b/legacy/Data/Questions/ingsw/0210_8/wrong1.txt
deleted file mode 100644
index f52d5ae..0000000
--- a/legacy/Data/Questions/ingsw/0210_8/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_8/wrong2.txt b/legacy/Data/Questions/ingsw/0210_8/wrong2.txt
deleted file mode 100644
index d246b94..0000000
--- a/legacy/Data/Questions/ingsw/0210_8/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0210_9/quest.txt b/legacy/Data/Questions/ingsw/0210_9/quest.txt
deleted file mode 100644
index fcfd787..0000000
--- a/legacy/Data/Questions/ingsw/0210_9/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0210_9/wrong1.txt b/legacy/Data/Questions/ingsw/0210_9/wrong1.txt
deleted file mode 100644
index acd5e00..0000000
--- a/legacy/Data/Questions/ingsw/0210_9/wrong1.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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/Questions/ingsw/0210_9/wrong2.txt b/legacy/Data/Questions/ingsw/0210_9/wrong2.txt
deleted file mode 100644
index 298890c..0000000
--- a/legacy/Data/Questions/ingsw/0210_9/wrong2.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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/Questions/ingsw/0210_9/wrong3.txt b/legacy/Data/Questions/ingsw/0210_9/wrong3.txt
deleted file mode 100644
index 3b3e08a..0000000
--- a/legacy/Data/Questions/ingsw/0210_9/wrong3.txt
+++ /dev/null
@@ -1,32 +0,0 @@
-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/Questions/ingsw/0221_18/correct.txt b/legacy/Data/Questions/ingsw/0221_18/correct.txt
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/Questions/ingsw/0221_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0221_18/quest.txt b/legacy/Data/Questions/ingsw/0221_18/quest.txt
deleted file mode 100644
index 937eabd..0000000
--- a/legacy/Data/Questions/ingsw/0221_18/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0221_18/wrong1.txt b/legacy/Data/Questions/ingsw/0221_18/wrong1.txt
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/Questions/ingsw/0221_18/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0221_18/wrong2.txt b/legacy/Data/Questions/ingsw/0221_18/wrong2.txt
deleted file mode 100644
index 9e12d11..0000000
--- a/legacy/Data/Questions/ingsw/0221_18/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0221_28/correct.txt b/legacy/Data/Questions/ingsw/0221_28/correct.txt
deleted file mode 100644
index 7c149d8..0000000
--- a/legacy/Data/Questions/ingsw/0221_28/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0221_28/quest.txt b/legacy/Data/Questions/ingsw/0221_28/quest.txt
deleted file mode 100644
index c71c807..0000000
--- a/legacy/Data/Questions/ingsw/0221_28/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0221_28/wrong1.txt b/legacy/Data/Questions/ingsw/0221_28/wrong1.txt
deleted file mode 100644
index 3461684..0000000
--- a/legacy/Data/Questions/ingsw/0221_28/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che per ogni requisito sia stato implementato nel sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0221_28/wrong2.txt b/legacy/Data/Questions/ingsw/0221_28/wrong2.txt
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/Questions/ingsw/0221_28/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0221_32/correct.txt b/legacy/Data/Questions/ingsw/0221_32/correct.txt
deleted file mode 100644
index e7c5bb8..0000000
--- a/legacy/Data/Questions/ingsw/0221_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0221_32/quest.txt b/legacy/Data/Questions/ingsw/0221_32/quest.txt
deleted file mode 100644
index 5552f2f..0000000
--- a/legacy/Data/Questions/ingsw/0221_32/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0221_32/wrong1.txt b/legacy/Data/Questions/ingsw/0221_32/wrong1.txt
deleted file mode 100644
index bfb5124..0000000
--- a/legacy/Data/Questions/ingsw/0221_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0221_32/wrong2.txt b/legacy/Data/Questions/ingsw/0221_32/wrong2.txt
deleted file mode 100644
index 2b6e242..0000000
--- a/legacy/Data/Questions/ingsw/0221_32/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0222_24/correct.txt b/legacy/Data/Questions/ingsw/0222_24/correct.txt
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/Questions/ingsw/0222_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_24/quest.txt b/legacy/Data/Questions/ingsw/0222_24/quest.txt
deleted file mode 100644
index ce59bae..0000000
--- a/legacy/Data/Questions/ingsw/0222_24/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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/Questions/ingsw/0222_24/wrong1.txt b/legacy/Data/Questions/ingsw/0222_24/wrong1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0222_24/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_24/wrong2.txt b/legacy/Data/Questions/ingsw/0222_24/wrong2.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0222_24/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_27/correct.txt b/legacy/Data/Questions/ingsw/0222_27/correct.txt
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/Questions/ingsw/0222_27/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_27/quest.txt b/legacy/Data/Questions/ingsw/0222_27/quest.txt
deleted file mode 100644
index b1548b4..0000000
--- a/legacy/Data/Questions/ingsw/0222_27/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0222_27/wrong1.txt b/legacy/Data/Questions/ingsw/0222_27/wrong1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0222_27/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_27/wrong2.txt b/legacy/Data/Questions/ingsw/0222_27/wrong2.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0222_27/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_33/correct.txt b/legacy/Data/Questions/ingsw/0222_33/correct.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0222_33/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_33/quest.txt b/legacy/Data/Questions/ingsw/0222_33/quest.txt
deleted file mode 100644
index 857057e..0000000
--- a/legacy/Data/Questions/ingsw/0222_33/quest.txt
+++ /dev/null
@@ -1,45 +0,0 @@
-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 <stdio.h>
-
-#include <stdlib.h>
-
-#include <assert.h>
-
-#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/Questions/ingsw/0222_33/wrong1.txt b/legacy/Data/Questions/ingsw/0222_33/wrong1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0222_33/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_33/wrong2.txt b/legacy/Data/Questions/ingsw/0222_33/wrong2.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0222_33/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_35/correct.txt b/legacy/Data/Questions/ingsw/0222_35/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0222_35/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_35/quest.txt b/legacy/Data/Questions/ingsw/0222_35/quest.txt
deleted file mode 100644
index 216c715..0000000
--- a/legacy/Data/Questions/ingsw/0222_35/quest.txt
+++ /dev/null
@@ -1,52 +0,0 @@
-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 <stdio.h>
-
-#include <stdlib.h>
-
-#include <assert.h>
-
-#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/Questions/ingsw/0222_35/wrong1.txt b/legacy/Data/Questions/ingsw/0222_35/wrong1.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0222_35/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_35/wrong2.txt b/legacy/Data/Questions/ingsw/0222_35/wrong2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0222_35/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_39/correct.txt b/legacy/Data/Questions/ingsw/0222_39/correct.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0222_39/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_39/quest.txt b/legacy/Data/Questions/ingsw/0222_39/quest.txt
deleted file mode 100644
index 0e6f9c0..0000000
--- a/legacy/Data/Questions/ingsw/0222_39/quest.txt
+++ /dev/null
@@ -1,55 +0,0 @@
-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 <stdio.h>
-
-#include <stdlib.h>
-
-#include <assert.h>
-
-#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/Questions/ingsw/0222_39/wrong1.txt b/legacy/Data/Questions/ingsw/0222_39/wrong1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0222_39/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_39/wrong2.txt b/legacy/Data/Questions/ingsw/0222_39/wrong2.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0222_39/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_41/correct.txt b/legacy/Data/Questions/ingsw/0222_41/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0222_41/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_41/quest.txt b/legacy/Data/Questions/ingsw/0222_41/quest.txt
deleted file mode 100644
index 77ee0c6..0000000
--- a/legacy/Data/Questions/ingsw/0222_41/quest.txt
+++ /dev/null
@@ -1,55 +0,0 @@
-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 <stdio.h>
-
-#include <stdlib.h>
-
-#include <assert.h>
-
-#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/Questions/ingsw/0222_41/wrong1.txt b/legacy/Data/Questions/ingsw/0222_41/wrong1.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0222_41/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_41/wrong2.txt b/legacy/Data/Questions/ingsw/0222_41/wrong2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0222_41/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_5/correct.txt b/legacy/Data/Questions/ingsw/0222_5/correct.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0222_5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_5/quest.txt b/legacy/Data/Questions/ingsw/0222_5/quest.txt
deleted file mode 100644
index 52b1367..0000000
--- a/legacy/Data/Questions/ingsw/0222_5/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/0222_5/wrong1.txt b/legacy/Data/Questions/ingsw/0222_5/wrong1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0222_5/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_5/wrong2.txt b/legacy/Data/Questions/ingsw/0222_5/wrong2.txt
deleted file mode 100644
index 711ba55..0000000
--- a/legacy/Data/Questions/ingsw/0222_5/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_50/correct.txt b/legacy/Data/Questions/ingsw/0222_50/correct.txt
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/Questions/ingsw/0222_50/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_50/quest.txt b/legacy/Data/Questions/ingsw/0222_50/quest.txt
deleted file mode 100644
index a3effb0..0000000
--- a/legacy/Data/Questions/ingsw/0222_50/quest.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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/Questions/ingsw/0222_50/wrong1.txt b/legacy/Data/Questions/ingsw/0222_50/wrong1.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0222_50/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_50/wrong2.txt b/legacy/Data/Questions/ingsw/0222_50/wrong2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0222_50/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_7/correct.txt b/legacy/Data/Questions/ingsw/0222_7/correct.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0222_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_7/quest.txt b/legacy/Data/Questions/ingsw/0222_7/quest.txt
deleted file mode 100644
index 97e921b..0000000
--- a/legacy/Data/Questions/ingsw/0222_7/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0222_7/wrong1.txt b/legacy/Data/Questions/ingsw/0222_7/wrong1.txt
deleted file mode 100644
index 711ba55..0000000
--- a/legacy/Data/Questions/ingsw/0222_7/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0222_7/wrong2.txt b/legacy/Data/Questions/ingsw/0222_7/wrong2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0222_7/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_1/correct.txt b/legacy/Data/Questions/ingsw/0321_1/correct.txt
deleted file mode 100644
index f3da655..0000000
--- a/legacy/Data/Questions/ingsw/0321_1/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-3*(A + 2*B)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_1/quest.txt b/legacy/Data/Questions/ingsw/0321_1/quest.txt
deleted file mode 100644
index 5d8e650..0000000
--- a/legacy/Data/Questions/ingsw/0321_1/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_1/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_1/wrong 1.txt
deleted file mode 100644
index 316107c..0000000
--- a/legacy/Data/Questions/ingsw/0321_1/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-A + 2*B
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_1/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_1/wrong 2.txt
deleted file mode 100644
index 82fe5c7..0000000
--- a/legacy/Data/Questions/ingsw/0321_1/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-3*A + 2*B
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_10/correct.txt b/legacy/Data/Questions/ingsw/0321_10/correct.txt
deleted file mode 100644
index 466ac31..0000000
--- a/legacy/Data/Questions/ingsw/0321_10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Gli utenti del sistema lavorano insieme al team di sviluppo per testare il software nel sito di sviluppo.
diff --git a/legacy/Data/Questions/ingsw/0321_10/quest.txt b/legacy/Data/Questions/ingsw/0321_10/quest.txt
deleted file mode 100644
index c35e04d..0000000
--- a/legacy/Data/Questions/ingsw/0321_10/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Quale delle seguenti affermazioni è vera riguardo all'alpha testing ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_10/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_10/wrong 1.txt
deleted file mode 100644
index 9a5ec0f..0000000
--- a/legacy/Data/Questions/ingsw/0321_10/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Test automatizzati sono eseguiti su una versione preliminare del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_10/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_10/wrong 2.txt
deleted file mode 100644
index e43ca64..0000000
--- a/legacy/Data/Questions/ingsw/0321_10/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Test automatizzati sono eseguiti sulla prima release del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_11/correct.txt b/legacy/Data/Questions/ingsw/0321_11/correct.txt
deleted file mode 100644
index b1a56d9..0000000
--- a/legacy/Data/Questions/ingsw/0321_11/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-3*(1 + p)*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_11/quest.txt b/legacy/Data/Questions/ingsw/0321_11/quest.txt
deleted file mode 100644
index e383a9d..0000000
--- a/legacy/Data/Questions/ingsw/0321_11/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_11/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_11/wrong 1.txt
deleted file mode 100644
index 769cb45..0000000
--- a/legacy/Data/Questions/ingsw/0321_11/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-3*(A + p)
diff --git a/legacy/Data/Questions/ingsw/0321_11/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_11/wrong 2.txt
deleted file mode 100644
index 1045d03..0000000
--- a/legacy/Data/Questions/ingsw/0321_11/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-3*p*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_12/correct.txt b/legacy/Data/Questions/ingsw/0321_12/correct.txt
deleted file mode 100644
index 04fb622..0000000
--- a/legacy/Data/Questions/ingsw/0321_12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-P = 1/10
diff --git a/legacy/Data/Questions/ingsw/0321_12/quest.txt b/legacy/Data/Questions/ingsw/0321_12/quest.txt
deleted file mode 100644
index 98d8c9c..0000000
--- a/legacy/Data/Questions/ingsw/0321_12/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_12/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_12/wrong 1.txt
deleted file mode 100644
index 76d3cf5..0000000
--- a/legacy/Data/Questions/ingsw/0321_12/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-P = 1/1000
diff --git a/legacy/Data/Questions/ingsw/0321_12/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_12/wrong 2.txt
deleted file mode 100644
index 79f61ef..0000000
--- a/legacy/Data/Questions/ingsw/0321_12/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-P=1/10000
diff --git a/legacy/Data/Questions/ingsw/0321_13/correct.txt b/legacy/Data/Questions/ingsw/0321_13/correct.txt
deleted file mode 100644
index e639181..0000000
--- a/legacy/Data/Questions/ingsw/0321_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-S = (1/b)*ln(C/R)
diff --git a/legacy/Data/Questions/ingsw/0321_13/quest.txt b/legacy/Data/Questions/ingsw/0321_13/quest.txt
deleted file mode 100644
index 074190a..0000000
--- a/legacy/Data/Questions/ingsw/0321_13/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_13/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_13/wrong 1.txt
deleted file mode 100644
index 587fc4b..0000000
--- a/legacy/Data/Questions/ingsw/0321_13/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-S = (1/b)*ln(R/C)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_13/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_13/wrong 2.txt
deleted file mode 100644
index 7e82f01..0000000
--- a/legacy/Data/Questions/ingsw/0321_13/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-S = b*ln(R/C)
diff --git a/legacy/Data/Questions/ingsw/0321_14/correct.txt b/legacy/Data/Questions/ingsw/0321_14/correct.txt
deleted file mode 100644
index b74296c..0000000
--- a/legacy/Data/Questions/ingsw/0321_14/correct.txt
+++ /dev/null
@@ -1,68 +0,0 @@
-<pre>
-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;
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_14/quest.txt b/legacy/Data/Questions/ingsw/0321_14/quest.txt
deleted file mode 100644
index 35d991e..0000000
--- a/legacy/Data/Questions/ingsw/0321_14/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0321_14/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_14/wrong 1.txt
deleted file mode 100644
index c7e45ef..0000000
--- a/legacy/Data/Questions/ingsw/0321_14/wrong 1.txt	
+++ /dev/null
@@ -1,68 +0,0 @@
-<pre>
-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;
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_14/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_14/wrong 2.txt
deleted file mode 100644
index 099e40c..0000000
--- a/legacy/Data/Questions/ingsw/0321_14/wrong 2.txt	
+++ /dev/null
@@ -1,67 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_15/correct.txt b/legacy/Data/Questions/ingsw/0321_15/correct.txt
deleted file mode 100644
index 2563af3..0000000
--- a/legacy/Data/Questions/ingsw/0321_15/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Plan driven
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_15/quest.txt b/legacy/Data/Questions/ingsw/0321_15/quest.txt
deleted file mode 100644
index 9a415e5..0000000
--- a/legacy/Data/Questions/ingsw/0321_15/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_15/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_15/wrong 1.txt
deleted file mode 100644
index feae3c0..0000000
--- a/legacy/Data/Questions/ingsw/0321_15/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Basato sul riuso
diff --git a/legacy/Data/Questions/ingsw/0321_15/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_15/wrong 2.txt
deleted file mode 100644
index f28b849..0000000
--- a/legacy/Data/Questions/ingsw/0321_15/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Iterativo
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_16/correct.txt b/legacy/Data/Questions/ingsw/0321_16/correct.txt
deleted file mode 100644
index 58e85d7..0000000
--- a/legacy/Data/Questions/ingsw/0321_16/correct.txt
+++ /dev/null
@@ -1,40 +0,0 @@
-<pre>
-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;
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_16/quest.txt b/legacy/Data/Questions/ingsw/0321_16/quest.txt
deleted file mode 100644
index ca5c33a..0000000
--- a/legacy/Data/Questions/ingsw/0321_16/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_16/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_16/wrong 1.txt
deleted file mode 100644
index 16efe9b..0000000
--- a/legacy/Data/Questions/ingsw/0321_16/wrong 1.txt	
+++ /dev/null
@@ -1,40 +0,0 @@
-<pre>
-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;
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_16/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_16/wrong 2.txt
deleted file mode 100644
index 6e931cd..0000000
--- a/legacy/Data/Questions/ingsw/0321_16/wrong 2.txt	
+++ /dev/null
@@ -1,39 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_17/correct.txt b/legacy/Data/Questions/ingsw/0321_17/correct.txt
deleted file mode 100644
index 3e05ae7..0000000
--- a/legacy/Data/Questions/ingsw/0321_17/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è fuori dall'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_17/quest.txt b/legacy/Data/Questions/ingsw/0321_17/quest.txt
deleted file mode 100644
index fd92d29..0000000
--- a/legacy/Data/Questions/ingsw/0321_17/quest.txt
+++ /dev/null
@@ -1,31 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena i requisiti per il sistema monitorato sono violati.
-<pre>
-//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;//
-</pre>
-
-Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
-
diff --git a/legacy/Data/Questions/ingsw/0321_17/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_17/wrong 1.txt
deleted file mode 100644
index 7e7f05d..0000000
--- a/legacy/Data/Questions/ingsw/0321_17/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-La variable x è minore di 0.
diff --git a/legacy/Data/Questions/ingsw/0321_17/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_17/wrong 2.txt
deleted file mode 100644
index 750bfd2..0000000
--- a/legacy/Data/Questions/ingsw/0321_17/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [0, 5].
diff --git a/legacy/Data/Questions/ingsw/0321_18/correct.txt b/legacy/Data/Questions/ingsw/0321_18/correct.txt
deleted file mode 100644
index 20bf664..0000000
--- a/legacy/Data/Questions/ingsw/0321_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Sviluppo Plan-driven.
diff --git a/legacy/Data/Questions/ingsw/0321_18/quest.txt b/legacy/Data/Questions/ingsw/0321_18/quest.txt
deleted file mode 100644
index 367a9e2..0000000
--- a/legacy/Data/Questions/ingsw/0321_18/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_18/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_18/wrong 1.txt
deleted file mode 100644
index 61e542a..0000000
--- a/legacy/Data/Questions/ingsw/0321_18/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Sviluppo Iterativo.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_18/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_18/wrong 2.txt
deleted file mode 100644
index 04301d6..0000000
--- a/legacy/Data/Questions/ingsw/0321_18/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Extreme programming.
diff --git a/legacy/Data/Questions/ingsw/0321_19/correct.txt b/legacy/Data/Questions/ingsw/0321_19/correct.txt
deleted file mode 100644
index 6bbf6f3..0000000
--- a/legacy/Data/Questions/ingsw/0321_19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Le attività di definizione dei requisiti e di sviluppo sono interleaved.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_19/quest.txt b/legacy/Data/Questions/ingsw/0321_19/quest.txt
deleted file mode 100644
index d0df919..0000000
--- a/legacy/Data/Questions/ingsw/0321_19/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Focalizzandosi sui metodi agile di sviluppo del software, quale delle seguenti affermazioni è vera?
diff --git a/legacy/Data/Questions/ingsw/0321_19/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_19/wrong 1.txt
deleted file mode 100644
index 45da4a7..0000000
--- a/legacy/Data/Questions/ingsw/0321_19/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_19/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_19/wrong 2.txt
deleted file mode 100644
index ddbf5eb..0000000
--- a/legacy/Data/Questions/ingsw/0321_19/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_2/correct.txt b/legacy/Data/Questions/ingsw/0321_2/correct.txt
deleted file mode 100644
index cee9602..0000000
--- a/legacy/Data/Questions/ingsw/0321_2/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/AFS4W2C.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_2/quest.txt b/legacy/Data/Questions/ingsw/0321_2/quest.txt
deleted file mode 100644
index bdf9fb8..0000000
--- a/legacy/Data/Questions/ingsw/0321_2/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_2/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_2/wrong 1.txt
deleted file mode 100644
index 66185ec..0000000
--- a/legacy/Data/Questions/ingsw/0321_2/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/Crqd1FF.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_2/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_2/wrong 2.txt
deleted file mode 100644
index 2079027..0000000
--- a/legacy/Data/Questions/ingsw/0321_2/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/fmFEpRh.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_20/correct.txt b/legacy/Data/Questions/ingsw/0321_20/correct.txt
deleted file mode 100644
index f331550..0000000
--- a/legacy/Data/Questions/ingsw/0321_20/correct.txt
+++ /dev/null
@@ -1,69 +0,0 @@
-<pre>
-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;
-
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_20/quest.txt b/legacy/Data/Questions/ingsw/0321_20/quest.txt
deleted file mode 100644
index 82d67f0..0000000
--- a/legacy/Data/Questions/ingsw/0321_20/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0321_20/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_20/wrong 1.txt
deleted file mode 100644
index 18b6dcd..0000000
--- a/legacy/Data/Questions/ingsw/0321_20/wrong 1.txt	
+++ /dev/null
@@ -1,67 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/Questions/ingsw/0321_20/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_20/wrong 2.txt
deleted file mode 100644
index f66d694..0000000
--- a/legacy/Data/Questions/ingsw/0321_20/wrong 2.txt	
+++ /dev/null
@@ -1,68 +0,0 @@
-<pre>
-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;
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_21/correct.txt b/legacy/Data/Questions/ingsw/0321_21/correct.txt
deleted file mode 100644
index 37e1847..0000000
--- a/legacy/Data/Questions/ingsw/0321_21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/hrzgmMX.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_21/quest.txt b/legacy/Data/Questions/ingsw/0321_21/quest.txt
deleted file mode 100644
index 269050d..0000000
--- a/legacy/Data/Questions/ingsw/0321_21/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_21/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_21/wrong 1.txt
deleted file mode 100644
index eb880d8..0000000
--- a/legacy/Data/Questions/ingsw/0321_21/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/FzqL7wa.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_21/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_21/wrong 2.txt
deleted file mode 100644
index 1f25f6d..0000000
--- a/legacy/Data/Questions/ingsw/0321_21/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/PHih8ak.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_23/correct.txt b/legacy/Data/Questions/ingsw/0321_23/correct.txt
deleted file mode 100644
index 986f4e1..0000000
--- a/legacy/Data/Questions/ingsw/0321_23/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-I metodi agile sono metodi di sviluppo incrementale. 
diff --git a/legacy/Data/Questions/ingsw/0321_23/quest.txt b/legacy/Data/Questions/ingsw/0321_23/quest.txt
deleted file mode 100644
index fe96eab..0000000
--- a/legacy/Data/Questions/ingsw/0321_23/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Quale delle seguenti affermazioni è vera riguardo ai metodi agile ?
diff --git a/legacy/Data/Questions/ingsw/0321_23/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_23/wrong 1.txt
deleted file mode 100644
index 06e87ff..0000000
--- a/legacy/Data/Questions/ingsw/0321_23/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-I metodi agile sono metodi di sviluppo plan-driven. 
diff --git a/legacy/Data/Questions/ingsw/0321_23/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_23/wrong 2.txt
deleted file mode 100644
index d291b48..0000000
--- a/legacy/Data/Questions/ingsw/0321_23/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-I metodi agile sono metodi di sviluppo orientato al riuso. 
diff --git a/legacy/Data/Questions/ingsw/0321_24/correct.txt b/legacy/Data/Questions/ingsw/0321_24/correct.txt
deleted file mode 100644
index d4074cf..0000000
--- a/legacy/Data/Questions/ingsw/0321_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Testare funzionalità di unità software individuali, oggetti, classi o metodi.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_24/quest.txt b/legacy/Data/Questions/ingsw/0321_24/quest.txt
deleted file mode 100644
index b8b36ab..0000000
--- a/legacy/Data/Questions/ingsw/0321_24/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Unit testing si concentra su:
diff --git a/legacy/Data/Questions/ingsw/0321_24/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_24/wrong 1.txt
deleted file mode 100644
index bc8b2f6..0000000
--- a/legacy/Data/Questions/ingsw/0321_24/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Testare l'interazione tra componenti.
diff --git a/legacy/Data/Questions/ingsw/0321_24/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_24/wrong 2.txt
deleted file mode 100644
index a801d80..0000000
--- a/legacy/Data/Questions/ingsw/0321_24/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Testare le interfacce di ciascuna componente.
diff --git a/legacy/Data/Questions/ingsw/0321_27/correct.txt b/legacy/Data/Questions/ingsw/0321_27/correct.txt
deleted file mode 100644
index 35e7b12..0000000
--- a/legacy/Data/Questions/ingsw/0321_27/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-2*A*(p +1)
diff --git a/legacy/Data/Questions/ingsw/0321_27/quest.txt b/legacy/Data/Questions/ingsw/0321_27/quest.txt
deleted file mode 100644
index 67e890e..0000000
--- a/legacy/Data/Questions/ingsw/0321_27/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_27/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_27/wrong 1.txt
deleted file mode 100644
index b84e570..0000000
--- a/legacy/Data/Questions/ingsw/0321_27/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-2*A*(p + 2)
diff --git a/legacy/Data/Questions/ingsw/0321_27/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_27/wrong 2.txt
deleted file mode 100644
index ebab514..0000000
--- a/legacy/Data/Questions/ingsw/0321_27/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-3*A*(p + 1)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_28/correct.txt b/legacy/Data/Questions/ingsw/0321_28/correct.txt
deleted file mode 100644
index 489e74c..0000000
--- a/legacy/Data/Questions/ingsw/0321_28/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-5*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_28/quest.txt b/legacy/Data/Questions/ingsw/0321_28/quest.txt
deleted file mode 100644
index 7441816..0000000
--- a/legacy/Data/Questions/ingsw/0321_28/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_28/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_28/wrong 1.txt
deleted file mode 100644
index bf91afb..0000000
--- a/legacy/Data/Questions/ingsw/0321_28/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-7*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_28/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_28/wrong 2.txt
deleted file mode 100644
index 23cbd0e..0000000
--- a/legacy/Data/Questions/ingsw/0321_28/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-6*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_29/correct.txt b/legacy/Data/Questions/ingsw/0321_29/correct.txt
deleted file mode 100644
index aed001f..0000000
--- a/legacy/Data/Questions/ingsw/0321_29/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [1, 4] oppure nell'intervallo [15, 20].
diff --git a/legacy/Data/Questions/ingsw/0321_29/quest.txt b/legacy/Data/Questions/ingsw/0321_29/quest.txt
deleted file mode 100644
index 9eb2619..0000000
--- a/legacy/Data/Questions/ingsw/0321_29/quest.txt
+++ /dev/null
@@ -1,31 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato.
-<pre>
-
-// 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; //
-</pre>
-
-Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
diff --git a/legacy/Data/Questions/ingsw/0321_29/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_29/wrong 1.txt
deleted file mode 100644
index bc08e8a..0000000
--- a/legacy/Data/Questions/ingsw/0321_29/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è fuori dall'intervallo [1, 4] e fuori dall'intervallo [15, 20].
diff --git a/legacy/Data/Questions/ingsw/0321_29/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_29/wrong 2.txt
deleted file mode 100644
index 52ad14a..0000000
--- a/legacy/Data/Questions/ingsw/0321_29/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [1, 4] e fuori dall'intervallo [15, 20].
diff --git a/legacy/Data/Questions/ingsw/0321_30/correct.txt b/legacy/Data/Questions/ingsw/0321_30/correct.txt
deleted file mode 100644
index 8cd4fca..0000000
--- a/legacy/Data/Questions/ingsw/0321_30/correct.txt
+++ /dev/null
@@ -1,26 +0,0 @@
-<pre>
-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;
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_30/quest.txt b/legacy/Data/Questions/ingsw/0321_30/quest.txt
deleted file mode 100644
index 6b6eb9d..0000000
--- a/legacy/Data/Questions/ingsw/0321_30/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_30/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_30/wrong 1.txt
deleted file mode 100644
index d9a0133..0000000
--- a/legacy/Data/Questions/ingsw/0321_30/wrong 1.txt	
+++ /dev/null
@@ -1,26 +0,0 @@
-<pre>
-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;
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_30/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_30/wrong 2.txt
deleted file mode 100644
index e11b34d..0000000
--- a/legacy/Data/Questions/ingsw/0321_30/wrong 2.txt	
+++ /dev/null
@@ -1,25 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_31/correct.txt b/legacy/Data/Questions/ingsw/0321_31/correct.txt
deleted file mode 100644
index 07800da..0000000
--- a/legacy/Data/Questions/ingsw/0321_31/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(1 + p)*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_31/quest.txt b/legacy/Data/Questions/ingsw/0321_31/quest.txt
deleted file mode 100644
index 6e4c617..0000000
--- a/legacy/Data/Questions/ingsw/0321_31/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_31/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_31/wrong 1.txt
deleted file mode 100644
index 8c7e5a6..0000000
--- a/legacy/Data/Questions/ingsw/0321_31/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_31/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_31/wrong 2.txt
deleted file mode 100644
index 14dff62..0000000
--- a/legacy/Data/Questions/ingsw/0321_31/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-p*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_32/correct.txt b/legacy/Data/Questions/ingsw/0321_32/correct.txt
deleted file mode 100644
index 1c03108..0000000
--- a/legacy/Data/Questions/ingsw/0321_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_32/quest.txt b/legacy/Data/Questions/ingsw/0321_32/quest.txt
deleted file mode 100644
index 49d08f9..0000000
--- a/legacy/Data/Questions/ingsw/0321_32/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_32/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_32/wrong 1.txt
deleted file mode 100644
index 5187be2..0000000
--- a/legacy/Data/Questions/ingsw/0321_32/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_32/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_32/wrong 2.txt
deleted file mode 100644
index 52330c1..0000000
--- a/legacy/Data/Questions/ingsw/0321_32/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_36/correct.txt b/legacy/Data/Questions/ingsw/0321_36/correct.txt
deleted file mode 100644
index f8c9568..0000000
--- a/legacy/Data/Questions/ingsw/0321_36/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_36/quest.txt b/legacy/Data/Questions/ingsw/0321_36/quest.txt
deleted file mode 100644
index c00055b..0000000
--- a/legacy/Data/Questions/ingsw/0321_36/quest.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-Si consideri il seguente modello Modelica:
-<pre>
-// class System
-
-Integer x;
-
-initial equation
-
-x = 0;
-
-equation
-
-when sample(0, 2) then
-
-    x = 1 - pre(x);
-
-end when;
-
-end System; //
-</pre>
-Quale delle seguenti affermazioni è vera per la variabile intera x?
diff --git a/legacy/Data/Questions/ingsw/0321_36/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_36/wrong 1.txt
deleted file mode 100644
index a7af2cb..0000000
--- a/legacy/Data/Questions/ingsw/0321_36/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_36/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_36/wrong 2.txt
deleted file mode 100644
index f485a50..0000000
--- a/legacy/Data/Questions/ingsw/0321_36/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_37/correct.txt b/legacy/Data/Questions/ingsw/0321_37/correct.txt
deleted file mode 100644
index ee47430..0000000
--- a/legacy/Data/Questions/ingsw/0321_37/correct.txt
+++ /dev/null
@@ -1,27 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_37/quest.txt b/legacy/Data/Questions/ingsw/0321_37/quest.txt
deleted file mode 100644
index a90ebb5..0000000
--- a/legacy/Data/Questions/ingsw/0321_37/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_37/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_37/wrong 1.txt
deleted file mode 100644
index 98dc977..0000000
--- a/legacy/Data/Questions/ingsw/0321_37/wrong 1.txt	
+++ /dev/null
@@ -1,28 +0,0 @@
-<pre>
-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;
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_37/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_37/wrong 2.txt
deleted file mode 100644
index dda46fb..0000000
--- a/legacy/Data/Questions/ingsw/0321_37/wrong 2.txt	
+++ /dev/null
@@ -1,27 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_38/correct.txt b/legacy/Data/Questions/ingsw/0321_38/correct.txt
deleted file mode 100644
index 1a8a50a..0000000
--- a/legacy/Data/Questions/ingsw/0321_38/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_38/quest.txt b/legacy/Data/Questions/ingsw/0321_38/quest.txt
deleted file mode 100644
index 580fc18..0000000
--- a/legacy/Data/Questions/ingsw/0321_38/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Quale delle seguenti frasi meglio descrive il criterio di "requirements verifiability" che è parte della "requirements validation activity".
diff --git a/legacy/Data/Questions/ingsw/0321_38/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_38/wrong 1.txt
deleted file mode 100644
index 3fdb31e..0000000
--- a/legacy/Data/Questions/ingsw/0321_38/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_38/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_38/wrong 2.txt
deleted file mode 100644
index fac8307..0000000
--- a/legacy/Data/Questions/ingsw/0321_38/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_4/correct.txt b/legacy/Data/Questions/ingsw/0321_4/correct.txt
deleted file mode 100644
index 2736f39..0000000
--- a/legacy/Data/Questions/ingsw/0321_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-A*(2 + p +q)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_4/quest.txt b/legacy/Data/Questions/ingsw/0321_4/quest.txt
deleted file mode 100644
index aec403c..0000000
--- a/legacy/Data/Questions/ingsw/0321_4/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_4/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_4/wrong 1.txt
deleted file mode 100644
index 66061d9..0000000
--- a/legacy/Data/Questions/ingsw/0321_4/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-A*(1 + p +q)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_4/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_4/wrong 2.txt
deleted file mode 100644
index dd9b48a..0000000
--- a/legacy/Data/Questions/ingsw/0321_4/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-A*(3 + p +q)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_40/correct.txt b/legacy/Data/Questions/ingsw/0321_40/correct.txt
deleted file mode 100644
index b126cfb..0000000
--- a/legacy/Data/Questions/ingsw/0321_40/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requisito funzionale. 
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_40/quest.txt b/legacy/Data/Questions/ingsw/0321_40/quest.txt
deleted file mode 100644
index 91423cc..0000000
--- a/legacy/Data/Questions/ingsw/0321_40/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-"Ogni giorno, per ciascuna clinica, il sistema genererà una lista dei pazienti che hanno un appuntamento quel giorno."
diff --git a/legacy/Data/Questions/ingsw/0321_40/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_40/wrong 1.txt
deleted file mode 100644
index c09e71c..0000000
--- a/legacy/Data/Questions/ingsw/0321_40/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Requisito non-funzionale. 
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_40/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_40/wrong 2.txt
deleted file mode 100644
index 4c69e5b..0000000
--- a/legacy/Data/Questions/ingsw/0321_40/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Requisito di performance. 
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_8/correct.txt b/legacy/Data/Questions/ingsw/0321_8/correct.txt
deleted file mode 100644
index 0b6b40f..0000000
--- a/legacy/Data/Questions/ingsw/0321_8/correct.txt
+++ /dev/null
@@ -1,53 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_8/quest.txt b/legacy/Data/Questions/ingsw/0321_8/quest.txt
deleted file mode 100644
index 01ba436..0000000
--- a/legacy/Data/Questions/ingsw/0321_8/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_8/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_8/wrong 1.txt
deleted file mode 100644
index 6a2cd60..0000000
--- a/legacy/Data/Questions/ingsw/0321_8/wrong 1.txt	
+++ /dev/null
@@ -1,54 +0,0 @@
-<pre>
-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;
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_8/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_8/wrong 2.txt
deleted file mode 100644
index 34bb9bd..0000000
--- a/legacy/Data/Questions/ingsw/0321_8/wrong 2.txt	
+++ /dev/null
@@ -1,53 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_9/correct.txt b/legacy/Data/Questions/ingsw/0321_9/correct.txt
deleted file mode 100644
index 936832d..0000000
--- a/legacy/Data/Questions/ingsw/0321_9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-3*A + 6*B
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_9/quest.txt b/legacy/Data/Questions/ingsw/0321_9/quest.txt
deleted file mode 100644
index 9f5e001..0000000
--- a/legacy/Data/Questions/ingsw/0321_9/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0321_9/wrong 1.txt b/legacy/Data/Questions/ingsw/0321_9/wrong 1.txt
deleted file mode 100644
index 316107c..0000000
--- a/legacy/Data/Questions/ingsw/0321_9/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-A + 2*B
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0321_9/wrong 2.txt b/legacy/Data/Questions/ingsw/0321_9/wrong 2.txt
deleted file mode 100644
index 68f09b9..0000000
--- a/legacy/Data/Questions/ingsw/0321_9/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-3*A + 3*B
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_0/correct.txt b/legacy/Data/Questions/ingsw/0324_0/correct.txt
deleted file mode 100644
index 3fb437d..0000000
--- a/legacy/Data/Questions/ingsw/0324_0/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.56
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_0/quest.txt b/legacy/Data/Questions/ingsw/0324_0/quest.txt
deleted file mode 100644
index 858d9c6..0000000
--- a/legacy/Data/Questions/ingsw/0324_0/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0324_0/wrong1.txt b/legacy/Data/Questions/ingsw/0324_0/wrong1.txt
deleted file mode 100644
index c64601b..0000000
--- a/legacy/Data/Questions/ingsw/0324_0/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.14
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_0/wrong2.txt b/legacy/Data/Questions/ingsw/0324_0/wrong2.txt
deleted file mode 100644
index fc54e00..0000000
--- a/legacy/Data/Questions/ingsw/0324_0/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.24
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_1/quest.txt b/legacy/Data/Questions/ingsw/0324_1/quest.txt
deleted file mode 100644
index a4a7e01..0000000
--- a/legacy/Data/Questions/ingsw/0324_1/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0324_1/wrong1.txt b/legacy/Data/Questions/ingsw/0324_1/wrong1.txt
deleted file mode 100644
index 4bcd55f..0000000
--- a/legacy/Data/Questions/ingsw/0324_1/wrong1.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/0324_1/wrong2.txt b/legacy/Data/Questions/ingsw/0324_1/wrong2.txt
deleted file mode 100644
index a3caf2e..0000000
--- a/legacy/Data/Questions/ingsw/0324_1/wrong2.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-input12)
-connect(sc2.output23, sc
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_1/wrong3.txt b/legacy/Data/Questions/ingsw/0324_1/wrong3.txt
deleted file mode 100644
index 1d08fb4..0000000
--- a/legacy/Data/Questions/ingsw/0324_1/wrong3.txt
+++ /dev/null
@@ -1,46 +0,0 @@
-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/Questions/ingsw/0324_10/correct.txt b/legacy/Data/Questions/ingsw/0324_10/correct.txt
deleted file mode 100644
index aef914a..0000000
--- a/legacy/Data/Questions/ingsw/0324_10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che un sistema che soddisfa i requisiti risolve il problema del "customer".
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_10/quest.txt b/legacy/Data/Questions/ingsw/0324_10/quest.txt
deleted file mode 100644
index 9af4805..0000000
--- a/legacy/Data/Questions/ingsw/0324_10/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_10/wrong1.txt b/legacy/Data/Questions/ingsw/0324_10/wrong1.txt
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/Questions/ingsw/0324_10/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_10/wrong2.txt b/legacy/Data/Questions/ingsw/0324_10/wrong2.txt
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/Questions/ingsw/0324_10/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_11/quest.txt b/legacy/Data/Questions/ingsw/0324_11/quest.txt
deleted file mode 100644
index 26df850..0000000
--- a/legacy/Data/Questions/ingsw/0324_11/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0324_11/wrong1.txt b/legacy/Data/Questions/ingsw/0324_11/wrong1.txt
deleted file mode 100644
index 2f7168f..0000000
--- a/legacy/Data/Questions/ingsw/0324_11/wrong1.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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/Questions/ingsw/0324_11/wrong2.txt b/legacy/Data/Questions/ingsw/0324_11/wrong2.txt
deleted file mode 100644
index c3b40d2..0000000
--- a/legacy/Data/Questions/ingsw/0324_11/wrong2.txt
+++ /dev/null
@@ -1,34 +0,0 @@
-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/Questions/ingsw/0324_11/wrong3.txt b/legacy/Data/Questions/ingsw/0324_11/wrong3.txt
deleted file mode 100644
index 9116c62..0000000
--- a/legacy/Data/Questions/ingsw/0324_11/wrong3.txt
+++ /dev/null
@@ -1,37 +0,0 @@
-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/Questions/ingsw/0324_12/correct.txt b/legacy/Data/Questions/ingsw/0324_12/correct.txt
deleted file mode 100644
index e74b1fc..0000000
--- a/legacy/Data/Questions/ingsw/0324_12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_12/quest.txt b/legacy/Data/Questions/ingsw/0324_12/quest.txt
deleted file mode 100644
index c1cd6d0..0000000
--- a/legacy/Data/Questions/ingsw/0324_12/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0324_12/wrong1.txt b/legacy/Data/Questions/ingsw/0324_12/wrong1.txt
deleted file mode 100644
index d63544a..0000000
--- a/legacy/Data/Questions/ingsw/0324_12/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_12/wrong2.txt b/legacy/Data/Questions/ingsw/0324_12/wrong2.txt
deleted file mode 100644
index 1753a91..0000000
--- a/legacy/Data/Questions/ingsw/0324_12/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-F(x, y, z) = (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_13/correct.txt b/legacy/Data/Questions/ingsw/0324_13/correct.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0324_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_13/quest.txt b/legacy/Data/Questions/ingsw/0324_13/quest.txt
deleted file mode 100644
index 4344b75..0000000
--- a/legacy/Data/Questions/ingsw/0324_13/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/0324_13/wrong1.txt b/legacy/Data/Questions/ingsw/0324_13/wrong1.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0324_13/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_13/wrong2.txt b/legacy/Data/Questions/ingsw/0324_13/wrong2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0324_13/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_14/correct.txt b/legacy/Data/Questions/ingsw/0324_14/correct.txt
deleted file mode 100644
index 1c7da8c..0000000
--- a/legacy/Data/Questions/ingsw/0324_14/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.03
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_14/quest.txt b/legacy/Data/Questions/ingsw/0324_14/quest.txt
deleted file mode 100644
index b9ba678..0000000
--- a/legacy/Data/Questions/ingsw/0324_14/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0324_14/wrong1.txt b/legacy/Data/Questions/ingsw/0324_14/wrong1.txt
deleted file mode 100644
index 7eb6830..0000000
--- a/legacy/Data/Questions/ingsw/0324_14/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.27
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_14/wrong2.txt b/legacy/Data/Questions/ingsw/0324_14/wrong2.txt
deleted file mode 100644
index 8a346b7..0000000
--- a/legacy/Data/Questions/ingsw/0324_14/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.07
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_15/correct.txt b/legacy/Data/Questions/ingsw/0324_15/correct.txt
deleted file mode 100644
index a40ea7d..0000000
--- a/legacy/Data/Questions/ingsw/0324_15/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0324_15/quest.txt b/legacy/Data/Questions/ingsw/0324_15/quest.txt
deleted file mode 100644
index 2d895ca..0000000
--- a/legacy/Data/Questions/ingsw/0324_15/quest.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-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/Questions/ingsw/0324_15/wrong1.txt b/legacy/Data/Questions/ingsw/0324_15/wrong1.txt
deleted file mode 100644
index 5b77112..0000000
--- a/legacy/Data/Questions/ingsw/0324_15/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0324_15/wrong2.txt b/legacy/Data/Questions/ingsw/0324_15/wrong2.txt
deleted file mode 100644
index abe0eaa..0000000
--- a/legacy/Data/Questions/ingsw/0324_15/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0324_16/correct.txt b/legacy/Data/Questions/ingsw/0324_16/correct.txt
deleted file mode 100644
index 1a8a50a..0000000
--- a/legacy/Data/Questions/ingsw/0324_16/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_16/quest.txt b/legacy/Data/Questions/ingsw/0324_16/quest.txt
deleted file mode 100644
index 793b220..0000000
--- a/legacy/Data/Questions/ingsw/0324_16/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_16/wrong1.txt b/legacy/Data/Questions/ingsw/0324_16/wrong1.txt
deleted file mode 100644
index fac8307..0000000
--- a/legacy/Data/Questions/ingsw/0324_16/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_16/wrong2.txt b/legacy/Data/Questions/ingsw/0324_16/wrong2.txt
deleted file mode 100644
index 3fdb31e..0000000
--- a/legacy/Data/Questions/ingsw/0324_16/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_17/correct.txt b/legacy/Data/Questions/ingsw/0324_17/correct.txt
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/Questions/ingsw/0324_17/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_17/quest.txt b/legacy/Data/Questions/ingsw/0324_17/quest.txt
deleted file mode 100644
index 1f51ab1..0000000
--- a/legacy/Data/Questions/ingsw/0324_17/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0324_17/wrong1.txt b/legacy/Data/Questions/ingsw/0324_17/wrong1.txt
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/Questions/ingsw/0324_17/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_17/wrong2.txt b/legacy/Data/Questions/ingsw/0324_17/wrong2.txt
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/Questions/ingsw/0324_17/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_18/correct.txt b/legacy/Data/Questions/ingsw/0324_18/correct.txt
deleted file mode 100644
index 7311d41..0000000
--- a/legacy/Data/Questions/ingsw/0324_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_18/quest.txt b/legacy/Data/Questions/ingsw/0324_18/quest.txt
deleted file mode 100644
index d3a9fe2..0000000
--- a/legacy/Data/Questions/ingsw/0324_18/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/0324_18/wrong1.txt b/legacy/Data/Questions/ingsw/0324_18/wrong1.txt
deleted file mode 100644
index 3e327ab..0000000
--- a/legacy/Data/Questions/ingsw/0324_18/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_18/wrong2.txt b/legacy/Data/Questions/ingsw/0324_18/wrong2.txt
deleted file mode 100644
index 7e48e4f..0000000
--- a/legacy/Data/Questions/ingsw/0324_18/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_19/correct.txt b/legacy/Data/Questions/ingsw/0324_19/correct.txt
deleted file mode 100644
index 6b560cf..0000000
--- a/legacy/Data/Questions/ingsw/0324_19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 25%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_19/quest.txt b/legacy/Data/Questions/ingsw/0324_19/quest.txt
deleted file mode 100644
index b7a608e..0000000
--- a/legacy/Data/Questions/ingsw/0324_19/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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/Questions/ingsw/0324_19/wrong1.txt b/legacy/Data/Questions/ingsw/0324_19/wrong1.txt
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/Questions/ingsw/0324_19/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_19/wrong2.txt b/legacy/Data/Questions/ingsw/0324_19/wrong2.txt
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/Questions/ingsw/0324_19/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_2/correct.txt b/legacy/Data/Questions/ingsw/0324_2/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0324_2/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_2/quest.txt b/legacy/Data/Questions/ingsw/0324_2/quest.txt
deleted file mode 100644
index adede32..0000000
--- a/legacy/Data/Questions/ingsw/0324_2/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0324_2/wrong1.txt b/legacy/Data/Questions/ingsw/0324_2/wrong1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0324_2/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_2/wrong2.txt b/legacy/Data/Questions/ingsw/0324_2/wrong2.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0324_2/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_20/correct.txt b/legacy/Data/Questions/ingsw/0324_20/correct.txt
deleted file mode 100644
index 90b2f35..0000000
--- a/legacy/Data/Questions/ingsw/0324_20/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_20/quest.txt b/legacy/Data/Questions/ingsw/0324_20/quest.txt
deleted file mode 100644
index 9d685ad..0000000
--- a/legacy/Data/Questions/ingsw/0324_20/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0324_20/wrong1.txt b/legacy/Data/Questions/ingsw/0324_20/wrong1.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0324_20/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_20/wrong2.txt b/legacy/Data/Questions/ingsw/0324_20/wrong2.txt
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/Questions/ingsw/0324_20/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_21/correct.txt b/legacy/Data/Questions/ingsw/0324_21/correct.txt
deleted file mode 100644
index 31a01d5..0000000
--- a/legacy/Data/Questions/ingsw/0324_21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_21/quest.txt b/legacy/Data/Questions/ingsw/0324_21/quest.txt
deleted file mode 100644
index d649932..0000000
--- a/legacy/Data/Questions/ingsw/0324_21/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/0324_21/wrong1.txt b/legacy/Data/Questions/ingsw/0324_21/wrong1.txt
deleted file mode 100644
index 0c564f7..0000000
--- a/legacy/Data/Questions/ingsw/0324_21/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_21/wrong2.txt b/legacy/Data/Questions/ingsw/0324_21/wrong2.txt
deleted file mode 100644
index 549dba8..0000000
--- a/legacy/Data/Questions/ingsw/0324_21/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_22/correct.txt b/legacy/Data/Questions/ingsw/0324_22/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0324_22/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_22/quest.txt b/legacy/Data/Questions/ingsw/0324_22/quest.txt
deleted file mode 100644
index 65cfd2d..0000000
--- a/legacy/Data/Questions/ingsw/0324_22/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0324_22/wrong1.txt b/legacy/Data/Questions/ingsw/0324_22/wrong1.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0324_22/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_22/wrong2.txt b/legacy/Data/Questions/ingsw/0324_22/wrong2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0324_22/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_23/correct.txt b/legacy/Data/Questions/ingsw/0324_23/correct.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0324_23/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_23/quest.txt b/legacy/Data/Questions/ingsw/0324_23/quest.txt
deleted file mode 100644
index c9ea208..0000000
--- a/legacy/Data/Questions/ingsw/0324_23/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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/Questions/ingsw/0324_23/wrong1.txt b/legacy/Data/Questions/ingsw/0324_23/wrong1.txt
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/Questions/ingsw/0324_23/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_23/wrong2.txt b/legacy/Data/Questions/ingsw/0324_23/wrong2.txt
deleted file mode 100644
index 1a8a508..0000000
--- a/legacy/Data/Questions/ingsw/0324_23/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_24/correct.txt b/legacy/Data/Questions/ingsw/0324_24/correct.txt
deleted file mode 100644
index e13eda2..0000000
--- a/legacy/Data/Questions/ingsw/0324_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_24/quest.txt b/legacy/Data/Questions/ingsw/0324_24/quest.txt
deleted file mode 100644
index b59a64d..0000000
--- a/legacy/Data/Questions/ingsw/0324_24/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Quali delle seguenti attivit� � parte del processo di validazione dei requisiti ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_24/wrong1.txt b/legacy/Data/Questions/ingsw/0324_24/wrong1.txt
deleted file mode 100644
index b24f900..0000000
--- a/legacy/Data/Questions/ingsw/0324_24/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Accertarsi che il sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_24/wrong2.txt b/legacy/Data/Questions/ingsw/0324_24/wrong2.txt
deleted file mode 100644
index 884d6b1..0000000
--- a/legacy/Data/Questions/ingsw/0324_24/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Accertarsi che l'architettura del sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_25/correct.txt b/legacy/Data/Questions/ingsw/0324_25/correct.txt
deleted file mode 100644
index 7c149d8..0000000
--- a/legacy/Data/Questions/ingsw/0324_25/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_25/quest.txt b/legacy/Data/Questions/ingsw/0324_25/quest.txt
deleted file mode 100644
index 8bba4b8..0000000
--- a/legacy/Data/Questions/ingsw/0324_25/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_25/wrong1.txt b/legacy/Data/Questions/ingsw/0324_25/wrong1.txt
deleted file mode 100644
index 3461684..0000000
--- a/legacy/Data/Questions/ingsw/0324_25/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che per ogni requisito sia stato implementato nel sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_25/wrong2.txt b/legacy/Data/Questions/ingsw/0324_25/wrong2.txt
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/Questions/ingsw/0324_25/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_26/quest.txt b/legacy/Data/Questions/ingsw/0324_26/quest.txt
deleted file mode 100644
index aef871e..0000000
--- a/legacy/Data/Questions/ingsw/0324_26/quest.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-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/Questions/ingsw/0324_26/wrong1.txt b/legacy/Data/Questions/ingsw/0324_26/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0324_26/wrong2.txt b/legacy/Data/Questions/ingsw/0324_26/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0324_26/wrong3.txt b/legacy/Data/Questions/ingsw/0324_26/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0324_27/correct.txt b/legacy/Data/Questions/ingsw/0324_27/correct.txt
deleted file mode 100644
index e582263..0000000
--- a/legacy/Data/Questions/ingsw/0324_27/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_27/quest.txt b/legacy/Data/Questions/ingsw/0324_27/quest.txt
deleted file mode 100644
index 864cc93..0000000
--- a/legacy/Data/Questions/ingsw/0324_27/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0324_27/wrong1.txt b/legacy/Data/Questions/ingsw/0324_27/wrong1.txt
deleted file mode 100644
index 590f7e1..0000000
--- a/legacy/Data/Questions/ingsw/0324_27/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_27/wrong2.txt b/legacy/Data/Questions/ingsw/0324_27/wrong2.txt
deleted file mode 100644
index 0f38391..0000000
--- a/legacy/Data/Questions/ingsw/0324_27/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_28/correct.txt b/legacy/Data/Questions/ingsw/0324_28/correct.txt
deleted file mode 100644
index 4c75070..0000000
--- a/legacy/Data/Questions/ingsw/0324_28/correct.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_28/quest.txt b/legacy/Data/Questions/ingsw/0324_28/quest.txt
deleted file mode 100644
index e11a044..0000000
--- a/legacy/Data/Questions/ingsw/0324_28/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0324_28/wrong1.txt b/legacy/Data/Questions/ingsw/0324_28/wrong1.txt
deleted file mode 100644
index 6dafe94..0000000
--- a/legacy/Data/Questions/ingsw/0324_28/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_28/wrong2.txt b/legacy/Data/Questions/ingsw/0324_28/wrong2.txt
deleted file mode 100644
index a3d79a4..0000000
--- a/legacy/Data/Questions/ingsw/0324_28/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_29/correct.txt b/legacy/Data/Questions/ingsw/0324_29/correct.txt
deleted file mode 100644
index e7c5bb8..0000000
--- a/legacy/Data/Questions/ingsw/0324_29/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_29/quest.txt b/legacy/Data/Questions/ingsw/0324_29/quest.txt
deleted file mode 100644
index 296cdcb..0000000
--- a/legacy/Data/Questions/ingsw/0324_29/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_29/wrong1.txt b/legacy/Data/Questions/ingsw/0324_29/wrong1.txt
deleted file mode 100644
index 2b6e242..0000000
--- a/legacy/Data/Questions/ingsw/0324_29/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_29/wrong2.txt b/legacy/Data/Questions/ingsw/0324_29/wrong2.txt
deleted file mode 100644
index bfb5124..0000000
--- a/legacy/Data/Questions/ingsw/0324_29/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_3/correct.txt b/legacy/Data/Questions/ingsw/0324_3/correct.txt
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/Questions/ingsw/0324_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_3/quest.txt b/legacy/Data/Questions/ingsw/0324_3/quest.txt
deleted file mode 100644
index b865ed9..0000000
--- a/legacy/Data/Questions/ingsw/0324_3/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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/Questions/ingsw/0324_3/wrong1.txt b/legacy/Data/Questions/ingsw/0324_3/wrong1.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/0324_3/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_3/wrong2.txt b/legacy/Data/Questions/ingsw/0324_3/wrong2.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0324_3/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_30/quest.txt b/legacy/Data/Questions/ingsw/0324_30/quest.txt
deleted file mode 100644
index 985c244..0000000
--- a/legacy/Data/Questions/ingsw/0324_30/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0324_30/wrong1.txt b/legacy/Data/Questions/ingsw/0324_30/wrong1.txt
deleted file mode 100644
index 69b9722..0000000
--- a/legacy/Data/Questions/ingsw/0324_30/wrong1.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-#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/Questions/ingsw/0324_30/wrong2.txt b/legacy/Data/Questions/ingsw/0324_30/wrong2.txt
deleted file mode 100644
index a26ce6e..0000000
--- a/legacy/Data/Questions/ingsw/0324_30/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-#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/Questions/ingsw/0324_30/wrong3.txt b/legacy/Data/Questions/ingsw/0324_30/wrong3.txt
deleted file mode 100644
index ed5ad19..0000000
--- a/legacy/Data/Questions/ingsw/0324_30/wrong3.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-#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/Questions/ingsw/0324_31/correct.txt b/legacy/Data/Questions/ingsw/0324_31/correct.txt
deleted file mode 100644
index 293ebbc..0000000
--- a/legacy/Data/Questions/ingsw/0324_31/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_31/quest.txt b/legacy/Data/Questions/ingsw/0324_31/quest.txt
deleted file mode 100644
index 5922b9f..0000000
--- a/legacy/Data/Questions/ingsw/0324_31/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0324_31/wrong1.txt b/legacy/Data/Questions/ingsw/0324_31/wrong1.txt
deleted file mode 100644
index d50b268..0000000
--- a/legacy/Data/Questions/ingsw/0324_31/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_31/wrong2.txt b/legacy/Data/Questions/ingsw/0324_31/wrong2.txt
deleted file mode 100644
index d7890b2..0000000
--- a/legacy/Data/Questions/ingsw/0324_31/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_32/correct.txt b/legacy/Data/Questions/ingsw/0324_32/correct.txt
deleted file mode 100644
index 2a2ecea..0000000
--- a/legacy/Data/Questions/ingsw/0324_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-time(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_32/quest.txt b/legacy/Data/Questions/ingsw/0324_32/quest.txt
deleted file mode 100644
index 5d96d42..0000000
--- a/legacy/Data/Questions/ingsw/0324_32/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0324_32/wrong1.txt b/legacy/Data/Questions/ingsw/0324_32/wrong1.txt
deleted file mode 100644
index 9927a93..0000000
--- a/legacy/Data/Questions/ingsw/0324_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-time(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_32/wrong2.txt b/legacy/Data/Questions/ingsw/0324_32/wrong2.txt
deleted file mode 100644
index d68fd15..0000000
--- a/legacy/Data/Questions/ingsw/0324_32/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-time(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_33/correct.txt b/legacy/Data/Questions/ingsw/0324_33/correct.txt
deleted file mode 100644
index 232aedf..0000000
--- a/legacy/Data/Questions/ingsw/0324_33/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0324_33/quest.txt b/legacy/Data/Questions/ingsw/0324_33/quest.txt
deleted file mode 100644
index b2bed72..0000000
--- a/legacy/Data/Questions/ingsw/0324_33/quest.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-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/Questions/ingsw/0324_33/wrong1.txt b/legacy/Data/Questions/ingsw/0324_33/wrong1.txt
deleted file mode 100644
index 5d5c9a4..0000000
--- a/legacy/Data/Questions/ingsw/0324_33/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0324_33/wrong2.txt b/legacy/Data/Questions/ingsw/0324_33/wrong2.txt
deleted file mode 100644
index 2b6c292..0000000
--- a/legacy/Data/Questions/ingsw/0324_33/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0324_34/correct.txt b/legacy/Data/Questions/ingsw/0324_34/correct.txt
deleted file mode 100644
index ad21063..0000000
--- a/legacy/Data/Questions/ingsw/0324_34/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_34/quest.txt b/legacy/Data/Questions/ingsw/0324_34/quest.txt
deleted file mode 100644
index 031c331..0000000
--- a/legacy/Data/Questions/ingsw/0324_34/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0324_34/wrong1.txt b/legacy/Data/Questions/ingsw/0324_34/wrong1.txt
deleted file mode 100644
index b14ac60..0000000
--- a/legacy/Data/Questions/ingsw/0324_34/wrong1.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_34/wrong2.txt b/legacy/Data/Questions/ingsw/0324_34/wrong2.txt
deleted file mode 100644
index e4201ab..0000000
--- a/legacy/Data/Questions/ingsw/0324_34/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_35/quest.txt b/legacy/Data/Questions/ingsw/0324_35/quest.txt
deleted file mode 100644
index 627c57e..0000000
--- a/legacy/Data/Questions/ingsw/0324_35/quest.txt
+++ /dev/null
@@ -1,39 +0,0 @@
-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/Questions/ingsw/0324_35/wrong1.txt b/legacy/Data/Questions/ingsw/0324_35/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0324_35/wrong2.txt b/legacy/Data/Questions/ingsw/0324_35/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0324_35/wrong3.txt b/legacy/Data/Questions/ingsw/0324_35/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0324_36/correct.txt b/legacy/Data/Questions/ingsw/0324_36/correct.txt
deleted file mode 100644
index b9f32a6..0000000
--- a/legacy/Data/Questions/ingsw/0324_36/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-c(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_36/quest.txt b/legacy/Data/Questions/ingsw/0324_36/quest.txt
deleted file mode 100644
index 36471c2..0000000
--- a/legacy/Data/Questions/ingsw/0324_36/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0324_36/wrong1.txt b/legacy/Data/Questions/ingsw/0324_36/wrong1.txt
deleted file mode 100644
index 3143da9..0000000
--- a/legacy/Data/Questions/ingsw/0324_36/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-c(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_36/wrong2.txt b/legacy/Data/Questions/ingsw/0324_36/wrong2.txt
deleted file mode 100644
index 70022eb..0000000
--- a/legacy/Data/Questions/ingsw/0324_36/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-c(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_37/correct.txt b/legacy/Data/Questions/ingsw/0324_37/correct.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0324_37/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_37/quest.txt b/legacy/Data/Questions/ingsw/0324_37/quest.txt
deleted file mode 100644
index fc6a5e1..0000000
--- a/legacy/Data/Questions/ingsw/0324_37/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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/Questions/ingsw/0324_37/wrong1.txt b/legacy/Data/Questions/ingsw/0324_37/wrong1.txt
deleted file mode 100644
index 90b2f35..0000000
--- a/legacy/Data/Questions/ingsw/0324_37/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_37/wrong2.txt b/legacy/Data/Questions/ingsw/0324_37/wrong2.txt
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/Questions/ingsw/0324_37/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_38/correct.txt b/legacy/Data/Questions/ingsw/0324_38/correct.txt
deleted file mode 100644
index 98939be..0000000
--- a/legacy/Data/Questions/ingsw/0324_38/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-1/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_38/quest.txt b/legacy/Data/Questions/ingsw/0324_38/quest.txt
deleted file mode 100644
index d24403f..0000000
--- a/legacy/Data/Questions/ingsw/0324_38/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0324_38/wrong1.txt b/legacy/Data/Questions/ingsw/0324_38/wrong1.txt
deleted file mode 100644
index 56ea6ac..0000000
--- a/legacy/Data/Questions/ingsw/0324_38/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-1/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_38/wrong2.txt b/legacy/Data/Questions/ingsw/0324_38/wrong2.txt
deleted file mode 100644
index db2276d..0000000
--- a/legacy/Data/Questions/ingsw/0324_38/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_39/correct.txt b/legacy/Data/Questions/ingsw/0324_39/correct.txt
deleted file mode 100644
index 4a8e634..0000000
--- a/legacy/Data/Questions/ingsw/0324_39/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_39/quest.txt b/legacy/Data/Questions/ingsw/0324_39/quest.txt
deleted file mode 100644
index 576af1a..0000000
--- a/legacy/Data/Questions/ingsw/0324_39/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0324_39/wrong1.txt b/legacy/Data/Questions/ingsw/0324_39/wrong1.txt
deleted file mode 100644
index a43796b..0000000
--- a/legacy/Data/Questions/ingsw/0324_39/wrong1.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_39/wrong2.txt b/legacy/Data/Questions/ingsw/0324_39/wrong2.txt
deleted file mode 100644
index 68aa37a..0000000
--- a/legacy/Data/Questions/ingsw/0324_39/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_4/correct.txt b/legacy/Data/Questions/ingsw/0324_4/correct.txt
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/Questions/ingsw/0324_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.12
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_4/quest.txt b/legacy/Data/Questions/ingsw/0324_4/quest.txt
deleted file mode 100644
index 40b7789..0000000
--- a/legacy/Data/Questions/ingsw/0324_4/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0324_4/wrong1.txt b/legacy/Data/Questions/ingsw/0324_4/wrong1.txt
deleted file mode 100644
index 2a47a95..0000000
--- a/legacy/Data/Questions/ingsw/0324_4/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.08
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_4/wrong2.txt b/legacy/Data/Questions/ingsw/0324_4/wrong2.txt
deleted file mode 100644
index b7bbee2..0000000
--- a/legacy/Data/Questions/ingsw/0324_4/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.32
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_40/correct.txt b/legacy/Data/Questions/ingsw/0324_40/correct.txt
deleted file mode 100644
index ce9968f..0000000
--- a/legacy/Data/Questions/ingsw/0324_40/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.28
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_40/quest.txt b/legacy/Data/Questions/ingsw/0324_40/quest.txt
deleted file mode 100644
index fbee794..0000000
--- a/legacy/Data/Questions/ingsw/0324_40/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0324_40/wrong1.txt b/legacy/Data/Questions/ingsw/0324_40/wrong1.txt
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/Questions/ingsw/0324_40/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.12
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_40/wrong2.txt b/legacy/Data/Questions/ingsw/0324_40/wrong2.txt
deleted file mode 100644
index e8f9017..0000000
--- a/legacy/Data/Questions/ingsw/0324_40/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.42
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_41/quest.txt b/legacy/Data/Questions/ingsw/0324_41/quest.txt
deleted file mode 100644
index bfb2790..0000000
--- a/legacy/Data/Questions/ingsw/0324_41/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0324_41/wrong1.txt b/legacy/Data/Questions/ingsw/0324_41/wrong1.txt
deleted file mode 100644
index 1fad89a..0000000
--- a/legacy/Data/Questions/ingsw/0324_41/wrong1.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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/Questions/ingsw/0324_41/wrong2.txt b/legacy/Data/Questions/ingsw/0324_41/wrong2.txt
deleted file mode 100644
index 882ae3e..0000000
--- a/legacy/Data/Questions/ingsw/0324_41/wrong2.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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/Questions/ingsw/0324_41/wrong3.txt b/legacy/Data/Questions/ingsw/0324_41/wrong3.txt
deleted file mode 100644
index e5618fa..0000000
--- a/legacy/Data/Questions/ingsw/0324_41/wrong3.txt
+++ /dev/null
@@ -1,34 +0,0 @@
-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/Questions/ingsw/0324_42/quest.txt b/legacy/Data/Questions/ingsw/0324_42/quest.txt
deleted file mode 100644
index 071ac68..0000000
--- a/legacy/Data/Questions/ingsw/0324_42/quest.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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/Questions/ingsw/0324_42/wrong1.txt b/legacy/Data/Questions/ingsw/0324_42/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0324_42/wrong2.txt b/legacy/Data/Questions/ingsw/0324_42/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0324_42/wrong3.txt b/legacy/Data/Questions/ingsw/0324_42/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0324_43/correct.txt b/legacy/Data/Questions/ingsw/0324_43/correct.txt
deleted file mode 100644
index 5464d05..0000000
--- a/legacy/Data/Questions/ingsw/0324_43/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 30%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_43/quest.txt b/legacy/Data/Questions/ingsw/0324_43/quest.txt
deleted file mode 100644
index 710edb6..0000000
--- a/legacy/Data/Questions/ingsw/0324_43/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0324_43/wrong1.txt b/legacy/Data/Questions/ingsw/0324_43/wrong1.txt
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/Questions/ingsw/0324_43/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_43/wrong2.txt b/legacy/Data/Questions/ingsw/0324_43/wrong2.txt
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/Questions/ingsw/0324_43/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_44/correct.txt b/legacy/Data/Questions/ingsw/0324_44/correct.txt
deleted file mode 100644
index 8785661..0000000
--- a/legacy/Data/Questions/ingsw/0324_44/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -50,  x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_44/quest.txt b/legacy/Data/Questions/ingsw/0324_44/quest.txt
deleted file mode 100644
index 36947c2..0000000
--- a/legacy/Data/Questions/ingsw/0324_44/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0324_44/wrong1.txt b/legacy/Data/Questions/ingsw/0324_44/wrong1.txt
deleted file mode 100644
index 0aaedb8..0000000
--- a/legacy/Data/Questions/ingsw/0324_44/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -50,  x = 0, x = 100, x = 500}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_44/wrong2.txt b/legacy/Data/Questions/ingsw/0324_44/wrong2.txt
deleted file mode 100644
index a6df32d..0000000
--- a/legacy/Data/Questions/ingsw/0324_44/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -150,  x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_45/correct.txt b/legacy/Data/Questions/ingsw/0324_45/correct.txt
deleted file mode 100644
index c37d6ae..0000000
--- a/legacy/Data/Questions/ingsw/0324_45/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_45/quest.txt b/legacy/Data/Questions/ingsw/0324_45/quest.txt
deleted file mode 100644
index 003d1dd..0000000
--- a/legacy/Data/Questions/ingsw/0324_45/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0324_45/wrong1.txt b/legacy/Data/Questions/ingsw/0324_45/wrong1.txt
deleted file mode 100644
index edea147..0000000
--- a/legacy/Data/Questions/ingsw/0324_45/wrong1.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_45/wrong2.txt b/legacy/Data/Questions/ingsw/0324_45/wrong2.txt
deleted file mode 100644
index 14bd900..0000000
--- a/legacy/Data/Questions/ingsw/0324_45/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_46/correct.txt b/legacy/Data/Questions/ingsw/0324_46/correct.txt
deleted file mode 100644
index a98afd2..0000000
--- a/legacy/Data/Questions/ingsw/0324_46/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_46/quest.txt b/legacy/Data/Questions/ingsw/0324_46/quest.txt
deleted file mode 100644
index b420aaf..0000000
--- a/legacy/Data/Questions/ingsw/0324_46/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0324_46/wrong1.txt b/legacy/Data/Questions/ingsw/0324_46/wrong1.txt
deleted file mode 100644
index 66064fe..0000000
--- a/legacy/Data/Questions/ingsw/0324_46/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_46/wrong2.txt b/legacy/Data/Questions/ingsw/0324_46/wrong2.txt
deleted file mode 100644
index c71f1f5..0000000
--- a/legacy/Data/Questions/ingsw/0324_46/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_47/quest.txt b/legacy/Data/Questions/ingsw/0324_47/quest.txt
deleted file mode 100644
index 0240bc8..0000000
--- a/legacy/Data/Questions/ingsw/0324_47/quest.txt
+++ /dev/null
@@ -1,18 +0,0 @@
-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/Questions/ingsw/0324_47/wrong1.txt b/legacy/Data/Questions/ingsw/0324_47/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0324_47/wrong2.txt b/legacy/Data/Questions/ingsw/0324_47/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0324_47/wrong3.txt b/legacy/Data/Questions/ingsw/0324_47/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0324_48/quest.txt b/legacy/Data/Questions/ingsw/0324_48/quest.txt
deleted file mode 100644
index 1109458..0000000
--- a/legacy/Data/Questions/ingsw/0324_48/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0324_48/wrong1.txt b/legacy/Data/Questions/ingsw/0324_48/wrong1.txt
deleted file mode 100644
index 4bcd55f..0000000
--- a/legacy/Data/Questions/ingsw/0324_48/wrong1.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/0324_48/wrong2.txt b/legacy/Data/Questions/ingsw/0324_48/wrong2.txt
deleted file mode 100644
index 19be218..0000000
--- a/legacy/Data/Questions/ingsw/0324_48/wrong2.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-input12)
-connect(sc1.output13, sc
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_48/wrong3.txt b/legacy/Data/Questions/ingsw/0324_48/wrong3.txt
deleted file mode 100644
index 3387be9..0000000
--- a/legacy/Data/Questions/ingsw/0324_48/wrong3.txt
+++ /dev/null
@@ -1,49 +0,0 @@
-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/Questions/ingsw/0324_49/correct.txt b/legacy/Data/Questions/ingsw/0324_49/correct.txt
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/Questions/ingsw/0324_49/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_49/quest.txt b/legacy/Data/Questions/ingsw/0324_49/quest.txt
deleted file mode 100644
index 7710e8f..0000000
--- a/legacy/Data/Questions/ingsw/0324_49/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_49/wrong1.txt b/legacy/Data/Questions/ingsw/0324_49/wrong1.txt
deleted file mode 100644
index 9e12d11..0000000
--- a/legacy/Data/Questions/ingsw/0324_49/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_49/wrong2.txt b/legacy/Data/Questions/ingsw/0324_49/wrong2.txt
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/Questions/ingsw/0324_49/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_5/correct.txt b/legacy/Data/Questions/ingsw/0324_5/correct.txt
deleted file mode 100644
index 81a4b93..0000000
--- a/legacy/Data/Questions/ingsw/0324_5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_5/quest.txt b/legacy/Data/Questions/ingsw/0324_5/quest.txt
deleted file mode 100644
index 236ccc7..0000000
--- a/legacy/Data/Questions/ingsw/0324_5/quest.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-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/Questions/ingsw/0324_5/wrong1.txt b/legacy/Data/Questions/ingsw/0324_5/wrong1.txt
deleted file mode 100644
index d246b94..0000000
--- a/legacy/Data/Questions/ingsw/0324_5/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_5/wrong2.txt b/legacy/Data/Questions/ingsw/0324_5/wrong2.txt
deleted file mode 100644
index f52d5ae..0000000
--- a/legacy/Data/Questions/ingsw/0324_5/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0324_6/correct.txt b/legacy/Data/Questions/ingsw/0324_6/correct.txt
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/Questions/ingsw/0324_6/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_6/quest.txt b/legacy/Data/Questions/ingsw/0324_6/quest.txt
deleted file mode 100644
index f6ffda4..0000000
--- a/legacy/Data/Questions/ingsw/0324_6/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0324_6/wrong1.txt b/legacy/Data/Questions/ingsw/0324_6/wrong1.txt
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/Questions/ingsw/0324_6/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_6/wrong2.txt b/legacy/Data/Questions/ingsw/0324_6/wrong2.txt
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/Questions/ingsw/0324_6/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_7/correct.txt b/legacy/Data/Questions/ingsw/0324_7/correct.txt
deleted file mode 100644
index 43dc0c9..0000000
--- a/legacy/Data/Questions/ingsw/0324_7/correct.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0324_7/quest.txt b/legacy/Data/Questions/ingsw/0324_7/quest.txt
deleted file mode 100644
index f6744fd..0000000
--- a/legacy/Data/Questions/ingsw/0324_7/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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/Questions/ingsw/0324_7/wrong1.txt b/legacy/Data/Questions/ingsw/0324_7/wrong1.txt
deleted file mode 100644
index 3f63933..0000000
--- a/legacy/Data/Questions/ingsw/0324_7/wrong1.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0324_7/wrong2.txt b/legacy/Data/Questions/ingsw/0324_7/wrong2.txt
deleted file mode 100644
index 6a97baf..0000000
--- a/legacy/Data/Questions/ingsw/0324_7/wrong2.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0324_8/correct.txt b/legacy/Data/Questions/ingsw/0324_8/correct.txt
deleted file mode 100644
index b8bf06e..0000000
--- a/legacy/Data/Questions/ingsw/0324_8/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_8/quest.txt b/legacy/Data/Questions/ingsw/0324_8/quest.txt
deleted file mode 100644
index 22c683f..0000000
--- a/legacy/Data/Questions/ingsw/0324_8/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0324_8/wrong1.txt b/legacy/Data/Questions/ingsw/0324_8/wrong1.txt
deleted file mode 100644
index 2029293..0000000
--- a/legacy/Data/Questions/ingsw/0324_8/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_8/wrong2.txt b/legacy/Data/Questions/ingsw/0324_8/wrong2.txt
deleted file mode 100644
index bc8720d..0000000
--- a/legacy/Data/Questions/ingsw/0324_8/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_9/correct.txt b/legacy/Data/Questions/ingsw/0324_9/correct.txt
deleted file mode 100644
index 7a6c6b9..0000000
--- a/legacy/Data/Questions/ingsw/0324_9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-300000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_9/quest.txt b/legacy/Data/Questions/ingsw/0324_9/quest.txt
deleted file mode 100644
index 47201e7..0000000
--- a/legacy/Data/Questions/ingsw/0324_9/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0324_9/wrong1.txt b/legacy/Data/Questions/ingsw/0324_9/wrong1.txt
deleted file mode 100644
index 2df501e..0000000
--- a/legacy/Data/Questions/ingsw/0324_9/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-500000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0324_9/wrong2.txt b/legacy/Data/Questions/ingsw/0324_9/wrong2.txt
deleted file mode 100644
index 997967b..0000000
--- a/legacy/Data/Questions/ingsw/0324_9/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-700000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0422-16/correct.txt b/legacy/Data/Questions/ingsw/0422-16/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0422-16/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0422-16/quest.txt b/legacy/Data/Questions/ingsw/0422-16/quest.txt
deleted file mode 100644
index 1b18990..0000000
--- a/legacy/Data/Questions/ingsw/0422-16/quest.txt
+++ /dev/null
@@ -1,20 +0,0 @@
-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/Questions/ingsw/0422-16/wrong1.txt b/legacy/Data/Questions/ingsw/0422-16/wrong1.txt
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/Questions/ingsw/0422-16/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0422-16/wrong2.txt b/legacy/Data/Questions/ingsw/0422-16/wrong2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0422-16/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_0/quest.txt b/legacy/Data/Questions/ingsw/0613_0/quest.txt
deleted file mode 100644
index 1f3419c..0000000
--- a/legacy/Data/Questions/ingsw/0613_0/quest.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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/Questions/ingsw/0613_0/wrong1.txt b/legacy/Data/Questions/ingsw/0613_0/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0613_0/wrong2.txt b/legacy/Data/Questions/ingsw/0613_0/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0613_0/wrong3.txt b/legacy/Data/Questions/ingsw/0613_0/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0613_1/correct.txt b/legacy/Data/Questions/ingsw/0613_1/correct.txt
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/Questions/ingsw/0613_1/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.12
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_1/quest.txt b/legacy/Data/Questions/ingsw/0613_1/quest.txt
deleted file mode 100644
index 654955e..0000000
--- a/legacy/Data/Questions/ingsw/0613_1/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0613_1/wrong1.txt b/legacy/Data/Questions/ingsw/0613_1/wrong1.txt
deleted file mode 100644
index 2a47a95..0000000
--- a/legacy/Data/Questions/ingsw/0613_1/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.08
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_1/wrong2.txt b/legacy/Data/Questions/ingsw/0613_1/wrong2.txt
deleted file mode 100644
index b7bbee2..0000000
--- a/legacy/Data/Questions/ingsw/0613_1/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.32
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_10/correct.txt b/legacy/Data/Questions/ingsw/0613_10/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0613_10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_10/quest.txt b/legacy/Data/Questions/ingsw/0613_10/quest.txt
deleted file mode 100644
index 9e4d3a9..0000000
--- a/legacy/Data/Questions/ingsw/0613_10/quest.txt
+++ /dev/null
@@ -1,31 +0,0 @@
-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/Questions/ingsw/0613_10/wrong1.txt b/legacy/Data/Questions/ingsw/0613_10/wrong1.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0613_10/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_10/wrong2.txt b/legacy/Data/Questions/ingsw/0613_10/wrong2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0613_10/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_11/correct.txt b/legacy/Data/Questions/ingsw/0613_11/correct.txt
deleted file mode 100644
index aef914a..0000000
--- a/legacy/Data/Questions/ingsw/0613_11/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che un sistema che soddisfa i requisiti risolve il problema del "customer".
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_11/quest.txt b/legacy/Data/Questions/ingsw/0613_11/quest.txt
deleted file mode 100644
index 9af4805..0000000
--- a/legacy/Data/Questions/ingsw/0613_11/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_11/wrong1.txt b/legacy/Data/Questions/ingsw/0613_11/wrong1.txt
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/Questions/ingsw/0613_11/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che non ci siano requisiti in conflitto con altri requisiti.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_11/wrong2.txt b/legacy/Data/Questions/ingsw/0613_11/wrong2.txt
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/Questions/ingsw/0613_11/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Assicurarsi che i requisiti funzionali descrivano tutte le funzionalità del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_12/correct.txt b/legacy/Data/Questions/ingsw/0613_12/correct.txt
deleted file mode 100644
index 475d1ef..0000000
--- a/legacy/Data/Questions/ingsw/0613_12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-{x = -150, x = -40,  x = 0, x = 200, x = 600}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_12/quest.txt b/legacy/Data/Questions/ingsw/0613_12/quest.txt
deleted file mode 100644
index 36947c2..0000000
--- a/legacy/Data/Questions/ingsw/0613_12/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0613_12/wrong1.txt b/legacy/Data/Questions/ingsw/0613_12/wrong1.txt
deleted file mode 100644
index 0aaedb8..0000000
--- a/legacy/Data/Questions/ingsw/0613_12/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -50,  x = 0, x = 100, x = 500}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_12/wrong2.txt b/legacy/Data/Questions/ingsw/0613_12/wrong2.txt
deleted file mode 100644
index a6df32d..0000000
--- a/legacy/Data/Questions/ingsw/0613_12/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -150,  x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_13/correct.txt b/legacy/Data/Questions/ingsw/0613_13/correct.txt
deleted file mode 100644
index 12d93cc..0000000
--- a/legacy/Data/Questions/ingsw/0613_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 20%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_13/quest.txt b/legacy/Data/Questions/ingsw/0613_13/quest.txt
deleted file mode 100644
index 6f20250..0000000
--- a/legacy/Data/Questions/ingsw/0613_13/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0613_13/wrong1.txt b/legacy/Data/Questions/ingsw/0613_13/wrong1.txt
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/Questions/ingsw/0613_13/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_13/wrong2.txt b/legacy/Data/Questions/ingsw/0613_13/wrong2.txt
deleted file mode 100644
index 5464d05..0000000
--- a/legacy/Data/Questions/ingsw/0613_13/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 30%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_14/quest.txt b/legacy/Data/Questions/ingsw/0613_14/quest.txt
deleted file mode 100644
index b95c7d3..0000000
--- a/legacy/Data/Questions/ingsw/0613_14/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0613_14/wrong1.txt b/legacy/Data/Questions/ingsw/0613_14/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0613_14/wrong2.txt b/legacy/Data/Questions/ingsw/0613_14/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0613_14/wrong3.txt b/legacy/Data/Questions/ingsw/0613_14/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0613_15/correct.txt b/legacy/Data/Questions/ingsw/0613_15/correct.txt
deleted file mode 100644
index b8bf06e..0000000
--- a/legacy/Data/Questions/ingsw/0613_15/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_15/quest.txt b/legacy/Data/Questions/ingsw/0613_15/quest.txt
deleted file mode 100644
index 22c683f..0000000
--- a/legacy/Data/Questions/ingsw/0613_15/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0613_15/wrong1.txt b/legacy/Data/Questions/ingsw/0613_15/wrong1.txt
deleted file mode 100644
index bc8720d..0000000
--- a/legacy/Data/Questions/ingsw/0613_15/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_15/wrong2.txt b/legacy/Data/Questions/ingsw/0613_15/wrong2.txt
deleted file mode 100644
index 2029293..0000000
--- a/legacy/Data/Questions/ingsw/0613_15/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_16/correct.txt b/legacy/Data/Questions/ingsw/0613_16/correct.txt
deleted file mode 100644
index e582263..0000000
--- a/legacy/Data/Questions/ingsw/0613_16/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_16/quest.txt b/legacy/Data/Questions/ingsw/0613_16/quest.txt
deleted file mode 100644
index 864cc93..0000000
--- a/legacy/Data/Questions/ingsw/0613_16/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0613_16/wrong1.txt b/legacy/Data/Questions/ingsw/0613_16/wrong1.txt
deleted file mode 100644
index 590f7e1..0000000
--- a/legacy/Data/Questions/ingsw/0613_16/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_16/wrong2.txt b/legacy/Data/Questions/ingsw/0613_16/wrong2.txt
deleted file mode 100644
index 0f38391..0000000
--- a/legacy/Data/Questions/ingsw/0613_16/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_17/correct.txt b/legacy/Data/Questions/ingsw/0613_17/correct.txt
deleted file mode 100644
index c37d6ae..0000000
--- a/legacy/Data/Questions/ingsw/0613_17/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_17/quest.txt b/legacy/Data/Questions/ingsw/0613_17/quest.txt
deleted file mode 100644
index 003d1dd..0000000
--- a/legacy/Data/Questions/ingsw/0613_17/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0613_17/wrong1.txt b/legacy/Data/Questions/ingsw/0613_17/wrong1.txt
deleted file mode 100644
index 14bd900..0000000
--- a/legacy/Data/Questions/ingsw/0613_17/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_17/wrong2.txt b/legacy/Data/Questions/ingsw/0613_17/wrong2.txt
deleted file mode 100644
index edea147..0000000
--- a/legacy/Data/Questions/ingsw/0613_17/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_18/correct.txt b/legacy/Data/Questions/ingsw/0613_18/correct.txt
deleted file mode 100644
index 98939be..0000000
--- a/legacy/Data/Questions/ingsw/0613_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-1/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_18/quest.txt b/legacy/Data/Questions/ingsw/0613_18/quest.txt
deleted file mode 100644
index 91edad5..0000000
--- a/legacy/Data/Questions/ingsw/0613_18/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0613_18/wrong1.txt b/legacy/Data/Questions/ingsw/0613_18/wrong1.txt
deleted file mode 100644
index 56ea6ac..0000000
--- a/legacy/Data/Questions/ingsw/0613_18/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-1/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_18/wrong2.txt b/legacy/Data/Questions/ingsw/0613_18/wrong2.txt
deleted file mode 100644
index db2276d..0000000
--- a/legacy/Data/Questions/ingsw/0613_18/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_19/quest.txt b/legacy/Data/Questions/ingsw/0613_19/quest.txt
deleted file mode 100644
index 052028b..0000000
--- a/legacy/Data/Questions/ingsw/0613_19/quest.txt
+++ /dev/null
@@ -1,37 +0,0 @@
-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/Questions/ingsw/0613_19/wrong1.txt b/legacy/Data/Questions/ingsw/0613_19/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0613_19/wrong2.txt b/legacy/Data/Questions/ingsw/0613_19/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0613_19/wrong3.txt b/legacy/Data/Questions/ingsw/0613_19/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0613_2/quest.txt b/legacy/Data/Questions/ingsw/0613_2/quest.txt
deleted file mode 100644
index fcb1323..0000000
--- a/legacy/Data/Questions/ingsw/0613_2/quest.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-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/Questions/ingsw/0613_2/wrong1.txt b/legacy/Data/Questions/ingsw/0613_2/wrong1.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0613_2/wrong2.txt b/legacy/Data/Questions/ingsw/0613_2/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0613_2/wrong3.txt b/legacy/Data/Questions/ingsw/0613_2/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/Questions/ingsw/0613_20/correct.txt b/legacy/Data/Questions/ingsw/0613_20/correct.txt
deleted file mode 100644
index 2a2ecea..0000000
--- a/legacy/Data/Questions/ingsw/0613_20/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-time(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_20/quest.txt b/legacy/Data/Questions/ingsw/0613_20/quest.txt
deleted file mode 100644
index 79b69ac..0000000
--- a/legacy/Data/Questions/ingsw/0613_20/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0613_20/wrong1.txt b/legacy/Data/Questions/ingsw/0613_20/wrong1.txt
deleted file mode 100644
index d68fd15..0000000
--- a/legacy/Data/Questions/ingsw/0613_20/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-time(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_20/wrong2.txt b/legacy/Data/Questions/ingsw/0613_20/wrong2.txt
deleted file mode 100644
index 9927a93..0000000
--- a/legacy/Data/Questions/ingsw/0613_20/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-time(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_21/correct.txt b/legacy/Data/Questions/ingsw/0613_21/correct.txt
deleted file mode 100644
index 936832d..0000000
--- a/legacy/Data/Questions/ingsw/0613_21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-3*A + 6*B
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_21/quest.txt b/legacy/Data/Questions/ingsw/0613_21/quest.txt
deleted file mode 100644
index 07ce5c9..0000000
--- a/legacy/Data/Questions/ingsw/0613_21/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_21/wrong1.txt b/legacy/Data/Questions/ingsw/0613_21/wrong1.txt
deleted file mode 100644
index 316107c..0000000
--- a/legacy/Data/Questions/ingsw/0613_21/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-A + 2*B
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_21/wrong2.txt b/legacy/Data/Questions/ingsw/0613_21/wrong2.txt
deleted file mode 100644
index 68f09b9..0000000
--- a/legacy/Data/Questions/ingsw/0613_21/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-3*A + 3*B
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_22/correct.txt b/legacy/Data/Questions/ingsw/0613_22/correct.txt
deleted file mode 100644
index 2ca9276..0000000
--- a/legacy/Data/Questions/ingsw/0613_22/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 35%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_22/quest.txt b/legacy/Data/Questions/ingsw/0613_22/quest.txt
deleted file mode 100644
index aef94a6..0000000
--- a/legacy/Data/Questions/ingsw/0613_22/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0613_22/wrong1.txt b/legacy/Data/Questions/ingsw/0613_22/wrong1.txt
deleted file mode 100644
index 5623b39..0000000
--- a/legacy/Data/Questions/ingsw/0613_22/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 65%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_22/wrong2.txt b/legacy/Data/Questions/ingsw/0613_22/wrong2.txt
deleted file mode 100644
index c376ef7..0000000
--- a/legacy/Data/Questions/ingsw/0613_22/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 55%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_23/correct.txt b/legacy/Data/Questions/ingsw/0613_23/correct.txt
deleted file mode 100644
index 4a8e634..0000000
--- a/legacy/Data/Questions/ingsw/0613_23/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_23/quest.txt b/legacy/Data/Questions/ingsw/0613_23/quest.txt
deleted file mode 100644
index 576af1a..0000000
--- a/legacy/Data/Questions/ingsw/0613_23/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0613_23/wrong1.txt b/legacy/Data/Questions/ingsw/0613_23/wrong1.txt
deleted file mode 100644
index 68aa37a..0000000
--- a/legacy/Data/Questions/ingsw/0613_23/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_23/wrong2.txt b/legacy/Data/Questions/ingsw/0613_23/wrong2.txt
deleted file mode 100644
index a43796b..0000000
--- a/legacy/Data/Questions/ingsw/0613_23/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_24/correct.txt b/legacy/Data/Questions/ingsw/0613_24/correct.txt
deleted file mode 100644
index 5464d05..0000000
--- a/legacy/Data/Questions/ingsw/0613_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 30%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_24/quest.txt b/legacy/Data/Questions/ingsw/0613_24/quest.txt
deleted file mode 100644
index 9534ab3..0000000
--- a/legacy/Data/Questions/ingsw/0613_24/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0613_24/wrong1.txt b/legacy/Data/Questions/ingsw/0613_24/wrong1.txt
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/Questions/ingsw/0613_24/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_24/wrong2.txt b/legacy/Data/Questions/ingsw/0613_24/wrong2.txt
deleted file mode 100644
index cf27703..0000000
--- a/legacy/Data/Questions/ingsw/0613_24/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_25/correct.txt b/legacy/Data/Questions/ingsw/0613_25/correct.txt
deleted file mode 100644
index e74b1fc..0000000
--- a/legacy/Data/Questions/ingsw/0613_25/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_25/quest.txt b/legacy/Data/Questions/ingsw/0613_25/quest.txt
deleted file mode 100644
index c1cd6d0..0000000
--- a/legacy/Data/Questions/ingsw/0613_25/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0613_25/wrong1.txt b/legacy/Data/Questions/ingsw/0613_25/wrong1.txt
deleted file mode 100644
index d63544a..0000000
--- a/legacy/Data/Questions/ingsw/0613_25/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_25/wrong2.txt b/legacy/Data/Questions/ingsw/0613_25/wrong2.txt
deleted file mode 100644
index 1753a91..0000000
--- a/legacy/Data/Questions/ingsw/0613_25/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-F(x, y, z) = (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_26/correct.txt b/legacy/Data/Questions/ingsw/0613_26/correct.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0613_26/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_26/quest.txt b/legacy/Data/Questions/ingsw/0613_26/quest.txt
deleted file mode 100644
index dcec721..0000000
--- a/legacy/Data/Questions/ingsw/0613_26/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/0613_26/wrong1.txt b/legacy/Data/Questions/ingsw/0613_26/wrong1.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0613_26/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_26/wrong2.txt b/legacy/Data/Questions/ingsw/0613_26/wrong2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0613_26/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_27/quest.txt b/legacy/Data/Questions/ingsw/0613_27/quest.txt
deleted file mode 100644
index 35670bc..0000000
--- a/legacy/Data/Questions/ingsw/0613_27/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0613_27/wrong1.txt b/legacy/Data/Questions/ingsw/0613_27/wrong1.txt
deleted file mode 100644
index 4bcd55f..0000000
--- a/legacy/Data/Questions/ingsw/0613_27/wrong1.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/0613_27/wrong2.txt b/legacy/Data/Questions/ingsw/0613_27/wrong2.txt
deleted file mode 100644
index 19be218..0000000
--- a/legacy/Data/Questions/ingsw/0613_27/wrong2.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-input12)
-connect(sc1.output13, sc
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_27/wrong3.txt b/legacy/Data/Questions/ingsw/0613_27/wrong3.txt
deleted file mode 100644
index 29daf30..0000000
--- a/legacy/Data/Questions/ingsw/0613_27/wrong3.txt
+++ /dev/null
@@ -1,49 +0,0 @@
-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/Questions/ingsw/0613_28/correct.txt b/legacy/Data/Questions/ingsw/0613_28/correct.txt
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/Questions/ingsw/0613_28/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_28/quest.txt b/legacy/Data/Questions/ingsw/0613_28/quest.txt
deleted file mode 100644
index 32aecd3..0000000
--- a/legacy/Data/Questions/ingsw/0613_28/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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/Questions/ingsw/0613_28/wrong1.txt b/legacy/Data/Questions/ingsw/0613_28/wrong1.txt
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/Questions/ingsw/0613_28/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_28/wrong2.txt b/legacy/Data/Questions/ingsw/0613_28/wrong2.txt
deleted file mode 100644
index 90b2f35..0000000
--- a/legacy/Data/Questions/ingsw/0613_28/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_29/correct.txt b/legacy/Data/Questions/ingsw/0613_29/correct.txt
deleted file mode 100644
index 7a6c6b9..0000000
--- a/legacy/Data/Questions/ingsw/0613_29/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-300000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_29/quest.txt b/legacy/Data/Questions/ingsw/0613_29/quest.txt
deleted file mode 100644
index 47201e7..0000000
--- a/legacy/Data/Questions/ingsw/0613_29/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0613_29/wrong1.txt b/legacy/Data/Questions/ingsw/0613_29/wrong1.txt
deleted file mode 100644
index 997967b..0000000
--- a/legacy/Data/Questions/ingsw/0613_29/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-700000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_29/wrong2.txt b/legacy/Data/Questions/ingsw/0613_29/wrong2.txt
deleted file mode 100644
index 2df501e..0000000
--- a/legacy/Data/Questions/ingsw/0613_29/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-500000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_3/correct.txt b/legacy/Data/Questions/ingsw/0613_3/correct.txt
deleted file mode 100644
index 3fb437d..0000000
--- a/legacy/Data/Questions/ingsw/0613_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.56
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_3/quest.txt b/legacy/Data/Questions/ingsw/0613_3/quest.txt
deleted file mode 100644
index d8bc097..0000000
--- a/legacy/Data/Questions/ingsw/0613_3/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0613_3/wrong1.txt b/legacy/Data/Questions/ingsw/0613_3/wrong1.txt
deleted file mode 100644
index fc54e00..0000000
--- a/legacy/Data/Questions/ingsw/0613_3/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.24
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_3/wrong2.txt b/legacy/Data/Questions/ingsw/0613_3/wrong2.txt
deleted file mode 100644
index c64601b..0000000
--- a/legacy/Data/Questions/ingsw/0613_3/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.14
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_30/correct.txt b/legacy/Data/Questions/ingsw/0613_30/correct.txt
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/Questions/ingsw/0613_30/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_30/quest.txt b/legacy/Data/Questions/ingsw/0613_30/quest.txt
deleted file mode 100644
index 56ab57a..0000000
--- a/legacy/Data/Questions/ingsw/0613_30/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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/Questions/ingsw/0613_30/wrong1.txt b/legacy/Data/Questions/ingsw/0613_30/wrong1.txt
deleted file mode 100644
index 90b2f35..0000000
--- a/legacy/Data/Questions/ingsw/0613_30/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_30/wrong2.txt b/legacy/Data/Questions/ingsw/0613_30/wrong2.txt
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/Questions/ingsw/0613_30/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_31/correct.txt b/legacy/Data/Questions/ingsw/0613_31/correct.txt
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/Questions/ingsw/0613_31/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_31/quest.txt b/legacy/Data/Questions/ingsw/0613_31/quest.txt
deleted file mode 100644
index 9f9ed74..0000000
--- a/legacy/Data/Questions/ingsw/0613_31/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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/Questions/ingsw/0613_31/wrong1.txt b/legacy/Data/Questions/ingsw/0613_31/wrong1.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0613_31/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_31/wrong2.txt b/legacy/Data/Questions/ingsw/0613_31/wrong2.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/0613_31/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_32/correct.txt b/legacy/Data/Questions/ingsw/0613_32/correct.txt
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/Questions/ingsw/0613_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_32/quest.txt b/legacy/Data/Questions/ingsw/0613_32/quest.txt
deleted file mode 100644
index 1724f1c..0000000
--- a/legacy/Data/Questions/ingsw/0613_32/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0613_32/wrong1.txt b/legacy/Data/Questions/ingsw/0613_32/wrong1.txt
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/Questions/ingsw/0613_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_32/wrong2.txt b/legacy/Data/Questions/ingsw/0613_32/wrong2.txt
deleted file mode 100644
index cf27703..0000000
--- a/legacy/Data/Questions/ingsw/0613_32/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_33/correct.txt b/legacy/Data/Questions/ingsw/0613_33/correct.txt
deleted file mode 100644
index e940faa..0000000
--- a/legacy/Data/Questions/ingsw/0613_33/correct.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0613_33/quest.txt b/legacy/Data/Questions/ingsw/0613_33/quest.txt
deleted file mode 100644
index 2758118..0000000
--- a/legacy/Data/Questions/ingsw/0613_33/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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/Questions/ingsw/0613_33/wrong1.txt b/legacy/Data/Questions/ingsw/0613_33/wrong1.txt
deleted file mode 100644
index ad32d88..0000000
--- a/legacy/Data/Questions/ingsw/0613_33/wrong1.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0613_33/wrong2.txt b/legacy/Data/Questions/ingsw/0613_33/wrong2.txt
deleted file mode 100644
index 642ec6b..0000000
--- a/legacy/Data/Questions/ingsw/0613_33/wrong2.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0613_34/correct.txt b/legacy/Data/Questions/ingsw/0613_34/correct.txt
deleted file mode 100644
index e7c5bb8..0000000
--- a/legacy/Data/Questions/ingsw/0613_34/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_34/quest.txt b/legacy/Data/Questions/ingsw/0613_34/quest.txt
deleted file mode 100644
index 296cdcb..0000000
--- a/legacy/Data/Questions/ingsw/0613_34/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_34/wrong1.txt b/legacy/Data/Questions/ingsw/0613_34/wrong1.txt
deleted file mode 100644
index bfb5124..0000000
--- a/legacy/Data/Questions/ingsw/0613_34/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_34/wrong2.txt b/legacy/Data/Questions/ingsw/0613_34/wrong2.txt
deleted file mode 100644
index 2b6e242..0000000
--- a/legacy/Data/Questions/ingsw/0613_34/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_35/correct.txt b/legacy/Data/Questions/ingsw/0613_35/correct.txt
deleted file mode 100644
index ad21063..0000000
--- a/legacy/Data/Questions/ingsw/0613_35/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_35/quest.txt b/legacy/Data/Questions/ingsw/0613_35/quest.txt
deleted file mode 100644
index 031c331..0000000
--- a/legacy/Data/Questions/ingsw/0613_35/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0613_35/wrong1.txt b/legacy/Data/Questions/ingsw/0613_35/wrong1.txt
deleted file mode 100644
index b14ac60..0000000
--- a/legacy/Data/Questions/ingsw/0613_35/wrong1.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_35/wrong2.txt b/legacy/Data/Questions/ingsw/0613_35/wrong2.txt
deleted file mode 100644
index e4201ab..0000000
--- a/legacy/Data/Questions/ingsw/0613_35/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_36/correct.txt b/legacy/Data/Questions/ingsw/0613_36/correct.txt
deleted file mode 100644
index 1c7da8c..0000000
--- a/legacy/Data/Questions/ingsw/0613_36/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.03
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_36/quest.txt b/legacy/Data/Questions/ingsw/0613_36/quest.txt
deleted file mode 100644
index 58782d5..0000000
--- a/legacy/Data/Questions/ingsw/0613_36/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0613_36/wrong1.txt b/legacy/Data/Questions/ingsw/0613_36/wrong1.txt
deleted file mode 100644
index 8a346b7..0000000
--- a/legacy/Data/Questions/ingsw/0613_36/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.07
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_36/wrong2.txt b/legacy/Data/Questions/ingsw/0613_36/wrong2.txt
deleted file mode 100644
index 7eb6830..0000000
--- a/legacy/Data/Questions/ingsw/0613_36/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.27
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_37/correct.txt b/legacy/Data/Questions/ingsw/0613_37/correct.txt
deleted file mode 100644
index a7029bc..0000000
--- a/legacy/Data/Questions/ingsw/0613_37/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [1, 4] oppure nell'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_37/quest.txt b/legacy/Data/Questions/ingsw/0613_37/quest.txt
deleted file mode 100644
index e5fbc81..0000000
--- a/legacy/Data/Questions/ingsw/0613_37/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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;
-</pre>
-Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_37/wrong1.txt b/legacy/Data/Questions/ingsw/0613_37/wrong1.txt
deleted file mode 100644
index 710b111..0000000
--- a/legacy/Data/Questions/ingsw/0613_37/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_37/wrong2.txt b/legacy/Data/Questions/ingsw/0613_37/wrong2.txt
deleted file mode 100644
index a82929b..0000000
--- a/legacy/Data/Questions/ingsw/0613_37/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_38/quest.txt b/legacy/Data/Questions/ingsw/0613_38/quest.txt
deleted file mode 100644
index 230115c..0000000
--- a/legacy/Data/Questions/ingsw/0613_38/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0613_38/wrong1.txt b/legacy/Data/Questions/ingsw/0613_38/wrong1.txt
deleted file mode 100644
index 00b636b..0000000
--- a/legacy/Data/Questions/ingsw/0613_38/wrong1.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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/Questions/ingsw/0613_38/wrong2.txt b/legacy/Data/Questions/ingsw/0613_38/wrong2.txt
deleted file mode 100644
index dc39134..0000000
--- a/legacy/Data/Questions/ingsw/0613_38/wrong2.txt
+++ /dev/null
@@ -1,34 +0,0 @@
-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/Questions/ingsw/0613_38/wrong3.txt b/legacy/Data/Questions/ingsw/0613_38/wrong3.txt
deleted file mode 100644
index 6a9ef82..0000000
--- a/legacy/Data/Questions/ingsw/0613_38/wrong3.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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/Questions/ingsw/0613_39/correct.txt b/legacy/Data/Questions/ingsw/0613_39/correct.txt
deleted file mode 100644
index b9f32a6..0000000
--- a/legacy/Data/Questions/ingsw/0613_39/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-c(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_39/quest.txt b/legacy/Data/Questions/ingsw/0613_39/quest.txt
deleted file mode 100644
index 24a64fe..0000000
--- a/legacy/Data/Questions/ingsw/0613_39/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0613_39/wrong1.txt b/legacy/Data/Questions/ingsw/0613_39/wrong1.txt
deleted file mode 100644
index 70022eb..0000000
--- a/legacy/Data/Questions/ingsw/0613_39/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-c(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_39/wrong2.txt b/legacy/Data/Questions/ingsw/0613_39/wrong2.txt
deleted file mode 100644
index 3143da9..0000000
--- a/legacy/Data/Questions/ingsw/0613_39/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-c(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_4/correct.txt b/legacy/Data/Questions/ingsw/0613_4/correct.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0613_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_4/quest.txt b/legacy/Data/Questions/ingsw/0613_4/quest.txt
deleted file mode 100644
index 5cf5cae..0000000
--- a/legacy/Data/Questions/ingsw/0613_4/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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/Questions/ingsw/0613_4/wrong1.txt b/legacy/Data/Questions/ingsw/0613_4/wrong1.txt
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/Questions/ingsw/0613_4/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_4/wrong2.txt b/legacy/Data/Questions/ingsw/0613_4/wrong2.txt
deleted file mode 100644
index 90b2f35..0000000
--- a/legacy/Data/Questions/ingsw/0613_4/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_40/quest.txt b/legacy/Data/Questions/ingsw/0613_40/quest.txt
deleted file mode 100644
index 2959407..0000000
--- a/legacy/Data/Questions/ingsw/0613_40/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0613_40/wrong1.txt b/legacy/Data/Questions/ingsw/0613_40/wrong1.txt
deleted file mode 100644
index f919b6b..0000000
--- a/legacy/Data/Questions/ingsw/0613_40/wrong1.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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/Questions/ingsw/0613_40/wrong2.txt b/legacy/Data/Questions/ingsw/0613_40/wrong2.txt
deleted file mode 100644
index fc9e0aa..0000000
--- a/legacy/Data/Questions/ingsw/0613_40/wrong2.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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/Questions/ingsw/0613_40/wrong3.txt b/legacy/Data/Questions/ingsw/0613_40/wrong3.txt
deleted file mode 100644
index e537817..0000000
--- a/legacy/Data/Questions/ingsw/0613_40/wrong3.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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/Questions/ingsw/0613_41/quest.txt b/legacy/Data/Questions/ingsw/0613_41/quest.txt
deleted file mode 100644
index 99379e6..0000000
--- a/legacy/Data/Questions/ingsw/0613_41/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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/Questions/ingsw/0613_41/wrong1.txt b/legacy/Data/Questions/ingsw/0613_41/wrong1.txt
deleted file mode 100644
index cbf1814..0000000
--- a/legacy/Data/Questions/ingsw/0613_41/wrong1.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0613_41/wrong2.txt b/legacy/Data/Questions/ingsw/0613_41/wrong2.txt
deleted file mode 100644
index 6fcb8b5..0000000
--- a/legacy/Data/Questions/ingsw/0613_41/wrong2.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0613_41/wrong3.txt b/legacy/Data/Questions/ingsw/0613_41/wrong3.txt
deleted file mode 100644
index 03b9f52..0000000
--- a/legacy/Data/Questions/ingsw/0613_41/wrong3.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/0613_42/correct.txt b/legacy/Data/Questions/ingsw/0613_42/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0613_42/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_42/quest.txt b/legacy/Data/Questions/ingsw/0613_42/quest.txt
deleted file mode 100644
index 2bda796..0000000
--- a/legacy/Data/Questions/ingsw/0613_42/quest.txt
+++ /dev/null
@@ -1,29 +0,0 @@
-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/Questions/ingsw/0613_42/wrong1.txt b/legacy/Data/Questions/ingsw/0613_42/wrong1.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0613_42/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_42/wrong2.txt b/legacy/Data/Questions/ingsw/0613_42/wrong2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0613_42/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_43/correct.txt b/legacy/Data/Questions/ingsw/0613_43/correct.txt
deleted file mode 100644
index 293ebbc..0000000
--- a/legacy/Data/Questions/ingsw/0613_43/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_43/quest.txt b/legacy/Data/Questions/ingsw/0613_43/quest.txt
deleted file mode 100644
index 5922b9f..0000000
--- a/legacy/Data/Questions/ingsw/0613_43/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0613_43/wrong1.txt b/legacy/Data/Questions/ingsw/0613_43/wrong1.txt
deleted file mode 100644
index d7890b2..0000000
--- a/legacy/Data/Questions/ingsw/0613_43/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_43/wrong2.txt b/legacy/Data/Questions/ingsw/0613_43/wrong2.txt
deleted file mode 100644
index d50b268..0000000
--- a/legacy/Data/Questions/ingsw/0613_43/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_44/correct.txt b/legacy/Data/Questions/ingsw/0613_44/correct.txt
deleted file mode 100644
index 1a8a50a..0000000
--- a/legacy/Data/Questions/ingsw/0613_44/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_44/quest.txt b/legacy/Data/Questions/ingsw/0613_44/quest.txt
deleted file mode 100644
index 793b220..0000000
--- a/legacy/Data/Questions/ingsw/0613_44/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_44/wrong1.txt b/legacy/Data/Questions/ingsw/0613_44/wrong1.txt
deleted file mode 100644
index fac8307..0000000
--- a/legacy/Data/Questions/ingsw/0613_44/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_44/wrong2.txt b/legacy/Data/Questions/ingsw/0613_44/wrong2.txt
deleted file mode 100644
index 3fdb31e..0000000
--- a/legacy/Data/Questions/ingsw/0613_44/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_45/correct.txt b/legacy/Data/Questions/ingsw/0613_45/correct.txt
deleted file mode 100644
index 232aedf..0000000
--- a/legacy/Data/Questions/ingsw/0613_45/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0613_45/quest.txt b/legacy/Data/Questions/ingsw/0613_45/quest.txt
deleted file mode 100644
index e44e320..0000000
--- a/legacy/Data/Questions/ingsw/0613_45/quest.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-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/Questions/ingsw/0613_45/wrong1.txt b/legacy/Data/Questions/ingsw/0613_45/wrong1.txt
deleted file mode 100644
index 5d5c9a4..0000000
--- a/legacy/Data/Questions/ingsw/0613_45/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0613_45/wrong2.txt b/legacy/Data/Questions/ingsw/0613_45/wrong2.txt
deleted file mode 100644
index 2b6c292..0000000
--- a/legacy/Data/Questions/ingsw/0613_45/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0613_46/correct.txt b/legacy/Data/Questions/ingsw/0613_46/correct.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0613_46/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_46/quest.txt b/legacy/Data/Questions/ingsw/0613_46/quest.txt
deleted file mode 100644
index 03acbcc..0000000
--- a/legacy/Data/Questions/ingsw/0613_46/quest.txt
+++ /dev/null
@@ -1,30 +0,0 @@
-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/Questions/ingsw/0613_46/wrong1.txt b/legacy/Data/Questions/ingsw/0613_46/wrong1.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0613_46/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_46/wrong2.txt b/legacy/Data/Questions/ingsw/0613_46/wrong2.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0613_46/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_47/correct.txt b/legacy/Data/Questions/ingsw/0613_47/correct.txt
deleted file mode 100644
index f3da655..0000000
--- a/legacy/Data/Questions/ingsw/0613_47/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-3*(A + 2*B)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_47/quest.txt b/legacy/Data/Questions/ingsw/0613_47/quest.txt
deleted file mode 100644
index 6395b05..0000000
--- a/legacy/Data/Questions/ingsw/0613_47/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_47/wrong1.txt b/legacy/Data/Questions/ingsw/0613_47/wrong1.txt
deleted file mode 100644
index 316107c..0000000
--- a/legacy/Data/Questions/ingsw/0613_47/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-A + 2*B
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_47/wrong2.txt b/legacy/Data/Questions/ingsw/0613_47/wrong2.txt
deleted file mode 100644
index 82fe5c7..0000000
--- a/legacy/Data/Questions/ingsw/0613_47/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-3*A + 2*B
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_48/correct.txt b/legacy/Data/Questions/ingsw/0613_48/correct.txt
deleted file mode 100644
index ce9968f..0000000
--- a/legacy/Data/Questions/ingsw/0613_48/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.28
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_48/quest.txt b/legacy/Data/Questions/ingsw/0613_48/quest.txt
deleted file mode 100644
index adccf3a..0000000
--- a/legacy/Data/Questions/ingsw/0613_48/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0613_48/wrong1.txt b/legacy/Data/Questions/ingsw/0613_48/wrong1.txt
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/Questions/ingsw/0613_48/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.12
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_48/wrong2.txt b/legacy/Data/Questions/ingsw/0613_48/wrong2.txt
deleted file mode 100644
index e8f9017..0000000
--- a/legacy/Data/Questions/ingsw/0613_48/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.42
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_49/correct.txt b/legacy/Data/Questions/ingsw/0613_49/correct.txt
deleted file mode 100644
index 4c75070..0000000
--- a/legacy/Data/Questions/ingsw/0613_49/correct.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_49/quest.txt b/legacy/Data/Questions/ingsw/0613_49/quest.txt
deleted file mode 100644
index e11a044..0000000
--- a/legacy/Data/Questions/ingsw/0613_49/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0613_49/wrong1.txt b/legacy/Data/Questions/ingsw/0613_49/wrong1.txt
deleted file mode 100644
index 6dafe94..0000000
--- a/legacy/Data/Questions/ingsw/0613_49/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_49/wrong2.txt b/legacy/Data/Questions/ingsw/0613_49/wrong2.txt
deleted file mode 100644
index a3d79a4..0000000
--- a/legacy/Data/Questions/ingsw/0613_49/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_5/correct.txt b/legacy/Data/Questions/ingsw/0613_5/correct.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0613_5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_5/quest.txt b/legacy/Data/Questions/ingsw/0613_5/quest.txt
deleted file mode 100644
index 579b39b..0000000
--- a/legacy/Data/Questions/ingsw/0613_5/quest.txt
+++ /dev/null
@@ -1,29 +0,0 @@
-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/Questions/ingsw/0613_5/wrong1.txt b/legacy/Data/Questions/ingsw/0613_5/wrong1.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0613_5/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_5/wrong2.txt b/legacy/Data/Questions/ingsw/0613_5/wrong2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0613_5/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_6/correct.txt b/legacy/Data/Questions/ingsw/0613_6/correct.txt
deleted file mode 100644
index a98afd2..0000000
--- a/legacy/Data/Questions/ingsw/0613_6/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_6/quest.txt b/legacy/Data/Questions/ingsw/0613_6/quest.txt
deleted file mode 100644
index b420aaf..0000000
--- a/legacy/Data/Questions/ingsw/0613_6/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0613_6/wrong1.txt b/legacy/Data/Questions/ingsw/0613_6/wrong1.txt
deleted file mode 100644
index 66064fe..0000000
--- a/legacy/Data/Questions/ingsw/0613_6/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_6/wrong2.txt b/legacy/Data/Questions/ingsw/0613_6/wrong2.txt
deleted file mode 100644
index c71f1f5..0000000
--- a/legacy/Data/Questions/ingsw/0613_6/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_7/correct.txt b/legacy/Data/Questions/ingsw/0613_7/correct.txt
deleted file mode 100644
index a40ea7d..0000000
--- a/legacy/Data/Questions/ingsw/0613_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0613_7/quest.txt b/legacy/Data/Questions/ingsw/0613_7/quest.txt
deleted file mode 100644
index dbd72c0..0000000
--- a/legacy/Data/Questions/ingsw/0613_7/quest.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-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/Questions/ingsw/0613_7/wrong1.txt b/legacy/Data/Questions/ingsw/0613_7/wrong1.txt
deleted file mode 100644
index abe0eaa..0000000
--- a/legacy/Data/Questions/ingsw/0613_7/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0613_7/wrong2.txt b/legacy/Data/Questions/ingsw/0613_7/wrong2.txt
deleted file mode 100644
index 5b77112..0000000
--- a/legacy/Data/Questions/ingsw/0613_7/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0613_8/correct.txt b/legacy/Data/Questions/ingsw/0613_8/correct.txt
deleted file mode 100644
index 489e74c..0000000
--- a/legacy/Data/Questions/ingsw/0613_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-5*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_8/quest.txt b/legacy/Data/Questions/ingsw/0613_8/quest.txt
deleted file mode 100644
index 570368e..0000000
--- a/legacy/Data/Questions/ingsw/0613_8/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0613_8/wrong1.txt b/legacy/Data/Questions/ingsw/0613_8/wrong1.txt
deleted file mode 100644
index bf91afb..0000000
--- a/legacy/Data/Questions/ingsw/0613_8/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-7*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_8/wrong2.txt b/legacy/Data/Questions/ingsw/0613_8/wrong2.txt
deleted file mode 100644
index 23cbd0e..0000000
--- a/legacy/Data/Questions/ingsw/0613_8/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-6*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_9/quest.txt b/legacy/Data/Questions/ingsw/0613_9/quest.txt
deleted file mode 100644
index 89f55eb..0000000
--- a/legacy/Data/Questions/ingsw/0613_9/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0613_9/wrong1.txt b/legacy/Data/Questions/ingsw/0613_9/wrong1.txt
deleted file mode 100644
index 4bcd55f..0000000
--- a/legacy/Data/Questions/ingsw/0613_9/wrong1.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/0613_9/wrong2.txt b/legacy/Data/Questions/ingsw/0613_9/wrong2.txt
deleted file mode 100644
index 2c10a10..0000000
--- a/legacy/Data/Questions/ingsw/0613_9/wrong2.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-input12)
-connect(sc1.output14, sc4.input14)
-connect(sc2.output24, sc4.input24)
-connect(sc
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0613_9/wrong3.txt b/legacy/Data/Questions/ingsw/0613_9/wrong3.txt
deleted file mode 100644
index 7ddc09e..0000000
--- a/legacy/Data/Questions/ingsw/0613_9/wrong3.txt
+++ /dev/null
@@ -1,46 +0,0 @@
-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/Questions/ingsw/0621_0/correct.txt b/legacy/Data/Questions/ingsw/0621_0/correct.txt
deleted file mode 100644
index 81ceb23..0000000
--- a/legacy/Data/Questions/ingsw/0621_0/correct.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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/Questions/ingsw/0621_0/quest.txt b/legacy/Data/Questions/ingsw/0621_0/quest.txt
deleted file mode 100644
index 2eb7f69..0000000
--- a/legacy/Data/Questions/ingsw/0621_0/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0621_0/wrong0.txt b/legacy/Data/Questions/ingsw/0621_0/wrong0.txt
deleted file mode 100644
index e09501c..0000000
--- a/legacy/Data/Questions/ingsw/0621_0/wrong0.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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/Questions/ingsw/0621_0/wrong1.txt b/legacy/Data/Questions/ingsw/0621_0/wrong1.txt
deleted file mode 100644
index f7ab72e..0000000
--- a/legacy/Data/Questions/ingsw/0621_0/wrong1.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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/Questions/ingsw/0621_1/correct.txt b/legacy/Data/Questions/ingsw/0621_1/correct.txt
deleted file mode 100644
index b740a0a..0000000
--- a/legacy/Data/Questions/ingsw/0621_1/correct.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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/Questions/ingsw/0621_1/quest.txt b/legacy/Data/Questions/ingsw/0621_1/quest.txt
deleted file mode 100644
index 5a1289f..0000000
--- a/legacy/Data/Questions/ingsw/0621_1/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_1/wrong1.txt b/legacy/Data/Questions/ingsw/0621_1/wrong1.txt
deleted file mode 100644
index 57fc69d..0000000
--- a/legacy/Data/Questions/ingsw/0621_1/wrong1.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0621_1/wrong2.txt b/legacy/Data/Questions/ingsw/0621_1/wrong2.txt
deleted file mode 100644
index 3390b13..0000000
--- a/legacy/Data/Questions/ingsw/0621_1/wrong2.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0621_10/correct.txt b/legacy/Data/Questions/ingsw/0621_10/correct.txt
deleted file mode 100644
index f8c9568..0000000
--- a/legacy/Data/Questions/ingsw/0621_10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_10/quest.txt b/legacy/Data/Questions/ingsw/0621_10/quest.txt
deleted file mode 100644
index ba1496d..0000000
--- a/legacy/Data/Questions/ingsw/0621_10/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-Si consideri il seguente modello Modelica:
-<html>
-class System
-Integer x;
-initial equation
-x = 0;
-equation
-when sample(0, 2) then
-    x = 1 - pre(x);
-end when;
-end System;
-</html>
-Quale delle seguenti affermazioni è vera per la variabile intera x?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_10/wrong0.txt b/legacy/Data/Questions/ingsw/0621_10/wrong0.txt
deleted file mode 100644
index f485a50..0000000
--- a/legacy/Data/Questions/ingsw/0621_10/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_10/wrong1.txt b/legacy/Data/Questions/ingsw/0621_10/wrong1.txt
deleted file mode 100644
index a7af2cb..0000000
--- a/legacy/Data/Questions/ingsw/0621_10/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_13/correct.txt b/legacy/Data/Questions/ingsw/0621_13/correct.txt
deleted file mode 100644
index 0c54a95..0000000
--- a/legacy/Data/Questions/ingsw/0621_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Sviluppo plan-driven.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_13/quest.txt b/legacy/Data/Questions/ingsw/0621_13/quest.txt
deleted file mode 100644
index 3c60626..0000000
--- a/legacy/Data/Questions/ingsw/0621_13/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_13/wrong0.txt b/legacy/Data/Questions/ingsw/0621_13/wrong0.txt
deleted file mode 100644
index 9d2b250..0000000
--- a/legacy/Data/Questions/ingsw/0621_13/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-Sviluppo Iterativo
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_13/wrong1.txt b/legacy/Data/Questions/ingsw/0621_13/wrong1.txt
deleted file mode 100644
index b37e1a6..0000000
--- a/legacy/Data/Questions/ingsw/0621_13/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Sviluppo Agile.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_14/correct.txt b/legacy/Data/Questions/ingsw/0621_14/correct.txt
deleted file mode 100644
index a4a8878..0000000
--- a/legacy/Data/Questions/ingsw/0621_14/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_14/quest.txt b/legacy/Data/Questions/ingsw/0621_14/quest.txt
deleted file mode 100644
index 8bbcdb8..0000000
--- a/legacy/Data/Questions/ingsw/0621_14/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Il system testing si concentra su:
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_14/wrong0.txt b/legacy/Data/Questions/ingsw/0621_14/wrong0.txt
deleted file mode 100644
index 3214f65..0000000
--- a/legacy/Data/Questions/ingsw/0621_14/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-Testare le interfacce per ciascuna componente.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_14/wrong1.txt b/legacy/Data/Questions/ingsw/0621_14/wrong1.txt
deleted file mode 100644
index 6a9cb98..0000000
--- a/legacy/Data/Questions/ingsw/0621_14/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Testare le funzionalità di unità software individuali, oggetti, classi o metodi.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_17/correct.txt b/legacy/Data/Questions/ingsw/0621_17/correct.txt
deleted file mode 100644
index 3f5bba6..0000000
--- a/legacy/Data/Questions/ingsw/0621_17/correct.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0621_17/quest.txt b/legacy/Data/Questions/ingsw/0621_17/quest.txt
deleted file mode 100644
index de77723..0000000
--- a/legacy/Data/Questions/ingsw/0621_17/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0621_17/wrong0.txt b/legacy/Data/Questions/ingsw/0621_17/wrong0.txt
deleted file mode 100644
index d23fe8e..0000000
--- a/legacy/Data/Questions/ingsw/0621_17/wrong0.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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/Questions/ingsw/0621_17/wrong1.txt b/legacy/Data/Questions/ingsw/0621_17/wrong1.txt
deleted file mode 100644
index 33310f9..0000000
--- a/legacy/Data/Questions/ingsw/0621_17/wrong1.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/0621_19/correct.txt b/legacy/Data/Questions/ingsw/0621_19/correct.txt
deleted file mode 100644
index d3826b5..0000000
--- a/legacy/Data/Questions/ingsw/0621_19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_19/quest.txt b/legacy/Data/Questions/ingsw/0621_19/quest.txt
deleted file mode 100644
index b3ee6d9..0000000
--- a/legacy/Data/Questions/ingsw/0621_19/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-Si consideri il seguente modello Modelica.
-<html>
-class System
-Boolean x;
-initial equation
-x = false;
-equation
-when sample(0, 2) then
-    x = not (pre(x));
-end when;
-end System;
-</html>
-Quale delle seguenti affermazioni vale per la variabile booleana x ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_19/wrong0.txt b/legacy/Data/Questions/ingsw/0621_19/wrong0.txt
deleted file mode 100644
index 6245a2f..0000000
--- a/legacy/Data/Questions/ingsw/0621_19/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_19/wrong1.txt b/legacy/Data/Questions/ingsw/0621_19/wrong1.txt
deleted file mode 100644
index 0ba96d3..0000000
--- a/legacy/Data/Questions/ingsw/0621_19/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_2/correct.txt b/legacy/Data/Questions/ingsw/0621_2/correct.txt
deleted file mode 100644
index 23cbd0e..0000000
--- a/legacy/Data/Questions/ingsw/0621_2/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-6*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_2/quest.txt b/legacy/Data/Questions/ingsw/0621_2/quest.txt
deleted file mode 100644
index c91abc9..0000000
--- a/legacy/Data/Questions/ingsw/0621_2/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_2/wrong0.txt b/legacy/Data/Questions/ingsw/0621_2/wrong0.txt
deleted file mode 100644
index 489e74c..0000000
--- a/legacy/Data/Questions/ingsw/0621_2/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-5*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_2/wrong1.txt b/legacy/Data/Questions/ingsw/0621_2/wrong1.txt
deleted file mode 100644
index 63ca2eb..0000000
--- a/legacy/Data/Questions/ingsw/0621_2/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-4*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_21/correct.txt b/legacy/Data/Questions/ingsw/0621_21/correct.txt
deleted file mode 100644
index c24cae9..0000000
--- a/legacy/Data/Questions/ingsw/0621_21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-A*(2 + p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_21/quest.txt b/legacy/Data/Questions/ingsw/0621_21/quest.txt
deleted file mode 100644
index 77c80a6..0000000
--- a/legacy/Data/Questions/ingsw/0621_21/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_21/wrong0.txt b/legacy/Data/Questions/ingsw/0621_21/wrong0.txt
deleted file mode 100644
index a9b1c29..0000000
--- a/legacy/Data/Questions/ingsw/0621_21/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-3*A*p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_21/wrong1.txt b/legacy/Data/Questions/ingsw/0621_21/wrong1.txt
deleted file mode 100644
index 6e771e9..0000000
--- a/legacy/Data/Questions/ingsw/0621_21/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-A*(1 + p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_22/correct.txt b/legacy/Data/Questions/ingsw/0621_22/correct.txt
deleted file mode 100644
index 83f9204..0000000
--- a/legacy/Data/Questions/ingsw/0621_22/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/LSxqSIl.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_22/quest.txt b/legacy/Data/Questions/ingsw/0621_22/quest.txt
deleted file mode 100644
index 5d926db..0000000
--- a/legacy/Data/Questions/ingsw/0621_22/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_22/wrong0.txt b/legacy/Data/Questions/ingsw/0621_22/wrong0.txt
deleted file mode 100644
index d2eb66b..0000000
--- a/legacy/Data/Questions/ingsw/0621_22/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/yGc7Zf2.png
diff --git a/legacy/Data/Questions/ingsw/0621_22/wrong1.txt b/legacy/Data/Questions/ingsw/0621_22/wrong1.txt
deleted file mode 100644
index dbdbad5..0000000
--- a/legacy/Data/Questions/ingsw/0621_22/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/3t92wEw.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_24/correct.txt b/legacy/Data/Questions/ingsw/0621_24/correct.txt
deleted file mode 100644
index a7029bc..0000000
--- a/legacy/Data/Questions/ingsw/0621_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [1, 4] oppure nell'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_24/quest.txt b/legacy/Data/Questions/ingsw/0621_24/quest.txt
deleted file mode 100644
index e943282..0000000
--- a/legacy/Data/Questions/ingsw/0621_24/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato.
-<html>
-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;
-</html>
-Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_24/wrong0.txt b/legacy/Data/Questions/ingsw/0621_24/wrong0.txt
deleted file mode 100644
index 710b111..0000000
--- a/legacy/Data/Questions/ingsw/0621_24/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_24/wrong1.txt b/legacy/Data/Questions/ingsw/0621_24/wrong1.txt
deleted file mode 100644
index a82929b..0000000
--- a/legacy/Data/Questions/ingsw/0621_24/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_3/correct.txt b/legacy/Data/Questions/ingsw/0621_3/correct.txt
deleted file mode 100644
index 68bfd31..0000000
--- a/legacy/Data/Questions/ingsw/0621_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_3/quest.txt b/legacy/Data/Questions/ingsw/0621_3/quest.txt
deleted file mode 100644
index 4589c15..0000000
--- a/legacy/Data/Questions/ingsw/0621_3/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Quale delle seguenti affermazione è vera riguardo al beta testing ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_3/wrong0.txt b/legacy/Data/Questions/ingsw/0621_3/wrong0.txt
deleted file mode 100644
index ab58544..0000000
--- a/legacy/Data/Questions/ingsw/0621_3/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_3/wrong1.txt b/legacy/Data/Questions/ingsw/0621_3/wrong1.txt
deleted file mode 100644
index f021931..0000000
--- a/legacy/Data/Questions/ingsw/0621_3/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Test automatizzato sono eseguiti sulla versione finale del sistema presso il cliente.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_32/correct.txt b/legacy/Data/Questions/ingsw/0621_32/correct.txt
deleted file mode 100644
index ddb0d65..0000000
--- a/legacy/Data/Questions/ingsw/0621_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_32/quest.txt b/legacy/Data/Questions/ingsw/0621_32/quest.txt
deleted file mode 100644
index 7004fa1..0000000
--- a/legacy/Data/Questions/ingsw/0621_32/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena i requisiti per il sistema monitorato sono violati.
-<html>
-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;
-</html>
-Quale delle seguenti affermazioni meglio descrive il requisito monitorato.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_32/wrong0.txt b/legacy/Data/Questions/ingsw/0621_32/wrong0.txt
deleted file mode 100644
index 3e05ae7..0000000
--- a/legacy/Data/Questions/ingsw/0621_32/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è fuori dall'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_32/wrong1.txt b/legacy/Data/Questions/ingsw/0621_32/wrong1.txt
deleted file mode 100644
index 7c7a691..0000000
--- a/legacy/Data/Questions/ingsw/0621_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variable x è minore di 0.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_35/correct.txt b/legacy/Data/Questions/ingsw/0621_35/correct.txt
deleted file mode 100644
index 0dcbeca..0000000
--- a/legacy/Data/Questions/ingsw/0621_35/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_35/quest.txt b/legacy/Data/Questions/ingsw/0621_35/quest.txt
deleted file mode 100644
index f3019d0..0000000
--- a/legacy/Data/Questions/ingsw/0621_35/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Si consideri il Test-Driven Development (TDD). Quale delle seguenti affermazioni è vera?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_35/wrong0.txt b/legacy/Data/Questions/ingsw/0621_35/wrong0.txt
deleted file mode 100644
index 2891ab7..0000000
--- a/legacy/Data/Questions/ingsw/0621_35/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_35/wrong1.txt b/legacy/Data/Questions/ingsw/0621_35/wrong1.txt
deleted file mode 100644
index cf5eab4..0000000
--- a/legacy/Data/Questions/ingsw/0621_35/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_36/correct.txt b/legacy/Data/Questions/ingsw/0621_36/correct.txt
deleted file mode 100644
index fc560a2..0000000
--- a/legacy/Data/Questions/ingsw/0621_36/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/0621_36/quest.txt b/legacy/Data/Questions/ingsw/0621_36/quest.txt
deleted file mode 100644
index 6473814..0000000
--- a/legacy/Data/Questions/ingsw/0621_36/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0621_36/wrong0.txt b/legacy/Data/Questions/ingsw/0621_36/wrong0.txt
deleted file mode 100644
index 61fa628..0000000
--- a/legacy/Data/Questions/ingsw/0621_36/wrong0.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/0621_36/wrong1.txt b/legacy/Data/Questions/ingsw/0621_36/wrong1.txt
deleted file mode 100644
index c8a2c3d..0000000
--- a/legacy/Data/Questions/ingsw/0621_36/wrong1.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/0621_39/correct.txt b/legacy/Data/Questions/ingsw/0621_39/correct.txt
deleted file mode 100644
index 91e6e0a..0000000
--- a/legacy/Data/Questions/ingsw/0621_39/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/J4TFpmw.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_39/quest.txt b/legacy/Data/Questions/ingsw/0621_39/quest.txt
deleted file mode 100644
index 406c612..0000000
--- a/legacy/Data/Questions/ingsw/0621_39/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0621_39/wrong0.txt b/legacy/Data/Questions/ingsw/0621_39/wrong0.txt
deleted file mode 100644
index 0f68af0..0000000
--- a/legacy/Data/Questions/ingsw/0621_39/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/xVrmeoj.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_39/wrong1.txt b/legacy/Data/Questions/ingsw/0621_39/wrong1.txt
deleted file mode 100644
index 908366a..0000000
--- a/legacy/Data/Questions/ingsw/0621_39/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/4Ew3YtM.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_6/correct.txt b/legacy/Data/Questions/ingsw/0621_6/correct.txt
deleted file mode 100644
index 81653ea..0000000
--- a/legacy/Data/Questions/ingsw/0621_6/correct.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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/Questions/ingsw/0621_6/quest.txt b/legacy/Data/Questions/ingsw/0621_6/quest.txt
deleted file mode 100644
index 8bc0606..0000000
--- a/legacy/Data/Questions/ingsw/0621_6/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0621_6/wrong0.txt b/legacy/Data/Questions/ingsw/0621_6/wrong0.txt
deleted file mode 100644
index 4c7125e..0000000
--- a/legacy/Data/Questions/ingsw/0621_6/wrong0.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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/Questions/ingsw/0621_6/wrong1.txt b/legacy/Data/Questions/ingsw/0621_6/wrong1.txt
deleted file mode 100644
index 47cf8cd..0000000
--- a/legacy/Data/Questions/ingsw/0621_6/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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/Questions/ingsw/0621_6/wrong2.txt b/legacy/Data/Questions/ingsw/0621_6/wrong2.txt
deleted file mode 100644
index 81653ea..0000000
--- a/legacy/Data/Questions/ingsw/0621_6/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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/Questions/ingsw/0621_9/correct.txt b/legacy/Data/Questions/ingsw/0621_9/correct.txt
deleted file mode 100644
index 4bef521..0000000
--- a/legacy/Data/Questions/ingsw/0621_9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requirements specification precedes the component analysis activity.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_9/quest.txt b/legacy/Data/Questions/ingsw/0621_9/quest.txt
deleted file mode 100644
index 47b8c7e..0000000
--- a/legacy/Data/Questions/ingsw/0621_9/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Consider reuse-based software development. Which of the following is true?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_9/wrong0.txt b/legacy/Data/Questions/ingsw/0621_9/wrong0.txt
deleted file mode 100644
index d37b8fe..0000000
--- a/legacy/Data/Questions/ingsw/0621_9/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requirements specification is not needed thanks to reuse.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0621_9/wrong1.txt b/legacy/Data/Questions/ingsw/0621_9/wrong1.txt
deleted file mode 100644
index 53c7eb8..0000000
--- a/legacy/Data/Questions/ingsw/0621_9/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Development and integration are not needed thanks to reuse.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_1/correct.txt b/legacy/Data/Questions/ingsw/0622_1/correct.txt
deleted file mode 100644
index 8da85a2..0000000
--- a/legacy/Data/Questions/ingsw/0622_1/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-3000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_1/quest.txt b/legacy/Data/Questions/ingsw/0622_1/quest.txt
deleted file mode 100644
index 045f2d6..0000000
--- a/legacy/Data/Questions/ingsw/0622_1/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0622_1/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_1/wrong 1.txt
deleted file mode 100644
index 0b3e0a6..0000000
--- a/legacy/Data/Questions/ingsw/0622_1/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-5000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_1/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_1/wrong 2.txt
deleted file mode 100644
index 9463411..0000000
--- a/legacy/Data/Questions/ingsw/0622_1/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-2000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_2/correct.txt b/legacy/Data/Questions/ingsw/0622_2/correct.txt
deleted file mode 100644
index f8ae137..0000000
--- a/legacy/Data/Questions/ingsw/0622_2/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-2700
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_2/quest.txt b/legacy/Data/Questions/ingsw/0622_2/quest.txt
deleted file mode 100644
index 7083f7d..0000000
--- a/legacy/Data/Questions/ingsw/0622_2/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0622_2/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_2/wrong 1.txt
deleted file mode 100644
index a211371..0000000
--- a/legacy/Data/Questions/ingsw/0622_2/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-4000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_2/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_2/wrong 2.txt
deleted file mode 100644
index 0b3e0a6..0000000
--- a/legacy/Data/Questions/ingsw/0622_2/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-5000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_3/correct.txt b/legacy/Data/Questions/ingsw/0622_3/correct.txt
deleted file mode 100644
index 07c6432..0000000
--- a/legacy/Data/Questions/ingsw/0622_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-24000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_3/quest.txt b/legacy/Data/Questions/ingsw/0622_3/quest.txt
deleted file mode 100644
index 641cce2..0000000
--- a/legacy/Data/Questions/ingsw/0622_3/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0622_3/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_3/wrong 1.txt
deleted file mode 100644
index 45842b7..0000000
--- a/legacy/Data/Questions/ingsw/0622_3/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-35000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_3/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_3/wrong 2.txt
deleted file mode 100644
index 137b176..0000000
--- a/legacy/Data/Questions/ingsw/0622_3/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-30000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_4/correct.txt b/legacy/Data/Questions/ingsw/0622_4/correct.txt
deleted file mode 100644
index 7c67f71..0000000
--- a/legacy/Data/Questions/ingsw/0622_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-950000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_4/quest.txt b/legacy/Data/Questions/ingsw/0622_4/quest.txt
deleted file mode 100644
index 0c283e9..0000000
--- a/legacy/Data/Questions/ingsw/0622_4/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0622_4/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_4/wrong 1.txt
deleted file mode 100644
index 7695ad8..0000000
--- a/legacy/Data/Questions/ingsw/0622_4/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-850000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_4/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_4/wrong 2.txt
deleted file mode 100644
index 1acd587..0000000
--- a/legacy/Data/Questions/ingsw/0622_4/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-750000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_5/correct.txt b/legacy/Data/Questions/ingsw/0622_5/correct.txt
deleted file mode 100644
index 4d597fb..0000000
--- a/legacy/Data/Questions/ingsw/0622_5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-22000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_5/quest.txt b/legacy/Data/Questions/ingsw/0622_5/quest.txt
deleted file mode 100644
index 5e83ec2..0000000
--- a/legacy/Data/Questions/ingsw/0622_5/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0622_5/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_5/wrong 1.txt
deleted file mode 100644
index 137b176..0000000
--- a/legacy/Data/Questions/ingsw/0622_5/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-30000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_5/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_5/wrong 2.txt
deleted file mode 100644
index fcb0699..0000000
--- a/legacy/Data/Questions/ingsw/0622_5/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-25000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_6/correct.txt b/legacy/Data/Questions/ingsw/0622_6/correct.txt
deleted file mode 100644
index ea557e9..0000000
--- a/legacy/Data/Questions/ingsw/0622_6/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-23000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_6/quest.txt b/legacy/Data/Questions/ingsw/0622_6/quest.txt
deleted file mode 100644
index b5b9386..0000000
--- a/legacy/Data/Questions/ingsw/0622_6/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0622_6/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_6/wrong 1.txt
deleted file mode 100644
index 137b176..0000000
--- a/legacy/Data/Questions/ingsw/0622_6/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-30000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_6/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_6/wrong 2.txt
deleted file mode 100644
index fcb0699..0000000
--- a/legacy/Data/Questions/ingsw/0622_6/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-25000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_7/correct.txt b/legacy/Data/Questions/ingsw/0622_7/correct.txt
deleted file mode 100644
index 8eb46f4..0000000
--- a/legacy/Data/Questions/ingsw/0622_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-21000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_7/quest.txt b/legacy/Data/Questions/ingsw/0622_7/quest.txt
deleted file mode 100644
index 3ab551d..0000000
--- a/legacy/Data/Questions/ingsw/0622_7/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0622_7/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_7/wrong 1.txt
deleted file mode 100644
index fcb0699..0000000
--- a/legacy/Data/Questions/ingsw/0622_7/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-25000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_7/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_7/wrong 2.txt
deleted file mode 100644
index 137b176..0000000
--- a/legacy/Data/Questions/ingsw/0622_7/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-30000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_8/correct.txt b/legacy/Data/Questions/ingsw/0622_8/correct.txt
deleted file mode 100644
index 60eaa92..0000000
--- a/legacy/Data/Questions/ingsw/0622_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0622_8/quest.txt b/legacy/Data/Questions/ingsw/0622_8/quest.txt
deleted file mode 100644
index 31346ae..0000000
--- a/legacy/Data/Questions/ingsw/0622_8/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0622_8/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_8/wrong 1.txt
deleted file mode 100644
index 3e13d27..0000000
--- a/legacy/Data/Questions/ingsw/0622_8/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0622_8/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_8/wrong 2.txt
deleted file mode 100644
index 06a3fbf..0000000
--- a/legacy/Data/Questions/ingsw/0622_8/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0622_9/correct.txt b/legacy/Data/Questions/ingsw/0622_9/correct.txt
deleted file mode 100644
index 997967b..0000000
--- a/legacy/Data/Questions/ingsw/0622_9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-700000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_9/quest.txt b/legacy/Data/Questions/ingsw/0622_9/quest.txt
deleted file mode 100644
index da5f8a9..0000000
--- a/legacy/Data/Questions/ingsw/0622_9/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0622_9/wrong 1.txt b/legacy/Data/Questions/ingsw/0622_9/wrong 1.txt
deleted file mode 100644
index 2df501e..0000000
--- a/legacy/Data/Questions/ingsw/0622_9/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-500000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0622_9/wrong 2.txt b/legacy/Data/Questions/ingsw/0622_9/wrong 2.txt
deleted file mode 100644
index 7a6c6b9..0000000
--- a/legacy/Data/Questions/ingsw/0622_9/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-300000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_1/correct.txt b/legacy/Data/Questions/ingsw/0721_1/correct.txt
deleted file mode 100644
index f8c9568..0000000
--- a/legacy/Data/Questions/ingsw/0721_1/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0721_1/quest.txt b/legacy/Data/Questions/ingsw/0721_1/quest.txt
deleted file mode 100644
index c5af322..0000000
--- a/legacy/Data/Questions/ingsw/0721_1/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-Si consideri il seguente modello Modelica:
-<pre>
-class System
-Integer x;
-initial equation
-x = 0;
-equation
-when sample(0, 2) then
-    x = 1 - pre(x);
-end when;
-end System;
-</pre>
-Quale delle seguenti affermazioni è vera per la variabile intera x?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_1/wrong1.txt b/legacy/Data/Questions/ingsw/0721_1/wrong1.txt
deleted file mode 100644
index f485a50..0000000
--- a/legacy/Data/Questions/ingsw/0721_1/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0721_1/wrong2.txt b/legacy/Data/Questions/ingsw/0721_1/wrong2.txt
deleted file mode 100644
index a7af2cb..0000000
--- a/legacy/Data/Questions/ingsw/0721_1/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0721_10/correct.txt b/legacy/Data/Questions/ingsw/0721_10/correct.txt
deleted file mode 100644
index f4e4c53..0000000
--- a/legacy/Data/Questions/ingsw/0721_10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Il performance testing è tipicamente eseguito una volta che il sistema è stato completamento integrato.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_10/quest.txt b/legacy/Data/Questions/ingsw/0721_10/quest.txt
deleted file mode 100644
index 4a711a4..0000000
--- a/legacy/Data/Questions/ingsw/0721_10/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Quale delle seguenti affermazioni è vera riguardo al performance testing?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_10/wrong1.txt b/legacy/Data/Questions/ingsw/0721_10/wrong1.txt
deleted file mode 100644
index 4885062..0000000
--- a/legacy/Data/Questions/ingsw/0721_10/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Il performance testing è tipicamente eseguito su un prototipo del sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_10/wrong2.txt b/legacy/Data/Questions/ingsw/0721_10/wrong2.txt
deleted file mode 100644
index bd881bc..0000000
--- a/legacy/Data/Questions/ingsw/0721_10/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Il performance testing è tipicamente eseguito solo sulle componenti del sistema prima dell'integrazione.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_13/correct.txt b/legacy/Data/Questions/ingsw/0721_13/correct.txt
deleted file mode 100644
index 9b5317b..0000000
--- a/legacy/Data/Questions/ingsw/0721_13/correct.txt
+++ /dev/null
@@ -1,18 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_13/quest.txt b/legacy/Data/Questions/ingsw/0721_13/quest.txt
deleted file mode 100644
index c105449..0000000
--- a/legacy/Data/Questions/ingsw/0721_13/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0721_13/wrong1.txt b/legacy/Data/Questions/ingsw/0721_13/wrong1.txt
deleted file mode 100644
index 9b5317b..0000000
--- a/legacy/Data/Questions/ingsw/0721_13/wrong1.txt
+++ /dev/null
@@ -1,18 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_13/wrong2.txt b/legacy/Data/Questions/ingsw/0721_13/wrong2.txt
deleted file mode 100644
index 78c7306..0000000
--- a/legacy/Data/Questions/ingsw/0721_13/wrong2.txt
+++ /dev/null
@@ -1,18 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_15/correct.txt b/legacy/Data/Questions/ingsw/0721_15/correct.txt
deleted file mode 100644
index 355e195..0000000
--- a/legacy/Data/Questions/ingsw/0721_15/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0721_15/quest.txt b/legacy/Data/Questions/ingsw/0721_15/quest.txt
deleted file mode 100644
index 15dbdf2..0000000
--- a/legacy/Data/Questions/ingsw/0721_15/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Quali delle seguenti attività può contribuire a validare i requisiti di un sistema ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_15/wrong1.txt b/legacy/Data/Questions/ingsw/0721_15/wrong1.txt
deleted file mode 100644
index 6806506..0000000
--- a/legacy/Data/Questions/ingsw/0721_15/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Costruire un prototipo e valutarne attentamente le performance.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_15/wrong2.txt b/legacy/Data/Questions/ingsw/0721_15/wrong2.txt
deleted file mode 100644
index 586ebee..0000000
--- a/legacy/Data/Questions/ingsw/0721_15/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Costruire un prototipo e testarlo a fondo per evidenziare subito errori di implementazione.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_17/correct.txt b/legacy/Data/Questions/ingsw/0721_17/correct.txt
deleted file mode 100644
index d3826b5..0000000
--- a/legacy/Data/Questions/ingsw/0721_17/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0721_17/quest.txt b/legacy/Data/Questions/ingsw/0721_17/quest.txt
deleted file mode 100644
index 4e55a8a..0000000
--- a/legacy/Data/Questions/ingsw/0721_17/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-Si consideri il seguente modello Modelica.
-<pre>
-class System
-Boolean x;
-initial equation
-x = false;
-equation
-when sample(0, 2) then
-    x = not (pre(x));
-end when;
-end System;
-</pre>
-Quale delle seguenti affermazioni vale per la variabile booleana x ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_17/wrong1.txt b/legacy/Data/Questions/ingsw/0721_17/wrong1.txt
deleted file mode 100644
index 6245a2f..0000000
--- a/legacy/Data/Questions/ingsw/0721_17/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0721_17/wrong2.txt b/legacy/Data/Questions/ingsw/0721_17/wrong2.txt
deleted file mode 100644
index 0ba96d3..0000000
--- a/legacy/Data/Questions/ingsw/0721_17/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0721_18/correct.txt b/legacy/Data/Questions/ingsw/0721_18/correct.txt
deleted file mode 100644
index eea60e9..0000000
--- a/legacy/Data/Questions/ingsw/0721_18/correct.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_18/quest.txt b/legacy/Data/Questions/ingsw/0721_18/quest.txt
deleted file mode 100644
index c46480d..0000000
--- a/legacy/Data/Questions/ingsw/0721_18/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/0721_18/wrong1.txt b/legacy/Data/Questions/ingsw/0721_18/wrong1.txt
deleted file mode 100644
index f66dbc7..0000000
--- a/legacy/Data/Questions/ingsw/0721_18/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_18/wrong2.txt b/legacy/Data/Questions/ingsw/0721_18/wrong2.txt
deleted file mode 100644
index 2192e79..0000000
--- a/legacy/Data/Questions/ingsw/0721_18/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_19/correct.txt b/legacy/Data/Questions/ingsw/0721_19/correct.txt
deleted file mode 100644
index 44ac343..0000000
--- a/legacy/Data/Questions/ingsw/0721_19/correct.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_19/quest.txt b/legacy/Data/Questions/ingsw/0721_19/quest.txt
deleted file mode 100644
index 6229852..0000000
--- a/legacy/Data/Questions/ingsw/0721_19/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0721_19/wrong1.txt b/legacy/Data/Questions/ingsw/0721_19/wrong1.txt
deleted file mode 100644
index 45f3fbe..0000000
--- a/legacy/Data/Questions/ingsw/0721_19/wrong1.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_19/wrong2.txt b/legacy/Data/Questions/ingsw/0721_19/wrong2.txt
deleted file mode 100644
index f6b2fef..0000000
--- a/legacy/Data/Questions/ingsw/0721_19/wrong2.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_21/correct.txt b/legacy/Data/Questions/ingsw/0721_21/correct.txt
deleted file mode 100644
index 67edba8..0000000
--- a/legacy/Data/Questions/ingsw/0721_21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0721_21/quest.txt b/legacy/Data/Questions/ingsw/0721_21/quest.txt
deleted file mode 100644
index 02d9102..0000000
--- a/legacy/Data/Questions/ingsw/0721_21/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0721_21/wrong1.txt b/legacy/Data/Questions/ingsw/0721_21/wrong1.txt
deleted file mode 100644
index 2c917d7..0000000
--- a/legacy/Data/Questions/ingsw/0721_21/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0721_21/wrong2.txt b/legacy/Data/Questions/ingsw/0721_21/wrong2.txt
deleted file mode 100644
index 1aa1cd5..0000000
--- a/legacy/Data/Questions/ingsw/0721_21/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0721_28/correct.txt b/legacy/Data/Questions/ingsw/0721_28/correct.txt
deleted file mode 100644
index c0acec0..0000000
--- a/legacy/Data/Questions/ingsw/0721_28/correct.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_28/quest.txt b/legacy/Data/Questions/ingsw/0721_28/quest.txt
deleted file mode 100644
index 04a9c59..0000000
--- a/legacy/Data/Questions/ingsw/0721_28/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0721_28/wrong1.txt b/legacy/Data/Questions/ingsw/0721_28/wrong1.txt
deleted file mode 100644
index af5ef9e..0000000
--- a/legacy/Data/Questions/ingsw/0721_28/wrong1.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_28/wrong2.txt b/legacy/Data/Questions/ingsw/0721_28/wrong2.txt
deleted file mode 100644
index 7e94fc7..0000000
--- a/legacy/Data/Questions/ingsw/0721_28/wrong2.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_29/correct.txt b/legacy/Data/Questions/ingsw/0721_29/correct.txt
deleted file mode 100644
index cb4fc9a..0000000
--- a/legacy/Data/Questions/ingsw/0721_29/correct.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_29/quest.txt b/legacy/Data/Questions/ingsw/0721_29/quest.txt
deleted file mode 100644
index 8f5424d..0000000
--- a/legacy/Data/Questions/ingsw/0721_29/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0721_29/wrong1.txt b/legacy/Data/Questions/ingsw/0721_29/wrong1.txt
deleted file mode 100644
index f32ca15..0000000
--- a/legacy/Data/Questions/ingsw/0721_29/wrong1.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_29/wrong2.txt b/legacy/Data/Questions/ingsw/0721_29/wrong2.txt
deleted file mode 100644
index 38e1c17..0000000
--- a/legacy/Data/Questions/ingsw/0721_29/wrong2.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_32/correct.txt b/legacy/Data/Questions/ingsw/0721_32/correct.txt
deleted file mode 100644
index e13eda2..0000000
--- a/legacy/Data/Questions/ingsw/0721_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0721_32/quest.txt b/legacy/Data/Questions/ingsw/0721_32/quest.txt
deleted file mode 100644
index ea06339..0000000
--- a/legacy/Data/Questions/ingsw/0721_32/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Quali delle seguenti attività è parte del processo di validazione dei requisiti ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_32/wrong1.txt b/legacy/Data/Questions/ingsw/0721_32/wrong1.txt
deleted file mode 100644
index b24f900..0000000
--- a/legacy/Data/Questions/ingsw/0721_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Accertarsi che il sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_32/wrong2.txt b/legacy/Data/Questions/ingsw/0721_32/wrong2.txt
deleted file mode 100644
index 884d6b1..0000000
--- a/legacy/Data/Questions/ingsw/0721_32/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Accertarsi che l'architettura del sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_33/correct.txt b/legacy/Data/Questions/ingsw/0721_33/correct.txt
deleted file mode 100644
index 9f4a8bf..0000000
--- a/legacy/Data/Questions/ingsw/0721_33/correct.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_33/quest.txt b/legacy/Data/Questions/ingsw/0721_33/quest.txt
deleted file mode 100644
index 496b6af..0000000
--- a/legacy/Data/Questions/ingsw/0721_33/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0721_33/wrong1.txt b/legacy/Data/Questions/ingsw/0721_33/wrong1.txt
deleted file mode 100644
index 8e7ebc7..0000000
--- a/legacy/Data/Questions/ingsw/0721_33/wrong1.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_33/wrong2.txt b/legacy/Data/Questions/ingsw/0721_33/wrong2.txt
deleted file mode 100644
index 2fd0f2e..0000000
--- a/legacy/Data/Questions/ingsw/0721_33/wrong2.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_34/correct.txt b/legacy/Data/Questions/ingsw/0721_34/correct.txt
deleted file mode 100644
index 5bca5f8..0000000
--- a/legacy/Data/Questions/ingsw/0721_34/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Testare le interfacce per ciascun componente.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_34/quest.txt b/legacy/Data/Questions/ingsw/0721_34/quest.txt
deleted file mode 100644
index 561755a..0000000
--- a/legacy/Data/Questions/ingsw/0721_34/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Il component testing si concentra su:
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_34/wrong1.txt b/legacy/Data/Questions/ingsw/0721_34/wrong1.txt
deleted file mode 100644
index 7a3fe03..0000000
--- a/legacy/Data/Questions/ingsw/0721_34/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Testare l'interazione tra molte componenti (cioè integrazione di molte unità).
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_34/wrong2.txt b/legacy/Data/Questions/ingsw/0721_34/wrong2.txt
deleted file mode 100644
index d4074cf..0000000
--- a/legacy/Data/Questions/ingsw/0721_34/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Testare funzionalità di unità software individuali, oggetti, classi o metodi.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_36/correct.txt b/legacy/Data/Questions/ingsw/0721_36/correct.txt
deleted file mode 100644
index 3a0f9a1..0000000
--- a/legacy/Data/Questions/ingsw/0721_36/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Stiamo costruendo il sistema giusto ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_36/quest.txt b/legacy/Data/Questions/ingsw/0721_36/quest.txt
deleted file mode 100644
index f7ef080..0000000
--- a/legacy/Data/Questions/ingsw/0721_36/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-La validazione risponde alla seguenete domanda:
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_36/wrong1.txt b/legacy/Data/Questions/ingsw/0721_36/wrong1.txt
deleted file mode 100644
index 6633b8c..0000000
--- a/legacy/Data/Questions/ingsw/0721_36/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Sono soddisfatti i requisti funzionali ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_36/wrong2.txt b/legacy/Data/Questions/ingsw/0721_36/wrong2.txt
deleted file mode 100644
index 7edd4bc..0000000
--- a/legacy/Data/Questions/ingsw/0721_36/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Stiamo costruendo il sistema nel modo giusto ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_4/correct.txt b/legacy/Data/Questions/ingsw/0721_4/correct.txt
deleted file mode 100644
index fe4a402..0000000
--- a/legacy/Data/Questions/ingsw/0721_4/correct.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_4/quest.txt b/legacy/Data/Questions/ingsw/0721_4/quest.txt
deleted file mode 100644
index f50c002..0000000
--- a/legacy/Data/Questions/ingsw/0721_4/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0721_4/wrong1.txt b/legacy/Data/Questions/ingsw/0721_4/wrong1.txt
deleted file mode 100644
index ad42984..0000000
--- a/legacy/Data/Questions/ingsw/0721_4/wrong1.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_4/wrong2.txt b/legacy/Data/Questions/ingsw/0721_4/wrong2.txt
deleted file mode 100644
index bb62616..0000000
--- a/legacy/Data/Questions/ingsw/0721_4/wrong2.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_5/correct.txt b/legacy/Data/Questions/ingsw/0721_5/correct.txt
deleted file mode 100644
index 0902686..0000000
--- a/legacy/Data/Questions/ingsw/0721_5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requisito funzionale.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_5/quest.txt b/legacy/Data/Questions/ingsw/0721_5/quest.txt
deleted file mode 100644
index c5dbb4e..0000000
--- a/legacy/Data/Questions/ingsw/0721_5/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-"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/Questions/ingsw/0721_5/wrong1.txt b/legacy/Data/Questions/ingsw/0721_5/wrong1.txt
deleted file mode 100644
index 396c8d3..0000000
--- a/legacy/Data/Questions/ingsw/0721_5/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requisito di performance.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_5/wrong2.txt b/legacy/Data/Questions/ingsw/0721_5/wrong2.txt
deleted file mode 100644
index 6084c49..0000000
--- a/legacy/Data/Questions/ingsw/0721_5/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requisito non-funzionale.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_6/correct.txt b/legacy/Data/Questions/ingsw/0721_6/correct.txt
deleted file mode 100644
index fc3d081..0000000
--- a/legacy/Data/Questions/ingsw/0721_6/correct.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_6/quest.txt b/legacy/Data/Questions/ingsw/0721_6/quest.txt
deleted file mode 100644
index 40a0c99..0000000
--- a/legacy/Data/Questions/ingsw/0721_6/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0721_6/wrong1.txt b/legacy/Data/Questions/ingsw/0721_6/wrong1.txt
deleted file mode 100644
index eeb1bba..0000000
--- a/legacy/Data/Questions/ingsw/0721_6/wrong1.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_6/wrong2.txt b/legacy/Data/Questions/ingsw/0721_6/wrong2.txt
deleted file mode 100644
index eb68041..0000000
--- a/legacy/Data/Questions/ingsw/0721_6/wrong2.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_8/correct.txt b/legacy/Data/Questions/ingsw/0721_8/correct.txt
deleted file mode 100644
index 99b5226..0000000
--- a/legacy/Data/Questions/ingsw/0721_8/correct.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_8/quest.txt b/legacy/Data/Questions/ingsw/0721_8/quest.txt
deleted file mode 100644
index ebf5ec9..0000000
--- a/legacy/Data/Questions/ingsw/0721_8/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/0721_8/wrong1.txt b/legacy/Data/Questions/ingsw/0721_8/wrong1.txt
deleted file mode 100644
index 75546bd..0000000
--- a/legacy/Data/Questions/ingsw/0721_8/wrong1.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0721_8/wrong2.txt b/legacy/Data/Questions/ingsw/0721_8/wrong2.txt
deleted file mode 100644
index ed6823c..0000000
--- a/legacy/Data/Questions/ingsw/0721_8/wrong2.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_1/correct.txt b/legacy/Data/Questions/ingsw/0722_1/correct.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/0722_1/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_1/quest.txt b/legacy/Data/Questions/ingsw/0722_1/quest.txt
deleted file mode 100644
index e6594c7..0000000
--- a/legacy/Data/Questions/ingsw/0722_1/quest.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-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/Questions/ingsw/0722_1/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_1/wrong 1.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0722_1/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_1/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_1/wrong 2.txt
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/Questions/ingsw/0722_1/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_10/correct.txt b/legacy/Data/Questions/ingsw/0722_10/correct.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0722_10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_10/quest.txt b/legacy/Data/Questions/ingsw/0722_10/quest.txt
deleted file mode 100644
index c18ff48..0000000
--- a/legacy/Data/Questions/ingsw/0722_10/quest.txt
+++ /dev/null
@@ -1,20 +0,0 @@
-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/Questions/ingsw/0722_10/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_10/wrong 1.txt
deleted file mode 100644
index 52f25fe..0000000
--- a/legacy/Data/Questions/ingsw/0722_10/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-70%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_10/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_10/wrong 2.txt
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/Questions/ingsw/0722_10/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_11/correct.txt b/legacy/Data/Questions/ingsw/0722_11/correct.txt
deleted file mode 100644
index f293f3e..0000000
--- a/legacy/Data/Questions/ingsw/0722_11/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0722_11/quest.txt b/legacy/Data/Questions/ingsw/0722_11/quest.txt
deleted file mode 100644
index 709cf96..0000000
--- a/legacy/Data/Questions/ingsw/0722_11/quest.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-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/Questions/ingsw/0722_11/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_11/wrong 1.txt
deleted file mode 100644
index eafabb1..0000000
--- a/legacy/Data/Questions/ingsw/0722_11/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0722_11/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_11/wrong 2.txt
deleted file mode 100644
index fc010a3..0000000
--- a/legacy/Data/Questions/ingsw/0722_11/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0722_12/correct.txt b/legacy/Data/Questions/ingsw/0722_12/correct.txt
deleted file mode 100644
index 8785661..0000000
--- a/legacy/Data/Questions/ingsw/0722_12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -50,  x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_12/quest.txt b/legacy/Data/Questions/ingsw/0722_12/quest.txt
deleted file mode 100644
index 58ef38e..0000000
--- a/legacy/Data/Questions/ingsw/0722_12/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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/Questions/ingsw/0722_12/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_12/wrong 1.txt
deleted file mode 100644
index a6df32d..0000000
--- a/legacy/Data/Questions/ingsw/0722_12/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -150,  x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_12/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_12/wrong 2.txt
deleted file mode 100644
index 0aaedb8..0000000
--- a/legacy/Data/Questions/ingsw/0722_12/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -50,  x = 0, x = 100, x = 500}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_13/correct.txt b/legacy/Data/Questions/ingsw/0722_13/correct.txt
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/Questions/ingsw/0722_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_13/quest.txt b/legacy/Data/Questions/ingsw/0722_13/quest.txt
deleted file mode 100644
index 83987bd..0000000
--- a/legacy/Data/Questions/ingsw/0722_13/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/0722_13/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_13/wrong 1.txt
deleted file mode 100644
index eb5e1cd..0000000
--- a/legacy/Data/Questions/ingsw/0722_13/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_13/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_13/wrong 2.txt
deleted file mode 100644
index cf27703..0000000
--- a/legacy/Data/Questions/ingsw/0722_13/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_14/correct.txt b/legacy/Data/Questions/ingsw/0722_14/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0722_14/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_14/quest.txt b/legacy/Data/Questions/ingsw/0722_14/quest.txt
deleted file mode 100644
index f3d1bcd..0000000
--- a/legacy/Data/Questions/ingsw/0722_14/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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/Questions/ingsw/0722_14/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_14/wrong 1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0722_14/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_14/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_14/wrong 2.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0722_14/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_15/correct.txt b/legacy/Data/Questions/ingsw/0722_15/correct.txt
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/Questions/ingsw/0722_15/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_15/quest.txt b/legacy/Data/Questions/ingsw/0722_15/quest.txt
deleted file mode 100644
index 035eb2b..0000000
--- a/legacy/Data/Questions/ingsw/0722_15/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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/Questions/ingsw/0722_15/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_15/wrong 1.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/0722_15/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_15/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_15/wrong 2.txt
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/Questions/ingsw/0722_15/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_16/correct.txt b/legacy/Data/Questions/ingsw/0722_16/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0722_16/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_16/quest.txt b/legacy/Data/Questions/ingsw/0722_16/quest.txt
deleted file mode 100644
index 12ae518..0000000
--- a/legacy/Data/Questions/ingsw/0722_16/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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/Questions/ingsw/0722_16/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_16/wrong 1.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0722_16/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_16/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_16/wrong 2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0722_16/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_17/correct.txt b/legacy/Data/Questions/ingsw/0722_17/correct.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0722_17/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_17/quest.txt b/legacy/Data/Questions/ingsw/0722_17/quest.txt
deleted file mode 100644
index 3150037..0000000
--- a/legacy/Data/Questions/ingsw/0722_17/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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/Questions/ingsw/0722_17/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_17/wrong 1.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0722_17/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_17/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_17/wrong 2.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0722_17/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_18/correct.txt b/legacy/Data/Questions/ingsw/0722_18/correct.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/0722_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_18/quest.txt b/legacy/Data/Questions/ingsw/0722_18/quest.txt
deleted file mode 100644
index ca50f58..0000000
--- a/legacy/Data/Questions/ingsw/0722_18/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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/Questions/ingsw/0722_18/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_18/wrong 1.txt
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/Questions/ingsw/0722_18/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_18/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_18/wrong 2.txt
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/Questions/ingsw/0722_18/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_19/correct.txt b/legacy/Data/Questions/ingsw/0722_19/correct.txt
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/Questions/ingsw/0722_19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_19/quest.txt b/legacy/Data/Questions/ingsw/0722_19/quest.txt
deleted file mode 100644
index a412231..0000000
--- a/legacy/Data/Questions/ingsw/0722_19/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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/Questions/ingsw/0722_19/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_19/wrong 1.txt
deleted file mode 100644
index eb5e1cd..0000000
--- a/legacy/Data/Questions/ingsw/0722_19/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_19/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_19/wrong 2.txt
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/Questions/ingsw/0722_19/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_2/correct.txt b/legacy/Data/Questions/ingsw/0722_2/correct.txt
deleted file mode 100644
index 7d0c43c..0000000
--- a/legacy/Data/Questions/ingsw/0722_2/correct.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0722_2/quest.txt b/legacy/Data/Questions/ingsw/0722_2/quest.txt
deleted file mode 100644
index 8210340..0000000
--- a/legacy/Data/Questions/ingsw/0722_2/quest.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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/Questions/ingsw/0722_2/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_2/wrong 1.txt
deleted file mode 100644
index 392cc67..0000000
--- a/legacy/Data/Questions/ingsw/0722_2/wrong 1.txt	
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0722_2/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_2/wrong 2.txt
deleted file mode 100644
index 2fde3f0..0000000
--- a/legacy/Data/Questions/ingsw/0722_2/wrong 2.txt	
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/0722_20/correct.txt b/legacy/Data/Questions/ingsw/0722_20/correct.txt
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/Questions/ingsw/0722_20/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_20/quest.txt b/legacy/Data/Questions/ingsw/0722_20/quest.txt
deleted file mode 100644
index afddbb1..0000000
--- a/legacy/Data/Questions/ingsw/0722_20/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/0722_20/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_20/wrong 1.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0722_20/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_20/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_20/wrong 2.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/0722_20/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_21/correct.txt b/legacy/Data/Questions/ingsw/0722_21/correct.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0722_21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_21/quest.txt b/legacy/Data/Questions/ingsw/0722_21/quest.txt
deleted file mode 100644
index 37d7e62..0000000
--- a/legacy/Data/Questions/ingsw/0722_21/quest.txt
+++ /dev/null
@@ -1,20 +0,0 @@
-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/Questions/ingsw/0722_21/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_21/wrong 1.txt
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/Questions/ingsw/0722_21/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_21/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_21/wrong 2.txt
deleted file mode 100644
index 90b2f35..0000000
--- a/legacy/Data/Questions/ingsw/0722_21/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_22/correct.txt b/legacy/Data/Questions/ingsw/0722_22/correct.txt
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/Questions/ingsw/0722_22/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_22/quest.txt b/legacy/Data/Questions/ingsw/0722_22/quest.txt
deleted file mode 100644
index fdca1b9..0000000
--- a/legacy/Data/Questions/ingsw/0722_22/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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/Questions/ingsw/0722_22/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_22/wrong 1.txt
deleted file mode 100644
index 1c07658..0000000
--- a/legacy/Data/Questions/ingsw/0722_22/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_22/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_22/wrong 2.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/0722_22/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_23/correct.txt b/legacy/Data/Questions/ingsw/0722_23/correct.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0722_23/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_23/quest.txt b/legacy/Data/Questions/ingsw/0722_23/quest.txt
deleted file mode 100644
index 2e81fc7..0000000
--- a/legacy/Data/Questions/ingsw/0722_23/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/0722_23/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_23/wrong 1.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0722_23/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_23/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_23/wrong 2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0722_23/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_24/correct.txt b/legacy/Data/Questions/ingsw/0722_24/correct.txt
deleted file mode 100644
index a40ea7d..0000000
--- a/legacy/Data/Questions/ingsw/0722_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0722_24/quest.txt b/legacy/Data/Questions/ingsw/0722_24/quest.txt
deleted file mode 100644
index 5b1bcf2..0000000
--- a/legacy/Data/Questions/ingsw/0722_24/quest.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-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/Questions/ingsw/0722_24/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_24/wrong 1.txt
deleted file mode 100644
index 5b77112..0000000
--- a/legacy/Data/Questions/ingsw/0722_24/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0722_24/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_24/wrong 2.txt
deleted file mode 100644
index abe0eaa..0000000
--- a/legacy/Data/Questions/ingsw/0722_24/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/0722_25/correct.txt b/legacy/Data/Questions/ingsw/0722_25/correct.txt
deleted file mode 100644
index 39d8c13..0000000
--- a/legacy/Data/Questions/ingsw/0722_25/correct.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0722_25/quest.txt b/legacy/Data/Questions/ingsw/0722_25/quest.txt
deleted file mode 100644
index 23565d6..0000000
--- a/legacy/Data/Questions/ingsw/0722_25/quest.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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/Questions/ingsw/0722_25/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_25/wrong 1.txt
deleted file mode 100644
index c5c0179..0000000
--- a/legacy/Data/Questions/ingsw/0722_25/wrong 1.txt	
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0722_25/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_25/wrong 2.txt
deleted file mode 100644
index e4e10cc..0000000
--- a/legacy/Data/Questions/ingsw/0722_25/wrong 2.txt	
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/0722_26/correct.txt b/legacy/Data/Questions/ingsw/0722_26/correct.txt
deleted file mode 100644
index 7311d41..0000000
--- a/legacy/Data/Questions/ingsw/0722_26/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0722_26/quest.txt b/legacy/Data/Questions/ingsw/0722_26/quest.txt
deleted file mode 100644
index 78ad81f..0000000
--- a/legacy/Data/Questions/ingsw/0722_26/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/0722_26/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_26/wrong 1.txt
deleted file mode 100644
index 7e48e4f..0000000
--- a/legacy/Data/Questions/ingsw/0722_26/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0722_26/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_26/wrong 2.txt
deleted file mode 100644
index 3e327ab..0000000
--- a/legacy/Data/Questions/ingsw/0722_26/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0722_3/correct.txt b/legacy/Data/Questions/ingsw/0722_3/correct.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0722_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_3/quest.txt b/legacy/Data/Questions/ingsw/0722_3/quest.txt
deleted file mode 100644
index ac6007d..0000000
--- a/legacy/Data/Questions/ingsw/0722_3/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/0722_3/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_3/wrong 1.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0722_3/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_3/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_3/wrong 2.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0722_3/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_4/correct.txt b/legacy/Data/Questions/ingsw/0722_4/correct.txt
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/Questions/ingsw/0722_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_4/quest.txt b/legacy/Data/Questions/ingsw/0722_4/quest.txt
deleted file mode 100644
index 681243a..0000000
--- a/legacy/Data/Questions/ingsw/0722_4/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/0722_4/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_4/wrong 1.txt
deleted file mode 100644
index 52f25fe..0000000
--- a/legacy/Data/Questions/ingsw/0722_4/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-70%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_4/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_4/wrong 2.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0722_4/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_5/correct.txt b/legacy/Data/Questions/ingsw/0722_5/correct.txt
deleted file mode 100644
index cf27703..0000000
--- a/legacy/Data/Questions/ingsw/0722_5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_5/quest.txt b/legacy/Data/Questions/ingsw/0722_5/quest.txt
deleted file mode 100644
index 5201b57..0000000
--- a/legacy/Data/Questions/ingsw/0722_5/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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/Questions/ingsw/0722_5/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_5/wrong 1.txt
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/Questions/ingsw/0722_5/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_5/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_5/wrong 2.txt
deleted file mode 100644
index eb5e1cd..0000000
--- a/legacy/Data/Questions/ingsw/0722_5/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_6/correct.txt b/legacy/Data/Questions/ingsw/0722_6/correct.txt
deleted file mode 100644
index 8d957c2..0000000
--- a/legacy/Data/Questions/ingsw/0722_6/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-45%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_6/quest.txt b/legacy/Data/Questions/ingsw/0722_6/quest.txt
deleted file mode 100644
index 363e53e..0000000
--- a/legacy/Data/Questions/ingsw/0722_6/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/0722_6/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_6/wrong 1.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0722_6/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_6/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_6/wrong 2.txt
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/Questions/ingsw/0722_6/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_7/correct.txt b/legacy/Data/Questions/ingsw/0722_7/correct.txt
deleted file mode 100644
index 711ba55..0000000
--- a/legacy/Data/Questions/ingsw/0722_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_7/quest.txt b/legacy/Data/Questions/ingsw/0722_7/quest.txt
deleted file mode 100644
index b33abf0..0000000
--- a/legacy/Data/Questions/ingsw/0722_7/quest.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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/Questions/ingsw/0722_7/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_7/wrong 1.txt
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/Questions/ingsw/0722_7/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_7/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_7/wrong 2.txt
deleted file mode 100644
index 52f25fe..0000000
--- a/legacy/Data/Questions/ingsw/0722_7/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-70%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_8/correct.txt b/legacy/Data/Questions/ingsw/0722_8/correct.txt
deleted file mode 100644
index 31a01d5..0000000
--- a/legacy/Data/Questions/ingsw/0722_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0722_8/quest.txt b/legacy/Data/Questions/ingsw/0722_8/quest.txt
deleted file mode 100644
index 462c3bb..0000000
--- a/legacy/Data/Questions/ingsw/0722_8/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/0722_8/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_8/wrong 1.txt
deleted file mode 100644
index 549dba8..0000000
--- a/legacy/Data/Questions/ingsw/0722_8/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0722_8/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_8/wrong 2.txt
deleted file mode 100644
index 0c564f7..0000000
--- a/legacy/Data/Questions/ingsw/0722_8/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/0722_9/correct.txt b/legacy/Data/Questions/ingsw/0722_9/correct.txt
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/Questions/ingsw/0722_9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_9/quest.txt b/legacy/Data/Questions/ingsw/0722_9/quest.txt
deleted file mode 100644
index 2b0b595..0000000
--- a/legacy/Data/Questions/ingsw/0722_9/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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/Questions/ingsw/0722_9/wrong 1.txt b/legacy/Data/Questions/ingsw/0722_9/wrong 1.txt
deleted file mode 100644
index 1c07658..0000000
--- a/legacy/Data/Questions/ingsw/0722_9/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0722_9/wrong 2.txt b/legacy/Data/Questions/ingsw/0722_9/wrong 2.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0722_9/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_10/correct.txt b/legacy/Data/Questions/ingsw/0922_10/correct.txt
deleted file mode 100644
index cefc84a..0000000
--- a/legacy/Data/Questions/ingsw/0922_10/correct.txt
+++ /dev/null
@@ -1,69 +0,0 @@
-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/Questions/ingsw/0922_10/quest.txt b/legacy/Data/Questions/ingsw/0922_10/quest.txt
deleted file mode 100644
index 9dd6e3b..0000000
--- a/legacy/Data/Questions/ingsw/0922_10/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0922_10/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_10/wrong 1.txt
deleted file mode 100644
index cc2b129..0000000
--- a/legacy/Data/Questions/ingsw/0922_10/wrong 1.txt	
+++ /dev/null
@@ -1,67 +0,0 @@
-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/Questions/ingsw/0922_10/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_10/wrong 2.txt
deleted file mode 100644
index f0f54bf..0000000
--- a/legacy/Data/Questions/ingsw/0922_10/wrong 2.txt	
+++ /dev/null
@@ -1,69 +0,0 @@
-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/Questions/ingsw/0922_11/correct.txt b/legacy/Data/Questions/ingsw/0922_11/correct.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0922_11/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_11/quest.txt b/legacy/Data/Questions/ingsw/0922_11/quest.txt
deleted file mode 100644
index 55e0e6a..0000000
--- a/legacy/Data/Questions/ingsw/0922_11/quest.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-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/Questions/ingsw/0922_11/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_11/wrong 1.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0922_11/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_11/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_11/wrong 2.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/0922_11/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_12/correct.txt b/legacy/Data/Questions/ingsw/0922_12/correct.txt
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/Questions/ingsw/0922_12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_12/quest.txt b/legacy/Data/Questions/ingsw/0922_12/quest.txt
deleted file mode 100644
index dd553a4..0000000
--- a/legacy/Data/Questions/ingsw/0922_12/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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/Questions/ingsw/0922_12/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_12/wrong 1.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0922_12/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_12/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_12/wrong 2.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0922_12/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_13/correct.txt b/legacy/Data/Questions/ingsw/0922_13/correct.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/0922_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_13/quest.txt b/legacy/Data/Questions/ingsw/0922_13/quest.txt
deleted file mode 100644
index 7e33553..0000000
--- a/legacy/Data/Questions/ingsw/0922_13/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/0922_13/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_13/wrong 1.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0922_13/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_13/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_13/wrong 2.txt
deleted file mode 100644
index f91ad01..0000000
--- a/legacy/Data/Questions/ingsw/0922_13/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-35%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_14/correct.txt b/legacy/Data/Questions/ingsw/0922_14/correct.txt
deleted file mode 100644
index 7734d60..0000000
--- a/legacy/Data/Questions/ingsw/0922_14/correct.txt
+++ /dev/null
@@ -1,71 +0,0 @@
-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/Questions/ingsw/0922_14/quest.txt b/legacy/Data/Questions/ingsw/0922_14/quest.txt
deleted file mode 100644
index 6afe072..0000000
--- a/legacy/Data/Questions/ingsw/0922_14/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0922_14/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_14/wrong 1.txt
deleted file mode 100644
index fd1c3a4..0000000
--- a/legacy/Data/Questions/ingsw/0922_14/wrong 1.txt	
+++ /dev/null
@@ -1,71 +0,0 @@
-
-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/Questions/ingsw/0922_14/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_14/wrong 2.txt
deleted file mode 100644
index 763d3a6..0000000
--- a/legacy/Data/Questions/ingsw/0922_14/wrong 2.txt	
+++ /dev/null
@@ -1,69 +0,0 @@
-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/Questions/ingsw/0922_15/correct.txt b/legacy/Data/Questions/ingsw/0922_15/correct.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0922_15/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_15/quest.txt b/legacy/Data/Questions/ingsw/0922_15/quest.txt
deleted file mode 100644
index a64d8e6..0000000
--- a/legacy/Data/Questions/ingsw/0922_15/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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/Questions/ingsw/0922_15/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_15/wrong 1.txt
deleted file mode 100644
index 7b19605..0000000
--- a/legacy/Data/Questions/ingsw/0922_15/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-75%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_15/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_15/wrong 2.txt
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/Questions/ingsw/0922_15/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_16/correct.txt b/legacy/Data/Questions/ingsw/0922_16/correct.txt
deleted file mode 100644
index 8dd7202..0000000
--- a/legacy/Data/Questions/ingsw/0922_16/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/Zzrmwyx.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_16/quest.txt b/legacy/Data/Questions/ingsw/0922_16/quest.txt
deleted file mode 100644
index df0415d..0000000
--- a/legacy/Data/Questions/ingsw/0922_16/quest.txt
+++ /dev/null
@@ -1,75 +0,0 @@
-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/Questions/ingsw/0922_16/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_16/wrong 1.txt
deleted file mode 100644
index db7cce6..0000000
--- a/legacy/Data/Questions/ingsw/0922_16/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/3ANMdkr.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_16/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_16/wrong 2.txt
deleted file mode 100644
index f0634e5..0000000
--- a/legacy/Data/Questions/ingsw/0922_16/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/2RoLmLS.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_17/correct.txt b/legacy/Data/Questions/ingsw/0922_17/correct.txt
deleted file mode 100644
index 9a7cc7e..0000000
--- a/legacy/Data/Questions/ingsw/0922_17/correct.txt
+++ /dev/null
@@ -1,69 +0,0 @@
-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/Questions/ingsw/0922_17/quest.txt b/legacy/Data/Questions/ingsw/0922_17/quest.txt
deleted file mode 100644
index 5ebf9be..0000000
--- a/legacy/Data/Questions/ingsw/0922_17/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0922_17/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_17/wrong 1.txt
deleted file mode 100644
index b635e9d..0000000
--- a/legacy/Data/Questions/ingsw/0922_17/wrong 1.txt	
+++ /dev/null
@@ -1,74 +0,0 @@
-
-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/Questions/ingsw/0922_17/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_17/wrong 2.txt
deleted file mode 100644
index 7006918..0000000
--- a/legacy/Data/Questions/ingsw/0922_17/wrong 2.txt	
+++ /dev/null
@@ -1,69 +0,0 @@
-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/Questions/ingsw/0922_18/correct.txt b/legacy/Data/Questions/ingsw/0922_18/correct.txt
deleted file mode 100644
index 9667516..0000000
--- a/legacy/Data/Questions/ingsw/0922_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/WRn8QOi.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_18/quest.txt b/legacy/Data/Questions/ingsw/0922_18/quest.txt
deleted file mode 100644
index 3d86edf..0000000
--- a/legacy/Data/Questions/ingsw/0922_18/quest.txt
+++ /dev/null
@@ -1,75 +0,0 @@
-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/Questions/ingsw/0922_18/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_18/wrong 1.txt
deleted file mode 100644
index a9214bc..0000000
--- a/legacy/Data/Questions/ingsw/0922_18/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/oUj28ho.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_18/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_18/wrong 2.txt
deleted file mode 100644
index 2a58fb7..0000000
--- a/legacy/Data/Questions/ingsw/0922_18/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/eVnEYDY.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_3/correct.txt b/legacy/Data/Questions/ingsw/0922_3/correct.txt
deleted file mode 100644
index faa122e..0000000
--- a/legacy/Data/Questions/ingsw/0922_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/VgLa2I6.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_3/quest.txt b/legacy/Data/Questions/ingsw/0922_3/quest.txt
deleted file mode 100644
index 7159aee..0000000
--- a/legacy/Data/Questions/ingsw/0922_3/quest.txt
+++ /dev/null
@@ -1,77 +0,0 @@
-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/Questions/ingsw/0922_3/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_3/wrong 1.txt
deleted file mode 100644
index 6e77050..0000000
--- a/legacy/Data/Questions/ingsw/0922_3/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/5MjNRI5.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_3/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_3/wrong 2.txt
deleted file mode 100644
index c7e9639..0000000
--- a/legacy/Data/Questions/ingsw/0922_3/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/ugOv25D.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_4/correct.txt b/legacy/Data/Questions/ingsw/0922_4/correct.txt
deleted file mode 100644
index 7b19605..0000000
--- a/legacy/Data/Questions/ingsw/0922_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-75%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_4/quest.txt b/legacy/Data/Questions/ingsw/0922_4/quest.txt
deleted file mode 100644
index 2eeb93f..0000000
--- a/legacy/Data/Questions/ingsw/0922_4/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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/Questions/ingsw/0922_4/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_4/wrong 1.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/0922_4/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_4/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_4/wrong 2.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/0922_4/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_5/correct.txt b/legacy/Data/Questions/ingsw/0922_5/correct.txt
deleted file mode 100644
index e0afa1b..0000000
--- a/legacy/Data/Questions/ingsw/0922_5/correct.txt
+++ /dev/null
@@ -1,67 +0,0 @@
-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/Questions/ingsw/0922_5/quest.txt b/legacy/Data/Questions/ingsw/0922_5/quest.txt
deleted file mode 100644
index 6cbb6d3..0000000
--- a/legacy/Data/Questions/ingsw/0922_5/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/0922_5/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_5/wrong 1.txt
deleted file mode 100644
index 53db382..0000000
--- a/legacy/Data/Questions/ingsw/0922_5/wrong 1.txt	
+++ /dev/null
@@ -1,69 +0,0 @@
-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/Questions/ingsw/0922_5/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_5/wrong 2.txt
deleted file mode 100644
index 11f8d0b..0000000
--- a/legacy/Data/Questions/ingsw/0922_5/wrong 2.txt	
+++ /dev/null
@@ -1,71 +0,0 @@
-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/Questions/ingsw/0922_6/correct.txt b/legacy/Data/Questions/ingsw/0922_6/correct.txt
deleted file mode 100644
index d494d0a..0000000
--- a/legacy/Data/Questions/ingsw/0922_6/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/2GmgSsg.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_6/quest.txt b/legacy/Data/Questions/ingsw/0922_6/quest.txt
deleted file mode 100644
index daf5598..0000000
--- a/legacy/Data/Questions/ingsw/0922_6/quest.txt
+++ /dev/null
@@ -1,73 +0,0 @@
-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/Questions/ingsw/0922_6/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_6/wrong 1.txt
deleted file mode 100644
index 2a0dce8..0000000
--- a/legacy/Data/Questions/ingsw/0922_6/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/vB4iDg8.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_6/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_6/wrong 2.txt
deleted file mode 100644
index e4e9137..0000000
--- a/legacy/Data/Questions/ingsw/0922_6/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/5Mtuh64.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_7/correct.txt b/legacy/Data/Questions/ingsw/0922_7/correct.txt
deleted file mode 100644
index fae4f5e..0000000
--- a/legacy/Data/Questions/ingsw/0922_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 85%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_7/quest.txt b/legacy/Data/Questions/ingsw/0922_7/quest.txt
deleted file mode 100644
index d94d7c9..0000000
--- a/legacy/Data/Questions/ingsw/0922_7/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/0922_7/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_7/wrong 1.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0922_7/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_7/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_7/wrong 2.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/0922_7/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_8/correct.txt b/legacy/Data/Questions/ingsw/0922_8/correct.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0922_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_8/quest.txt b/legacy/Data/Questions/ingsw/0922_8/quest.txt
deleted file mode 100644
index 983cffc..0000000
--- a/legacy/Data/Questions/ingsw/0922_8/quest.txt
+++ /dev/null
@@ -1,18 +0,0 @@
-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/Questions/ingsw/0922_8/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_8/wrong 1.txt
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/Questions/ingsw/0922_8/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_8/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_8/wrong 2.txt
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/Questions/ingsw/0922_8/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_9/correct.txt b/legacy/Data/Questions/ingsw/0922_9/correct.txt
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/Questions/ingsw/0922_9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_9/quest.txt b/legacy/Data/Questions/ingsw/0922_9/quest.txt
deleted file mode 100644
index 13fde42..0000000
--- a/legacy/Data/Questions/ingsw/0922_9/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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/Questions/ingsw/0922_9/wrong 1.txt b/legacy/Data/Questions/ingsw/0922_9/wrong 1.txt
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/Questions/ingsw/0922_9/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/0922_9/wrong 2.txt b/legacy/Data/Questions/ingsw/0922_9/wrong 2.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/0922_9/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/10/correct.txt b/legacy/Data/Questions/ingsw/10/correct.txt
deleted file mode 100644
index 00cf334..0000000
--- a/legacy/Data/Questions/ingsw/10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/10/quest.txt b/legacy/Data/Questions/ingsw/10/quest.txt
deleted file mode 100644
index 6befac6..0000000
--- a/legacy/Data/Questions/ingsw/10/quest.txt
+++ /dev/null
@@ -1,26 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato:
-<pre>
-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;
-</pre>
-
-Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/10/wrong 2.txt b/legacy/Data/Questions/ingsw/10/wrong 2.txt
deleted file mode 100644
index fe0ce72..0000000
--- a/legacy/Data/Questions/ingsw/10/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/10/wrong.txt b/legacy/Data/Questions/ingsw/10/wrong.txt
deleted file mode 100644
index 5303e44..0000000
--- a/legacy/Data/Questions/ingsw/10/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [1, 4] e fuori dall'intervallo [15, 20]
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/11/correct.txt b/legacy/Data/Questions/ingsw/11/correct.txt
deleted file mode 100644
index c24cae9..0000000
--- a/legacy/Data/Questions/ingsw/11/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-A*(2 + p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/11/quest.txt b/legacy/Data/Questions/ingsw/11/quest.txt
deleted file mode 100644
index 77a393f..0000000
--- a/legacy/Data/Questions/ingsw/11/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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/Questions/ingsw/11/wrong 2.txt b/legacy/Data/Questions/ingsw/11/wrong 2.txt
deleted file mode 100644
index 6e771e9..0000000
--- a/legacy/Data/Questions/ingsw/11/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-A*(1 + p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/11/wrong.txt b/legacy/Data/Questions/ingsw/11/wrong.txt
deleted file mode 100644
index a9b1c29..0000000
--- a/legacy/Data/Questions/ingsw/11/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-3*A*p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_1/correct.txt b/legacy/Data/Questions/ingsw/1122_1/correct.txt
deleted file mode 100644
index fd39f0f..0000000
--- a/legacy/Data/Questions/ingsw/1122_1/correct.txt
+++ /dev/null
@@ -1,44 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_1/quest.txt b/legacy/Data/Questions/ingsw/1122_1/quest.txt
deleted file mode 100644
index df0e6be..0000000
--- a/legacy/Data/Questions/ingsw/1122_1/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/1122_1/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_1/wrong 1.txt
deleted file mode 100644
index febcca9..0000000
--- a/legacy/Data/Questions/ingsw/1122_1/wrong 1.txt	
+++ /dev/null
@@ -1,77 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_1/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_1/wrong 2.txt
deleted file mode 100644
index 94279c9..0000000
--- a/legacy/Data/Questions/ingsw/1122_1/wrong 2.txt	
+++ /dev/null
@@ -1,67 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_10/correct.txt b/legacy/Data/Questions/ingsw/1122_10/correct.txt
deleted file mode 100644
index e940faa..0000000
--- a/legacy/Data/Questions/ingsw/1122_10/correct.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/1122_10/quest.txt b/legacy/Data/Questions/ingsw/1122_10/quest.txt
deleted file mode 100644
index c939cfb..0000000
--- a/legacy/Data/Questions/ingsw/1122_10/quest.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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/Questions/ingsw/1122_10/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_10/wrong 1.txt
deleted file mode 100644
index 03abba5..0000000
--- a/legacy/Data/Questions/ingsw/1122_10/wrong 1.txt	
+++ /dev/null
@@ -1,10 +0,0 @@
-
-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/Questions/ingsw/1122_10/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_10/wrong 2.txt
deleted file mode 100644
index a820d7a..0000000
--- a/legacy/Data/Questions/ingsw/1122_10/wrong 2.txt	
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/1122_11/correct.txt b/legacy/Data/Questions/ingsw/1122_11/correct.txt
deleted file mode 100644
index e74b1fc..0000000
--- a/legacy/Data/Questions/ingsw/1122_11/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/1122_11/quest.txt b/legacy/Data/Questions/ingsw/1122_11/quest.txt
deleted file mode 100644
index b46cb2b..0000000
--- a/legacy/Data/Questions/ingsw/1122_11/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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/Questions/ingsw/1122_11/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_11/wrong 1.txt
deleted file mode 100644
index d63544a..0000000
--- a/legacy/Data/Questions/ingsw/1122_11/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/1122_11/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_11/wrong 2.txt
deleted file mode 100644
index 1753a91..0000000
--- a/legacy/Data/Questions/ingsw/1122_11/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-F(x, y, z) = (z == y + 1)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_12/correct.txt b/legacy/Data/Questions/ingsw/1122_12/correct.txt
deleted file mode 100644
index 95722a4..0000000
--- a/legacy/Data/Questions/ingsw/1122_12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/toYPiWs.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_12/quest.txt b/legacy/Data/Questions/ingsw/1122_12/quest.txt
deleted file mode 100644
index 464b817..0000000
--- a/legacy/Data/Questions/ingsw/1122_12/quest.txt
+++ /dev/null
@@ -1,76 +0,0 @@
-Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente?
-
-
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_12/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_12/wrong 1.txt
deleted file mode 100644
index c737a86..0000000
--- a/legacy/Data/Questions/ingsw/1122_12/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/0yWuing.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_12/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_12/wrong 2.txt
deleted file mode 100644
index 27b6d1e..0000000
--- a/legacy/Data/Questions/ingsw/1122_12/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/AmIbYTU.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_13/correct.txt b/legacy/Data/Questions/ingsw/1122_13/correct.txt
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/Questions/ingsw/1122_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.12
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_13/quest.txt b/legacy/Data/Questions/ingsw/1122_13/quest.txt
deleted file mode 100644
index d57a552..0000000
--- a/legacy/Data/Questions/ingsw/1122_13/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/1122_13/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_13/wrong 1.txt
deleted file mode 100644
index b7bbee2..0000000
--- a/legacy/Data/Questions/ingsw/1122_13/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-0.32
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_13/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_13/wrong 2.txt
deleted file mode 100644
index 2a47a95..0000000
--- a/legacy/Data/Questions/ingsw/1122_13/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-0.08
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_14/correct.txt b/legacy/Data/Questions/ingsw/1122_14/correct.txt
deleted file mode 100644
index 97f2744..0000000
--- a/legacy/Data/Questions/ingsw/1122_14/correct.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-#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);
-}
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_14/quest.txt b/legacy/Data/Questions/ingsw/1122_14/quest.txt
deleted file mode 100644
index bd20578..0000000
--- a/legacy/Data/Questions/ingsw/1122_14/quest.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-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/Questions/ingsw/1122_14/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_14/wrong 1.txt
deleted file mode 100644
index 189d31d..0000000
--- a/legacy/Data/Questions/ingsw/1122_14/wrong 1.txt	
+++ /dev/null
@@ -1,29 +0,0 @@
-<pre>
-#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);
-
-}
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_14/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_14/wrong 2.txt
deleted file mode 100644
index 4a9e2c8..0000000
--- a/legacy/Data/Questions/ingsw/1122_14/wrong 2.txt	
+++ /dev/null
@@ -1,29 +0,0 @@
-<pre>
-#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);
-
-}
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_15/correct.txt b/legacy/Data/Questions/ingsw/1122_15/correct.txt
deleted file mode 100644
index 1a8a508..0000000
--- a/legacy/Data/Questions/ingsw/1122_15/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_15/quest.txt b/legacy/Data/Questions/ingsw/1122_15/quest.txt
deleted file mode 100644
index 0d7fe08..0000000
--- a/legacy/Data/Questions/ingsw/1122_15/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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/Questions/ingsw/1122_15/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_15/wrong 1.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/1122_15/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_15/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_15/wrong 2.txt
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/Questions/ingsw/1122_15/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_16/correct.txt b/legacy/Data/Questions/ingsw/1122_16/correct.txt
deleted file mode 100644
index 7a6c6b9..0000000
--- a/legacy/Data/Questions/ingsw/1122_16/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-300000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_16/quest.txt b/legacy/Data/Questions/ingsw/1122_16/quest.txt
deleted file mode 100644
index db10798..0000000
--- a/legacy/Data/Questions/ingsw/1122_16/quest.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-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/Questions/ingsw/1122_16/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_16/wrong 1.txt
deleted file mode 100644
index 2df501e..0000000
--- a/legacy/Data/Questions/ingsw/1122_16/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-500000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_16/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_16/wrong 2.txt
deleted file mode 100644
index 997967b..0000000
--- a/legacy/Data/Questions/ingsw/1122_16/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-700000 EUR
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_19/correct.txt b/legacy/Data/Questions/ingsw/1122_19/correct.txt
deleted file mode 100644
index e0bba82..0000000
--- a/legacy/Data/Questions/ingsw/1122_19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/EDqWXLf.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_19/quest.txt b/legacy/Data/Questions/ingsw/1122_19/quest.txt
deleted file mode 100644
index 28aa70c..0000000
--- a/legacy/Data/Questions/ingsw/1122_19/quest.txt
+++ /dev/null
@@ -1,75 +0,0 @@
-Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente?
-
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_19/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_19/wrong 1.txt
deleted file mode 100644
index 75dcbd7..0000000
--- a/legacy/Data/Questions/ingsw/1122_19/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/u6No1XI.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_19/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_19/wrong 2.txt
deleted file mode 100644
index 5e5c30f..0000000
--- a/legacy/Data/Questions/ingsw/1122_19/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/SLOrqrl.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_2/correct.txt b/legacy/Data/Questions/ingsw/1122_2/correct.txt
deleted file mode 100644
index ad21063..0000000
--- a/legacy/Data/Questions/ingsw/1122_2/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_2/quest.txt b/legacy/Data/Questions/ingsw/1122_2/quest.txt
deleted file mode 100644
index 2ef9a23..0000000
--- a/legacy/Data/Questions/ingsw/1122_2/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/1122_2/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_2/wrong 1.txt
deleted file mode 100644
index b0c70b4..0000000
--- a/legacy/Data/Questions/ingsw/1122_2/wrong 1.txt	
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_2/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_2/wrong 2.txt
deleted file mode 100644
index 50c4137..0000000
--- a/legacy/Data/Questions/ingsw/1122_2/wrong 2.txt	
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_20/correct.txt b/legacy/Data/Questions/ingsw/1122_20/correct.txt
deleted file mode 100644
index 81a4b93..0000000
--- a/legacy/Data/Questions/ingsw/1122_20/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/1122_20/quest.txt b/legacy/Data/Questions/ingsw/1122_20/quest.txt
deleted file mode 100644
index 139b0a2..0000000
--- a/legacy/Data/Questions/ingsw/1122_20/quest.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-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:
-
------------
-<pre>
-int f(int x, int y)  {   
-
-int z, k;
-
-z = 1;   k = 0;
-
-while (k < x)  { z = y*z;  k = k + 1; }
-
-return (z);
-
-}
-</pre>
-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/Questions/ingsw/1122_20/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_20/wrong 1.txt
deleted file mode 100644
index f52d5ae..0000000
--- a/legacy/Data/Questions/ingsw/1122_20/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/1122_20/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_20/wrong 2.txt
deleted file mode 100644
index d246b94..0000000
--- a/legacy/Data/Questions/ingsw/1122_20/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/1122_21/correct.txt b/legacy/Data/Questions/ingsw/1122_21/correct.txt
deleted file mode 100644
index e582263..0000000
--- a/legacy/Data/Questions/ingsw/1122_21/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_21/quest.txt b/legacy/Data/Questions/ingsw/1122_21/quest.txt
deleted file mode 100644
index 9f10cbc..0000000
--- a/legacy/Data/Questions/ingsw/1122_21/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/1122_21/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_21/wrong 1.txt
deleted file mode 100644
index 93791b3..0000000
--- a/legacy/Data/Questions/ingsw/1122_21/wrong 1.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_21/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_21/wrong 2.txt
deleted file mode 100644
index 826c225..0000000
--- a/legacy/Data/Questions/ingsw/1122_21/wrong 2.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_22/correct.txt b/legacy/Data/Questions/ingsw/1122_22/correct.txt
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/Questions/ingsw/1122_22/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 40%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_22/quest.txt b/legacy/Data/Questions/ingsw/1122_22/quest.txt
deleted file mode 100644
index a116140..0000000
--- a/legacy/Data/Questions/ingsw/1122_22/quest.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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/Questions/ingsw/1122_22/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_22/wrong 1.txt
deleted file mode 100644
index cf27703..0000000
--- a/legacy/Data/Questions/ingsw/1122_22/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 70%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_22/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_22/wrong 2.txt
deleted file mode 100644
index eb5e1cd..0000000
--- a/legacy/Data/Questions/ingsw/1122_22/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_23/correct.txt b/legacy/Data/Questions/ingsw/1122_23/correct.txt
deleted file mode 100644
index 37bad47..0000000
--- a/legacy/Data/Questions/ingsw/1122_23/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [0, 5]
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_23/quest.txt b/legacy/Data/Questions/ingsw/1122_23/quest.txt
deleted file mode 100644
index 63f2e9f..0000000
--- a/legacy/Data/Questions/ingsw/1122_23/quest.txt
+++ /dev/null
@@ -1,29 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena i requisiti per il sistema monitorato sono violati.
-<pre>
-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;
-</pre>
-Quale delle seguenti affermazioni meglio descrive il requisito monitorato.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_23/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_23/wrong 1.txt
deleted file mode 100644
index 6fa1af9..0000000
--- a/legacy/Data/Questions/ingsw/1122_23/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è fuori dall'intervallo [0, 5]
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_23/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_23/wrong 2.txt
deleted file mode 100644
index b383e07..0000000
--- a/legacy/Data/Questions/ingsw/1122_23/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-La variable x è minore di 0
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_24/correct.txt b/legacy/Data/Questions/ingsw/1122_24/correct.txt
deleted file mode 100644
index 293ebbc..0000000
--- a/legacy/Data/Questions/ingsw/1122_24/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_24/quest.txt b/legacy/Data/Questions/ingsw/1122_24/quest.txt
deleted file mode 100644
index 0accc5f..0000000
--- a/legacy/Data/Questions/ingsw/1122_24/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/1122_24/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_24/wrong 1.txt
deleted file mode 100644
index 835a5ac..0000000
--- a/legacy/Data/Questions/ingsw/1122_24/wrong 1.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_24/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_24/wrong 2.txt
deleted file mode 100644
index 5a7d171..0000000
--- a/legacy/Data/Questions/ingsw/1122_24/wrong 2.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_25/correct.txt b/legacy/Data/Questions/ingsw/1122_25/correct.txt
deleted file mode 100644
index b9f32a6..0000000
--- a/legacy/Data/Questions/ingsw/1122_25/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-c(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_25/quest.txt b/legacy/Data/Questions/ingsw/1122_25/quest.txt
deleted file mode 100644
index 4087608..0000000
--- a/legacy/Data/Questions/ingsw/1122_25/quest.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-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/Questions/ingsw/1122_25/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_25/wrong 1.txt
deleted file mode 100644
index 3143da9..0000000
--- a/legacy/Data/Questions/ingsw/1122_25/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-c(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_25/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_25/wrong 2.txt
deleted file mode 100644
index b9f32a6..0000000
--- a/legacy/Data/Questions/ingsw/1122_25/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-c(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_26/correct.txt b/legacy/Data/Questions/ingsw/1122_26/correct.txt
deleted file mode 100644
index 2f4c4c9..0000000
--- a/legacy/Data/Questions/ingsw/1122_26/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/1122_26/quest.txt b/legacy/Data/Questions/ingsw/1122_26/quest.txt
deleted file mode 100644
index 514a3fa..0000000
--- a/legacy/Data/Questions/ingsw/1122_26/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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:
-
------------
-<pre>
-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()  */
-</pre>
-Quale dei seguenti test sets consegue una branch coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_26/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_26/wrong 1.txt
deleted file mode 100644
index a82e779..0000000
--- a/legacy/Data/Questions/ingsw/1122_26/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/1122_26/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_26/wrong 2.txt
deleted file mode 100644
index 82d4c38..0000000
--- a/legacy/Data/Questions/ingsw/1122_26/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/1122_27/correct.txt b/legacy/Data/Questions/ingsw/1122_27/correct.txt
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/Questions/ingsw/1122_27/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_27/quest.txt b/legacy/Data/Questions/ingsw/1122_27/quest.txt
deleted file mode 100644
index 59f8742..0000000
--- a/legacy/Data/Questions/ingsw/1122_27/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/1122_27/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_27/wrong 1.txt
deleted file mode 100644
index 2ca9276..0000000
--- a/legacy/Data/Questions/ingsw/1122_27/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 35%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_27/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_27/wrong 2.txt
deleted file mode 100644
index 6da4c51..0000000
--- a/legacy/Data/Questions/ingsw/1122_27/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 90%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_28/correct.txt b/legacy/Data/Questions/ingsw/1122_28/correct.txt
deleted file mode 100644
index c3fc7c1..0000000
--- a/legacy/Data/Questions/ingsw/1122_28/correct.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-<pre>
-int f(in x, int y) 
-
-{ 
-int z, w;
-assert( (z + w < 1) || (z + w > 7));
-.....
-}
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_28/quest.txt b/legacy/Data/Questions/ingsw/1122_28/quest.txt
deleted file mode 100644
index 733c0cb..0000000
--- a/legacy/Data/Questions/ingsw/1122_28/quest.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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/Questions/ingsw/1122_28/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_28/wrong 1.txt
deleted file mode 100644
index 1b8fa8b..0000000
--- a/legacy/Data/Questions/ingsw/1122_28/wrong 1.txt	
+++ /dev/null
@@ -1,13 +0,0 @@
-<pre>
-int f(in x, int y) 
-
-{ 
-
-int z, w;
-
-assert( (z + w <= 1) || (z + w >= 7));
-
-.....
-
-}
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_28/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_28/wrong 2.txt
deleted file mode 100644
index b0705b4..0000000
--- a/legacy/Data/Questions/ingsw/1122_28/wrong 2.txt	
+++ /dev/null
@@ -1,13 +0,0 @@
-<pre>
-int f(in x, int y) 
-
-{ 
-
-int z, w;
-
-assert( (z + w > 1) || (z + w < 7));
-
-.....
-
-}
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_29/correct.txt b/legacy/Data/Questions/ingsw/1122_29/correct.txt
deleted file mode 100644
index 2d46409..0000000
--- a/legacy/Data/Questions/ingsw/1122_29/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/SXM3yWp.png
diff --git a/legacy/Data/Questions/ingsw/1122_29/quest.txt b/legacy/Data/Questions/ingsw/1122_29/quest.txt
deleted file mode 100644
index 52863ce..0000000
--- a/legacy/Data/Questions/ingsw/1122_29/quest.txt
+++ /dev/null
@@ -1,70 +0,0 @@
-Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente ?
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_29/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_29/wrong 1.txt
deleted file mode 100644
index b008b75..0000000
--- a/legacy/Data/Questions/ingsw/1122_29/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/CeDe2lF.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_29/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_29/wrong 2.txt
deleted file mode 100644
index 861967c..0000000
--- a/legacy/Data/Questions/ingsw/1122_29/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/HBR1EoE.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_3/correct.txt b/legacy/Data/Questions/ingsw/1122_3/correct.txt
deleted file mode 100644
index 6d02149..0000000
--- a/legacy/Data/Questions/ingsw/1122_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requisito funzionale
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_3/quest.txt b/legacy/Data/Questions/ingsw/1122_3/quest.txt
deleted file mode 100644
index ddcf7c8..0000000
--- a/legacy/Data/Questions/ingsw/1122_3/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-"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/Questions/ingsw/1122_3/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_3/wrong 1.txt
deleted file mode 100644
index fb5bb3e..0000000
--- a/legacy/Data/Questions/ingsw/1122_3/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Requisito non-funzionale
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_3/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_3/wrong 2.txt
deleted file mode 100644
index 2c39a1a..0000000
--- a/legacy/Data/Questions/ingsw/1122_3/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Requisito di performance
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_30/correct.txt b/legacy/Data/Questions/ingsw/1122_30/correct.txt
deleted file mode 100644
index 2a2ecea..0000000
--- a/legacy/Data/Questions/ingsw/1122_30/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-time(0)/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_30/quest.txt b/legacy/Data/Questions/ingsw/1122_30/quest.txt
deleted file mode 100644
index 8b8cea7..0000000
--- a/legacy/Data/Questions/ingsw/1122_30/quest.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-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/Questions/ingsw/1122_30/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_30/wrong 1.txt
deleted file mode 100644
index 9927a93..0000000
--- a/legacy/Data/Questions/ingsw/1122_30/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-time(0)/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_30/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_30/wrong 2.txt
deleted file mode 100644
index d68fd15..0000000
--- a/legacy/Data/Questions/ingsw/1122_30/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-time(0)*(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_31/correct.txt b/legacy/Data/Questions/ingsw/1122_31/correct.txt
deleted file mode 100644
index a98afd2..0000000
--- a/legacy/Data/Questions/ingsw/1122_31/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_31/quest.txt b/legacy/Data/Questions/ingsw/1122_31/quest.txt
deleted file mode 100644
index 7314e2c..0000000
--- a/legacy/Data/Questions/ingsw/1122_31/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/1122_31/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_31/wrong 1.txt
deleted file mode 100644
index 8f1589e..0000000
--- a/legacy/Data/Questions/ingsw/1122_31/wrong 1.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_31/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_31/wrong 2.txt
deleted file mode 100644
index 8fd5deb..0000000
--- a/legacy/Data/Questions/ingsw/1122_31/wrong 2.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_33/correct.txt b/legacy/Data/Questions/ingsw/1122_33/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/1122_33/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_33/quest.txt b/legacy/Data/Questions/ingsw/1122_33/quest.txt
deleted file mode 100644
index 6283906..0000000
--- a/legacy/Data/Questions/ingsw/1122_33/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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:
-
------------
-<pre>
-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()  */
-</pre>
-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/Questions/ingsw/1122_33/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_33/wrong 1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/1122_33/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_33/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_33/wrong 2.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/1122_33/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_34/correct.txt b/legacy/Data/Questions/ingsw/1122_34/correct.txt
deleted file mode 100644
index bc5692f..0000000
--- a/legacy/Data/Questions/ingsw/1122_34/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 87%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_34/quest.txt b/legacy/Data/Questions/ingsw/1122_34/quest.txt
deleted file mode 100644
index 09970ee..0000000
--- a/legacy/Data/Questions/ingsw/1122_34/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/1122_34/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_34/wrong 1.txt
deleted file mode 100644
index 1a8a508..0000000
--- a/legacy/Data/Questions/ingsw/1122_34/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_34/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_34/wrong 2.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/1122_34/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_35/correct.txt b/legacy/Data/Questions/ingsw/1122_35/correct.txt
deleted file mode 100644
index 98939be..0000000
--- a/legacy/Data/Questions/ingsw/1122_35/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-1/(1 - p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_35/quest.txt b/legacy/Data/Questions/ingsw/1122_35/quest.txt
deleted file mode 100644
index 215b21b..0000000
--- a/legacy/Data/Questions/ingsw/1122_35/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/1122_35/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_35/wrong 1.txt
deleted file mode 100644
index 56ea6ac..0000000
--- a/legacy/Data/Questions/ingsw/1122_35/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-1/(p*(1 - p))
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_35/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_35/wrong 2.txt
deleted file mode 100644
index db2276d..0000000
--- a/legacy/Data/Questions/ingsw/1122_35/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(1 - p)/p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_36/correct.txt b/legacy/Data/Questions/ingsw/1122_36/correct.txt
deleted file mode 100644
index a66c9ae..0000000
--- a/legacy/Data/Questions/ingsw/1122_36/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/1122_36/quest.txt b/legacy/Data/Questions/ingsw/1122_36/quest.txt
deleted file mode 100644
index da5d010..0000000
--- a/legacy/Data/Questions/ingsw/1122_36/quest.txt
+++ /dev/null
@@ -1,26 +0,0 @@
-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:
-<pre>
-(x + y <= 3) 
-((x + y <= 3) || (x - y > 7))
-</pre>
-
-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:
-<pre>
-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
-}
-</pre>
-Quale dei seguenti test set soddisfa il criterio della Condition/Decision coverage?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_36/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_36/wrong 1.txt
deleted file mode 100644
index abe0eaa..0000000
--- a/legacy/Data/Questions/ingsw/1122_36/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/1122_36/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_36/wrong 2.txt
deleted file mode 100644
index ea25d73..0000000
--- a/legacy/Data/Questions/ingsw/1122_36/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/1122_37/correct.txt b/legacy/Data/Questions/ingsw/1122_37/correct.txt
deleted file mode 100644
index deba1f5..0000000
--- a/legacy/Data/Questions/ingsw/1122_37/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_37/quest.txt b/legacy/Data/Questions/ingsw/1122_37/quest.txt
deleted file mode 100644
index 843e4e9..0000000
--- a/legacy/Data/Questions/ingsw/1122_37/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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/Questions/ingsw/1122_37/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_37/wrong 1.txt
deleted file mode 100644
index 6a0d3e9..0000000
--- a/legacy/Data/Questions/ingsw/1122_37/wrong 1.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_37/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_37/wrong 2.txt
deleted file mode 100644
index f2a9214..0000000
--- a/legacy/Data/Questions/ingsw/1122_37/wrong 2.txt	
+++ /dev/null
@@ -1,20 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_38/correct.txt b/legacy/Data/Questions/ingsw/1122_38/correct.txt
deleted file mode 100644
index a7029bc..0000000
--- a/legacy/Data/Questions/ingsw/1122_38/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [1, 4] oppure nell'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_38/quest.txt b/legacy/Data/Questions/ingsw/1122_38/quest.txt
deleted file mode 100644
index 24d3f68..0000000
--- a/legacy/Data/Questions/ingsw/1122_38/quest.txt
+++ /dev/null
@@ -1,29 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato.
-<pre>
-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;
-</pre>
-Quale delle seguenti affermazioni meglio descrive il requisito monitorato?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_38/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_38/wrong 1.txt
deleted file mode 100644
index 710b111..0000000
--- a/legacy/Data/Questions/ingsw/1122_38/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/1122_38/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_38/wrong 2.txt
deleted file mode 100644
index a82929b..0000000
--- a/legacy/Data/Questions/ingsw/1122_38/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [1, 4] e fuori dall'intervallo [15, 20].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_39/correct.txt b/legacy/Data/Questions/ingsw/1122_39/correct.txt
deleted file mode 100644
index 8bec3c6..0000000
--- a/legacy/Data/Questions/ingsw/1122_39/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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/Questions/ingsw/1122_39/quest.txt b/legacy/Data/Questions/ingsw/1122_39/quest.txt
deleted file mode 100644
index 5826af4..0000000
--- a/legacy/Data/Questions/ingsw/1122_39/quest.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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:
------------
-<pre>
-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()  */
-</pre>
-Quale dei seguenti test sets consegue una branch coverage del 100% ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_39/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_39/wrong 1.txt
deleted file mode 100644
index 08bfca1..0000000
--- a/legacy/Data/Questions/ingsw/1122_39/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-{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/Questions/ingsw/1122_39/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_39/wrong 2.txt
deleted file mode 100644
index 256a361..0000000
--- a/legacy/Data/Questions/ingsw/1122_39/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-{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/Questions/ingsw/1122_4/correct.txt b/legacy/Data/Questions/ingsw/1122_4/correct.txt
deleted file mode 100644
index 9ddc3d7..0000000
--- a/legacy/Data/Questions/ingsw/1122_4/correct.txt
+++ /dev/null
@@ -1,45 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_4/quest.txt b/legacy/Data/Questions/ingsw/1122_4/quest.txt
deleted file mode 100644
index 4181719..0000000
--- a/legacy/Data/Questions/ingsw/1122_4/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/1122_4/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_4/wrong 1.txt
deleted file mode 100644
index c92e243..0000000
--- a/legacy/Data/Questions/ingsw/1122_4/wrong 1.txt	
+++ /dev/null
@@ -1,67 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_4/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_4/wrong 2.txt
deleted file mode 100644
index ef7bdb0..0000000
--- a/legacy/Data/Questions/ingsw/1122_4/wrong 2.txt	
+++ /dev/null
@@ -1,69 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_40/correct.txt b/legacy/Data/Questions/ingsw/1122_40/correct.txt
deleted file mode 100644
index 6b560cf..0000000
--- a/legacy/Data/Questions/ingsw/1122_40/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 25%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_40/quest.txt b/legacy/Data/Questions/ingsw/1122_40/quest.txt
deleted file mode 100644
index 62c01e2..0000000
--- a/legacy/Data/Questions/ingsw/1122_40/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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/Questions/ingsw/1122_40/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_40/wrong 1.txt
deleted file mode 100644
index d4b5815..0000000
--- a/legacy/Data/Questions/ingsw/1122_40/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_40/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_40/wrong 2.txt
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/Questions/ingsw/1122_40/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_42/correct.txt b/legacy/Data/Questions/ingsw/1122_42/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/1122_42/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_42/quest.txt b/legacy/Data/Questions/ingsw/1122_42/quest.txt
deleted file mode 100644
index 67b07dc..0000000
--- a/legacy/Data/Questions/ingsw/1122_42/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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:
-
------------
-<pre>
-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()  */
-</pre>
-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/Questions/ingsw/1122_42/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_42/wrong 1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/1122_42/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_42/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_42/wrong 2.txt
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/Questions/ingsw/1122_42/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_43/correct.txt b/legacy/Data/Questions/ingsw/1122_43/correct.txt
deleted file mode 100644
index bc5692f..0000000
--- a/legacy/Data/Questions/ingsw/1122_43/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 87%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_43/quest.txt b/legacy/Data/Questions/ingsw/1122_43/quest.txt
deleted file mode 100644
index 1045bb8..0000000
--- a/legacy/Data/Questions/ingsw/1122_43/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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/Questions/ingsw/1122_43/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_43/wrong 1.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/1122_43/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_43/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_43/wrong 2.txt
deleted file mode 100644
index 1a8a508..0000000
--- a/legacy/Data/Questions/ingsw/1122_43/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_44/correct.txt b/legacy/Data/Questions/ingsw/1122_44/correct.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/Questions/ingsw/1122_44/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_44/quest.txt b/legacy/Data/Questions/ingsw/1122_44/quest.txt
deleted file mode 100644
index 6428a0e..0000000
--- a/legacy/Data/Questions/ingsw/1122_44/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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/Questions/ingsw/1122_44/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_44/wrong 1.txt
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/Questions/ingsw/1122_44/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-80%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_44/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_44/wrong 2.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/Questions/ingsw/1122_44/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_45/correct.txt b/legacy/Data/Questions/ingsw/1122_45/correct.txt
deleted file mode 100644
index 3fb437d..0000000
--- a/legacy/Data/Questions/ingsw/1122_45/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.56
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_45/quest.txt b/legacy/Data/Questions/ingsw/1122_45/quest.txt
deleted file mode 100644
index 1454704..0000000
--- a/legacy/Data/Questions/ingsw/1122_45/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/1122_45/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_45/wrong 1.txt
deleted file mode 100644
index fc54e00..0000000
--- a/legacy/Data/Questions/ingsw/1122_45/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-0.24
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_45/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_45/wrong 2.txt
deleted file mode 100644
index c64601b..0000000
--- a/legacy/Data/Questions/ingsw/1122_45/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-0.14
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_46/correct.txt b/legacy/Data/Questions/ingsw/1122_46/correct.txt
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/Questions/ingsw/1122_46/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_46/quest.txt b/legacy/Data/Questions/ingsw/1122_46/quest.txt
deleted file mode 100644
index 5bf1a08..0000000
--- a/legacy/Data/Questions/ingsw/1122_46/quest.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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/Questions/ingsw/1122_46/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_46/wrong 1.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/Questions/ingsw/1122_46/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_46/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_46/wrong 2.txt
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/Questions/ingsw/1122_46/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-State coverage: 60%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_47/correct.txt b/legacy/Data/Questions/ingsw/1122_47/correct.txt
deleted file mode 100644
index 475d1ef..0000000
--- a/legacy/Data/Questions/ingsw/1122_47/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-{x = -150, x = -40,  x = 0, x = 200, x = 600}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_47/quest.txt b/legacy/Data/Questions/ingsw/1122_47/quest.txt
deleted file mode 100644
index 3631f63..0000000
--- a/legacy/Data/Questions/ingsw/1122_47/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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/Questions/ingsw/1122_47/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_47/wrong 1.txt
deleted file mode 100644
index 0aaedb8..0000000
--- a/legacy/Data/Questions/ingsw/1122_47/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -50,  x = 0, x = 100, x = 500}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_47/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_47/wrong 2.txt
deleted file mode 100644
index a6df32d..0000000
--- a/legacy/Data/Questions/ingsw/1122_47/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-{x = -200, x = -150,  x = 0, x = 100, x = 700}
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_48/correct.txt b/legacy/Data/Questions/ingsw/1122_48/correct.txt
deleted file mode 100644
index f293f3e..0000000
--- a/legacy/Data/Questions/ingsw/1122_48/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/1122_48/quest.txt b/legacy/Data/Questions/ingsw/1122_48/quest.txt
deleted file mode 100644
index 4fc3c18..0000000
--- a/legacy/Data/Questions/ingsw/1122_48/quest.txt
+++ /dev/null
@@ -1,24 +0,0 @@
-Una Condition è una proposizione booleana, cioè una espressione con valore booleano che non può essere decomposta in espressioni boolean più semplici. Ad esempio, <code>(x + y <= 3)</code> è una condition.
-
-Una Decision è una espressione booleana composta da conditions e zero o più operatori booleani. Ad esempio, sono decisions:
-<pre>
-(x + y <= 3) 
-((x + y <= 3) || (x - y > 7))
-</pre>
-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:
-<pre>
-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 ?
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_48/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_48/wrong 1.txt
deleted file mode 100644
index fc010a3..0000000
--- a/legacy/Data/Questions/ingsw/1122_48/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/1122_48/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_48/wrong 2.txt
deleted file mode 100644
index eafabb1..0000000
--- a/legacy/Data/Questions/ingsw/1122_48/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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/Questions/ingsw/1122_49/correct.txt b/legacy/Data/Questions/ingsw/1122_49/correct.txt
deleted file mode 100644
index d4b5815..0000000
--- a/legacy/Data/Questions/ingsw/1122_49/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 75%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_49/quest.txt b/legacy/Data/Questions/ingsw/1122_49/quest.txt
deleted file mode 100644
index e591c8c..0000000
--- a/legacy/Data/Questions/ingsw/1122_49/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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/Questions/ingsw/1122_49/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_49/wrong 1.txt
deleted file mode 100644
index eb5e1cd..0000000
--- a/legacy/Data/Questions/ingsw/1122_49/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 100%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_49/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_49/wrong 2.txt
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/Questions/ingsw/1122_49/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Transition coverage: 50%
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_5/correct.txt b/legacy/Data/Questions/ingsw/1122_5/correct.txt
deleted file mode 100644
index f64e200..0000000
--- a/legacy/Data/Questions/ingsw/1122_5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/t6Yscfv.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_5/quest.txt b/legacy/Data/Questions/ingsw/1122_5/quest.txt
deleted file mode 100644
index bcbb3d8..0000000
--- a/legacy/Data/Questions/ingsw/1122_5/quest.txt
+++ /dev/null
@@ -1,68 +0,0 @@
-Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente?
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_5/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_5/wrong 1.txt
deleted file mode 100644
index 03aeaee..0000000
--- a/legacy/Data/Questions/ingsw/1122_5/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/AZ8nnvv.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_5/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_5/wrong 2.txt
deleted file mode 100644
index ade29f4..0000000
--- a/legacy/Data/Questions/ingsw/1122_5/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/flqJ7iy.png
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_50/correct.txt b/legacy/Data/Questions/ingsw/1122_50/correct.txt
deleted file mode 100644
index 7470aaf..0000000
--- a/legacy/Data/Questions/ingsw/1122_50/correct.txt
+++ /dev/null
@@ -1,69 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_50/quest.txt b/legacy/Data/Questions/ingsw/1122_50/quest.txt
deleted file mode 100644
index 971e607..0000000
--- a/legacy/Data/Questions/ingsw/1122_50/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/1122_50/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_50/wrong 1.txt
deleted file mode 100644
index e77e043..0000000
--- a/legacy/Data/Questions/ingsw/1122_50/wrong 1.txt	
+++ /dev/null
@@ -1,69 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_50/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_50/wrong 2.txt
deleted file mode 100644
index 03c4dea..0000000
--- a/legacy/Data/Questions/ingsw/1122_50/wrong 2.txt	
+++ /dev/null
@@ -1,71 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_6/correct.txt b/legacy/Data/Questions/ingsw/1122_6/correct.txt
deleted file mode 100644
index cf8581f..0000000
--- a/legacy/Data/Questions/ingsw/1122_6/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/1122_6/quest.txt b/legacy/Data/Questions/ingsw/1122_6/quest.txt
deleted file mode 100644
index b17d629..0000000
--- a/legacy/Data/Questions/ingsw/1122_6/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Quali delle seguenti attività può contribuire a validare i requisiti di un sistema?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_6/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_6/wrong 1.txt
deleted file mode 100644
index 2cddbca..0000000
--- a/legacy/Data/Questions/ingsw/1122_6/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Costruire un prototipo e valutarne attentamente le performance
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_6/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_6/wrong 2.txt
deleted file mode 100644
index 04f8a5e..0000000
--- a/legacy/Data/Questions/ingsw/1122_6/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Costruire un prototipo e testarlo a fondo per evidenziare subito errori di implementazione
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_7/correct.txt b/legacy/Data/Questions/ingsw/1122_7/correct.txt
deleted file mode 100644
index ce9968f..0000000
--- a/legacy/Data/Questions/ingsw/1122_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.28
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_7/quest.txt b/legacy/Data/Questions/ingsw/1122_7/quest.txt
deleted file mode 100644
index 8db1ade..0000000
--- a/legacy/Data/Questions/ingsw/1122_7/quest.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-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/Questions/ingsw/1122_7/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_7/wrong 1.txt
deleted file mode 100644
index e8f9017..0000000
--- a/legacy/Data/Questions/ingsw/1122_7/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-0.42
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_7/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_7/wrong 2.txt
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/Questions/ingsw/1122_7/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-0.12
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_8/correct.txt b/legacy/Data/Questions/ingsw/1122_8/correct.txt
deleted file mode 100644
index 1c7da8c..0000000
--- a/legacy/Data/Questions/ingsw/1122_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.03
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_8/quest.txt b/legacy/Data/Questions/ingsw/1122_8/quest.txt
deleted file mode 100644
index 1f66143..0000000
--- a/legacy/Data/Questions/ingsw/1122_8/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/1122_8/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_8/wrong 1.txt
deleted file mode 100644
index 7eb6830..0000000
--- a/legacy/Data/Questions/ingsw/1122_8/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-0.27
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_8/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_8/wrong 2.txt
deleted file mode 100644
index 8a346b7..0000000
--- a/legacy/Data/Questions/ingsw/1122_8/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-0.07
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_9/correct.txt b/legacy/Data/Questions/ingsw/1122_9/correct.txt
deleted file mode 100644
index a7a3133..0000000
--- a/legacy/Data/Questions/ingsw/1122_9/correct.txt
+++ /dev/null
@@ -1,44 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_9/quest.txt b/legacy/Data/Questions/ingsw/1122_9/quest.txt
deleted file mode 100644
index 0e4c593..0000000
--- a/legacy/Data/Questions/ingsw/1122_9/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/1122_9/wrong 1.txt b/legacy/Data/Questions/ingsw/1122_9/wrong 1.txt
deleted file mode 100644
index ea67dd7..0000000
--- a/legacy/Data/Questions/ingsw/1122_9/wrong 1.txt	
+++ /dev/null
@@ -1,71 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/1122_9/wrong 2.txt b/legacy/Data/Questions/ingsw/1122_9/wrong 2.txt
deleted file mode 100644
index 578bb6b..0000000
--- a/legacy/Data/Questions/ingsw/1122_9/wrong 2.txt	
+++ /dev/null
@@ -1,76 +0,0 @@
-<pre>
-
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/12/correct.txt b/legacy/Data/Questions/ingsw/12/correct.txt
deleted file mode 100644
index 3769c66..0000000
--- a/legacy/Data/Questions/ingsw/12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Sviluppo plan-driven
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/12/quest.txt b/legacy/Data/Questions/ingsw/12/quest.txt
deleted file mode 100644
index 48d53db..0000000
--- a/legacy/Data/Questions/ingsw/12/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/12/wrong 2.txt b/legacy/Data/Questions/ingsw/12/wrong 2.txt
deleted file mode 100644
index 9d2b250..0000000
--- a/legacy/Data/Questions/ingsw/12/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Sviluppo Iterativo
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/12/wrong.txt b/legacy/Data/Questions/ingsw/12/wrong.txt
deleted file mode 100644
index 541e265..0000000
--- a/legacy/Data/Questions/ingsw/12/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-Sviluppo Agile
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/16/correct.txt b/legacy/Data/Questions/ingsw/16/correct.txt
deleted file mode 100644
index 445c2fd..0000000
--- a/legacy/Data/Questions/ingsw/16/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/5gsmkFI.png
diff --git a/legacy/Data/Questions/ingsw/16/quest.txt b/legacy/Data/Questions/ingsw/16/quest.txt
deleted file mode 100644
index ce9037d..0000000
--- a/legacy/Data/Questions/ingsw/16/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/16/wrong 2.txt b/legacy/Data/Questions/ingsw/16/wrong 2.txt
deleted file mode 100644
index d880802..0000000
--- a/legacy/Data/Questions/ingsw/16/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/oqO8kfc.png
diff --git a/legacy/Data/Questions/ingsw/16/wrong.txt b/legacy/Data/Questions/ingsw/16/wrong.txt
deleted file mode 100644
index 79ee317..0000000
--- a/legacy/Data/Questions/ingsw/16/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/kAJWpZb.png
diff --git a/legacy/Data/Questions/ingsw/17/correct.txt b/legacy/Data/Questions/ingsw/17/correct.txt
deleted file mode 100644
index 5aeccb4..0000000
--- a/legacy/Data/Questions/ingsw/17/correct.txt
+++ /dev/null
@@ -1,25 +0,0 @@
-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/Questions/ingsw/17/quest.txt b/legacy/Data/Questions/ingsw/17/quest.txt
deleted file mode 100644
index ff93c6c..0000000
--- a/legacy/Data/Questions/ingsw/17/quest.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-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/Questions/ingsw/17/wrong 2.txt b/legacy/Data/Questions/ingsw/17/wrong 2.txt
deleted file mode 100644
index 5ab3880..0000000
--- a/legacy/Data/Questions/ingsw/17/wrong 2.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-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/Questions/ingsw/17/wrong.txt b/legacy/Data/Questions/ingsw/17/wrong.txt
deleted file mode 100644
index 12836de..0000000
--- a/legacy/Data/Questions/ingsw/17/wrong.txt
+++ /dev/null
@@ -1,25 +0,0 @@
-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/Questions/ingsw/19/correct.txt b/legacy/Data/Questions/ingsw/19/correct.txt
deleted file mode 100644
index 0465ee7..0000000
--- a/legacy/Data/Questions/ingsw/19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/19/quest.txt b/legacy/Data/Questions/ingsw/19/quest.txt
deleted file mode 100644
index b8d789e..0000000
--- a/legacy/Data/Questions/ingsw/19/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/19/wrong 2.txt b/legacy/Data/Questions/ingsw/19/wrong 2.txt
deleted file mode 100644
index 43fd110..0000000
--- a/legacy/Data/Questions/ingsw/19/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Costruire un prototipo del sistema e valutarne i requisiti non funzionali usando i dati storici dall'azienda
diff --git a/legacy/Data/Questions/ingsw/19/wrong.txt b/legacy/Data/Questions/ingsw/19/wrong.txt
deleted file mode 100644
index 1aa1cd5..0000000
--- a/legacy/Data/Questions/ingsw/19/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/2/correct.txt b/legacy/Data/Questions/ingsw/2/correct.txt
deleted file mode 100644
index 23cbd0e..0000000
--- a/legacy/Data/Questions/ingsw/2/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-6*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/2/quest.txt b/legacy/Data/Questions/ingsw/2/quest.txt
deleted file mode 100644
index 78e700c..0000000
--- a/legacy/Data/Questions/ingsw/2/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/2/wrong 2.txt b/legacy/Data/Questions/ingsw/2/wrong 2.txt
deleted file mode 100644
index 489e74c..0000000
--- a/legacy/Data/Questions/ingsw/2/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-5*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/2/wrong.txt b/legacy/Data/Questions/ingsw/2/wrong.txt
deleted file mode 100644
index 63ca2eb..0000000
--- a/legacy/Data/Questions/ingsw/2/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-4*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/20/correct.txt b/legacy/Data/Questions/ingsw/20/correct.txt
deleted file mode 100644
index 375f7c5..0000000
--- a/legacy/Data/Questions/ingsw/20/correct.txt
+++ /dev/null
@@ -1,47 +0,0 @@
-: 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/Questions/ingsw/20/quest.txt b/legacy/Data/Questions/ingsw/20/quest.txt
deleted file mode 100644
index 1fb3954..0000000
--- a/legacy/Data/Questions/ingsw/20/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/20/wrong 2.txt b/legacy/Data/Questions/ingsw/20/wrong 2.txt
deleted file mode 100644
index 43c9f97..0000000
--- a/legacy/Data/Questions/ingsw/20/wrong 2.txt	
+++ /dev/null
@@ -1,47 +0,0 @@
-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/Questions/ingsw/20/wrong.txt b/legacy/Data/Questions/ingsw/20/wrong.txt
deleted file mode 100644
index 4e53f48..0000000
--- a/legacy/Data/Questions/ingsw/20/wrong.txt
+++ /dev/null
@@ -1,47 +0,0 @@
-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/Questions/ingsw/21/correct.txt b/legacy/Data/Questions/ingsw/21/correct.txt
deleted file mode 100644
index 60eaa92..0000000
--- a/legacy/Data/Questions/ingsw/21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/21/quest.txt b/legacy/Data/Questions/ingsw/21/quest.txt
deleted file mode 100644
index 7799f39..0000000
--- a/legacy/Data/Questions/ingsw/21/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-img=https://i.imgur.com/jHN6wRm.png
-Quale delle seguenti frasi è corretta riguardo all'activity diagram in figura ?
diff --git a/legacy/Data/Questions/ingsw/21/wrong 2.txt b/legacy/Data/Questions/ingsw/21/wrong 2.txt
deleted file mode 100644
index 06a3fbf..0000000
--- a/legacy/Data/Questions/ingsw/21/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/21/wrong.txt b/legacy/Data/Questions/ingsw/21/wrong.txt
deleted file mode 100644
index 3e13d27..0000000
--- a/legacy/Data/Questions/ingsw/21/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/22/correct.txt b/legacy/Data/Questions/ingsw/22/correct.txt
deleted file mode 100644
index 2d1c2f0..0000000
--- a/legacy/Data/Questions/ingsw/22/correct.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/22/quest.txt b/legacy/Data/Questions/ingsw/22/quest.txt
deleted file mode 100644
index fcc9ac9..0000000
--- a/legacy/Data/Questions/ingsw/22/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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/Questions/ingsw/22/wrong 2.txt b/legacy/Data/Questions/ingsw/22/wrong 2.txt
deleted file mode 100644
index 40720c0..0000000
--- a/legacy/Data/Questions/ingsw/22/wrong 2.txt	
+++ /dev/null
@@ -1,21 +0,0 @@
-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/Questions/ingsw/22/wrong.txt b/legacy/Data/Questions/ingsw/22/wrong.txt
deleted file mode 100644
index eba6b6d..0000000
--- a/legacy/Data/Questions/ingsw/22/wrong.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/24/correct.txt b/legacy/Data/Questions/ingsw/24/correct.txt
deleted file mode 100644
index c7c83e5..0000000
--- a/legacy/Data/Questions/ingsw/24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-3*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/24/quest.txt b/legacy/Data/Questions/ingsw/24/quest.txt
deleted file mode 100644
index 1e2f071..0000000
--- a/legacy/Data/Questions/ingsw/24/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/24/wrong 2.txt b/legacy/Data/Questions/ingsw/24/wrong 2.txt
deleted file mode 100644
index ff38c25..0000000
--- a/legacy/Data/Questions/ingsw/24/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-2*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/24/wrong.txt b/legacy/Data/Questions/ingsw/24/wrong.txt
deleted file mode 100644
index 8c7e5a6..0000000
--- a/legacy/Data/Questions/ingsw/24/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/25/correct.txt b/legacy/Data/Questions/ingsw/25/correct.txt
deleted file mode 100644
index 1c03108..0000000
--- a/legacy/Data/Questions/ingsw/25/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/25/quest.txt b/legacy/Data/Questions/ingsw/25/quest.txt
deleted file mode 100644
index bf0f99b..0000000
--- a/legacy/Data/Questions/ingsw/25/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/25/wrong 2.txt b/legacy/Data/Questions/ingsw/25/wrong 2.txt
deleted file mode 100644
index 5187be2..0000000
--- a/legacy/Data/Questions/ingsw/25/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/25/wrong.txt b/legacy/Data/Questions/ingsw/25/wrong.txt
deleted file mode 100644
index 52330c1..0000000
--- a/legacy/Data/Questions/ingsw/25/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/26/correct.txt b/legacy/Data/Questions/ingsw/26/correct.txt
deleted file mode 100644
index e13eda2..0000000
--- a/legacy/Data/Questions/ingsw/26/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/26/quest.txt b/legacy/Data/Questions/ingsw/26/quest.txt
deleted file mode 100644
index 3cb2d1f..0000000
--- a/legacy/Data/Questions/ingsw/26/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/26/wrong 2.txt b/legacy/Data/Questions/ingsw/26/wrong 2.txt
deleted file mode 100644
index b24f900..0000000
--- a/legacy/Data/Questions/ingsw/26/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Accertarsi che il sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/26/wrong.txt b/legacy/Data/Questions/ingsw/26/wrong.txt
deleted file mode 100644
index 884d6b1..0000000
--- a/legacy/Data/Questions/ingsw/26/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-Accertarsi che l'architettura del sistema soddisfi i requisiti dati.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/32/correct.txt b/legacy/Data/Questions/ingsw/32/correct.txt
deleted file mode 100644
index 90c1575..0000000
--- a/legacy/Data/Questions/ingsw/32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/qKyYHVj.png
diff --git a/legacy/Data/Questions/ingsw/32/quest.txt b/legacy/Data/Questions/ingsw/32/quest.txt
deleted file mode 100644
index f0c9221..0000000
--- a/legacy/Data/Questions/ingsw/32/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/32/wrong 2.txt b/legacy/Data/Questions/ingsw/32/wrong 2.txt
deleted file mode 100644
index 54e368c..0000000
--- a/legacy/Data/Questions/ingsw/32/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/5I3NjLb.png
diff --git a/legacy/Data/Questions/ingsw/32/wrong.txt b/legacy/Data/Questions/ingsw/32/wrong.txt
deleted file mode 100644
index c3a4d99..0000000
--- a/legacy/Data/Questions/ingsw/32/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/NDNLPgt.png
diff --git a/legacy/Data/Questions/ingsw/33/correct.txt b/legacy/Data/Questions/ingsw/33/correct.txt
deleted file mode 100644
index ddb0d65..0000000
--- a/legacy/Data/Questions/ingsw/33/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è nell'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/33/quest.txt b/legacy/Data/Questions/ingsw/33/quest.txt
deleted file mode 100644
index 4ea55e0..0000000
--- a/legacy/Data/Questions/ingsw/33/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena i requisiti per il sistema monitorato sono violati.
-<pre>
-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;
-</pre>
-Quale delle seguenti affermazioni meglio descrive il requisito monitorato.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/33/wrong 2.txt b/legacy/Data/Questions/ingsw/33/wrong 2.txt
deleted file mode 100644
index 7c7a691..0000000
--- a/legacy/Data/Questions/ingsw/33/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-La variable x è minore di 0.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/33/wrong.txt b/legacy/Data/Questions/ingsw/33/wrong.txt
deleted file mode 100644
index 3e05ae7..0000000
--- a/legacy/Data/Questions/ingsw/33/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-La variabile x è fuori dall'intervallo [0, 5].
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/34/correct.txt b/legacy/Data/Questions/ingsw/34/correct.txt
deleted file mode 100644
index 3f7adfb..0000000
--- a/legacy/Data/Questions/ingsw/34/correct.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/34/quest.txt b/legacy/Data/Questions/ingsw/34/quest.txt
deleted file mode 100644
index 0ba09fa..0000000
--- a/legacy/Data/Questions/ingsw/34/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/34/wrong 2.txt b/legacy/Data/Questions/ingsw/34/wrong 2.txt
deleted file mode 100644
index 25f1613..0000000
--- a/legacy/Data/Questions/ingsw/34/wrong 2.txt	
+++ /dev/null
@@ -1,22 +0,0 @@
-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/Questions/ingsw/34/wrong.txt b/legacy/Data/Questions/ingsw/34/wrong.txt
deleted file mode 100644
index 4fb78cc..0000000
--- a/legacy/Data/Questions/ingsw/34/wrong.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-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/Questions/ingsw/35/correct.txt b/legacy/Data/Questions/ingsw/35/correct.txt
deleted file mode 100644
index 3a0f9a1..0000000
--- a/legacy/Data/Questions/ingsw/35/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Stiamo costruendo il sistema giusto ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/35/quest.txt b/legacy/Data/Questions/ingsw/35/quest.txt
deleted file mode 100644
index 9af583e..0000000
--- a/legacy/Data/Questions/ingsw/35/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-La validazione risponde alla seguente domanda:
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/35/wrong 2.txt b/legacy/Data/Questions/ingsw/35/wrong 2.txt
deleted file mode 100644
index 6633b8c..0000000
--- a/legacy/Data/Questions/ingsw/35/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Sono soddisfatti i requisti funzionali ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/35/wrong.txt b/legacy/Data/Questions/ingsw/35/wrong.txt
deleted file mode 100644
index 7edd4bc..0000000
--- a/legacy/Data/Questions/ingsw/35/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-Stiamo costruendo il sistema nel modo giusto ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/39/correct.txt b/legacy/Data/Questions/ingsw/39/correct.txt
deleted file mode 100644
index 634f690..0000000
--- a/legacy/Data/Questions/ingsw/39/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Il performance testing è tipicamente eseguito una volta che il sistema è stato completamento integrato
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/39/quest.txt b/legacy/Data/Questions/ingsw/39/quest.txt
deleted file mode 100644
index 4a711a4..0000000
--- a/legacy/Data/Questions/ingsw/39/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Quale delle seguenti affermazioni è vera riguardo al performance testing?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/39/wrong 2.txt b/legacy/Data/Questions/ingsw/39/wrong 2.txt
deleted file mode 100644
index 74c1239..0000000
--- a/legacy/Data/Questions/ingsw/39/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Il performance testing è tipicamente eseguito su un prototipo del sistema
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/39/wrong.txt b/legacy/Data/Questions/ingsw/39/wrong.txt
deleted file mode 100644
index bd881bc..0000000
--- a/legacy/Data/Questions/ingsw/39/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-Il performance testing è tipicamente eseguito solo sulle componenti del sistema prima dell'integrazione.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/4/correct.txt b/legacy/Data/Questions/ingsw/4/correct.txt
deleted file mode 100644
index 6e771e9..0000000
--- a/legacy/Data/Questions/ingsw/4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-A*(1 + p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/4/quest.txt b/legacy/Data/Questions/ingsw/4/quest.txt
deleted file mode 100644
index 07df0c7..0000000
--- a/legacy/Data/Questions/ingsw/4/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/4/wrong 2.txt b/legacy/Data/Questions/ingsw/4/wrong 2.txt
deleted file mode 100644
index a9b1c29..0000000
--- a/legacy/Data/Questions/ingsw/4/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-3*A*p
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/4/wrong.txt b/legacy/Data/Questions/ingsw/4/wrong.txt
deleted file mode 100644
index c24cae9..0000000
--- a/legacy/Data/Questions/ingsw/4/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-A*(2 + p)
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/43/correct.txt b/legacy/Data/Questions/ingsw/43/correct.txt
deleted file mode 100644
index c4cb236..0000000
--- a/legacy/Data/Questions/ingsw/43/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/43/quest.txt b/legacy/Data/Questions/ingsw/43/quest.txt
deleted file mode 100644
index 71eee89..0000000
--- a/legacy/Data/Questions/ingsw/43/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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/Questions/ingsw/43/wrong 2.txt b/legacy/Data/Questions/ingsw/43/wrong 2.txt
deleted file mode 100644
index 98b6414..0000000
--- a/legacy/Data/Questions/ingsw/43/wrong 2.txt	
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/43/wrong.txt b/legacy/Data/Questions/ingsw/43/wrong.txt
deleted file mode 100644
index a4ee4fb..0000000
--- a/legacy/Data/Questions/ingsw/43/wrong.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/44/correct.txt b/legacy/Data/Questions/ingsw/44/correct.txt
deleted file mode 100644
index aa45c64..0000000
--- a/legacy/Data/Questions/ingsw/44/correct.txt
+++ /dev/null
@@ -1,20 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/44/quest.txt b/legacy/Data/Questions/ingsw/44/quest.txt
deleted file mode 100644
index 18bac37..0000000
--- a/legacy/Data/Questions/ingsw/44/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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/Questions/ingsw/44/wrong 2.txt b/legacy/Data/Questions/ingsw/44/wrong 2.txt
deleted file mode 100644
index 2e82c1c..0000000
--- a/legacy/Data/Questions/ingsw/44/wrong 2.txt	
+++ /dev/null
@@ -1,20 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/44/wrong.txt b/legacy/Data/Questions/ingsw/44/wrong.txt
deleted file mode 100644
index 75b3383..0000000
--- a/legacy/Data/Questions/ingsw/44/wrong.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-<pre>
-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
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/45/correct.txt b/legacy/Data/Questions/ingsw/45/correct.txt
deleted file mode 100644
index 19d3060..0000000
--- a/legacy/Data/Questions/ingsw/45/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Layred architecture.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/45/quest.txt b/legacy/Data/Questions/ingsw/45/quest.txt
deleted file mode 100644
index e43794a..0000000
--- a/legacy/Data/Questions/ingsw/45/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-img=https://i.imgur.com/7DG7vhi.png
-Quale pattern architetturale meglio descrive l'architettura in figura ?
diff --git a/legacy/Data/Questions/ingsw/45/wrong 2.txt b/legacy/Data/Questions/ingsw/45/wrong 2.txt
deleted file mode 100644
index fd0a8b5..0000000
--- a/legacy/Data/Questions/ingsw/45/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Model View Controller
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/45/wrong.txt b/legacy/Data/Questions/ingsw/45/wrong.txt
deleted file mode 100644
index 9266c1a..0000000
--- a/legacy/Data/Questions/ingsw/45/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-Pipe and filter architecture.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/46/correct.txt b/legacy/Data/Questions/ingsw/46/correct.txt
deleted file mode 100644
index 4a45407..0000000
--- a/legacy/Data/Questions/ingsw/46/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/cMy78HJ.png
diff --git a/legacy/Data/Questions/ingsw/46/quest.txt b/legacy/Data/Questions/ingsw/46/quest.txt
deleted file mode 100644
index 20c9a97..0000000
--- a/legacy/Data/Questions/ingsw/46/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/46/wrong 2.txt b/legacy/Data/Questions/ingsw/46/wrong 2.txt
deleted file mode 100644
index 5b7d09a..0000000
--- a/legacy/Data/Questions/ingsw/46/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/7lOYboM.png
diff --git a/legacy/Data/Questions/ingsw/46/wrong.txt b/legacy/Data/Questions/ingsw/46/wrong.txt
deleted file mode 100644
index 50bd343..0000000
--- a/legacy/Data/Questions/ingsw/46/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/4gXreOh.png
diff --git a/legacy/Data/Questions/ingsw/47/correct.txt b/legacy/Data/Questions/ingsw/47/correct.txt
deleted file mode 100644
index c8bbd53..0000000
--- a/legacy/Data/Questions/ingsw/47/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Una volta selezionata la bevanda non è possibile cancellare l'operazione
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/47/quest.txt b/legacy/Data/Questions/ingsw/47/quest.txt
deleted file mode 100644
index 193a65f..0000000
--- a/legacy/Data/Questions/ingsw/47/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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/Questions/ingsw/47/wrong 2.txt b/legacy/Data/Questions/ingsw/47/wrong 2.txt
deleted file mode 100644
index bc8629f..0000000
--- a/legacy/Data/Questions/ingsw/47/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-La macchina non dà resto
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/47/wrong.txt b/legacy/Data/Questions/ingsw/47/wrong.txt
deleted file mode 100644
index 5d317c8..0000000
--- a/legacy/Data/Questions/ingsw/47/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-Una volta inserite monete per due bevande è possibile ottenerle senza reinserire le monete.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/48/correct.txt b/legacy/Data/Questions/ingsw/48/correct.txt
deleted file mode 100644
index 455d534..0000000
--- a/legacy/Data/Questions/ingsw/48/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Are we building the system right?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/48/quest.txt b/legacy/Data/Questions/ingsw/48/quest.txt
deleted file mode 100644
index b7e0b09..0000000
--- a/legacy/Data/Questions/ingsw/48/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Verification answers the following question:
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/48/wrong 2.txt b/legacy/Data/Questions/ingsw/48/wrong 2.txt
deleted file mode 100644
index 87e99c2..0000000
--- a/legacy/Data/Questions/ingsw/48/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Are we building the right system?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/48/wrong.txt b/legacy/Data/Questions/ingsw/48/wrong.txt
deleted file mode 100644
index ddc2301..0000000
--- a/legacy/Data/Questions/ingsw/48/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-Is the system cost reasonable for the intended market ?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/49/correct.txt b/legacy/Data/Questions/ingsw/49/correct.txt
deleted file mode 100644
index 88f9125..0000000
--- a/legacy/Data/Questions/ingsw/49/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requisito utente.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/49/quest.txt b/legacy/Data/Questions/ingsw/49/quest.txt
deleted file mode 100644
index e544e9e..0000000
--- a/legacy/Data/Questions/ingsw/49/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/49/wrong 2.txt b/legacy/Data/Questions/ingsw/49/wrong 2.txt
deleted file mode 100644
index 6084c49..0000000
--- a/legacy/Data/Questions/ingsw/49/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Requisito non-funzionale.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/49/wrong.txt b/legacy/Data/Questions/ingsw/49/wrong.txt
deleted file mode 100644
index 4cae0da..0000000
--- a/legacy/Data/Questions/ingsw/49/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requisito di sistema.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/5/correct.txt b/legacy/Data/Questions/ingsw/5/correct.txt
deleted file mode 100644
index 58964fc..0000000
--- a/legacy/Data/Questions/ingsw/5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Se ci sono abbastanza monete è sempre possibile ottenere la bevanda selezionata
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/5/quest.txt b/legacy/Data/Questions/ingsw/5/quest.txt
deleted file mode 100644
index 4ce9b89..0000000
--- a/legacy/Data/Questions/ingsw/5/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/5/wrong 2.txt b/legacy/Data/Questions/ingsw/5/wrong 2.txt
deleted file mode 100644
index a75a40c..0000000
--- a/legacy/Data/Questions/ingsw/5/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Una volta inserite le monete bisogna necessariamente consumare almeno una bevanda
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/5/wrong.txt b/legacy/Data/Questions/ingsw/5/wrong.txt
deleted file mode 100644
index e47f380..0000000
--- a/legacy/Data/Questions/ingsw/5/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/50/correct.txt b/legacy/Data/Questions/ingsw/50/correct.txt
deleted file mode 100644
index bb086af..0000000
--- a/legacy/Data/Questions/ingsw/50/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/50/quest.txt b/legacy/Data/Questions/ingsw/50/quest.txt
deleted file mode 100644
index 7816962..0000000
--- a/legacy/Data/Questions/ingsw/50/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-img=https://i.imgur.com/0OTH4Yw.png
-Quale delle seguenti frasi è corretta riguardo al Sequence Diagram in figura?
diff --git a/legacy/Data/Questions/ingsw/50/wrong 2.txt b/legacy/Data/Questions/ingsw/50/wrong 2.txt
deleted file mode 100644
index d61601e..0000000
--- a/legacy/Data/Questions/ingsw/50/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Periodicamente il client comunica ai pazienti le disponibilità dei medici.
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/50/wrong.txt b/legacy/Data/Questions/ingsw/50/wrong.txt
deleted file mode 100644
index dd9b316..0000000
--- a/legacy/Data/Questions/ingsw/50/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/69420/correct.txt b/legacy/Data/Questions/ingsw/69420/correct.txt
deleted file mode 100644
index 431a7c5..0000000
--- a/legacy/Data/Questions/ingsw/69420/correct.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-img=https://i.imgur.com/a8kMXoW.png
-Serafina che tagga Sabrina
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/69420/quest.txt b/legacy/Data/Questions/ingsw/69420/quest.txt
deleted file mode 100644
index 8fa4d25..0000000
--- a/legacy/Data/Questions/ingsw/69420/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-Chi insegna questo corso?
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/69420/wrong 2.txt b/legacy/Data/Questions/ingsw/69420/wrong 2.txt
deleted file mode 100644
index 670e7eb..0000000
--- a/legacy/Data/Questions/ingsw/69420/wrong 2.txt	
+++ /dev/null
@@ -1,2 +0,0 @@
-img=https://i.imgur.com/F4evurl.jpg
-Gioele che tagga Sabrina
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/69420/wrong 3.txt b/legacy/Data/Questions/ingsw/69420/wrong 3.txt
deleted file mode 100644
index 673514a..0000000
--- a/legacy/Data/Questions/ingsw/69420/wrong 3.txt	
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/69420/wrong.txt b/legacy/Data/Questions/ingsw/69420/wrong.txt
deleted file mode 100644
index 6e6963e..0000000
--- a/legacy/Data/Questions/ingsw/69420/wrong.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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/Questions/ingsw/8/correct.txt b/legacy/Data/Questions/ingsw/8/correct.txt
deleted file mode 100644
index b3843cf..0000000
--- a/legacy/Data/Questions/ingsw/8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-1.5*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/8/quest.txt b/legacy/Data/Questions/ingsw/8/quest.txt
deleted file mode 100644
index e4ebc4a..0000000
--- a/legacy/Data/Questions/ingsw/8/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/8/wrong 2.txt b/legacy/Data/Questions/ingsw/8/wrong 2.txt
deleted file mode 100644
index 8c7e5a6..0000000
--- a/legacy/Data/Questions/ingsw/8/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/8/wrong.txt b/legacy/Data/Questions/ingsw/8/wrong.txt
deleted file mode 100644
index 54d2e91..0000000
--- a/legacy/Data/Questions/ingsw/8/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-0.5*A
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/9/correct.txt b/legacy/Data/Questions/ingsw/9/correct.txt
deleted file mode 100644
index e86ff88..0000000
--- a/legacy/Data/Questions/ingsw/9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-1/1000
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/9/quest.txt b/legacy/Data/Questions/ingsw/9/quest.txt
deleted file mode 100644
index 7cae29d..0000000
--- a/legacy/Data/Questions/ingsw/9/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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/Questions/ingsw/9/wrong 2.txt b/legacy/Data/Questions/ingsw/9/wrong 2.txt
deleted file mode 100644
index 78abc32..0000000
--- a/legacy/Data/Questions/ingsw/9/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-1/100
\ No newline at end of file
diff --git a/legacy/Data/Questions/ingsw/9/wrong.txt b/legacy/Data/Questions/ingsw/9/wrong.txt
deleted file mode 100644
index bb7060e..0000000
--- a/legacy/Data/Questions/ingsw/9/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-1/10
\ No newline at end of file
diff --git a/legacy/Data/Questions/ium_unive.txt b/legacy/Data/Questions/ium_unive.txt
deleted file mode 100644
index 601b8c5..0000000
--- a/legacy/Data/Questions/ium_unive.txt
+++ /dev/null
@@ -1,815 +0,0 @@
-1) L’interaction framework descrive 4 fasi del ciclo interattivo, tra le quali troviamo:
-> l’osservazione e la memorizzazione
-> la sintesi e l’articolazione
-v l’articolazione e la presentazione
-> la prestazione e la virtualizzazione
-
-2) Qual èil significato dell’euristica visibilità dello stato del sistema?
-> che i dispositivi di input del sistema devono essere posizionati in modo da essere sempre visibili agli utenti
-v che in ogni momento il sistema deve tenere informato l’utente su quello che sta succedendo
->  che i dispositivi di output del sistema devono essere posizionati a non più di 2 metri dall’utente
-> che il sistema deve fornire un feedback all’utente quando ha esaurito tutti gli altri compiti computazionali
-
-3) Nell’ambito dell’informatica pervasiva si intende per ambient display:
-v l’uso dell’ambiente fisico come interfaccia per l’informazione digitale
-> l’utilizzo esclusivo di schermi di schermi di grande dimensione, per permettere una comunicazione parallela a più utenti
-> l’utilizzo esclusivo della visualità per comunicare l’output di un sistema pervasivo
-
-4) Il paradigma a manipolazione diretta è caratterizzato da:
-> invisibilità di una parte degli oggetti e feedback veloce
-> sostituzione di linguaggi di comando basati su numero con linguaggi di comando basati su parole comuni
-v reversibilità delle azioni
-> impossibilità di attuare azioni incrementali
-
-5) Nell’ambito dell’informatica pervasiva, che cosa si intende per principio di intelligenza appropriata?
-> che il sistema deve essere percepito dall’utente come una controparte umana
-> che il sistema informatico non deve mai effettuare previsioni sbagliate
-v che il sistema informatico deve eseguire previsioni il più spesso possibile corrette
-> che il sistema informatico deve avere un livello minimo di intelligenza misurata utilizzando il test di Turing
-
-6) Il termine mixed realityintrodotto da Milgrim e Kishino si riferisce a:
-> paradigmi di interazione in cui vengono presentati all’utente in sequenza elementi reali ed elementi virtuali
-> paradigmi di interazione in cui vengono presentati all’utente contemporaneamente sia elementi reali che virtuali
-v tutta la gamma di combinazioni possibili tra realtà e virtualità
-> paradigmi di interazione completamente immersivi in cui l’utente si sente ‘frullato’ (da qui il termine mixed) e proiettato con il corpo in un mondo virtuale
-
-7) In uno degli articoli proposti nella bibliografia del corso (Comparative Feedback in the Street: Exposing Residential Energy Consumption on House Façades) gli autori descrivono uno studio sull’impatto sui comportamenti dovuti alla condivisione dei dati dei consumi energetici sulle facciate esternedelle abitazioni, e concludono che:
-> è fondamentale dare il dettaglio dei consumi in tempo reale
-v è importante mostrare dati sui consumi a lungo termine
-> non c’è alcun vantaggio dal punto di vista del miglioramento delle abitudini derivante dalla competizione tra i vicini
-> è importante dare informazioni sui consumi, ma non è importante dare informazioni su come cambiare i comportamenti, visto che la maggior parte delle famiglie è consapevole dei suoi punti di debolezza
-
-8) Nell’ambito delle tecniche di prototipazione di un’interfaccia, che si intende perbranching storyboard?
-> una storyboard caratterizzata da uno schema lineare per mostrare i cambiamenti di stato dell’interfaccia a seguito dell’azione dell’utente o di altri eventi
-> una storyboard nella qualevengono proposti gli screenshot dell’interfaccia senza alcun ordinamento particolare
-v una storyboard nella quale viene data una descrizioneil più possibilecompleta di tutti glistati dell’interazionee delle loro relazioni
-> una storyboard nella quale viene descrittanon solo l'interfaccia ma anche il contesto in cui avviene l’interazione
-
-9) Le interfacce per l’eco-feedbacksi caratterizzano per:
-> richiedere un consumo di energia molto basso, di provenienza esclusivamente rinnovabile
-v fornire agli utenti informazioni riguardo alle conseguenze per l’ambiente del loro comportamento
-> fornire agli utenti un feedback sonoro per il quale vengono utilizzati processori di ecoo di riverbero, atti a simulare luoghi chiusi e aperti molto ampi
-
-10) Nell’ambito dell’informatica pervasiva, che cosa si intende per prossemica (proxemics)?
-> lo studio dei tempi di interazione con un sistema pervasivo
-> lo studio del significato della gestualità umana
-v lo studio delle distanze interpersonali
-> lo studio delle distanze tra le componenti dell’interfaccia
-
-11) Tra le caratteristiche positive dei nuovi stili di interazione gestuale pensati per tablet e smartphone possiamo indicare:
-> la disponibilità e l’omogeneità di operazioni non distruttive, come l’undo
-> la disponibilità di linee guida riconosciute per il controllo gestuale
-> la disponibilità di gesti consistenti e omogenei attraverso le diverse piattaforme di utilizzo
-v l’elevata espressività del linguaggio di input
-
-12) Nell’ambito del modello di interazione proposto da Don Norman (ciclo di esecuzione e di valutazione) il golfo di valutazione indica:
-> la differenza tra la formulazione delle azioni dell’utente e le azioni consentite
-v la differenza tra la presentazione dello stato del sistema e le aspettative dell’utente
-> la differenza tra la presentazione dello stato del sistema e le azioni consentite
-> la differenza tra la formulazione delle azioni dell’utente e le aspettative dell’utente
-
-13) In uno degli articoli proposti nella bibliografia del corso (Comparative Feedback in the Street: Exposing Residential Energy Consumption on House Façades) gli autori descrivono uno studio sull’impattosui comportamenti dovuti alla condivisione dei dati dei consumi energetici sulle facciate esternedelle abitazioni, e concludono che:
-> è fondamentale dare il dettaglio dei consumi in tempo reale
-> è importante dare informazioni sui consumi, ma non è importante dare informazioni su come cambiare i comportamenti, visto che la maggior parte delle famiglie è consapevoledei suoi punti di debolezza
-v è importante mostrare dati sui consumi a lungo termine
-> non c’è alcun vantaggio dal punto di vista del miglioramento delle abitudini derivante dalla competizione tra i vicini
-
-14) Nell’ambito dell’informatica pervasiva per input implicito si intende:
-> le azioni che non richiedono un’interazione verbale da parte dell’utente
-v le azioni che non vengono viste dall’utente come un’interazione con un sistema informatico, ma che vengono interpretati come tali da un sistema informatico presente nell’ambiente
-> le azioni che non richiedono un’interazione gestuale da parte dell’utente
-> le azioni compiute dagli utenti che non vengono viste dalle altre persone presenti nell’ambiente
-
-15) Il termine mixed reality introdotto da Milgrim e Kishino si riferisce a:
-> paradigmi di interazione in cui vengono presentati all’utente in sequenza elementi reali ed elementi virtuali
-> paradigmi di interazione in cui vengono presentati all’utente contemporaneamente siaelementi reali che virtuali
-v tutta la gamma di combinazioni possibili tra realtà e virtualità
-> paradigmi di interazione completamente immersivi in cui l’utente si sente ‘frullato’ (da qui il termine mixed) e proiettato con il corpo in un mondo virtuale
-
-16) Nell’ambito delle tecniche di prototipazione di un’interfaccia, che si intende per narrative storyboard?
-> una storyboard caratterizzata da uno schema lineare per mostrare i cambiamenti di stato dell’interfaccia a seguito dell’azione diretta dell’utente
-> una storyboard nella quale vengono proposti gli screenshot dell’interfaccia senza alcun ordinamento particolare
-> una storyboard nella quale viene data una descrizione il più possibile completa di tutti gli stati dell’interazione e delle loro relazioni
-v una storyboard nella quale viene descritta non solo l'interfaccia ma anche il contesto in cui avviene l’interazione
-
-17) Qual è il significato dell’euristica ‘Controllo dell’utente e libertà?
-> che agli utenti deve essere impedito di selezionare per errore le funzionalità del sistema
-> che tutti i sistemi dovrebbero fornire la libertà di essere utilizzati,anche da parte di utenti non registrati
-v che agli utenti deve essere fornite uscite di emergenza nel caso in cui selezionino determinate funzionalità per errore
-> che non devono essere supportate le funzionalità di Redo e Redo multiplo
-
-18) I punti di forza delle interfacce tangibili (TUI) includono:
-> la versatilità e la collaborazione
-> il parallelismo spaziale e la scalabilità
-v il pensiero tangibile e l’uso delle affordances
-
-19) I parametri che definiscono l’engagement dell’utente comprendono:
-v l’attenzione focalizzata e la durabilità
-> l’usabilità percepita e l’effervescenza
-> il coinvolgimento percepito e l’accessibilità
-
-20) Il cosiddetto affective computing denota:
-v la computazione che influenza le emozioni degli utenti
-> l’attrazione emotiva degli utenti verso i nuovi prodotti hardware
-> la computazione che sorge dalle emozioni dell’unità di calcolo
-> l’attrazione emotiva degli utenti verso i prodotti hardware vintage
-
-21) Le nuove interfacce gestuali da un certo punto di vista rappresentano un passo indietro dal punto di vista dell’usabilità, a causa:
-> dell’incapacità dei cosiddetti nativi digitali ad effettuare manipolazioni con entrambe le mani
-v della mancanza di linee guida riconosciute per il controllo gestuale
-> dellalimitata espressività delle interfacce gestuali
-> dell’incapacità degli utenti ad effettuare manipolazioni con una mano singola
-
-22) Nell’ambito delle attività di prototipazione la tecnica del mago di Oz denota:
-v l’implementazione fittizia di interfacce, costruita in modo tale che l’utente abbia l’impressione di interagire con un sistema realmente funzionante
-> l’utilizzo di tecniche di storytelling (narrazione interattiva) per la didattica dell’informatica
-> un’implementazione ridondante e fantasiosa di un’interfaccia utente, effettuata allo scopo di permettere molteplici modalità di interazione
-> l’implementazione completa delle interfacce, realizzata in tempi molto rapidi
-
-23) Tra le caratteristiche dei nuovi stili di interazione gestuale pensati per tablet e smartphone possiamo indicare:
-> la disponibilità e l’omogeneità di operazioni non distruttive, come l’undo
-> la ridotta espressività del linguaggio di input
-> la disponibilità di gesti consistenti e omogenei attraverso le diverse piattaforme di utilizzo
-v la mancanza di linee guida riconosciute per il controllo gestuale
-
-24) Nell'ambito delle interfacce WIMP le cosiddette finestre modalisi caratterizzano per:
-v bloccare la possibilità di interazioni ulteriori fino a quando l’utente non ha dato un OK o ha annullato le operazioni consentite dall’interfaccia della finestra
-> permettere di svolgere la stessa azione attraverso modalità diverse, scegliendo ad esempio una modalitàgrafica piuttosto che una a linea di comando
-> permettere di selezionare altre funzionalità dell'applicazione esterne alla finestra modale, senza la necessità di dover concludere prima l'interazione all'interno della finestra stessa
-
-25) L'euristica Consistenza e Standard indica che:
-> gli oggetti, le azioni e le opzioni che fanno parte dell’interazione vanno resi visibili
-> non vanno seguitele convenzioni delle piattaforme su cui si sta lavorando
-> i widget utilizzati per l'interazione dovrebbero essere di grandi dimensioni e posti a breve distanza
-v gli utenti non dovrebbero preoccuparsi di dover capire se parole, situazioni e azioni diverse significano la stessa cosa
-
-26) Nell’ambito delle tecniche di prototipazione di un’interfaccia, la cosiddetta narrative storyboardsi differenzia dalla sequential storyboard:
-v per la descrizione del contesto in cui avviene l’interazione
-> per la presentazione degli screenshots dell’interfaccia senza alcun ordinamento particolare
-> per la definizione di percorsi non-lineari che descrivono le transizioni di stato dell’interfaccia
-> per una migliore accuratezza nella rappresentazione dell’interfaccia
-
-27) Nell’ambito della percezione uditiva, che cosa si intende per effetto mascheramento?
-v l’incapacità del sistema uditivo di distinguere, in determinate condizioni, suoni di livello diverso vicini nel tempo
-> la capacità del sistema uditivo di filtrare i suoni in un ambiente rumoroso
-> l’incapacità del sistema uditivo di distinguere suoni bassi con frequenze molto diverse
-> l’incapacità del sistema uditivo di focalizzarsi in una conversazione in un ambiente rumoroso
-
-28) La tastiera Michela è un particolare tipo di dispositivo per l’input del testo:
-> che ha lo stesso layout fisico di una tastiera QWERTY
-> che ha il layout e lo stesso numero di tasti di una tastiera di pianoforte
-> per avviare alla digitazione del testo i bambini di età pre-scolare
-v fondato sulla scomposizione del testo da digitare in sillabe
-
-29)Nell’ambito del modello definito come Interaction Framework, che cosa succede durante la fase di articolazione?
-v Il linguaggio dei compitidell’utente viene tradottoinlinguaggio di input
-> Dopo l’esecuzione il sistema cambia stato e lo comunica attraverso il linguaggio di output
-> L’utente osserva l’output e valuta i risultati
-> L'inputvienetradotto nel linguaggio di base del sistema per attivare l’esecuzione
-
-30) E’ corretto dire che, nella progettazione di dispositivi fisici, l’applicazione del concetto di affordance dovrebbe portare a:
-v utilizzare forme specifi che suggeriscano come svolgere la funzione
-> utilizzare in forma seriale le stesse forme per mappare funzioni diverse
-> utilizzare solo dispositivi sostenibili economicamente
-> utilizzare solo dispositivi che richiedano una forza fisica limitata
-
-31) Che cosa si intende per scheumorfismo?
-v E’ un ornamento apposto su un oggetto (digitale) allo scopo di richiamare le caratteristiche di un altro oggetto
-> E’ un termine che indica le interfacce visuali caratterizzate da uno stile astratto
-> E’ un termine che indica le interfacce realizzate in economia di mezzi
-> E’ un termine utilizzato per caratterizzare tutte le tipologie di interfacce tangibili
-
-32) E’ corretto dire, secondo gli studi di O’Brien, che i sei parametri che definiscono l’engagement:
-v non sono indipendenti l’uno dall’altro
-> comprendono il coinvolgimento percepito e la reversibilità delle azioni
-> comprendono la consistenzae la durabilità
-> non comprendono l’usabilità percepita
-
-33) Con il termine interazione a manipolazione diretta:
->ci si riferisce ad un paradigma di interazione basato sull’invisibilità degli oggetti
-> ci si riferisce ad un paradigma di interazione nel quale le azioni sono irreversibili
-v ci si riferisce ad un paradigma di interazione basato su WIMP
-> ci si riferisce ad un paradigma di interazione basato su oggetti fisici
-
-34) Nell'ambito delle tecniche di progettazionedi interfacce, è corretto dire che una storyboard sequenziale è assimilabile a:
-> un prototipo orizzontale
-> un prototipo verticale
-v uno scenario
-> una combinazione di un prototipo orizzontale con un prototipo verticale
-
-35) E’ corretto dire che, nell’ambito delle interfacce olfattive,la diffusione di sistemi di output per la riproduzione di una grande varietà di odori è correntemente limitata:
-> dal grande costo delle essenze necessarie
-v dall’impossibilità di ottenere il risultato utilizzando una miscela di pochi odori di base
-> dalla grande diffusione di allergie e dal conseguente rischio di shock anafilattici conseguenti all’uso di questo tipo di interfacce
-
-36) Tra le caratteristiche dei nuovi stili di interazione gestuale pensati per tablet e smartphone possiamo indicare:
-> la disponibilità e l’omogeneità di operazioni non distruttive, come l’undo
-> la disponibilità di gesti consistenti e omogenei attraverso le diverse piattaforme di utilizzo
-v la mancanza di linee guida riconosciute per il controllo gestuale
-> la ridotta espressività del linguaggio di input
-
-37) Il layout del tastierino numerico delle tastiere di computer deriva:
-> da uno dei primi studi sul layout dei tastierini numerici di Bell Labs
-v dal layout dei calcolatori meccanici
-> dal layout delle tastiere telefoniche
-> dal fatto che 0 e 1 sono i numeri più utilizzzati
-
-38) E’corretto dire che, nella progettazione di dispositivi fisici, l’applicazione del concetto di affordance dovrebbe portare a:
-v utilizzare forme specifiche che suggeriscano come svolgere la funzione
-> utilizzare in forma seriale le stesse forme per mappare funzioni diverse
-> utilizzare solo dispositivi sostenibili economicamente
-> utilizzare solo dispositivi che richiedano una forza fisica limitata
-
-39) L'euristica Consistenza e Standard indica che:
-> gli oggetti, le azioni e le opzioni che fanno parte dell’interazione vanno resi visibili
-> non vanno seguitele convenzioni delle piattaforme su cui si sta lavorando
-> i widget utilizzati per l'interazione dovrebbero essere di grandi dimensioni e posti a breve distanza
-v gli utenti non dovrebbero preoccuparsi di dover capire se parole, situazioni e azioni diverse significano la stessa cosa
-
-40) Che cosa si intende per scheumorfismo?
-> E’ un termine che indica le interfacce visuali caratterizzate da uno stile astratto
-v E’ un ornamento apposto su un oggetto (digitale) allo scopo di richiamare le caratteristiche di un altro
-> E’ un termine utilizzato per caratterizzare tutte le tipologie di interfacce tangibili
-> E’ un termine che indica le interfacce realizzate in economiadi mezzi
-
-41) Definire la relazione tra usabilità ed engagement:
-> il concetto di engagementè utilizzato solo nella progettazione di sistemi di gioco interattivi
-> sono due concetti separati che vengono utilizzati in aree di applicazione completamente diverse
-v l'usabilità percepita è parte della definizione del concetto di engagement(secondo la definizione di O'Brien)
-> L’engagementè parte della definizionedel concetto di usabilità (secondo la definizione ISO)
-
-42) Nell’ambito del modello definito come Interaction Framework, che cosa succede durante la fase di prestazione?
-> Il linguaggio dei compitidell’utente viene tradottoinlinguaggio di input
-> Dopo l’esecuzione il sistema cambia stato e lo comunica attraverso il linguaggio di output
-> L’utente osserva l’output e valuta i risultati
-v L'inputvienetradotto nel linguaggio di base del sistema per attivare l’esecuzione
-
-43) Un’interfaccia tangibile
-v è un’interfaccia utente nella quale l’utente interagiscecon l’informazione digitale trasmettendo l’input attraverso oggetti fisici
-> è un’interfaccia utente nella quale l’utente interagisce con gli oggetti tangibili trasmettendo l’input attraverso la mediazione dioggetti digitali
-> è un’interfaccia che va oltre lo stadio prototipale, presentandosi come un sistema interattivo ben costruito
-
-44) I menu pull-down si differenziano rispetto ai menu fall-down perché
-> vengono aperti automaticamente al passaggio del puntatore sui titoli
-v vengono aperti posizionando il puntatore sui titoli e facendo click
-> vengono aperti posizionando il puntatore sui titoli e rilasciando il tasto del mouse
-
-45) Un campoX3D
-> è un’area in cui viene partizionato lo spazio della scena 3D
-v è un’entità di secondo livello che definisce lo stato di un nodo
-> è un’entità di primolivello per definire primitivegeometrichedi interazione
-
-46) In un prototipo verticale di un'interfaccia
-> viene ridotto il livello di funzionalità del sistema, dando luogo a un'interfaccia con features non completamente implementate
-> viene ridotto il numero di features considerate, mostrando il funzionamento del sistema solo lungo percorsi precedentemente pianificati
-v viene ridotto il numero di features considerate, ma quelle selezionate vengono pienamente implementate
-
-47) Le interfacce industriali si distinguono dalle interfacce a manipolazione diretta perché
-v l'utente riceve un doppio output, dall'interfaccia e dal sistema
-> l'utente opera un doppio input, verso l'interfaccia e verso il sistema
-> l'utente riceve un unico output derivante dall'interfaccia
-
-48) Il ciclo di esecuzione e di valutazione di Norman
-v definisce un modello di interazione uomo calcolatore basato sulla specifica di 7 fasi corrispondenti alle attività dell’utente
-> definisce un modello di interazione uomo calcolatore basato sulla specifica di 7 golfi corrispondenti ai punti critici dell’interazione
-> definisce un modello di interazione uomo calcolatore basato sulla definizione di 4 componenti principali, ognuna delle quali è caratterizzata da un proprio linguaggio
-
-49) Comparando i sistemi interattivi basati sull’uso del mouse e quelli basati sull’utilizzo delle gestures,è generalmente corretto affermare che:
-> i secondi sistemi si differenziano dai primi per un’espressività più limitata
-v i primi sistemi si differenziano dai secondi per una maggiore standardizzazione
-> non ci sono differenze significative dal punto di vista dell’espressività e della standardizzazione
-
-50) Le applicazioni context-aware vengono utilizzate in molti domini applicativi, e per scopi diversi, tra i quali
-> la comunicazione di un maggior numero di informazioni
-> la diminuzione del coinvolgimento emotivo dell’utente
-v la diminuzione del carico cognitivo dell’utente
-
-51) Nell’ambito dell’informatica pervasiva, sono utilizzati studi teorici a supporto della progettazione e della valutazione dell’esperienza. Tra i vari studi, èconsiderata la teoria delle attività, nella quale:
-> si da spazio all’aspetto dell’improvvisazione tipico del comportamento umano
-v le azioni derivano da scopi pre-pianificati
-> l’uomo viene considerato come parte di un sistema più ampio
-
-52) Nell’ambito della descrizione delparadigma a manipolazione direttasi fa riferimento alla metafora mondo modello, per la quale:
-v l’interfaccia non viene percepita comeuna mediazione con il sistema sottostante, ma come il sistema
-> l’interfaccia dovrebbe essere costruita come un modello in scala del mondo
->le azioni non sono reversibili, come succede appunto nel mondo reale
-
-53) La tastiera DVORAK
-v condivide con la tastiera QWERTY lo stesso layout fisico dei tasti
-> diminuisce la fatica di input e raddoppia la velocità di input
-> permette di eseguire il 50% delle sequenze senza spostare le dita
-
-54) I punti di forza di un’interfaccia tangibile includono:
-> lascalabilità
->la mancanza di relazione con il contesto
-v il parallelismo spaziale
-> la mancanza di affordance
-
-55) Una finestra di dialogo modale
-> permette di continuare in ogni momento l’interazione con le altre componenti dell’interfaccia che non fanno parte della finestra di dialogo
-v non permette di continuare l’interazione con le altre componenti dell’interfaccia che non fanno parte della finestra di dialogo fino alla conferma di una delle opzioni contenute nella finestra di dialogo
-> permette di continuare l’interazione con le altre componenti dell’interfaccia, ma solo nel caso di un imminente crash di sistema
-
-56) La mixed reality
-> è un altro modo per riferirsi alla realtà virtuale immersiva
-v descrive tutto il continuum nel quale si collocano tutte le diverse miscele di realtà e virtualità
-> è un altro modo per riferirsi alla realtà aumentata
-
-57) L’affordance di un oggetto consiste
-> nella capacità dell’oggetto di suggerire, attraverso il proprio nome, le possibilità di interazione
-> nel grado di convenienza economica dell’oggetto
-v nella capacità dell’oggetto di suggerire, attraverso la propria forma, le possibilità di interazione
-
-58) Qual è il significato dell’euristica ‘Riconoscimento anziché ricordo’?
-v che è vantaggioso per l’interazione rendere gli oggetti e le azioni visibili
-> che è vantaggioso per l’interazione richiedere all’utente di memorizzare azioni e opzioni
-> che è vantaggioso per l’interazione riconoscere il linguaggio con il quale è stata costruita l’applicazione.
-
-59) La legge di Fitts afferma che è vantaggioso per l’interazione:
-> definire oggetti interattivi di piccole dimensioni e posti a grande distanza tra di loro
-v definire oggetti interattivi di grandidimensioni e posti a piccoladistanza tra di loro
-> definire oggetti interattivi di grandidimensioni e posti a grande distanza tra di loro
-> definire oggetti interattivi di piccole dimensioni e posti a piccola distanza tra di loro
-
-60) Il meccanismo di routing per i mondi X3D serve a:
-> definire un meccanismo di navigazione per gli utenti del mondo interattivo
-> definire un meccanismo di rotazione automatica per il nodo a cui è applicato
-v definire un meccanismo di trasmissione degli eventi attraverso i nodi che definiscono il mondo X3D
-
-61)Qual è il significato dell’euristica ‘Consistenza e standard’?
-> che è necessario seguire nella progettazione unnumero consistente di standard
-v che è necessario seguire le convenzioni delle piattaforme su cui si lavora
-> che è possibile utilizzare anche etichette diverse per fare riferimento ad uno stesso oggetto purché si seguano gli standard
-
-62)I punti di forza delle interfacce tangibili (TUI) includono
-> la versatilità e la malleabilità
-v la relazione con il contesto e l’utilizzo delle affordances
-> il pensiero tangibile e la scalabilità
-
-63)La realtà aumentata
-> prevede l’esclusiva possibilità di sincronizzazione gli elementi virtuali con l’occhio dell’utente
-v prevede la possibilità di sincronizzazione gli oggetti virtuali con una telecamera non coincidente con il punto di vista dell’utente
-> prevede solo forme di sincronizzazione di oggetti reali
-
-64)La definizione di golfo dell’esecuzione nel ciclo di esecuzione di Norman (uno dei modelli di interazione uomo calcolatore più famosi) indica
-> la differenza tra l’osservazione della risposta del sistema e la prestazione
-v la differenza tra la formulazione delle azioni dell’utente e le azioni consentite
-> la differenza tra la presentazione dello stato del sistema e l’aspettativa dell’utente
-
-65)In un’interfaccia WIMP i menu linearisono preferibili ai menu a tortaperché
-v permettono di aumentare leggermente la produttività
-> diminuiscono lo spazio necessario per l’interfaccia
-> permettono di accedere nello stesso tempo ad un numero molto elevato di elementi
-> garantiscono un aumento della soddisfazione soggettiva degli utenti
-
-66)In un prototipo orizzontaledi un'interfaccia
-> viene ridotto il numero di features considerate, mostrando il funzionamento del sistema solo lungo percorsi precedentemente pianificati
-> viene ridotto il numero di features considerate, ma quelle selezionate vengono pienamente implementate
-v viene ridotto il livello di funzionalità del sistema, dando luogo a un'interfaccia con features non completamente implementate
-
-67) Nell’ambito delle interfacce per Apple Watch con il termine complicazione ci si riferisce a:
-v piccoli widget che forniscono informazioni aggiuntive oltre all’indicazione del tempo
-> una situazione di blocco dell’interfaccia che provoca problemi persistenti agli utenti
-> app particolarmente complesse che richiedono il pieno utilizzo delle capacità computazionali del dispositivo
-
-68) Nell'ambito della definizione di engagement, la durabilità esprime:
-> ilcoinvolgimento emotivo del soggetto coinvolto
-> l’impegno cognitivo del soggetto coinvolto
-> Il grado di novità dell’esperienza con il sistema interattivo percepito dal soggetto coinvolto
-v la propensione del soggetto coinvolto a ripetere l’esperienza
-
-69) Nell’ambito dell’informatica pervasiva si intende per ambient display:
-v l’uso dell’ambiente fisico come interfaccia per l’informazione digitale
-> l’utilizzo esclusivo di schermi di schermi di grande dimensione, per permettere una comunicazione parallela a più utenti
-> l’utilizzo esclusivo della visualità per comunicare l’output di un sistema pervasivo
-
-70) La tastiera DVORAK si differenzia dalla tastiera MICHELA per:
-> l'utilizzo della sola mano sinistra
-v una minore velocità nella digitazione
-> l'utilizzo della sola mano destra
-> la maggiore adattabilità a bambini di età pre-scolare
-
-71) I punti di forza di un’interfaccia tangibile includono:
-> la scalabilità
-> la mancanza di relazione con il contesto
-v il parallelismo spaziale
-> la mancanza di affordance
-
-72) Nell’ambito delle tecniche di prototipazione di un’interfaccia, che cosa si intende per branching storyboard?
-> è uno storyboard nel quale vengono proposti gli screenshots dell’interfaccia senza alcun ordinamento particolare
-v è uno storyboard che utilizza uno schema non-lineare per mostrare i cambiamenti di stato dell’interfaccia a seguito dell’azione dell’utente o di altri eventi
-> è uno storyboard che utilizza uno schema lineare per mostrare i cambiamenti di stato dell’interfaccia a seguito dell’azione dell’utente o di altri eventi
-
-73) Per quanto riguarda i tempi di risposta ad uno stimolo sensoriale, è corretto affermare che:
-> il tempo motorio è funzione del canale sensoriale e aumenta in caso di segnali misti (es. segnale uditivo + segnale visivo)
-v il tempo motorio è funzione dell’età e della salute dell’individuo
-> il tempo motorio è funzione del canale sensoriale e diminuisce in caso di segnali misti (es. segnale uditivo + segnale visivo)
-
-74) Nell’ambito della progettazione ergonomica, si indica come keyhole effect (effetto buco della serratura):
-> la situazione positiva derivante dalla possibilità di concentrarsi solo sul proprio compito senza essere distratti da visualizzazioni di flussi informativi che devono essere gestiti da altri operatori
-v la situazione negativa derivante all’incapacità di avere una visione complessiva dello stato del sistema con cui più operatori interagiscono
-> la pericolosa distrazione derivante dall’osservazione del comportamento dei colleghi che operano nelle postazioni adiacenti o nella sala di controllo vicina
-
-75) Nell’ambito del modello definito come Interaction Framework, la fase di articolazione indica:
-> la fase di conversione del linguaggio di base in linguaggio di output
-v la fase di conversione del linguaggio del compito in linguaggio di input
-> la fase di conversione del linguaggio di output in linguaggio del compito
-> la fase di conversione del linguaggio di input in linguaggio del compito
-
-76) Nell'ambito delle tecniche di prototipazione, che cosa caratterizza la tecnica del Mago di Oz?
-> l'utilizzo di schemi su carta (paper mockup) anziché programmi funzionanti, con un esperto che fa la parte del computer e mostra lo schema di interfaccia successivo quando colui che prova l'applicazione seleziona un’azione sullo schema corrente
-> la necessità, da parte dei valutatori, di indossare i costumi dei protagonisti del noto romanzo, al fine di aumentare l'engagement dei bambini che provano l'interfaccia
-> l'utilizzo di una configurazione di computer più potente di quella che verrà utilizzata come target per il rilascio dell’applicazione
-v l'utilizzo di un umano dietro le scene che si prenda carico delle operazioni troppo difficili da programmare
-
-77) Indicare quale delle seguenti affermazioni contrasta con le 10 euristiche di usabilità di Nielsen:
-> il sistema dovrebbe parlare il linguaggio dell'utente
-> nel processo di interazione gli oggetti, le azioni e le opzioni vanno rese visibili
-> ogni elemento informativo presentato nella finestra di output compete con gli altri e ne diminuisce la visibilità
-v le indicazioni di aiuto non dovrebbero essere troppo focalizzate sui compiti dell'utente
-
-78) Nell’ambito delle tecniche di prototipazione di un’interfaccia, la cosiddettanarrative storyboardsi differenzia dallasequentialstoryboard:
-> per la definizione di percorsi non-lineari che descrivono le transizioni di stato dell’interfaccia
-v per la descrizione del contesto in cui avviene l’interazione
-> per la presentazione degli screenshots dell’interfaccia senza alcun ordinamento particolar
-> per una migliore accuratezza nella rappresentazione dell’interfaccia
-
-79) Nell’ambito del modello definito come Interaction Framework, che cosa succede durante lafase di prestazione?
-> Dopo l’esecuzione il sistema cambia stato e lo comunica attraverso il linguaggio di output
-> L’utente osserva l’output e valuta i risultati
-> Il compito dell’utentevienearticolato all’interno del linguaggio di input
-v L'inputvienetradotto nel linguaggio di base del sistema per attivare l’esecuzione
-
-80) Nell’ambito dell’informatica pervasiva si considera il concetto di engagement, che tra i parametri che lo definiscono comprende:
-> l’esteticae la visibilità degli oggetti
-> la durabilità e le azioni incrementali
-v il coinvolgimento percepitoe l'attenzione focalizzata
-> l’usabilità percepita e la correttezza sintattica
-
-81) Nell’ambito della risposta sensoriale ad uno stimolo esterno, è corretto affermare che il tempo di reazione:
-> è indipendente dal canale sensoriale
-> dipende dalla salute del soggetto
-diminuisce quando lo stimolo avviene su un canale misto (es. uditivo e visivo)
-> dipende dall'età del soggetto
-
-82) Le interfaccea manipolazione diretta si caratterizzano per:
-> l'irreversibilità delle azioni
-> l'invisibilità degli oggetti
-> l'utilizzo di linguaggi di comando
-v la correttezza sintattica di tutte le azioni
-
-83) Gli studi sull’uso di sistemi multi-touch per la manipolazione di rappresentazioni digitali evidenziano che:
-
-v sarebbe opportuno avere mapping versatili (uno a molti) tra azioni e gestualità
-> gli adulti utilizzano in maniera più intensa gestures che richiedono l’uso di due mani
-> gli utenti tendono ad utilizzare un solo tipo di gesture per l’esecuzione di una stessa azione (ad esempio lo spostamento di una foto rappresentata sullo schermo multitouch
-
-84) Il concetto di affordanceesprime:
-v la capacità di un oggetto fisico di suggerire, tramite la propria forma, la funzione a cui è preposto
-> la possibilità di produzionedi un oggetto fisico a basso costo, per permettere una distribuzione ampia
-> la capacità di un oggetto fisico di suggerire, tramite etichette apposte sull’oggetto stesso, la funzione a cui è preposto
-
-85) Nell’ambito delle attività di valutazione dell’usabilità dell’interfaccia le tecniche di ispezione:
-> prevedono che un elevato numero di utenti esaminino gli aspetti di usabilità di un prodotto
-> prevedono un’accurata analisi del dispositivo prima della release finale, ottenuta anche attraverso il disassemblaggio e l’ispezione delle sue componenti
-v prevedono che un numero limitato di specialisti esaminino gli aspetti di usabilità di un prodotto
-> prevedono che i valutatori dell’usabilità raccolgano dati attraverso un numero sostanzioso di questionari composti di domande aperte e chiuse
-
-86) Lo studio “Why don’t Families Get along with Eco-Feedback Technologies?” analizza le tecnologie di eco-feedback in un contesto familiare.Quali delle seguenti affermazioni corrisponde a indicazioni che si possono derivare dallo studio?
-> il sistema di eco-feedback dovrebbe dare solo informazioni generali, lasciando agli utenti il compito di elaborare strategie di azione giornaliere
-> non ci sono benefici nel rendere il sistema di eco-feedback accessibile atutta la famiglia, dal momento che le decisioni vengono comunque prese dagli adulti
-v il sistema di eco-feedback dovrebbe includere una vista a volo d’uccello dei consumi della famiglia
-> il sistema di eco-feedback, per ragioni di privacy, non dovrebbe stimolare una mutua consapevolezza dei consumi individuali
-
-87) Indicare quale delle seguenti affermazioni, relative all'informatica pervasiva e all'informatica interattiva, è vera.
-> l'informatica pervasiva richiede che l'utente comunichi esplicitamente al sistema che cosa fare
-> l'informatica interattiva richiede necessariamente un ambiente dotato di sensori
-> l'informatica interattiva prevede che l'utente possa essere ignaro del fatto che stia
-v nell'informatica pervasiva è possibile che l'output sia implicito
-
-88) Indicare quale delle seguenti affermazioni, relative ai concetti di usabilità ed engagement, è vera.
-> usabilità ed engagement sono due concetti separati che vengono utilizzati in ambiti applicativi completamente diversi
-v il concetto di usabilità viene compreso nella definizione del concetto di engagement (secondo la definizione di O'Brien)
-> il concetto di engagement viene compreso nella definizione del concetto di usabilità (secondo la definizione ISO)
-> il concetto di engagement viene utilizzato solo nell'ambito della progettazione di sistemi interattivi ludici
-
-89) Indicare quale delle seguenti affermazioni contrasta con una delle 10 euristiche di usabilità di Nielsen:
-> vanno predisposte uscite di emergenza per lasciare lo stato dell'interazione in cui ci si trova
-v l'interfaccia non deve seguire le convenzioni del mondo reale
-> gli utenti non devono preoccuparsi se le parole o icone diverse usate nell'interfaccia indicano la stessa cosa
->  i messaggi di errore non dovrebbero usare un linguaggio per esperti
-
-90) Nell’ambito delle tecniche di prototipazione di un’interfaccia, una narrative storyboard si distingue per:
-> l'utilizzo di una voce narrante che descrive lo scenario dell'interfaccia
-> l'utilizzo di uno schema non lineare per mostrare i cambiamenti di stato dell’interfaccia a seguito delle azioni dell'utente
-v l'utilizzo di uno schema lineare per mostrare i cambiamenti di stato dell’interfaccia
-> l'utilizzo di una voce narrante che descrive il contesto dell'interfaccia
-
-91) Le interfacce industriali si distinguono dalle interfacce a manipolazione diretta:
-> per avere solamente un’interfaccia di input
-v perché il feedback per l’operatore non deriva solo dall’interfaccia di output
-> perché il feedback per l’operatore deriva solo dall’osservazione diretta del mondo reale
-> per avere solamente un’interfaccia di output
-
-92) Il paradigma a manipolazione diretta si distingue dal paradigma linguistico:
-> perché è più difficile da apprendere
-> per la possibilità di applicare contemporaneamente un determinato comando a più oggetti
-v per l'implicita correttezza sintattica di tutte le azioni che si possono compiere
-> per l'invisibilità degli oggetti che si usano nell'interazione
-
-93) Il layout del tastierino numerico usato in telefonia e basato su una matrice rettangolare nella quale i numeri 1 2 3 stanno nella riga superiore deriva:
-> dalla trasposizione del layout utilizzato nelle calcolatrici meccaniche
-> da uno studio specifico sulla fatica di utilizzo svolto da IBM
-> dalla versione estesa della tastiera DVORAK
-v da uno studio specifico sulle preferenze da parte degli utenti svolto da Bell Labs
-
-94) Il concetto di eco-feedback:
-> si riferisce alle modalità di utilizzo del canale sonoro per la comunicazione a grande distanza in sistemi pervasivi
-v si riferisce alla possibilità di fornire agli utenti informazioni sulle conseguenze delle loro azioni per l'ambiente
-> si riferisce alla possibilità di regolare automaticamente le condizioni ambientali per gli utenti attraverso un sistema di controllo
-
-95) Nell’ambito del modello definito come Interaction Framework, il mapping tra il linguaggio del compito e il linguaggio di input dell'interfaccia viene svolto nella fase di:
-> presentazione
-> prestazione
-v articolazione
-> osservazione
-
-96) In uno degli articoli proposti nella bibliografia del corso (Comparative Feedback in the Street: Exposing Residential Energy Consumption on House Façades) gli autori descrivono uno studio sull’impatto sui comportamenti dovuti alla condivisione dei dati dei consumi energetici sulle facciate esterne delle abitazioni, e concludono che:
-> è essenziale dare informazioni sui consumi in tempo reale
-v è importante dare informazioni chiare su come cambiare i comportamenti
-> è importante mostrare comparazione sui consumi, ma solo a lungo termine
-
-97) Nell'ambito dell'informatica pervasiva il principio di intelligenza appropriata:
-> indica che il sistema deve eseguire almeno il 5% di previsioni corrette ed utili
-> indica che è necessario un quoziente intellettivo minimo (espresso come valore QI) per poter interagire con il sistema
-v indica che il sistema non deve causare problemi nel caso in cui l'azione del sistema derivi da una previsione sbagliata
-> indica che il sistema deve essere percepito come una controparte umana
-
-98) Nell’ambito del modello definito come Interaction Framework, il mapping tra il linguaggio di base e il linguaggio di output dell'interfaccia viene svolto nella fase di:
-> osservazione
-> articolazione
-v presentazione
-> prestazione
-
-99) Definire quale dei seguenti parametri non viene considerato nella definizione di engagement secondo O'Brien:
-> coinvolgimento percepito
-v costo
-> durabilità
-> attenzione focalizzata
-
-100) Nell’ambito delle tecniche di prototipazione di un’interfaccia, una branching storyboard si distingue per:
-> l'utilizzo di uno schema lineare per mostrare i cambiamenti di stato dell’interfaccia a seguito dell’azione dell’utente o di altri eventi
-> l'utilizzo di uno schema non lineare per mostrare i cambiamenti di stato dell’interfaccia a seguito delle sole azioni esplicite dell'utente
-v l'utilizzo di uno schema non lineare per mostrare i cambiamenti di stato dell’interfaccia, anche a seguito dei cambiamenti di valore di alcune variabili del contesto
-> l'utilizzo di uno schema non ordinato per mostrare i cambiamenti di stato dell’interfaccia a seguito dell’azione dell’utente o di altri eventi
-
-101) Correntemente le interfacce basate sullo stile di interazione WIMP si distinguono da quelle basate sullo stile di interazione touch-based per:
-> la maggiore espressività nell'input
-v la maggiore consistenza
-> la minore scopribilità
-> la minore scalabilità
-
-102) Nell’ambito dei sistemi di input, la motivazione per la quale tuttora la tastiera QWERTY è la più utilizzata è:
-> la maggiore velocità rispetto alle soluzioni concorrent
-> la minore fatica rispetto alle soluzioni concorrent
-> l'ordinamento ottimale del layout
-v 'inerzia tecnologica
-
-103) Le interfacce industriali si distinguono dalle interfacce a manipolazione diretta:
-> per avere solamente un’interfaccia di input
-v perché il feedback per l’operatore non deriva solo dall’interfaccia di output
-> per avere solamente un’interfaccia di output
->  perché il feedback per l’operatore deriva solo dall’osservazione diretta del mondo reale
-
-104) In uno degli articoli proposti nella bibliografia del corso (SINAIS from Fanal) gli autori descrivono la progettazione e la valutazione di un sistema di eco-feedback giungendo alla conclusione che:
-> le soluzioni di eco-feedback basate su semplici rappresentazioni numeriche alla fine sono le più efficaci nel suscitare per lungo tempo l'attenzione degli utenti
-> il feedback basato su rappresentazioni artistiche è un'ottima alternativa alla visualizzazione di informazione dettagliata
-v il feedback basato su rappresentazioni artistiche dovrebbe comunque essere associato alla visualizzazione dettagliata dell'informazione
-
-105) E' corretto affermare che il numero di colori a cui viene assegnato un nome :
-v dipende dalle culture.
-> non cambia a seconda delle culture.
-> non cambia (ma possono cambiare i nomi a seconda delle culture).
-> é correlato alle condizioni climatiche.
-
-106) E' corretto dire che il software Graffiti per il riconoscimento della scrittura:
-> permette il riconoscimento di qualsiasi stile di scrittura individuale.
-> è basato esclusivamente sulla semplificazione dei caratteri.
-v  si avvale della standardizzazione del tratto.
-> necessita di un lunghissimo periodo di apprendimento da parte dell'utente.
-
-107) Nell’ambito dell’informatica pervasiva si considera il concetto di engagement, che tra i parametri che lo definiscono comprende:
-> la durabilità e la visibilità degli oggetti
-> il coinvolgimento percepito e le azioni incrementali
-v l'estetica e l'attenzione focalizzata
-> la correttezza sintattica e la novità
-
-108) Indicare quale delle seguenti affermazioni contrasta con le 10 euristiche di usabilità di Nielsen:
-> è bene permettere all'utente di personalizzare lo svolgimento delle azioni frequenti
-> nell'interazione è preferibile il riconoscimento al ricordo
-v il sistema non dovrebbe corrispondere al mondo reale
-> va supportata la funzione di Redo
-
-109) Lo studio “Why don’t Families Get along with Eco-Feedback Technologies?” analizza le tecnologie di eco-feedback in un contesto familiare. Quali delle seguenti affermazioni corrisponde a indicazioni che si possono derivare dallo studio?
-v il sistema di eco-feedback dovrebbe includere una vista a volo d’uccello dei consumi della famiglia
-> il sistema di eco-feedback, per ragioni di privacy, non dovrebbe stimolare una mutua
-consapevolezza dei consumi individuali
-> il sistema di eco-feedback dovrebbe dare solo informazioni generali, lasciando agli utenti il compito di elaborare strategie di azione giornaliere
-> non ci sono benefici nel rendere il sistema di eco-feedback accessibile a tutta la famiglia, dal momento che le decisioni vengono comunque prese dagli adulti
-
-110) Nell’ambito dell’informatica pervasiva si considera il concetto di engagement, che tra i parametri che lo definiscono comprende
-> la durabilità e la visibilità degli oggetti
-> il coinvolgimento percepito e le azioni incrementali
-v l'estetica e l'attenzione focalizzata
-> la correttezza sintattica e la novità
-
-111) Indicare quale delle seguenti affermazioni contrasta con le 10 euristiche di usabilità di Nielsen:
-> è bene permettere all'utente di personalizzare lo svolgimento delle azioni frequenti
-> nell'interazione è preferibile il riconoscimento al ricordo
-v il sistema non dovrebbe corrispondere al mondo reale
-> va supportata la funzione di Redo
-
-112) Lo studio “Why don’t Families Get along with Eco-Feedback Technologies?” analizza le tecnologie di eco-feedback in un contesto familiare. Quali delle seguenti affermazioni corrisponde a indicazioni che si possono derivare dallo studio?
-v il sistema di eco-feedback dovrebbe includere una vista a volo d’uccello dei consumi della famiglia
-> il sistema di eco-feedback, per ragioni di privacy, non dovrebbe stimolare una mutua
-consapevolezza dei consumi individuali
-> il sistema di eco-feedback dovrebbe dare solo informazioni generali, lasciando agli utenti il compito di elaborare strategie di azione giornaliere
-> non ci sono benefici nel rendere il sistema di eco-feedback accessibile a tutta la famiglia, dal momento che le decisioni vengono comunque prese dagli adulti
-
-113) Nell’ambito delle tecniche di prototipazione di un’interfaccia, la cosiddetta narrative storyboard si differenzia dalla branching storyboard:
-v per la descrizione del contesto in cui avviene l’interazione
-> per la definizione di percorsi lineari che descrivono le transizioni di stato dell’interfaccia
-> per una migliore accuratezza nella rappresentazione dell’interfaccia
-> per la presentazione degli screenshots dell’interfaccia senza alcun ordinamento particolare
-
-114) Nell’ambito della risposta sensoriale ad uno stimolo esterno, è corretto affermare che il tempo motorio:
-> è dipendente dal canale sensoriale
-v dipende dalla salute del soggetto
-> diminuisce quando lo stimolo avviene su un canale misto (es. uditivo e tattile
-> è indipendente dall'età del soggetto
-
-115) Nell’ambito del modello definito come Interaction Framework, che cosa succede durante la fase di presentazione?
-> il compito dell’utente viene articolato all’interno del linguaggio di input
-v dopo l’esecuzione il sistema cambia stato e lo comunica attraverso il linguaggio di output
-> l’utente osserva l’output e valuta i risultati
-> l'input viene tradotto nel linguaggio di base del sistema per attivare l’esecuzione
-
-116) Nell’ambito delle attività di valutazione dell’usabilità dell’interfaccia le tecniche di ispezione:
-> prevedono che un elevato numero di utenti esaminino gli aspetti di usabilità di un prodotto
-v prevedono che un numero limitato di specialisti esaminino gli aspetti di usabilità di un prodotto
-> prevedono che i valutatori dell’usabilità raccolgano dati attraverso un numero sostanzioso di questionari composti di domande aperte e chiuse
-> prevedono un’accurata analisi del dispositivo prima della release finale, ottenuta anche attraverso il disassemblaggio e l’ispezione delle sue componenti
-
-117) Le interfacce a righe di comando si distinguono per:
-> la manipolazione di oggetti visibili
-> l’impossibilità di accedere in modo diretto alle funzioni del sistema
-v la possibilità di applicare lo stesso comando contemporaneamente a più oggetti
-> la correttezza sintattica di tutte le azioni
-
-118) Nell’ambito dell’informatica pervasiva, per iHCI si intende:
-> l’interazione dell’uomo con un dispositivo smart, basata sull’uso di un set di app
-v l’interazione di un uomo con il suo ambiente e con gli artefatti inseriti all’interno di esso,
-nel corso del quale il sistema pervasivo acquisisce anche input implicito
-> la formalizzazione del processo di interazione, noto anche come Interaction Framework
-
-119) Per quanto riguarda le capacità percettive del nostro apparato uditivo, che cosa si intende per effetto cocktail?
-> la capacità del sistema uditivo di comprendere una conversazione che comprende una miscela di termini appartenenti a lingue diverse
-v la capacità del sistema uditivo di filtrare i suoni ricevuti, per permettere ad esempio di focalizzarsi su una conversazione in un ambiente rumoroso
-> l’incapacità del nostro del sistema uditivo di distinguere una conversazione in un ambiente rumoroso
-
-120) Nell’ambito della risposta sensoriale ad uno stimolo esterno, è corretto affermare che il tempo motorio:
-> è dipendente dal canale sensoriale
-v dipende dalla salute del soggetto
-> diminuisce quando lo stimolo avviene su un canale misto (es. uditivo e tattile
-> è indipendente dall'età del soggetto
-
-121) Nell’ambito delle tecniche di prototipazione di un’interfaccia, la cosiddetta narrative storyboard si differenzia dalla branching storyboard:
-v per la descrizione del contesto in cui avviene l’interazione
-> per la definizione di percorsi lineari che descrivono le transizioni di stato dell’interfaccia
-> per una migliore accuratezza nella rappresentazione dell’interfaccia
-> per la presentazione degli screenshots dell’interfaccia senza alcun ordinamento particolare
-
-122) Nell’ambito del modello definito come Interaction Framework, che cosa succede durante la fase di presentazione?
-> il compito dell’utente viene articolato all’interno del linguaggio di input
-v dopo l’esecuzione il sistema cambia stato e lo comunica attraverso il linguaggio di output
-> l’utente osserva l’output e valuta i risultati
-> l'input viene tradotto nel linguaggio di base del sistema per attivare l’esecuzione
-
-123) Nell’ambito delle attività di valutazione dell’usabilità dell’interfaccia le tecniche di ispezione:
-> prevedono che un elevato numero di utenti esaminino gli aspetti di usabilità di un prodotto
-v prevedono che un numero limitato di specialisti esaminino gli aspetti di usabilità di un prodotto
-> prevedono che i valutatori dell’usabilità raccolgano dati attraverso un numero sostanzioso di questionari composti di domande aperte e chiuse
-> prevedono un’accurata analisi del dispositivo prima della release finale, ottenuta anche attraverso il disassemblaggio e l’ispezione delle sue componenti
-
-124) Le interfacce a righe di comando si distinguono per:
-> la manipolazione di oggetti visibili
-> l’impossibilità di accedere in modo diretto alle funzioni del sistema
-v la possibilità di applicare lo stesso comando contemporaneamente a più oggetti
-> la correttezza sintattica di tutte le azioni
-
-125) Nell’ambito dell’informatica pervasiva, per iHCI si intende:
-> l’interazione dell’uomo con un dispositivo smart, basata sull’uso di un set di app
-v l’interazione di un uomo con il suo ambiente e con gli artefatti inseriti all’interno di esso,
-nel corso del quale il sistema pervasivo acquisisce anche input implicito
-> la formalizzazione del processo di interazione, noto anche come Interaction Framework
-
-126) Per quanto riguarda le capacità percettive del nostro apparato uditivo, che cosa si intende per effetto cocktail?
-> la capacità del sistema uditivo di comprendere una conversazione che comprende una miscela di termini appartenenti a lingue diverse
-v la capacità del sistema uditivo di filtrare i suoni ricevuti, per permettere ad esempio di focalizzarsi su una conversazione in un ambiente rumoroso
-> l’incapacità del nostro del sistema uditivo di distinguere una conversazione in un ambiente rumoroso
-
-127) L’interaction framework descrive 4 fasi del ciclo interattivo, tra le quali troviamo:
-> la sintesi e l’articolazione;
-> l’elaborazione e la manipolazione;
-> la sequenza e la presentazione;
-v l’osservazione e la prestazione
-
-128) Qual è il significato dell’euristica controllo dell’utente e libertà?
-> che gli utenti non devono avere la possibilità di selezionare funzionalità del sistema per errore;
-v che agli utenti devono essere disponibili funzioni di undo;
-> che agli utenti non devono essere disponibili funzioni di redo;
-> che gli utenti devono avere a disposizioneuscite di emergenza, ma ben celate per non disturbare il normale flusso dell’interazione
-
-129) Nell’ambito degli studi legati alla percezione umana, per effetto mascheramentosi intende:
-> l’impossibilità di riconoscere la vocedi una persona in ambienti molto rumorosi;
-v l’incapacità del sistema uditivo di differenziare suoni vicini per intensità e frequenza;
-> l’incapacità del sistema visuale di discriminare l’identità di una persona in ambienti poco illuminati;
-> l’incapacità del sistema uditivo di differenziare suoni con frequenza diversa ma di uguale intensità
-
-130) In uno degli articoli proposti nella bibliografia del corso (Why don’t families get along with eco-feedback Technologies) gli autori affrontano con uno studio il tema dell’assorbimento dell’informazione data dal sistema di eco-feedback (incorporation), e notano che:
-> gli utenti che hanno fatto parte dello studio si sono sentiti a disagio quando sono stati dati loro come punto di riferimento i costi legati ai comportamenti correnti;
-v gli utenti che hanno fatto parte dello studio hanno avuto difficoltà nell’agire a seguito dell’informazionericevuta,nel caso in cui l’informazione fossestata fornita con un basso grado di dettaglio;
-> gli utenti che hanno fatto parte dello studio si sono sentiti a disagio quando sono stati dati loro come punto di riferimento la comparazione con comportamenti ottimali;
-> gli utenti che hanno fatto parte dello studio hanno avuto difficoltà nell’agire a seguito dell’informazionericevuta,nel caso in cui l’informazione fossestata fornita con un elevato grado di dettaglio
-
-131) Nell’ambito dell’informatica pervasiva, i concetti di informatica quotidianae interazione continuasi riferiscono:
-> allo svolgimento di attività che hanno un inizio ed una fine ben definiti;
-v alla promozione di attività informali e non strutturate;
-> all’uso giornaliero e continuativo di alcune applicazioni nel contesto lavorativo;
-> allo svolgimento di attività con un elevato grado di coordinamento
-
-132) Nell’ambito dell’ergonomia, che cosa si intende per keyhole effect (effetto buco della serratura)?
-> una situazione che si verifica quando l’utente deve accedere ad un’interfaccia con un visore monoculare;
-> una situazione che si verifica quando l’operatore si astrae volontariamente dalla visualizzazione generale dell’interfaccia per concentrarsi sul suo lavoro;
-> una situazione che si verifica quando l’utente ha accesso a informazioni riservate;
-v una situazione che si verifica quando l’utente ha accesso solo a visualizzazioni parziali del sistema
-
-133) Il paradigma a manipolazione direttaè caratterizzato da:
-> irreversibilità delle azioni;
-> azioni non incrementali;
-v presenza di widget che vengono utilizzati come oggetti di input e di output;
-> invisibilità degli oggetti che fanno parte dell’interazione
-
-134) Secondo la ricerca scientifica, le attuali interfacce basate sull’uso di gestures sono caratterizzate da:
-> una bassa espressività;
-> la disponibilitàdi linee guida riconosciute;
-v la proposta di nuove convenzioni che ignorano le esistenti;
-> il profondo legame con la ricerca nell’interazione uomo calcolatore
-
-135) L’interaction framework descrive 4 fasi del ciclo interattivo, tra le quali troviamo:
-> l’osservazione e la prenotazione;
-> l’analisi e la collaborazione;
-> la sintesi e l’articolazione;
-v la presentazionee la prestazione
-
-136) Qual è il significato dell’euristica riconoscimento anziché ricordo?
-v che,per favorire l’interazione,gli oggetti e le azioni dell’interazionestessavanno resi visibili;
-> che è auspicabile che sistema interattivo sia in grado di riconoscere i pattern di interazione dell’utente;
-> che è auspicabile che sistema interattivo sia in grado di riconoscere il profilo dell’utente;
-> che va favorita l’interazione cooperativa
-
-137) Nell’ambito dell’ergonomia, che cosa si intende per keyhole effect(effetto buco della serratura)?
-> una situazione che si verifica quando l’utente ha accesso a informazioni riservate;
-> una situazione che si verifica quando l’operatore si astrae volontariamente dalla visualizzazione generale dell’interfaccia per concentrarsi sul suo lavoro;
-v una situazione che si verifica quando l’utente ha accesso solo a visualizzazioni parziali del sistema;
-> una situazione che si verifica quando l’utente deve accedere ad un’interfaccia con un visore monoculare
-
-138) Nell’ambito degli studi legati alla percezione umana, per effetto cocktailsi intende:
-> uno stato di frastornamento legato all’eccesso di stimoli uditivi di un ambiente;
-> la capacità del sistema sensoriale di miscelare stimoli da canali diversi (es. visuale e tattile) per aumentare la velocità di ricezione dell’informazione;
-> uno stato di frastornamento legato all’eccesso di stimoli visuali di un ambiente;
-v la capacità del sistema uditivo di filtrare i suoni ricevuti per focalizzarsi su una conversazione
-
-139) Secondo la ricerca scientifica, le attuali interfacce basate sull’uso di gestures sono caratterizzate da:
-> una bassa espressività;
-v la proposta di nuove convenzioni che ignorano le esistenti;
-> la disponibilità di linee guida riconosciute;
-> il profondo legame con la ricerca nell’interazione uomo calcolatore
-
-140) In uno degli articoli proposti nella bibliografia del corso (Why don’t families get along with eco-feedback Technologies) gli autori affrontano con uno studio il tema dell’assorbimento dell’informazione data dal sistema di eco-feedback (incorporation), e notanoche:
-> gli utenti che hanno fatto parte dello studio hanno avuto difficoltà nell’agire a seguito dell’informazionericevuta,nel caso in cui l’informazione fossestata fornita con un elevato grado di dettaglio;
-> gli utenti che hanno fatto parte dello studio si sono sentiti a disagio quando sono stati dati lorocome puntodi riferimento la comparazione con comportamenti ottimali;
-v gli utenti che hanno fatto parte dello studio hanno avuto difficoltà nell’agire a seguito dell’informazionericevuta,nel caso in cui l’informazione fossestata fornita con un basso grado di dettaglio;
-> gli utenti che hanno fatto parte dello studio si sono sentiti a disagio quando sono stati dati loro come puntodi riferimento i costi legati ai comportamenti correnti
-
-141) Nell’ambito dell’informatica pervasiva, è corretto dire che:
-> l’output esplicito costituisce un canale di comunicazione diretto tra utente e ambiente, che non passa attraversol’applicazione di informatica pervasiva;
-> l’output esplicitonon dovrebbe mai affiancare l’output esplicito dell’interfaccia;
-> l’input implicito viene comunque visto dall’utente come un’interazione con il sistema informatico;
-v l’input implicito può affiancare l’input esplicito dell’utente
-
-142) Ilparadigma a manipolazione diretta è caratterizzato da:
-> sostituzione di azioni per la manipolazione di oggetti visibili con linguaggi di comando;
-v correttezza sintattica di tutte le azioni;
-> chiara separazionedel linguaggio di input e del linguaggio di output;
-> uso esclusivo di widget fisici
diff --git a/legacy/Data/Questions/ogas.txt b/legacy/Data/Questions/ogas.txt
deleted file mode 100644
index 60c7bd5..0000000
--- a/legacy/Data/Questions/ogas.txt
+++ /dev/null
@@ -1,282 +0,0 @@
-1) I manager sono dei visionari e hanno un'alta propensione al rischio
-> V
-v F
-
-2) Il prototitpo di un modello di business può presentarsi come un foglio di calcolo che simula il funzionamento del nuovo business
-v V
-> F
-
-3) Il budget è l'output dell'attività di programmazione
-v V
-> F
-
-4) Nel processo di pianificazione di un business il meccanismo di controllo assume caratteristiche più rilevanti rispetto a quello della programmazione
-> V
-v F
-
-5) La propensione al rischio, che secondo alcuni studiosi è tipica dell'orientamento imprenditoriale, è l'inclinazione a intraprendere nuovi progetti avventurandosi in ambienti incerti
-v V
-> F
-
-6) I primi tasselli indispensabili per la formazione di uno schema di Business Plan sono i 'Ricavi' e gli 'Investimenti durevoli'
-v V
-> F
-
-7) Il business plan è in grado di fornire una stima della probabilità di successo di una startup
-v V
-> F
-
-8) La fattibilità economica è quella fase della pianificazione il cui output è il piano operativo
-> V
-v F
-
-9) Il pensiero visuale è una tecnica di progettazione dei modelli di business
-v V
-> F
-
-10) Il business model CANVAS è strutturato in sette blocchi
-> V
-v F
-
-11) Gli scenari possono rivelarsi utili come guide per la progettazione di nuovi modelli di business in quanto aiutano gli innovatori a riflettere sul modello più appropriato per ciascuna delle ambientazioni future (Scenario Planning)
-v V
-> F
-
-12) Il manager, così come l'imprenditore, potrebbe rischiare il proprio capitale
-> V
-v F
-
-13) Il business plan non è in grado di fornire una stima della probabilità di successo di una startup
-> V
-v F
-
-14) La condizione di vitalità dell'impresa è RICAVI >= COSTI
-v V
-> F
-
-15) Il business model è composto da elementi che mostrano la logica con cui un'azienda intende creare valore
-v V
-> F
-
-16) La struttura organizzativa rappresenta il sistema di processi e di attività di un'organizzazione, cioè il suo modo di funzionare
-v V
-> F
-
-17) L'equilibrio finanziario è rappresentato dall'equazione ∑ Ricavi = ∑ Costi + margine di profitto equo
-> V
-v F
-
-18) In un sistema di impresa, compito della direzione è la ricerca di una coordinazione fra sub-sistemi, come condizione per la coordinazione generale
-v V
-> F
-
-img=https://i.imgur.com/MgB9zPg.png
-19) Quando combinata con il CANVAS la SWOT Analysis permette una precisa valutazione del modello di business di un'organizzazione e dei suoi elementi di base
-v V
-> F
-
-20) I modelli di business sono progettati in ambienti specifici che possono essere considerati "spazi di progettazione"
-v V
-> F
-
-21) Il capitale di rischio rappresenta i mezzi monetari apportati da terzi finanziatori
-> V
-v F
-
-22) L'attitudine all'imprenditorialità si manifesta
-> nell'ideazione dell'attività intrapresa dall'imprenditore
-> nell'avviamento e gestione dell'attività oggetto dell'impresa
-v nell'ideazione, ma anche nell'avviamento e gestione dell'attività intrapresa dall'imprenditore
-
-23) Nelle società per azioni, il rischio aziendale
-v rimane in capo ai soci, nei limiti delle azioni sottoscritte
-> viene delegato al consiglio di amministrazione
-> è assunto dal top management
-
-24) L'interesse patrimoniale consiste
-v nel compenso spettante al titolare per la messa a disposizione del capitale
-> nel compenso per il rischio sopportato con l'investimento
-> nel compenso per l'attività che il titolare svolge in azienda
-
-25) La redditività coincide con l'economicità
-> in ogni caso
-v nel caso in cui il reddito realizzato sia anche equo
-> nel caso in cui i ricavi coprano esattamente tutti i costi della gestione
-
-26) L'ordine di composizione si riferisce
-> all'ottimale combinazione dei fattori produttivi
-> all'ordinata sequenza ed alla correta attuazione delle operazioni di gestione
-v all'instaurazione di corretti rapporti con l'ambiente di riferimento
-
-27) Il budget è
-v il documento sintetico che scaturisce al termine del processo di programmazione
-> il documento sintetico che scaturisce al termine del processo di pianificazione
-> uno strumento di analisi dei problemi gestionali
-
-28) Il gruppo autarchicoera caratterizzato da una politica rivolta
-> all'oggi e al domani proprio e all'oggi e al domani altrui
-> all'oggi proprio e al domani altrui
-v all'oggi proprio e al domani proprio
-
-29) La fase cognitiva, nell'ambito dell'attività umana per il soddisfacimento dei bisogni, si riferisce
-> all'attuazione della produzione, mediante il principio del minimo mezzo
-> all'acquisizione dei beni necessari per il consumo
-v alla selezione dei bisogni e all'individuazione delle vie più convenienti per la produzione
-
-30) Le imprese sono
-v aziende che producono per il mercato
-> aziende che producono per gli associati
-> aziende che producono per la collettività
-
-31) Lo scambio è una fase economica che ha origine
-> nel momento dell'introduzione della moneta
-v nel momento in cui il gruppo economico da chiuso diventa aperto
-> nelle epoche in cui la produzione avveniva nei limiti del consumo
-
-32) Le associazioni sono aziende nelle quali prevale
-> lo scopo di lucro
-v l'elemento personale
-> l'elemento patrimoniale
-
-33) Il concepimento delle linee strategico-tattiche si riferisce all'impegno umano in azienda
-> di tipo esecutivo
-> di tipo volitivo
-v di tipo direttivo
-
-34) Il passaggio da capitale generico a capitale disponibile si attua
-> con la progettazione dell'azienda
-> con l'ingresso del capitale in azienda
-v con l'ingresso in azienda dei fattori produttivi
-
-35) La cognizione post-operativa, si riferisce
-v alla fase del controllo dell'esito della gestione
-> alla fase esecutiva della gestione
-> alla fase di pianificazione della gestione
-
-36) Il passaggio da capitale inerte a capitale attivato si ha
-> quando il capitale monetario viene rimborsato al titolare
-> quando il capitale monetario viene convertito nei fattori produttivi con esso acquisiti
-v con l'applicazione delle capacità potenziali del lavoro alle utilità del capitale
-
-37) Il soggetto istituzionale è
-> colui che svolge il lavoro direttivo in azienda
-v colui che progetta l'azienda e le linee fondamentali dell'attività
-> colui che svolge il lavoro esecutivo in azienda
-
-img=https://i.imgur.com/u3xZ9NP.png
-38) Il soggetto giuridico, in un'azienda individuale
-> coincide sempre con il soggetto economico
-> non può mai coincidere con il soggetto economico
-v è rappresentato dal titolare dell'azienda
-
-39) Nelle società per azioni, il rischio aziendale
-v rimane in capo ai soci, nei limiti delle azioni sottoscritte
-> viene delegato al consiglio di amministrazione
-> è assunto dal top management
-
-40) Il capitale di rischio rappresenta
-> mezzi monetari apportati da terzi finanziatori
-v mezzi monetari apportati dal titolare
-> l'insieme dei mezzi monetari e del lavoro del titolare
-
-41) Le combinazioni di processi sono
-> raggruppamenti di operazioni di gestione
-v raggruppamenti di funzioni amministrative
-> operazioni collegate sotto il profilo spaziale
-
-42) Nelle società per azioni, la titolarità dei diritti e degli obblighi è in capo
-> ai soci
-> al consiglio di amministrazione
-v alla società
-
-43) La redditività coincide con l'economicità
-> in ogni caso
-v nel caso in cui il reddito realizzato sia anche equo
-> nel caso in cui i ricavi coprano esattamente tutti i costi della gestione
-
-44) L'ordine di composizionesi riferisce
-> all'ottimale combinazione dei fattori produttivi
-> all'ordinata sequenza ed alla corretta attuazione delle operazioni di gestione
-v all'instaurazione di corretti rapporti con l'ambiente di riferimento
-
-46) Affinché si abbia equilibrio economico, i ricavi
-> devono limitarsi a reintegrare i costi storici
-v devono coprire anche i costi prospettici di ricostituzione
-> devono coprire anche i costi prospettici di sviluppo
-
-47) L'ordine
-> è sinonimo di economicità
-v è il presupposto dell'economicità
-> è dipendente dall'economicità
-
-48) DOMANDA APERTA: Come dovrebbe evolvere il modello di business in un ambiente che cambia?
-v So rispondere
-
-49) DOMANDA APERTA: Progettare un modello di business nuovo o innovativo e rappresentarne uno esistente: descrivere la differenza principale.
-v So rispondere
-
-50) DOMANDA APERTA: Il business plan: descrizione e scopi
-v So rispondere
-
-51) DOMANDA APERTA: Progettare un modello di business. Finalità e tecniche
-v So rispondere
-
-52) Il business plan è
-> non conosco la risposta (a)
-v il documento sintetico che scaturisce al termine del processo di pianificazione
-> non conosco la risposta (c)
-
-53) Il break-even operativo
-v rappresenta il punto di pareggio tra costi totali e ricavi totali, espresso in volumi di vendita
-> non conosco la risposta (b)
-> non conosco la risposta (c)
-
-54) Organizzazione è un concetto polisemico
-v con molteplici significati e due accezioni prevalenti
-> con molteplici significati e un' accezione prevalente
-> con molteplici significati e molte accezioni
-
-55) Le due grandi dimensioni del problema organizzativo
-> divisione del lavoro e controllo
-v divisione del lavoro e coordinamento
-> coordinamento e potere
-
-56) DOMANDA APERTA: Si descrivano le funzioni del business plan
-v So rispondere
-
-57) Cosa hai appreso durante il corso?
-> Se non investi in azioni non sei nessuno
-> Se non hai l'Audi non sei nessuno
-> Se non hai la Amex Platinum non sei nessuno
-> Miriam
-v Tutte le risposte sono corrette
-
-58) Cosa hai appreso durante il corso?
-> Berlusconi usa delle scorciatoie
-> I conquistatori inglesi sono violenti
-> Saremo schiavi della Cina
-> Il voto dell'esame è espresso in trentesimi
-> Gli ospedali offrono servizi di problem solving
-v Tutte le risposte sono corrette
-
-45) Cosa hai appreso durante il corso?
-> Gli imprenditori hanno le visioni, in pratica pippano
-> L'attività del progettista comprende pratiche di proiezione astrale per "estendere il pensiero"
-> Uno di noi sarà il nuovo Steve Jobs (no niente poi ci ha ripensato e ha detto che non starebbe ad informatica)
-> POPI (https://popipopi.win) è la miglior idea del 2023
-v Tutte le risposte sono corrette
-
-59) Cosa hai appreso durante il corso?
-> Che la prof vuole un personal trainer figo, un azzardo
-> Che il cane della prof ce l'ha con gli attrezzi da palestra
-> I foulard Gucci sono meglio dei Rolex e delle Mercedes
-> I vegani sono facilmente abbindolati dai guru
-> I lavoratori hanno troppi diritti
-> La televisione è un mezzo del mezzo
-> I mezzi sono essi stessi un mezzo
-v Tutte le risposte sono corrette
-
-60) L'orale è:
-> Obbligatorio
-> Facoltativo
-v FACOLTATIVO
diff --git a/legacy/Data/Questions/sicurezza.txt b/legacy/Data/Questions/sicurezza.txt
deleted file mode 100644
index c39fe05..0000000
--- a/legacy/Data/Questions/sicurezza.txt
+++ /dev/null
@@ -1,3266 +0,0 @@
-473) Developed by IBM and refined by Symantec, the __________ provides a malware detection system that will automatically capture, analyze, add detection and shielding, or remove new malware and pass information about it to client systems so the malware can be detected before it is allowed to run elsewhere
-> Intrusion Prevention System (IPS)
-> Firewall
-> Encryption tool
-v digital immune system
-> Rootkit
-
-342) In a a __________ attack the slave zombies construct packets requiring a response that contains the target's IP address as the source IP address in the packet's IP header. These packets are sent to uninfected machines that respond with packets directed at the target machine
-Select one:
-v reflector DDoS
-> blended
-> internal resource
-> direct DDoS
-
-302) ____________detection involves the collection of data relating to the behavior of legitimate users over a period of time. Statistical tests are applied to observed behavior to determine with a high level of confidence whether that behavior is not legitimate user behavior
-> Signature-based
-v Statistical anomaly
-> Heuristic
-> Machine learning
-
-469) A __________ is when a user views a Web page controlled by the attacker that contains a code that exploits the browser bug and downloads and installs malware on the system without the user's knowledge or consent
-> Phishing attack
-v drive-by-download
-> Cross-site scripting (XSS)
-> Denial of Service (DoS) attack
-> Social engineering attack
-
-311) The ________ is an audit collection module operating as a background process on a monitored system whose purpose is to collect data on security related events on the host and transmit these to the central manager
-Select one:
-> central manager module
-v host agent module
-> intruder alert module
-> LAN monitor agent module
-
-826) A(n) __________ is an action, device, procedure, or technique that reduces a threat, a vulnerability, or an attack by eliminating or preventing it, by minimizing the harm it can cause, or by discovering and reporting it so that correct action can be taken
-Select one:
-> protocol
-> attavk
-v countermeasure
-> adversary
-
-441) _________ attacks can occur in a binary buffer copy when the programmer has included code to check the number of bytes being transferred, but due to a coding error, allows just one more byte to be copied than there is space available
-> SQL injection
-v off-by-one
-> Cross-site scripting (XSS)
-> Integer overflow
-
-1145) the __________ approach is unsuitable for a connectionless type of application because it requires the overhead of a handshake before any connectionless transmission, effectively negating the chief characteristic of a connectionless transaction.
-> timestamp
-> backward reply
-v challenge-response
-> replay
-
-416) A buffer _________ is a condition at an interface under which more input can be placed into a buffer or data holding area than the capacity allocated, overwriting other information
-> underflow/underrun/underwrite
-v overflow/overrun/overwrite
-> bypass/overwrite/override
-> breach/infiltration/compromise
-
-417) A consequence of a buffer overflow error is __________ 
-> loss of data connectivity and communication
-v corruption of data used by the program, unexpected transfer of control int he program, and possible memory access violation
-> system shutdown and restart
-> network congestion and slow performance
-
-286) The _________ is the predefined formally documented statement that defines what activities are allowed to take place on an organization's network or on particular hosts to support the organization's requirements
-> incident response plan
-> access control list
-v security policy
-> encryption protocol
-
-88) Because of the opportunities for parallel execution in __________ mode, processors that support parallel features, such as aggressive pipelining, multiple instruction dispatch per clock cycle, a large number of registers, and SIMD instructions can be effectively utilized
-> CBC
-v CTR
-> CFB
-> ECB
-
-439) __________ is one of the best known protection mechanisms that is a GCC compiler extension that inserts additional function entry and exit code
-> Address Space Layout Randomization (ASLR)
-> Data Execution Prevention (DEP)
-> Control Flow Integrity (CFI)
-v stackguard
-> Stack smashing protection
-
-474) __________ technology is an anti-virus approach that enables the anti-virus program to easily detect even the most complex polymorphic viruses and other malware, while maintaining fast scanning speeds
-> Encryption key
-v Generic decryption
-> Firewall
-> Intrusion Detection System (IDS)
-
-344) Unlike heuristics or fingerprint based scanners,the _________ integrates with the operating system of a host computer and monitors program behavior in real time for malicious actions
-Select one:
-> mobile code
-> digital immune system
-> generic decryption
-v behavior blocking software
-
-5) The principal objectives of computer security are to prevent unauthorized users from gaining access to resources, to prevent legitimate users from accessing resources in an unauthorized manner, and to enable legitimate users to access resources in an authorized manner
-v True
-> False
-
-422) __________ can prevent buffer overflow attacks, typically of global data, which
-attempt to overwrite adjacent regions in the processes address space, such as the global offset table
-> secure coding practices
-v guard pages
-> encrypted tunnels
-> intrusion detection systems (IDS)
-
-129) Assuming that Alice and Bob have each other?s public key. In order to establish a shared session key, Alice just needs to generate a random k, encrypt k using Bob?s public key, and send the encrypted k to Bob and then Bob will know he has a key shared with Alice
-> True
-v False
-
-314) A ________ is used to measure the current value of some entity. Examples include the number of logical connections assigned to a user application and the number of outgoing messages queued for a user process
-Select one:
-v Gauge
-> Resource utilization
-> Counter
-> Interval timer
-
-414) Traditionally the function of __________ was to transfer control to a user commandline interpreter, which gave access to any program available on the system with the privileges of the attacked program
-> Firewall
-v Shellcode
-> Antivirus software
-> Virtual private network (VPN)
-
-284) The _________ (RFC 4766) document defines requirements for the Intrusion Detection Message Exchange Format (IDMEF)
-v Intrusion Detection Message Exchange Requirements
-> Network Security Protocol Standards
-> Firewall Configuration Best Practices
-> Data Encryption Algorithms
-
-430) A __________ can occur as a result of a programming error when a process attempts to store data beyond the limits of a fixed-size buffer and consequently overwrites adjacent memory locations
-v buffer overflow
-> Null pointer dereference
-> Division by zero
-> Integer overflow
-
-110) An encryption scheme is _________ if the cost of breaking the cipher exceeds the value of the encrypted information and/or the time required to break the cipher exceeds the useful lifetime of the information
-> vulnerable
-v computationally secure
-> unbreakable
-> reversible
-
-277) __________ is a security service that monitors and analyzes system events for the purpose of finding, and providing real-time warning of attempts to access system resources in an unauthorized manner
-> Anti-virus software
-> Data encryption
-v Intrusion Detection
-> Firewall
-
-404) The function of ________ was to transfer control to a user commandline interpreter,which gave access to any program available on the system with the privileges of the attacked program
-> Cryptographic hash function
-v Shellcode
-> Key exchange algorithm
-> Digital signature
-
-444) In the classic __________ overflow, the attacker overwrites a buffer located in the local variable area of a stack frame and then overwrites the saved frame pointer and return address
-> Heap buffer overflow
-> Integer overflow
-> Format string vulnerability
-v stack buffer
-
-113) "The input to the encryption algorithm is the XOR of the next 64 bits of plaintext and the preceding 64 bits of ciphertext" is a description of the ________ mode of operation
-> Stream Cipher (SC)
-> Counter (CTR)
-v Cipher Block Chaining (CBC)
-> Electronic Codebook (ECB)
-
-512) Modifying the system's TCP/IP network code to selectively drop an entry for an incomplete connection from the TCP connections table when it overflows, allowing a new connection attempt to proceed is _______
-> poison packet
-> slashdot
-> backscatter traffic
-v random drop
-
-1120) the __________ mechanism assures that a received packet was in fact transmitted by the party identified as the source in the packet header and assures that the
-Packet has not been altered in transit.
-> confidentiality
-v authentication
-> security
-> key management
-
-81) The output of the encryption function is fed back to the shift register in Output Feedback mode, whereas in ___________ the ciphertext unit is fed back to the shift register
-> Electronic Codebook mode
-> Cipher Block Chaining mode
-> Counter mode
-v Cipher Feedback mode
-
-111) The _________ was issued as a federal information-processing standard and is intended to replace DES and 3DES with an algorithm that is more secure and efficient
-> Data Encryption Standard (DES)
-> Rivest Cipher 4 (RC4)
-> Blowfish
-v Advanced Encryption Standard (AES)
-
-1170) The __________ strategy is when users are told the importance of using hard to guess passwords and provided with guidelines for selecting strong passwords.
-> reactive password checking
-> computer-generated password
-> proactive password checking
-v user education
-
-709) The __________ strategy is when users are told the importance of using hard to guess passwords and provided with guidelines for selecting strong passwords
-> reactive password checking
-> proactive password checking
-> computer-generated password
-v user education
-
-305) The simplest statistical test is to measure the _________ of a parameter over some historical period which would give a reflection of the average behavior and its variability
-Select one:
-v mean and standard deviation
-> Markoprocess
-> multivariate
-> time series
-
-281) ________ detection techniques detect intrusion by observing events in the system and applying a set of rules that lead to a decision regarding whether a given pattern of activity is or is not suspicious
-v Signature
-> Statistical
-> Heuristic
-> Machine learning
-
-429) Traditionally the function of __________ was to transfer control to a user command-line interpreter, which gave access to any program available on the system with the privileges of the attacked program
-> Ransomware
-> Spyware
-v shellcode
-> Rootkit
-> Keylogger
-
-90) Both __________ produce output that is independent of both the plaintext and the ciphertext. This makes them natural candidates for stream ciphers that encrypt plaintext by XOR one full block at a time
-> CBC and ECB
-v OFB and CTR
-> ECB and OFB
-> CTR and CBC
-
-322) The _________ prevents duplicate passwords from being visible in the password file. Even if two users choose the same password, those passwords will be assigned at different times
-Select one:
-> honeypot
-v salt
-> rule based intrusion detection
-> audit record
-
-407) __________ can prevent buffer overflow attacks, typically of global data, which attempt to overwrite adjacent regions in the processes address space, such as the global offset table
-> Intrusion Prevention System (IPS)
-> Honeytokens
-v Guard pages
-> Captcha
-
-54) A __________ uses macro or scripting code, typically embedded in a document and triggered when the document is viewed or edited, to run and replicate itself into other such documents
-> boot sector infector
-> file infector
-v macro virus
-> multipartite virus
-
-509) In both direct flooding attacks and ______ the use of spoofed source addresses results in response packets being scattered across the Internet and thus detectable
-v SYN spoofing attacks
-> indirect flooding attacks
-> ICMP attacks
-> system address spoofing
-
-316) A _________ is a legitimate user who accesses data, programs, or resources for which such access is not authorized, or who is authorized for such access but misuses his or her privileges
-Select one:
-v Misfeasor
-> Emissary
-> Clandestine User
-> Masquerader
-
-582) The __________ cloud infrastructure is a composition of two or more clouds that remain unique entities but are bound together by standardized or proprietary technology that enables data and application portability
-v hybrid
-> community
-> private
-> public
-
-262) A ________ monitors network traffic for particular network segments or devices and analyzes network, transport, and application protocols to identify suspicious activity
-> host-based IDS 
-> security intrusion
-v network-based IDS 
-> intrusion detection
-
-461) A __________ uses multiple methods of infection or propagation to maximize the speed of contagion and the severity of the attack
-> Man-in-the-middle attack
-> Social engineering attack
-v blended attack
-> Phishing attack
-> Denial of Service (DoS) attack
-
-823) __________ assures that individuals control or influence what information related to them may be collected and stored and by whom and to whom that information may be disclosed
-Select one:
-v Privacy
-> System Integrity
-> Avvailability
-> Data Integrity
-
-279) Copying a database containing credit card numbers, viewing sensitive data without authorization, and guessing and cracking passwords are examples of _________ 
-> firewall configuration
-v intrusion
-> network segmentation
-> vulnerability scanning
-
-383) The function of ___________ was to transfer control to a user command-line interpreter, which gave access to any program available on the system with the privileges of the attacked program
-> stacking
-v shellcode
-> no-execute
-> memory management
-
-60) __________ will integrate with the operating system of a host computer and monitor program behavior in real time for malicious actions
-> Fingerprint-based scanners
-v Behavior-blocking software
-> Generic decryption technology
-> Heuristic scanners
-
-243) A _____ monitors network traffic for particular network segments or devices and analyzes network, transport, and application protocols to identify suspicious activity
-> Host-based IDS
-> Intrusion Prevention System
-> Firewal
-v Network-based IDS
-
-273) The _______ is the ID component that analyzes the data collected by the sensor for signs of unauthorized or undesired activity or for events that might be of interest to the security administrator
-> data source 
-> sensor
-> operator 
-v analyzer
-
-834) ________ assures that a system performs its intended function in an unimpaired manner, free from deliberate or inadvertent unauthorized manipulation of the system
-Select one:
-> Data Integrity
-> Confidentiality
-> Availability
-v System Integrity
-
-1140) ________ is a procedure that allows communicating parties to verify that the contents of a received message have not been altered and that the source is authentic.
-> Identification
-v Message authentication
-> Verification
-> User authentication
-
-502) The ______ attacks the ability of a network server to respond to TCP connection requests by overflowing the tables used to manage such connections
-> DNS amplification attack
-v SYN spoofing attack
-> basic flooding attack
-> poison packet attack
-
-16) __________ implements a security policy that specifies who or what may have access to each specific system resource and the type of access that is permitted in each instance
-> Audit control
-> Resource control
-> System control
-v Access control
-
-1140) A (n)__________ uses a microcontroller, is not programmable once the program logic for the device has been burned into ROM, and has no interaction with a user.
-v deeply embedded system
-> constrained device
-> lattice device
-> embedded system
-
-460) A _________ is a set of programs installed on a system to maintain covert access to that system with administrator (root) privileges while hiding evidence of its presence
-> Encryption tool
-> Spyware
-v rootkit
-> Firewall
-> Antivirus software
-
-368) A buffer ____________ is a condition at an interface under which more input can be placed into a buffer or data holding area than the capacity allocated, overwriting other information
-> overwrite
-> overflow
-> overrun
-v all of these options
-
-434) An essential component of many buffer overflow attacks is the transfer of execution to code supplied by the attacker and often saved in the buffer being overflowed.
-This code is known as _________ 
-> Exploit
-v shellcode
-> Payload
-> Malware
-
-326) _________ detection focuses on characterizing the past behavior of individual users or related groups of users and then detecting significant deviations
-Select one:
-> Threshold
-v Profile-based anomaly
-> Statistical anomaly
-> Action condition
-
-89) __________ mode is suitable for parallel operation. Because there is no chaining, multiple blocks can be encrypted or decrypted simultaneously. Unlike CTR mode, this mode includes a nonce as well as a counter
-v XTS-AES
-> S-AES
-> 3DES
-> OFB
-
-264) __________ involves an attempt to define a set of rules or attack patterns that can be used to decide if a given behavior is that of an intruder
-> Profile based detection 
-v Signature detection
-> Threshold detection 
-> Anomaly detection
-
-241) The _____ is the IDS component that analyzes the data collected by the sensor for signs of unauthorized or undesired activity or for events that might be of interest to the security administrator
-> Agent
-> Collector
-v Analyzer
-> Logger
-
-345) _________ is a mass mailing e-mail worm that installs a backdoor in infected computers thereby enabling hackers to gain remote access to data such as passwords and credit card numbers
-Select one:
-> Sobig.f
-v Mydoom
-> Slammer
-> Code Red
-
-339) _____technology enables the antivirus program to easily detect even the most complex polymorphic viruses while maintaining fast scanning speeds
-> File signature matching
-v Generic Decryption
-> Behavioral analysis
-> Heuristic scanning
-
-347) _________ antivirus programs are memory resident programs that identify a virus by its actions rather than its structure in an infected program
-Select one:
-> First generation
-> Fourth generation
-> Second generation
-v Third generation
-
-419) The function of ________ was to transfer control to a user command-line interpreter, which gave access to any program available on the system with the privileges of the attacked program
-> ransomware
-v shellcode
-> rootkit
-> keylogger
-
-472) Countermeasures for malware are generally known as _________ mechanisms because they were first developed to specifically target virus infections
-> Firewall
-> Encryption tool
-> Rootkit
-v anti-virus
-> Intrusion Detection System (IDS)
-
-433) "Smashing the Stack for Fun and Profit" was a step by step introduction to exploiting stack-based buffer overflow vulnerabilities that was published in Phrack magazine by _________ 
-v Aleph One
-> L0phtcrack
-> Acid Burn
-> The Mentor
-
-825) A flaw or weakness in a system's design, implementation, or operation and management that could be exploited to violate the system's security policy is a(n) __________
-Select one:
-v vulnerability
-> countermeasure
-> risk
-> adversary
-
-331) The _________ worm exploits a security hole in the Microsoft Internet Information Server to penetrate and spread to other hosts. It also disables the system file checker in Windows
-Select one:
-> Mydoom
-> Warezov
-> Slammer
-v Code Red
-
-432) A ___________ overflow occurs when the targeted buffer is located on the stack, usually as a local variable in a function's stack frame
-> Heap buffer overflow
-> Global buffer overflow
-v stack buffer
-> Data section buffer overflow
-
-84) The __________ method is ideal for a short amount of data and is the appropriate mode to use if you want to transmit a DES or AES key securely
-> cipher feedback mode
-> counter mode
-v electronic codebook mode
-> output feedback mode
-
-303) A ________ is an individual who seizes supervisory control of the system and uses this control to evade auditing and access controls or to suppress audit collection
-Select one:
-v Clandestine User
-> Mole
-> Masquerader
-> Misfeasor
-
-300) What are possible locations for NIDS sensors?
-> inside the external firewall
-> between the external firewall and the Internet
-> before internal servers and database resources
-> before the workstation networks
-v All of the above 
-
-580) An end user who operates on database objects via a particular application but does not own any of the database objects is the __________
-> application owner
-v end user other than application owner
-> foreign key
-> administrator
-
-710) A __________ strategy is one in which the system periodically runs its own password cracker to find guessable passwords
-> user education
-> proactive password checking
-v reactive password checking
-> computer-generated password
-
-154) ________ is a term that refers to the means of delivering a key to two parties that wish to exchange data without allowing others to see the key
-> Private key
-> Key exchange protocol
-v Key distribution technique 
-> Public key
-
-260) A _________ is a security event that constitutes a security incident in which an intruder gains access to a system without having authorization to do so
-> intrusion detection 
-> IDS
-> criminal enterprise 
-v security intrusion
-
-824) An assault on system security that derives from an intelligent act that is a deliberate attempt to evade security services and violate the security policy of a system is a(n) __________
-> risk
-> vulnerability
-> asset
-v attack
-
-1297)________ includes data processing and storage equipment,transmission and networking facilities,and offline storage media.
-> Supporting facilities
-> Physical facilities
-v Information system hardware
-> Infrastructure facilities
-
-500) A ______ triggers a bug in the system's network handling software causing it to crash and the system can no longer communicate over the network until this software is reloaded
-> echo
-> reflection
-v poison packet
-> flash flood
-
-86) "Each block of plaintext is XORed with an encrypted counter. The counter is incremented for each subsequent block", is a description of ___________ mode
-> Cipher Block Chaining
-v Counter
-> Cipher Feedback
-> Electronic Codebook
-
-715) A __________ is when an adversary attempts to achieve user authentication without access to the remote host or to the intervening communications path
-v client attack
-> eavesdropping attack
-> host attack
-> Trojan horse attack
-
-338) A _________ is a secret entry point into a program that allows someone who is aware of it to gain access without going through the usual security access procedures
-Select one:
-> multipartite
-v backdoor
-> hatch
-> Trojan horse
-
-1142) _________ is a program flaw that occurs when program input data can accidentally or deliberately influence the flow of execution of the program.
-> PHP attack
-> Format string injection attack
-> XSS attack
-v Injection attack
-
-105) Cryptographic systems are generically classified by _________
-> the type of operations used for transforming plaintext to ciphertext
-> the number of keys used
-> the way in which the plaintext is processed
-v all of the above
-
-706) Presenting or generating authentication information that corroborates the binding between the entity and the identifier is the ___________
-> identification step
-v verification step
-> authentication step
-> corroboration step
-
-317) A _________ is an individual who is not authorized to use the computer and who penetrates a system's access controls to exploit a legitimate user's account
-Select one:
-> Clandestine User
-v Masquerader
-> Sniffer
-> Misfeasor
-
-646) __________ houses cross-connects and active equipment for distributing cable to the equipment distribution area
-> Main distribution area
-> Equipment distribution area
-v Horizontal distribution area
-> Zone distribution area
-
-280) _________ anomaly detection focuses on characterizing the past behavior of individual users or related groups of users and then detecting significant deviations
-v Profile-based
-> Statistical
-> Behavioral
-> Signature-based
-
-238) _____ involves an attempt to define a set of rules or attack patterns that can be used to decide if a given behavior is that of an intruder
-> Traffic Analysis
-> Payload Inspection
-v Signature Detection
-> Anomaly Detection
-
-784) IPsec can assure that _________
-> a router advertisement comes from an authorized router
-> a routing update is not forged
-> a redirect message comes from the router to which the initial packet was sent
-v all of the above
-
-83) The __________ algorithm will work against any block encryption cipher and does not depend on any particular property of DES
-> counter mode attack
-> ciphertext stealing
-v meet-in-the-middle attack
-> cipher block chaining
-
-288) The __________ is the human with overall responsibility for setting the security policy of the organization, and, thus, for decisions about deploying and configuring the IDS
-> hacker
-v administrator
-> analyst
-> auditor
-
-06) If the only form of attack that could be made on an encryption algorithm is brute-force, then the way to counter such attacks would be to __________ 
-v use longer keys
-> use shorter keys
-> use more keys
-> use less keys
-
-1087) A common technique for masking contents of messages or other information traffic so that opponents can not extract the information from the message is __________ .
->  integrity
-v encryption
->  analysis
->  masquerade
-
-010) A __________ is created by using a secure hash function to generate a hash value for a message and then encrypting the hash code with a private key
-v digital signature
-> keystream
-> one way hash function
-> secret key
-
-101) __________ is a term that refers to the means of delivering a key to two parties that wish to exchange data without allowing others to see the key
-> Session key
-> Subkey
-v Key distribution technique
-> Ciphertext key
-
-014) Combined one byte at a time with the plaintext stream using the XOR operation, a __________ is the output of the pseudorandom bit generator
-v keystream
-> digital signature
-> secure hash
-> message authentication code
-
-385) To exploit any type of buffer overflow, the attacker needs to identify a buffer overflow vulnerability in some program that can be triggered using externally sourced data under the attacker's control
-v True
-> False
-
-829) A ________ level breach of security could be expected to have a severe or catastrophic adverse effect on organizational operations, organizational assets, or individuals
-Select one:
-> moderate
-v high
-> normal
-> low
-
-268) The purpose of the ________ module is to collect data on security related events on the host and transmit these to the central manager
-> central manager agent 
-> LAN monitor agent
-v host agent 
-> architecture agent
-
-1115) If the analyst is able to get the source system to insert into the system a message chosen by the analyst,then a ________ attack is possible.
-> known-plaintext
-v chosen-plaintext
-> chosen ciphertext
-> chosen text
-
-158) ________ are analogous to a burglar guessing a safe combination by observing how long it takes to turn the dial from number to number
-> Collision attacks
-> Preimage attacks
-v Timing attacks
-> Side-channel attacks
-
-1083) the algorithm will produce a different output depending on the
-specific secret key being used at the time.the exact substitutions
-and transformations performed by the algorithm depend on the
-key.
-v True
-> False
-
-376) _________ can prevent buffer overflow attacks, typically of global data, which attempt to overwrite adjacent regions in the processes address space, such as the global offset table
-> MMUs
-> Heaps
-v Guard Pages
-
-1091) The _______ category is a transitional stage between awareness and training.
-> roles and responsibilities relative to IT systems
-v security basics and literacy
-> education and experience
-> security awareness
-
-585) T/F: To create a relationship between two tables, the attributes that define the primary key in one table must appear as attributes in another table, where they are referred to as a foreign key
-v True
-> False
-
-223) 5.0 Points
-Since the responsibility for IT security is shared across the
-organization, there is a risk of inconsistent implementation of security and a loss of central monitoring and control
-v True
-> False
-
-261) A _________ monitors the characteristics of a single host and the events occurring within that host for suspicious activity
-v host-based IDS 
-> security intrusion
-> network-based IDS 
-> intrusion detection
-
-259) _________ are either individuals or members of a larger group of outsider attackers who are motivated by social or political causes
-> State-sponsored organizations 
-v Activists
-> Cyber criminals 
-> Others
-
-153) Which of the following would allow an attack that to know the (plaintext of) current message must be the same as one previously transmitted because their ciphtertexts are the same?
-> CBC
-> CTR
-> OFB
-v ECB
-
-464) Sometimes known as a "logic bomb", the __________ is the event or condition that determines when the payload is activated or delivered
-> Firewall
-> Router
-> Antivirus software
-> Encryption key
-v trigger
-
-013) The purpose of the DSS algorithm is to enable two users to securely reach agreement about a shared secret that can be used as a secret key for subsequent symmetric encryption of messages
-> True
-v False
-
-716) A __________ is directed at the user file at the host where passwords, token passcodes, or biometric templates are stored
-> eavesdropping attack
-> denial-of-service attack
-> client attack
-v host attack
-
-468) __________ code refers to programs that can be shipped unchanged to a heterogeneous collection of platforms and execute with identical semantics
-> Obfuscated
-> Scripting
-> Legacy
-v Mobile
-> Open-source
-
-276) The _________ to an IDS enables a user to view output from the system or control the behavior of the system
-> command-line interface
-> graphical user interface
-> administrator console
-v user interface
-
-465) The four phases of a typical virus are: dormant phase, triggering phase, execution phase and __________ phase
-> Initialization phase
-> Recovery phase
-v propagation
-> Termination phase
-> Mutation phase
-
-265) _________ involves the collection of data relating to the behavior of legitimate users over a period of time
-> Profile based detection 
-> Signature detection
-> Threshold detection 
-v Anomaly detection
-
-013) A __________ is to try every possible key on a piece of ciphertext until an intelligible translation into plaintext is obtained
-> mode of operation
-> hash function
-> cryptanalysis
-v brute-force attack
-
-012) A __________ is directed at the user file at the host where passwords, token passcodes, or biometric templates are store
-> eavesdropping attack
-> denial-of-service attack
-> client attack
-v host attack
-
-642) A(n) __________ is a user who has administrative responsibility for part or all of the database
-v administrator
-> database relations manager
-> application owner
-> end user other than application owner
-
-96) There are _____ modes of operation defined by NIST that are intended to cover virtually all the possible applications of encryption for which a block cipher could be used
-> three
-v five
-> seven
-> nine
-
-30) The __________ component deals with the management and control of the ways entities are granted access to resources
-> resource management
-v access management
-> privilege management
-> policy management
-
-325) _________ involves counting the number of occurrences of a specific event type over an interval of time
-Select one:
-v Threshold detection
-> Rule-based detection
-> Resource usage
-> Profile-based system
-
-282) _________ simulate human brain operation with neurons and synapse between them that classify observed data
-> Antivirus software
-> Intrusion prevention systems
-v Neural networks
-> Genetic algorithms
-
-239) A _____ monitors the characteristics of a single host and the events occurring within that host for suspicious activity
-> Network-based IDS
-> Intrusion Prevention System
-> Firewall
-v Host-based IDS
-
-832) A(n) _________ is an attempt to learn or make use of information from the system that does not affect system resources
-Select one:
-> active attack
-> inside attack
-> outside attack
-v passive attack
-
-507) ______ attempts to monopolize all of the available request handling threads on the Web server by sending HTTP requests that never complete
-> HTTP
-> Reflection attacks
-> SYN flooding
-v Slowloris
-
-443) Gaps, or __________ , are flagged in the MMU as illegal addresses, and any attempt to access them results in the process being aborted
-> Stack frames
-> Heap blocks
-v guard pages
-> Code sections
-
-1107) If the PRF does not generate effectively random 128-bit output values it may be possible for an adversary to narrow the possibilities and successfully use a brute force attack.
-v True
-> False
-
-633) Network security is extremely important in a facility in which such a large collection of assets is concentrated in a single place and accessible by external network connections
-v True
-> False
-
-07) __________ is a procedure that allows communicating parties to verify that received or stored messages are authentic
-> Cryptanalysis
-> Decryption
-v Message authentication
-> Collision resistance
-
-85) _________ mode is similar to Cipher Feedback, except that the input to the encryption algorithm is the preceding DES output
-> Counter
-> Cipher Block Chaining
-v Output Feedback
-> Cipher Feedback
-
-463) Sometimes referred to as the "infection vector", the __________ is the means by which a virus spreads or propagates
-> Exploit
-> Encryption algorithm
-v infection mechanism
-> Payload
-> Backdoor
-
-1122) the key exchange protocol is vulnerable to a __________ attack because it does not authenticate the participants.
-> one-way function
-> time complexity
-> chosen ciphertext
-v man-in-the-middle
-
-718) An institution that issues debit cards to cardholders and is responsible for the cardholder's account and authorizing transactions is the _________
-> cardholder
-> auditor
-v issuer
-> processor
-
-378) A consequence of a buffer overflow error is:
-> possibly memory access violation
-> corruption of data used by the program
-> unexpected transfer of control in the program
-v all of these options
-
-310) An operation such as login, read, perform, I/O or execute that is performed by the subject on or with an object is the _________ audit record field
-v Action
-> Subject
-> Resource-usage
-> Object
-
-1077) the XtS-AES standard describes a method of decryption for data
-stored in sector-based devices where the threat model includes
-possible access to stored data by the adversary.
-> True
-v False
-
-462) A computer __________ is a piece of software that can "infect" other programs or any type of executable content and tries to replicate itself
-> Trojan horse
-> Adware
-v virus
-> Worm
-> Spyware
-
-511) It is possible to specifically defend against the ______ by using a modified version of the TCP connection handling code
-> three-way handshake
-> UDP flood
-v SYN spoofing attack
-> flash crowd
-
-015) A _________ protects against an attack in which one party generates a message for another party to sign
-> data authenticator 
-v strong hash function
-> weak hash function 
-> digital signature
-
-644) __________ is the process of performing authorized queries and deducing unauthorized information from the legitimate responses received
-> Perturbation
-v Inference
-> Compromise
-> Partitioning
-
-283) A ________ IDS monitors traffic at selected points on a network or interconnected set of networks
-> host-based (HIDS)
-> cloud-based (CIDS)
-> application-based (AIDS)
-v net-work based (NIDS)
-
-27) __________ provide a means of adapting RBAC to the specifics of administrative and security policies in an organization
-v Constraints
-> Mutually Exclusive Roles
-> Cardinality
-> Prerequisites
-
-160) The principal attraction of ________ compared to RSA is that it appears to offer equal security for a far smaller bit size, thereby reducing processing overhead
-> AES
-v ECC
-> Blowfish
-> RC4
-
-393) At the basic machine level, all of the data manipulated by machine instructions executed by the computer processor are stored in either the processors registers or in memory
-v True
-> False
-
-1124) For determining the security of various elliptic curve
-ciphers it is of some interest to know the number of
-points in a finite abelian group defined over an elliptic
-curve.
-v True
-> False
-
-366) In 2004 the ________ exploited a buffer overflow in Microsoft Windows 2000/XP Local Security Authority Subsystem Service
-> Code Red Worm
-> Slammer Worm
-> Morris Internet Worm
-v Sasser Worm
-
-694) User authentication is a procedure that allows communicating parties to verify that the contents of a received message have not been altered and that the source is authentic
-> True
-v False
-
-421) __________ aim to prevent or detect buffer overflows by instrumenting programs when they are compiled
-> threat modeling
-v compile-time defenses
-> runtime patching
-> post-incident analysis
-
-308) Metrics that are useful for profile-based intrusion detection are: counter, gauge, resource utilization, and _______
-> network bandwidth
-> packet loss rate
-> system uptime
-v interval timer
-
-1440) __________ is a data collection technology that uses electronic tags attached to items to allow the items to be identified and tracked by a remote system.
-v RFID
-> NtRU
-> EPC
-> CRYPtOREC
-
-827) An example of __________ is an attempt by an unauthorized user to gain access to a system by posing as an authorized user
-Select one:
-> repudiation
-v masquerade
-> inference
-> interception
-
-822) __________ is the insertion of bits into gaps in a data stream to frustrate traffic analysis attempts
-Select one:
-v Traffic padding
-> Traffic integrity
-> Traffic control
-> Traffic routing
-
-242) _____ involves the collection of data relating to the behavior of legitimate users over a period of time
-> Signature Detection
-> Statistical Analysis
-> Log Monitoring
-v Anomaly Detection
-
-375) Even through it is a high-level programming language, Java still suffers from buffer overflows because it permits more data to be saved into a buffer than it has space for
-> True
-v False
-
-775) ______ is the recommended technique for wireless network security
-> Using encryption
-> Using anti-virus and anti-spyware software
-> Turning off identifier broadcasting
-v All of the above
-
-269) A(n) ________ is inserted into a network segment so that the traffic that it is monitoring must pass through the sensor
-> passive sensor 
-> analysis sensor
-> LAN sensor 
-v inline sensor
-
-57) __________ is malware that encrypts the user's data and demands payment in order to access the key needed to recover the information
-> Trojan horse
-v Ransomware
-> Crimeware
-> Polymorphic
-
-510) In a _______ attack the attacker creates a series of DNS requests containing the spoofed source address for the target system
-> SYN flood
-v DNS amplification
-> poison packet
-> UDP flood
-
-830) A __________ is any action that compromises the security of information owned by an organization
-Select one:
-v security attack
-> security mechanism
-> security policy
-> security service
-
-466) During the __________ phase the virus is activated to perform the function for which it was intended
-> Encryption phase
-> Stealth phase
-> Payload phase
-v triggering
-> Replication phase
-
-394) Even though it is a highlevel programming language, Java still suffers from buffer overflows because it permits more data to be saved into a buffer than it has space for
-> True
-v False
-
-46) A program that is covertly inserted into a system with the intent of compromising the integrity or confidentiality of the victim's data is __________
-> Adobe
-> Animoto
-v Malware
-> Prezi
-
-106) A symmetric encryption scheme has five ingredients: plaintext, encryption algorithm, ciphertext, decryption algorithm and _________
-> password
-> hash
-v secret key
-> digital signature
-
-648) _________ is an organization that produces data to be made available for controlled release, either within the organization or to external users
-> Client
-v Data owner
-> User
-> Server
-
-114) Unlike ECB and CBC modes, ________ mode requires only the implementation of the encryption algorithm and not the decryption algorithm
-> block
-v counter (CTR)
-> stream
-> substitution
-
-714) To counter threats to remote user authentication, systems generally rely on some form of ___________ protocol
-> eavesdropping
-> Trojan horse
-v challenge-response
-> denial-of-service
-
-1104) Plaintext is recovered from the ciphertext using the paired key and _____________ .
-> a digital signature
-> a recovery encryption
-v a decryption algorithm
-> an encryption algorithm
-
-115) The most powerful, and most common, approach to countering the threats to network security is ________
-> authentication
-> firewall implementation
-> intrusion detection
-v encryption
-
-442) The _________ is typically located above the program code and global data and grows up in memory (while the sack grows down toward it)
-> Data section
-> Cache
-v heap
-> Register file
-
-369) _________ aim to prevent or detect buffer overflows by instrumenting programs when they are compiled
-> Run-time defenses
-v Compile-time defenses
-> Shellcodes
-> All of these answers
-
-821) Masquerade, falsification, and repudiation are threat actions that cause __________ threat consequences
-Select one:
-> unauthorized disclosure
-> disruption
-v deception
-> usurpation
-
-348) _________ are used to attack networked computer systems with a large volume of traffic to carry out a denial-of-service attack
-Select one:
-> Bots
-> Exploits
-> Keyloggers
-v flooders
-
-275) A ________ is a hacker with sufficient technical skills to modify and extend attack toolkits to use newly discovered vulnerabilities
-> script kiddie
-v journeyman
-> novice
-> expert
-
-1101) The appeal of HMAC is that its designers have been able to prove an
-exact relationship between the strength of the embedded hash function and the strength of HMAC.
-v True
-> False
-
-21) A concept that evolved out of requirements for military information security is ______ 
-> reliable input
-v mandatory access control
-> open and closed policies
-> discretionary input
-
-287) 14.________ are decoy systems that are designed to lure a potential attacker away from critical systems
-> Antivirus software
-v Honeypots
-> Firewalls
-> Intrusion Detection Systems
-
-48) A __________ is code inserted into malware that lies dormant until a predefined condition, which triggers an unauthorized act, is met
-v logic bomb
-> trapdoor
-> worm
-> Trojan horse
-
-315) To be of practical use an intrusion detection system should detect a substantial percentage of intrusions while keeping the false alarm rate at an acceptable level
-v True
-> False
-
-118) For symmetric encryption to work the two parties to an exchange must share the same _____, which must be protected from access by others
-> username
-v key
-> password
-> certificate
-
-380) The potential for a buffer overflow exists anywhere that data is copied or merged into a buffer, where at least some of the data are read from outside the program
-v True
-> False
-
-471) A bot can use a __________ to capture keystrokes on the infected machine to retrieve sensitive information
-> Antivirus software
-> Encryption key
-v keylogger
-> Firewall
-> Rootkit
-
-828) The assurance that data received are exactly as sent by an authorized entity is __________
-Select one:
-v data integrity
-> data confidentiality
-> authentication
-> access control
-
-833) The _________ prevents or inhibits the normal use or management of communications facilities
-Select one:
-> passive attack
-v denial of service
-> masquerade
-> traffic encryption
-
-1128) Intrusion detection is the process of collecting information about
-events occurring in a computer system or network and analyzing them for signs of intrusions.
-v True
-> False
-
-504) _______ bandwidth attacks attempt to take advantage of the disproportionally large resource consumption at a server
-v Application-based
-> System-based
-> Random
-> Amplification
-
-499) ______ relates to the capacity of the network links connecting a server to the wider Internet
-> Application resource
-v Network bandwidth
-> System payload
-> Directed broadcast
-
-440) A _________ value is named after the miner's bird used to detect poisonous air in a mine and warn miners in time for them to escape
-> Sparrow
-> Falcon
-> Hawk
-v canary
-> Eagle
-
-384) The buffer overflow type of attack has been known since it was first widely used by the _______ Worm in 1988
-> Alpha One
-> Code Red Worm
-> Slammer Worm
-v Morris Internet Worm
-
-423) _________ is a form of overflow attack
-v heap overflows, return to system call, and replacement stack frame
-> Cross-site scripting (XSS)
-> SQL injection
-> Directory traversal
-
-412) A buffer overflow in Microoft Windows 2000/XP Local Security Authority Subsystem Service was exploited by the _________
-> Melissa Worm
-v Sasser Worm
-> Nimda Worm
-> Sobig Worm
-
-240) A(n) _____ is inserted into a network segment so that the traffic that it is monitoring must pass through the sensor
-> Active Sensor
-> Probe
-v Inline Sensor
-> Passive Sensor
-
-868) The Common Criteria for Information Technology and Security Evaluation are ISO standards for specifying security requirements and defining evaluation criteria
-v True
-> False
-
-228) The relative lack of success in bringing cybercriminals to justice has led to an increase in their numbers, boldness, and the global scale of their operations
-v True
-> False
-
-579) The basic building block of a __________ is a table of data, consisting of rows and columns, similar to a spreadsheet
-v relational database
-> query set
-> DBMS
-> perturbation
-
-329) A ______ attack is an attempt to prevent legitimate users of a service from using that service
-> Man-in-the-middle
-> Phishing
-v Denial of service (DOS)
-> Social engineering
-
-506) Bots starting from a given HTTP link and then following all links on the provided Web site in a recursive way is called _______
-> trailing
-v spidering
-> spoofing
-> crowding
-
-271) _________ is a document that describes the application level protocol for exchanging data between intrusion detection entities
-v RFC 4767 
-> RFC 4766
-> RFC 4765 
-> RFC 4764
-
-581) __________ is an organization that receives the encrypted data from a data owner and makes them available for distribution to clients
-> User
-> Client
-> Data owner
-v Server
-
-06) Modes of operation are the alternative techniques that have been developed to increase the security of symmetric block encryption for large sequences of data
-v True
-> False
-
-343) A _________ virus is a form of virus explicitly designed to hide itself from detection by antivirus software
-Select one:
-v stealth
-> polymorphic
-> encrypted
-> metamorphic
-
-157) ________ attacks have several approaches, all equivalent in effort to factoring the product of two primes
-v Mathematical 
-> Statistical
-> Brute-force
-> Social engineering
-
-841) Computer security is essentially a battle of wits between a perpetrator
-who tries to find holes and the administrator who tries to close them
-True or False
-v True
-> False
-
-897) An attacker can generally determine in advance exactly where the targeted buffer will be located in the stack frame of teh function in which it is defined
-> True
-v False
-
-1043) Which stages does a virus have?
-> Dormant phase
-> Propagation phase - i.e. attachment to email
-> Triggering phase
-> Execution phase
-v All viruses have these four stages
-
-267) The _________ module analyzes LAN traffic and reports the results to the central manager
-v LAN monitor agent 
-> host agent
-> central manager agent 
-> architecture agent
-
-1134) Message authentication protects two parties who exchange
-messages from any third party, however, it does not protect the
-two parties against each other.
-v True
-> False
-
-645) A ___________ is the portion of the data center that houses data processing equipment
-v computer room
-> main distribution area
-> entrance room
-> horizontal distribution
-
-377) The ________________ used a buffer overflow exploit in the "fingerd" as one of its attack mechanisms
-v Morris Internet Worm
-> Sasser Worm
-> Code Red Worm
-> Slammer Worm
-
-470) A __________ is a collection of bots capable of acting in a coordinated manner
-v botnet
-> Firewall
-> Encryption algorithm
-> Intrusion Detection System (IDS)
-> Rootkit
-
-11) A user program executes in a kernel mode in which certain areas of memory are protected from the user's use and certain instructions may not be executed
-> True
-v False
-
-1116) The BLP model effectively breaks down when (untruste> low classified
-executable data are allowed to be executed by a high clearance (truste>  subject.
-v True
-> False
-
-1089) To emphasize the importance of security awareness,an organization
-should have a security awareness policy document that is provided to all employees.
-v True
-> False
-
-76) In the first instance of multiple encryption plaintext is converted to __________ using the encryption algorithm
-v ciphertext
-> S-AES mode
-> Triple DES
-> block cipher
-
-161) Intrusion detection is based on the assumption that the behavior of the intruder differs from that of a legitimate user in ways that can be quantified
-v True
-> False
-
-92) The exact substitutions and transformations performed by the algorithm depend on the ________
-> ciphertext
-> decryption algorithm
-v secret key
-> encryption algorithm
-
-127) A hash function such as SHA-1 was not designed for use as a MAC and cannot be used directly for that purpose because it does not rely on a secret key
-v True
-> False
-
-109) A ________ cipher processes the input elements continuously, producing output one element at a time as it goes along
-> substitution
-> block
-v stream
-> transposition
-
-1078) Once the plaintext is converted to ciphertext using the
-encryption algorithm the plaintext is then used as input and the algorithm is applied again.
-> True
-v False
-
-692) Depending on the details of the overall authentication system, the registration authority issues some sort of electronic credential to the subscriber
-> True
-v False
-
-713) Each individual who is to be included in the database of authorized users must first be __________ in the system
-> verified
-> authenticated
-> identified
-v enrolled
-
-397) An attacker is more interested in transferring control to a location and code of the attackers choosing rather than immediately crashing the program
-v True
-> False
-
-307) Password files can be protected in one of two ways: One-way function or ______
-> biometric authentication
-v access control
-> encryption
-> two-factor authentication
-
-719) __________ allows an issuer to access regional and national networks that connect point of sale devices and bank teller machines worldwide
-v EFT
-> POS
-> BTM
-> ATF
-
-012) Digital signatures and key management are the two most important applications of __________ encryption
-> private-key
-v public-key
-> preimage resistant 
-> advanced
-
-647) __________ encompasses intrusion detection, prevention and response
-v Intrusion management
-> Security assessments
-> Database access control
-> Data loss prevention
-
-820) A threat action in which sensitive data are directly released to an unauthorized entity is __________
-Select one:
-> disruption
-v exposure
-> corruption
-> intrusion
-
-12) Any program that is owned by, and SetUID to, the "superuser" potentially grants unrestricted access to the system to any user executing that program
-v True
-> False
-
-08) The purpose of a __________ is to produce a “fingerprint” of a file, message, or other block of data
-> secret key 
-> digital signature
-> keystream
-v hash function
-
-04) On average, __________ of all possible keys must be tried in order to achieve success with a brute-force attack
-> one-fourth 
-v half
-> two-thirds 
-> three-fourths
-
-759) A traditional packet filter makes filtering decisions on an individual packet basis and does not take into consideration any higher layer context
-v True
-> False
-
-270) A(n) ________ event is an alert that is generated when the gossip traffic enables a platform to conclude that an attack is under way
-> PEP 
-v DDI
-> IDEP 
-> IDME
-
-1172) __________ defines user authentication as "the process of verifying an identity claimed by or for a system entity".
-v RFC 2828
-> RFC 2493
-> RFC 2298
-> RFC 2328
-
-370) In 2003, the _______ exploited a buffer overflow in Microsoft SQL Server 2000
-> Slammer worm
-> Sasser worm
-> Morris Internet Worm
-> Code Red Worm
-v Slammer Worm
-
-1118) Multilevel security is of interest when there is a requirement to maintain a
-resource in which multiple levels of data sensitivity are defined.
-v True
-> False
-
-410) The __________ used a buffer overflow exploit in fingerd as one of its attack mechanisms
-> Conficker Worm
-v Morris Internet Worm
-> Stuxnet Worm
-> ILOVEYOU Worm
-
-108) A ________ cipher processes the input one block of elements at a time, producing an output block for each input
-> substitution
-v block
-> stream
-> transposition
-
-212) A cookie can be used to authenticate a user to a web site so that the user does not have to type in his password for each connection to the site
-v True
-> False
-
-1163) The countermeasure to tiny fragment attacks is to discard packets with
-an inside source address if the packet arrives on an external interface.
-> True
-v False
-
-140) Which of the following scenario requires a security protocol:
-> log in to mail.google.com
-> connecting to work from home using a VPN
-v All the previous answers
-
-274) The broad classes of intruders are: cyber criminals, state-sponsored organizations, _________ , and others
-> terrorists
-> script kiddies
-v activists
-> hackers
-
-1095) Performing regular backups of data on a system is a critical control
-that assists with maintaining the integrity of the system and user data.
-v True
-> False
-
-594) T/F: Business continuity consists of security services that allocate access, distribute, monitor, and protect the underlying resource services
-> True
-v False
-
-01) __________ defines user authentication as “the process of verifying an identity claimed by or for a system entity”
-v RFC 4949
-> RFC 2298
-> RFC 2493
-> RFC 2328
-
-427) The buffer is located __________ 
-> in the heap
-> in the stack
-> in the data section of the process
-> in the register
-> All of the above
-v 1,2,3 are correct
-
-162) To be of practical use an IDS should detect a substantial percentage of intrusions while keeping the false alarm rate at an acceptable level
-v True
-> False
-
-132) In Kerberos, each human user has a master key shared with the authentication server, and the key is usually derived from the user's password
-v True
-> False
-
-712) __________ systems identify features of the hand, including shape, and lengths and widths of fingers
-> Signature
-v Hand geometry
-> Fingerprint
-> Palm print
-
-155) Which of the following feature can only be provided by public-key cryptography?
-> Data integrity
-> Confidentiality
-> Digital signatures
-v None of the above
-
-401) The buffer overflow type of attack has been known since it was first widely used by the __________ Worm in 1988
-v Morris
-> Slammer
-> Code Red
-> Heartbleed
-
-707) Recognition by fingerprint, retina, and face are examples of __________
-> face recognition
-> dynamic biometrics
-v static biometrics authentication
-> token
-
-306) The three classes of intruders identified by Anderson are: Masquerader, Misfeasor, and____
-> Insider threat
-> Social engineer
-v clandestine
-> Cybercriminal
-
-513) When a DoS attack is detected, the first step is to _______
-v identify the attack
-> analyze the response
-> design blocking filters
-> shut down the network
-
-373) Buffer overflows can be found in a wide variety of programs, processing a range of different input and with a variety of possible responses
-v True
-> False
-
-309) Two types of audit records used are Detection-specific audit records and ____ audit records
-> system uptime
-v native
-> network bandwidth
-> packet loss rate
-
-102) A ________ is a key used between entities for the purpose of distributing session keys
-v permanent key
-> session key
-> distribution key
-> all of the above
-
-1074) A __________ is a set in which you can do addition, subtraction, multiplication and division without leaving the set.
-> record
-> standard
-v field
-> block
-
-202) In a wireless network, traffic is broadcasted into the air, and so it is much easier to sniff wireless traffic compared with wired traffic
-v True
-> False
-
-1113) Defensive programming is sometimes referred to as _________.
-> variable programming
-v secure programming
-> interpretive programming
-> chroot programming
-
-18) _________ is the granting of a right or permission to a system entity to access a system resource
-v Authorization
-> Authentication
-> Control
-> Monitoring
-
-1119) IPSec can guarantee that all traffic designated by the network
-administrator is authenticated but cannot guarantee that it is
-encrypted.
-> True
-v False
-
-33) Metamorphic code is software that can be shipped unchanged to a heterogeneous collection of platforms and execute with identical semantics
-> True
-v False
-
-381) Memory is requested from the ______ by programs for use in dynamic data structures, such as linked lists of records
-> ROM
-v heap
-> address space
-> shell
-
-117) With ______ encryption each vulnerable communications link is equipped on both ends with an encryption device
-> network
-> end-to-end
-v link
-> transport
-
-351) The success of the digital immune system depends on the ability of the virus analysis machine to detect new and innovative virus strains
-v True
-> False
-
-91) _________ is the original message or data that is fed into the algorithm as input
-v Plaintext
-> Encryption algorithm
-> Decryption algorithm
-> Ciphertext
-
-1166) Signature-based approaches attempt to define normal,or expected,
-behavior,whereas anomaly approaches attempt to define proper behavior.
-> True
-v False
-
-143) A brute-force approach involves trying every possible key until an intelligible translation of the ciphertext into plaintext is obtained
-v True
-> False
-
-1138) the __________ generation is usually thought of as the Iot and is marked by the use of billions of embedded devices.
-> second
-> third
-v fourth
-> fifth
-
-1158) A denial-of-service attack is an attempt to compromise availability by
-hindering or blocking completely the provision of some service.
-v True
-> False
-
-321) Intrusion detection involves detecting unusual patterns of activity or patterns of activity that are known to correlate with intrusions
-v True
-> False
-
-577) Encryption can be applied to the entire database, at the record level, at the attribute level, or at the level of the individual field
-v True
-> False
-
-266) A (n) __________ is a hacker with minimal technical skill who primarily uses existing attack toolkits
-> Master 
-v Apprentice
-> Journeyman 
-> Activist
-
-424) The __________ used a buffer overflow exploit in "fingerd" as one of its attack
-> Code Red Worm
-> Stuxnet Worm
-v Morris Internet Worm
-> ILOVEYOU Worm
-
-632) Site security of the data center itself includes barriers to entry, coupled with authentication techniques for gaining physical access
-> True
-v False
-
-285) 12.The functional components of an _________ are: data source, sensor, analyzer, administration, manager, and operator
-v IDS
-> IPS
-> SIEM
-> Firewall
-
-139) The purposes of a security protocol include:
-> Authentication
-> Key-exchange
-> Negotiate crypto algorithms and parameters
-v All the previous answers
-
-1106) there are well-defined tests for determining uniform distribution
-and independence to validate that a sequence of numbers is
-random.
-> True
-v False
-
-1082) The first widely used occurrence of the buffer overflow attack was the _______.
-> Code Red Worm
-v Morris Internet Worm
-> Sasser Worm
-> Slammer Worm
-
-29) Subject attributes, object attributes and environment attributes are the three types of attributes in the __________ model
-> DSD
-> RBAC
-v ABAC
-> SSD
-
-63) A mode of operation is a technique for enhancing the effect of a cryptographic algorithm or adapting the algorithm for an application
-v True
-> False
-
-272) The rule _______ tells Snort what to do when it finds a packet that matches the rule criteria
-> protocol 
-> direction
-v action 
-> destination port
-
-640) A _________ is defined to be a portion of a row used to uniquely identify a row in a table
-> foreign key
-> query
-v primary key
-> data perturbation
-
-211) Since Android is open-source, each handset vendor can customize it, and this is good for security (hint: consider security updates)
-> True
-v False
-
-010) The strength of a hash function against brute-force attacks depends
-solely on the length of the hash code produced by the algorithm
-v True
-> False
-
-138) The DSS makes use of the _______ and presents a new digital signature technique, the Digital Signature Algorithm (DSA) 
-> AES
-v SHA-1 
-> MD5
-> RSA
-
-428) _________ is a tool used to automatically identify potentially vulnerable programs
-> Code obfuscation
-> Encryption
-v fuzzing
-> Penetration testing
-
-80) __________ modes of operation have been standardized by NIST for use with symmetric block ciphers such as DES and AES
-> Nine
-> Seven
-> Three
-v Five
-
-467) A __________ virus is explicitly designed to hide itself from detection by anti-virus software
-> Adware
-> Spyware
-> Rootkit
-v stealth
-> Ransomware
-
-116) With _________ encryption the encryption process is carried out at the two end systems
-> point-to-point
-> intermediary
-> centralized
-v end-to-end
-
-119) All encryption algorithms are based on two general principles: substitution and _________
-> compression
-> expansion
-v transposition
-> permutation
-
-01) The original message or data that is fed into the algorithm is __________
-> encryption algorithm 
-> secret key
-> decryption algorithm 
-v plaintext
-
-100) ______ mode is typically used for a general-purpose block-oriented transmission and is useful for high-speed requirements
-> ECB
-> OFB
-> CFB
-v CTR
-
-323) System administrators can stop all attacks and hackers from penetrating their systems by installing software patches periodically
-> True
-v False
-
-217) In XSRF, the malicious site can send malicious script to execute in the user?s browser by embedding the script in a hidden iframe
-> True
-v False
-
-634) Security specifically tailored to databases is an increasingly important component of an overall organizational security strategy
-v True
-> False
-
-836) Computer security is protection of the integrity, availability, and
-confidentiality of information system resources
-True or False
-v True
-> False
-
-1137) A major characteristic of a good security program is how quickly
-the Iot system can be recovered after an incident has occurred.
-v True
-> False
-
-1121) Additional padding may be added to provide partial traffic-flow
-confidentiality by concealing the actual length of the payload.
-v True
-> False
-
-03) Cryptanalytic attacks try every possible key on a piece of ciphertext until an intelligible translation into plaintext is obtaine
-> True
-v False
-
-69) A typical application of Output Feedback mode is stream oriented transmission over noisy channel, such as satellite communication
-v True
-> False
-
-650) __________ specifies the minimum requirements for telecommunications infrastructure of data centers
-v TIA-492
-> RFC-4949
-> NIST-7883
-> RSA-298
-
-147) Using PKCS (public-key cryptography standard), when RSA encrypts the same message twice, different ciphertexts will be produced
-v True
-> False
-
-943) Four stages of viruses
-> Dormant phase
-> Propagation phase - i.e. attachment to email
-> Triggering phase
-> Execution phase
-v All of the above
-
-437) __________ defenses aim to detect and abort attacks in existing programs
-> Code signing
-v run-time
-> Compile-time defenses
-> Patch management
-
-1162) The firewall may be a single computer system or a set of two or more
-systems that cooperate to perform the firewall function.
-v True
-> False
-
-82) The simplest form of multiple encryption has __________ encryption stages and __________ keys
-> three, two
-> four, two
-> two, three
-v two, two
-
-304) Statistical approaches attempt to define proper behavior and rule-based approaches attempt to define normal or expected behavior
-> True
-v False
-
-17) __________ is verification that the credentials of a user or other system entity are valid
-> Adequacy
-v Authentication
-> Authorization
-> Audit
-
-711) The most common means of human-to-human identification are __________
-v facial characteristics
-> signatures
-> retinal patterns
-> fingerprints
-
-1155) In relational database parlance,the basic building block is a __________,which is a flat table.
-> attribute
-> tuple
-> primary key
-v relation
-
-1159) Using forged source addresses is known as _________.
-v source address spoofing
-> a three-way address
-> random dropping
-> directed broadcast
-
-1432) "Each block of 64 plaintext bits is encoded independently using the
-same key" is a description of the CBC mode of operation.
-> True
-v False
-
-126) Cryptographic hash functions generally execute faster in software than conventional encryption algorithms such as DES and AES
-v True
-> False
-
-95) The most widely used encryption scheme is based on the _________ adopted in 1977 by the National Bureau of Standards
-> AES
-> 3DES
-> CES
-v DES
-
-939) If we find that a botnet server is located in country X, we can be certain that criminals within country X control the botnet
-> True
-v False
-
-169) The strength of a hash function against brute-force attacks depends on the length of the hash code produced by the algorithm
-v True
-> False
-
-05) The most important symmetric algorithms, all of which are block ciphers, are the DES, triple DES, and the __________
-> SHA
-> RSA
-v AES
-> DSS
-
-229) The purpose of the privacy functions is to provide a user protection against discovery and misuse of identity by other users
-v True
-> False
-
-1123) the __________ cryptosystem is used in some form in a number of standards including DSS and S/MIME.
-> Rabin
-> Rijnedel
-> Hillman
-v ElGamal
-
-1052) TCB Design Principles
-> Least Privilege
-> Economy
-> Open Design
-> Complete Mediation
-> Fail-safe defaults
-> Ease of Use
-v All of the above
-
-438) The __________ project produces a free, multiplatform 4.4BSD-based UNIX-like operating system
-> Linux
-> Windows
-v OpenBSD
-> macOS
-> FreeBSD
-
-58) A __________ attack is a bot attack on a computer system or network that causes a loss of service to users
-> spam
-> phishing
-v DDoS
-> sniff
-
-328) Stealth is not a term that applies to a virus as such but, rather, refers to a technique used by a virus to evade detection
-v True
-> False
-
-411) In 2003 the _________ exploited a buffer overflow in Microsoft SQL Server 2000
-> Code Red Worm
-> Mydoom Worm
-> Blaster Worm
-v Slammer Worm
-
-1131) A recipient in possession of the secret key cannot generate an
-authentication code to verify the integrity of the message.
-> True
-v False
-
-831) A loss of _________ is the unauthorized disclosure of information
-Select one:
-> integrity
-> availability
-v confidentiality
-> authenticity
-
-335) An encrypted virus is a virus that mutates with every infection, making detection by the signature of the virus impossible
-> True
-v False
-
-934) The best defense against being an unwitting participant in a DDos attack is to prevent your systems from being compromised
-v True
-> False
-
-112) ______ was designed in 1987 by Ron Rivest and is a variable key-size stream cipher with byte-oriented operations
-> DES
-v RC4
-> AES
-> RSA
-
-1090) Security awareness,training,and education programs may be needed to
-comply with regulations and contractual obligations.
-v True
-> False
-
-77) Triple DES makes use of __________ stages of the DES algorithm, using a total of two or three distinct keys
-> twelve
-> six
-> nine
-v three
-
-436) __________ defenses aim to harden programs to resist attacks in new programs
-> Machine code
-> Obfuscated
-> Self-modifying
-v compile-time
-
-150) Just like RSA can be used for signature as well as encryption, Digital Signature Standard can also be used for encryption
-> True
-v False
-
-55) __________ is the first function in the propagation phase for a network worm
-> Propagating
-v Fingerprinting
-> Keylogging
-> Spear phishing
-
-717) A __________ attack involves an adversary repeating a previously captured user response
-> client
-v replay
-> Trojan horse
-> eavesdropping
-
-578) A(n) __________ is a structured collection of data stored for use by one or more applications
-> attribute
-v database
-> tuple
-> inference
-
-837) Data integrity assures that information and programs are changed only
-in a specified and authorized manner
-True or False
-v True
-> False
-
-216) XSRF is possible when a user has a connection to a malicious site while a connection to a legitimate site is still alive
-v True
-> False
-
-1125) Limited characteristics make it impossible for hash functions to be
-used to determine whether or not data has changed.
-> True
-v False
-
-120) The three most important symmetric block ciphers are: 3DES, AES, and _____
-> Serpent
-v Data Encryption Standard (DES)
-> Blowfish
-> RSA
-
-795) The principal objective for developing a PKI is to enable secure, convenient, and efficient acquisition of private keys
-> True
-v False
-
-278) An IDS comprises three logical components: analyzers, user interface and _____
-v sensors
-> firewalls
-> routers
-> encryption algorithms
-
-1129) One limitation of a firewall is that an improperly secured wireless
-LAN may be accessed from outside the organization.
-v True
-> False
-
-41) A Trojan horse is an apparently useful program containing hidden code that, when invoked, performs some harmful function
-v True
-> False
-
-698) Depending on the application, user authentication on a biometric system involves either verification or identification
-v True
-> False
-
-382) A stack buffer overflow attack is also referred to as ______
-> buffer overrunning
-> stack framing
-> heap overflowing
-v stack smashing
-
-78) Another important mode, XTS-AES, has been standardized by the __________ Security in Storage Working Group
-> NIST
-v IEEE
-> ITIL
-> ISO
-
-72) It is possible to convert a block cipher into a stream cipher using cipher feedback, output feedback and counter modes
-v True
-> False
-
-1105) A major advance in symmetric cryptography occurred with the
-development of the rotor encryption/decryption machine.
-v True
-> False
-
-1108) A widely used technique for pseudorandom number generation is
-an algorithm known as the linear congruential method.
-v True
-> False
-
-26) A __________ is a named job function within the organization that controls this computer system
-> user
-v role
-> permission
-> session
-
-1126) the Secure Hash Algorithm design closely models, and is based on, the hash function __________ .
-> MD5
-> FIPS 180
-> RFC 4634
-v MD4
-
-09) __________ is a block cipher in which the plaintext and ciphertext are integers between 0 and n-1 for some n
-> DSS
-v RSA
-> SHA
-> AES
-
-349) Malicious software that needs a host program is referred to as _________ 
-Select one:
-> blended
-v parasitic
-> logic bomb
-> flooders
-
-701) Identifiers should be assigned carefully because authenticated identities are the basis for other security services
-v True
-> False
-
-79) The _________ and _________ block cipher modes of operation are used for authentication
-> OFB, CTR
-v CBC, CFB
-> CFB, OFB
-> ECB, CBC
-
-865) A subject can exercise only accesses for which it has the necessary authorization and which satisfy the MAC rules
-v True
-> False
-
-1111) Data representing behavior that does not trigger an alarm cannot serve as input to intrusion detection analysis.
-> True
-v False
-
-1112) Security flaws occur as a consequence of sufficient checking and validation of data and error codes in programs.
-> True
-v False
-
-107) _________ is the process of attempting to discover the plaintext or key
-v Cryptanalysis
-> Steganography
-> Cryptography
-> Hashing
-
-133) In Kerberos, the purpose of using ticket-granting-ticket (TGT) is to minimize the exposure of a user?s master key
-v True
-> False
-
-1135) the main work for signature generation depends on the message
-and is done during the idle time of the processor.
-> True
-v False
-
-02) The __________ is the encryption algorithm run in reverse
-v decryption algorithm
-> plaintext
-> ciphertext 
-> encryption algorithm
-
-15) An ABAC model can define authorizations that express conditions on properties of both the resource and the subject
-v True
-> False
-
-1169) A bot propagates itself and activates itself,whereas a worm is initially
-controlled from some central facility.
-> True
-v False
-
-560) T/F: SQL Server allows users to create roles that can then be assigned access rights to portions of the database
-v True
-> False
-
-320) Unauthorized intrusion into a computer system or network is one of the most serious threats to computer security
-v True
-> False
-
-567) T/F: A view cannot provide restricted access to a relational database so it cannot be used for security purposes
-> True
-v False
-
-1160) Flooding attacks take a variety of forms based on which network
-protocol is being used to implement the attack.
-v True
-> False
-
-589) T/F: The database management system makes use of the database description tables to manage the physical database
-v True
-> False
-
-595) T/F: An IPS incorporates IDS functionality but also includes mechanisms designed to block traffic from intruders
-v True
-> False
-
-340) Mobile phone worms communicate through Bluetooth wireless connections or via the _________ 
-Select one:
-> SQL
-> TRW
-> PWC
-v MMS
-
-367) ____________ is a form of overflow attack
-> Heap overflows
-> Replacement stack frame
-> Return to system call
-v All of the above
-
-1102) HMAC can be proven secure provided that the embedded hash function
-has some reasonable cryptographic strengths.
-v True
-> False
-
-1149) A loss of _________ is the unauthorized disclosure of information.
-v confidentiality
-> authenticity
-> integrity
-> availability
-
-149) A key exchange protocol is vulnerable to a man-in-the-middle attack if it does not authenticate the participants
-v True
-> False
-
-319) The main advantage of the use of statistical profiles is that a prior knowledge of security flaws is not required
-v True
-> False
-
-1100) The Diffie-Hellman algorithm depends for its effectiveness on the
-difficulty of computing discrete logarithms.
-v True
-> False
-
-014) An important element in many computer security services and
-applications is the use of cryptographic algorithms
-v True
-> False
-
-937) the domain name of the command and control server of a botnet are pre-determined for the lifetime of the botnet
-> True
-v False
-
-52) The __________ is when the virus function is performed
-> dormant phase
-> propagation phase
-> triggering phase
-v execution phase
-
-596) T/F: The CSP can provide backup at multiple locations, with reliable failover and disaster recovery facilities
-v True
-> False
-
-131) In Kerberos, the authentication server shares a unique secret key with each authorized computer on the network
-v True
-> False
-
-1171) In a biometric scheme some physical characteristic of the individual is
-mapped into a digital representation.
-v True
-> False
-
-418) A stack buffer overflow is also referred to as ___________ 
-> data leakage
-v stack smashing
-> heap hijacking
-> code injection
-
-87) The __________ mode operates on full blocks of plaintext and ciphertext, as opposed to an s-bit subset
-> ECB
-> CFB
-> CBC
-v OFB
-
-214) XSS is possible when a web site does not check user input properly and use the input in an outgoing html page
-v True
-> False
-
-1075) the Rijndael developers designed the expansion key algorithm to
-be resistant to known cryptanalytic attacks.
-v True
-> False
-
-898) It is possible to write a compiler tool to check any C program and identify all possible buffer overflow bugs
-> True
-v False
-
-838) Availability assures that systems works promptly and service is not
-denied to authorized users
-True or False
-v True
-> False
-
-207) The App Store review process can guarantee that no malicious iOS app is allowed into the store for download
-> True
-v False
-
-1142) A major weakness of the public announcement of public keys is
-that anyone can forge a public announcement.
-v True
-> False
-
-137) Issued as RFC 2104, _______ has been chosen as the mandatory-to-implement MAC for IP Security
-> SHA-256
-v HMAC
-> MD5
-> AES
-
-1084) Restoring the plaintext from the ciphertext is __________ .
-v deciphering
->  transposition
->  steganography
->  encryption
-
-74) OFB mode requires an initialization vector that must be unique to each execution of the encryption operation
-v True
-> False
-
-05) Triple DES takes a plaintext block of 64 bits and a key of 56 bits to produce a ciphertext block of 64 bits
-> True
-v False
-
-590) T/F: The cloud carrier is useful when cloud services are too complex for a cloud consumer to easily manage
-> True
-v False
-
-08) A message authentication code is a small block of data generated by a
-secret key and appended to a message
-v True
-> False
-
-49) The term "computer virus" is attributed to __________
-> Herman Hollerith
-v Fred Cohen
-> Charles Babbage
-> Albert Einstein
-
-167) Two of the most important applications of public-key encryption are digital signatures and key management
-v True
-> False
-
-842) Security mechanisms typically do not involve more than one particular
-algorithm or protocol
-True or False
-> True
-v False
-
-227) The IT security management process ends with the implementation of controls and the training of personnel
-> True
-v False
-
-913) each layer of code needs appropriate hardening measures in place to provide appropriate security services
-v True
-> False
-
-1117) The Biba models deals with confidentiality and is concerned with
-unauthorized disclosure of information.
-> True
-v False
-
-215) XSS can perform many types of malicious actions because a malicious script is executed at user?s browser
-v True
-> False
-
-163) An inline sensor monitors a copy of network traffic; the actual traffic does not pass through the device
-> True
-v False
-
-1114) It is possible to convert any block cipher into a stream cipher by using
-the cipher feedback (CF> mode.
-v True
-> False
-
-37) Many forms of infection can be blocked by denying normal users the right to modify programs on the system
-v True
-> False
-
-28) __________ refers to setting a maximum number with respect to roles
-v Cardinality
-> Prerequisite
-> Exclusive
-> Hierarchy
-
-152) is the original message or data that is fed into the encryption process as input
-> Hash
-> Key
-v Plaintext 
-> Ciphertext
-
-1092) The approach taken by Kerberos is using authentication software tied
-to a secure authentication server.
-v True
-> False
-
-25) __________ is based on the roles the users assume in a system rather than the user's identity
-> DAC
-v RBAC
-> MAC
-> URAC
-
-245) Activists are either individuals or members of an organized crime group with a goal of financial reward
-> True
-v False
-
-246) Running a packet sniffer on a workstation to capture usernames and passwords is an example of intrusion
-v True
-> False
-
-409) A buffer can be located _________
-> in the heap
-> on the stack
-> in the data section of the process
-v All of the above
-
-226) It is likely that an organization will not have the resources to implement all the recommended controls
-v True
-> False
-
-47) __________ are used to send large volumes of unwanted e-mail
-> Rootkits
-v Spammer programs
-> Downloaders
-> Auto-rooters
-
-263) The ________ is responsible for determining if an intrusion has occurred
-v analyzer 
-> host
-> user interface 
-> sensor
-
-899) The OpenSSL heartbleed vulnerability would have been prevented if OpenSSL had been implemented in Java
-v True
-> False
-
-220) Using an input filter to block certain characters is an effective way to prevent SQL injection attacks
-v True
-> False
-
-103) The _______ module performs end-to-end encryption and obtains session keys on behalf of users
-> PKM
-> RCM
-v SSM
-> CCM
-
-1130) the primary benefit of a host-based IDS is that it can detect both
-external and internal intrusions.
-v True
-> False
-
-93) The _________ is the encryption algorithm run in reverse
-v decryption algorithm
-> ciphertext
-> plaintext
-> secret key
-
-840) The more critical a component or service, the higher the level of
-availability required
-True or False
-v True
-> False
-
-1099) If a computer's temperature gets too cold the system can undergo
-thermal shock when it is turned on.
-v True
-> False
-
-708) A __________ is a password guessing program
-> password hash
-v password cracker
-> password biometric
-> password salt
-
-1088) Integrity can apply to a stream of messages, a single message, or
-selected fields within a message.
-v True
-> False
-
-1489) __________ controls access based on comparing security labels with security clearances.
-v MAC
-> DAC
-> RBAC
-> MBAC
-
-124) The additive constant numbers used in SHA-512 are random-looking and are hardcoded in the algorithm
-v True
-> False
-
-508) A characteristic of reflection attacks is the lack of _______ traffic
-v backscatter
-> network
-> three-way
-> botnet
-
-313) Penetration identification is an approach developed to detect deviation from previous usage patterns
-> True
-v False
-
-935) Botnet command and control must be centralized( i.e. all bots communicate with a central server(s))
-> True
-v False
-
-880) A virus that attaches to an executable program can do anything that hte program is permitted to do
-v True
-> False
-
-691) Identification is the means of establishing the validity of a claimed identity provided by a user
-v True
-> False
-
-198) In IPSec, if A uses DES for traffic from A to B, then B must also use DES for traffic from B to A
-> True
-v False
-
-34) A virus that attaches to an executable program can do anything that the program is permitted to do
-v True
-> False
-
-779) The most significant source of risk in wireless networks in the underlying communications medium
-v True
-> False
-
-36) A logic bomb is the event or condition that determines when the payload is activated or delivered
-v True
-> False
-
-53) During the __________ the virus is idle
-v dormant phase
-> propagation phase
-> triggering phase
-> execution phase
-
-503) TCP uses the _______ to establish a connection
-> zombie
-> SYN cookie
-> directed broadcast
-v three-way handshake
-
-97) For stream-oriented transmission over noisy channel you would typically use _______ mode
-> ECB
-> CTR
-v OFB
-> CBC
-
-866) One way to secure against Trojan horse attacks is the use of a secure, trusted operating system
-v True
-> False
-
-593) T/F: An IDS is a set of automated tools designed to detect unauthorized access to a host system
-v True
-> False
-
-350) The challenge in coping with DDoS attacks is the sheer number of ways in which they can operate
-v True
-> False
-
-66) Given the potential vulnerability of DES to a brute-force attack, an alternative has been found
-v True
-> False
-
-758) A packet filtering firewall is typically configured to filter packets going in both directions
-v True
-> False
-
-1085) the process of converting from plaintext to ciphertext is known as
-deciphering or decryption.
-> True
-v False
-
-99) For general-purpose stream-oriented transmission you would typically use _______ mode
-> CTR
-v CFB
-> ECB
-> CBC
-
-10) The default set of rights should always follow the rule of least privilege or read-only access
-v True
-> False
-
-03) __________ is the scrambled message produced as output
-> Plaintext
-v Ciphertext
-> Secret key 
-> Cryptanalysis
-
-42) Packet sniffers are mostly used to retrieve sensitive information like usernames and passwords
-v True
-> False
-
-236) The primary purpose of an IDS is to detect intrusions, log suspicious events, and send alerts
-v True
-> False
-
-696) User authentication is the basis for most types of access control and for user accountability
-v True
-> False
-
-59) The ideal solution to the threat of malware is __________
-> identification
-> removal
-> detection
-v prevention
-
-98) For general-purpose block-oriented transmission you would typically use _______ mode
-v CBC
-> CTR
-> CFB
-> OFB
-
-695) A good technique for choosing a password is to use the first letter of each word of a phrase
-v True
-> False
-
-128) It is a good idea to use sequentially increasing numbers as challenges in security protocols
-> True
-v False
-
-210) In Android, an app will never be able to get more permission than what the user has approved
-v True
-> False
-
-893) Security mechanisms typically do not involve more than one particular algorithm or protocol
-> True
-v False
-
-1127) Big-endian format is the most significant byte of a word in the
-low-address byte position.
-v True
-> False
-
-341) Backdoors become threats when unscrupulous programmers use them to gain unauthorized access
-v True
-> False
-
-894) The first step in devising security services and mechanisms is to develop a security policy
-v True
-> False
-
-67) A number of Internet based applications have adopted two-key 3DES, including PGP and S/MIME
-> True
-v False
-
-386) Buffer overflow exploits are no longer a major source of concern to security practitioners
-> True
-v False
-
-936) Both static and dynamic analyses are needed in order to fully understand malware behaviors
-v True
-> False
-
-151) In general, public key based encryption is much slower than symmetric key based encryption
-v True
-> False
-
-011) Transmitted data stored locally are referred to as __________ 
-> ciphertext 
-> DES
-v data at rest 
-> ECC
-
-727) Hardware is the most vulnerable to attack and the least susceptible to automated controls
-v True
-> False
-
-1109) The foundation of a security auditing facility is the initial capture of
-the audit data.
-v True
-> False
-
-597) T/F: Encryption is a pervasive service that can be provided for data at rest in the cloud
-v True
-> False
-
-699) Enrollment creates an association between a user and the user's biometric characteristics
-v True
-> False
-
-222) Organizational security objectives identify what IT security outcomes should be achieved
-v True
-> False
-
-221) SQL injection is yet another example that illustrates the importance of input validation
-v True
-> False
-
-203) Compared with WEP, WPA2 has more flexible authentication and stronger encryption schemes
-v True
-> False
-
-165) Network-based intrusion detection makes use of signature detection and anomaly detection
-v True
-> False
-
-125) The strong collision resistance property subsumes the weak collision resistance property
-v True
-> False
-
-13) Traditional RBAC systems define the access rights of individual users and groups of users
-> True
-v False
-
-218) It is easy for the legitimate site to know if a request is really from the (human) user
-> True
-v False
-
-200) Most browsers come equipped with SSL and most Web servers have implemented the protocol
-v True
-> False
-
-690) User authentication is the fundamental building block and the primary line of defense
-v True
-> False
-
-6) Security labels indicate which system entities are eligible to access certain resources
-> True
-v False
-
-1096) A malicious driver can potentially bypass many security controls to
-install malware.
-v True
-> False
-
-639) In a relational database rows are referred to as _________
-> relations
-> attributes
-> views
-v tuples
-
-312) Password crackers rely on the fact that some people choose easily guessable passwords
-v True
-> False
-
-1161) An important aspect of a distributed firewall configuration is security
-monitoring.
-v True
-> False
-
-1133) An important characteristic of the MAC algorithm is that it needs
-to be reversible.
-> True
-v False
-
-1086) A loss of integrity is the unauthorized modification or destruction
-of information.
-v True
-> False
-
-3) An auditing function monitors and keeps a record of user accesses to system resources
-v True
-> False
-
-224) Legal and regulatory constraints may require specific approaches to risk assessment
-v True
-> False
-
-568) T/F: Two disadvantages to database encryption are key management and inflexibility
-v True
-> False
-
-1146) SSO enables a user to access all network resources after a single
-authentication.
-v True
-> False
-
-333) Viruses, logic bombs, and backdoors are examples of independent malicious software
-> True
-v False
-
-225) One asset may have multiple threats and a single threat may target multiple assets
-v True
-> False
-
-371) A stack overflow can result in some form of a denial of service attack on a system
-v True
-> False
-
-14) A constraint is a defined relationship among roles or a condition related to roles
-v True
-> False
-
-1167) The __________ is what the virus "does".
-> infection mechanism
-> trigger
-> logic bomb
-v payload
-
-56) Unsolicited bulk e-mail is referred to as __________
-v spam
-> propagating
-> phishing
-> crimeware
-
-575) The two commands that SQL provides for managing access rights are ALLOW and DENY
-> True
-v False
-
-71) Cipher Block Chaining is a simple way to satisfy the security deficiencies of ECB
-v True
-> False
-
-197) In IPSec, packets can be protected using ESP or AH but not both at the same time
-> True
-v False
-
-1110) Although important,security auditing is not a key element in computer
-security.
-> True
-v False
-
-933) A bot is a computer compromised by malware and under the control of a bot master
-v True
-> False
-
-379) A buffer overflow error is not likely to lead to eventual program termination. 
-> True
-v False
-
-700) An individual's signature is not unique enough to use in biometric applications
-> True
-v False
-
-505) _______ is a text-based protocol with a syntax similar to that of HTTP
-> RIP
-> DIP
-v SIP
-> HIP
-
-431) Data is simply an array of _________ 
-> characters
-> integers
-> floating-point numbers
-v bytes
-
-915) The default configuration for many operating systems usually maximizes security
-> True
-v False
-
-141) Symmetric encryption is also referred to as secret-key or single-key encryption
-v True
-> False
-
-1081) The buffer overflow type of attack is one of the least commonly seen
-attacks.
-> True
-v False
-
-23) A(n) __________ is a resource to which access is controlled
-v object
-> owner
-> world
-> subject
-
-159) _________ was the first published public-key algorithm
-> ElGamal
-> DSA
-v Diffie-Hellman
-> RSA
-
-1132) A __________ is an algorithm that requires the use of a secret key.
-> DAA
-> SHA
-> GCM
-v MAC
-
-914) it is possible for a system to be compromised during the installation process
-v True
-> False
-
-1136) the digital signature function does not include the authentication
-function.
-> True
-v False
-
-19) __________ is the traditional method of implementing access control
-> MAC
-> RBAC
-v DAC
-> MBAC
-
-1157) T F 4.The value of a primary key must be unique for each tuple of its table.
-v True
-> False
-
-31) Malicious software aims to trick users into revealing sensitive personal data
-v True
-> False
-
-1147) The authentication function determines who is trusted for a given purpose.
-> True
-v False
-
-73) Cipher Feedback Mode conforms to the typical construction of a stream cipher
-> True
-v False
-
-168) The secret key is one of the inputs to a symmetric-key encryption algorithm
-v True
-> False
-
-1080) Buffer overflow attacks result from careless programming in
-applications.
-v True
-> False
-
-70) Cipher Feedback (CFB  is used for the secure transmission of single values)
-> True
-v False
-
-586) T/F: The value of a primary key must be unique for each tuple of its table
-v True
-> False
-
-1103) Much of the theory of public-key cryptosystems is based on
-number theory.
-v True
-> False
-
-22) A __________ is an entity capable of accessing objects
-> group
-> object
-v subject
-> owner
-
-334) In addition to propagation a worm usually performs some unwanted function
-v True
-> False
-
-388) The buffer overflow type of attack is one of the most common attacks seen
-v True
-> False
-
-104) Public-key encryption was developed in the late ________
-> 1950s
-v 1970s
-> 1960s
-> 1980s
-
-164) A common location for a NIDS sensor is just inside the external firewall
-v True
-> False
-
-1165) Those who hack into computers do so for the thrill of it or for status.
-v True
-> False
-
-9) An access right describes the way in which a subject may access an object
-v True
-> False
-
-4) External devices such as firewalls cannot provide access control services
-> True
-v False
-
-1094) The authentication server shares a unique secret key with each server.
-v True
-> False
-
-233) The IDS component responsible for collecting data is the user interface
-> True
-v False
-
-130) In security protocol, an obvious security risk is that of impersonation
-v True
-> False
-
-50) Computer viruses first appeared in the early __________
-> 1960s
-> 1970s
-v 1980s
-> 1990s
-
-24) The final permission bit is the _________ bit
-> superuser
-> kernel
-> set user
-v sticky
-
-1079) the XtS-AES mode is based on the concept of a tweakable block
-cipher.
-v True
-> False
-
-591) T/F: Fixed server roles operate at the level of an individual database
-> True
-v False
-
-1154) Public-key algorithms are based on simple operations on bit patterns.
-> True
-v False
-
-40) In addition to propagating, a worm usually carries some form of payload
-v True
-> False
-
-1144) For end-to-end encryption over a network, manual delivery is
-awkward.
-v True
-> False
-
-1093) X.509 provides a format for use in revoking a key before it expires.
-v True
-> False
-
-387) Shellcode must be able to run no matter where in memory it is located
-v True
-> False
-
-563) T/F: Encryption becomes the last line of defense in database security
-v True
-> False
-
-324) One important element of intrusion prevention is password management
-v True
-> False
-
-1164) Snort can perform intrusion prevention but not intrusion detection.
-> True
-v False
-
-68) The sender is the only one who needs to know an initialization vector
-> True
-v False
-
-693) Many users choose a password that is too short or too easy to guess
-v True
-> False
-
-374) Stack buffer overflow attacks were first seen in the Aleph One Worm
-> True
-v False
-
-199) In IPSec, the sequence number is used for preventing replay attacks
-v True
-> False
-
-372) There are several generic restrictions on the content of shellcode
-v True
-> False
-
-583) T/F: A query language provides a uniform interface to the database
-v True
-> False
-
-166) Symmetric encryption is used primarily to provide confidentiality
-v True
-> False
-
-900) ASLR(if implemented correctly) can prevent return-to-libc attacks
-v True
-> False
-
-399) Shellcode is not specific to a particular processor architecture
-> True
-v False
-
-1143) Manual delivery of a key is not reasonable for link encryption.
-> True
-v False
-
-839) The "A" in the CIA triad stands for "authenticity"
-True or False
-> True
-v False
-
-389) Buffer overflow attacks are one of the most common attacks seen
-v True
-> False
-
-206) In iOS, an app can run its own dynamic, run-time generated code
-> True
-v False
-
-336) Macro viruses infect documents, not executable portions of code
-v True
-> False
-
-732) Like the MAC, a hash function also takes a secret key as input
-> True
-v False
-
-235) Intruders typically use steps from a common attack methodology
-v True
-> False
-
-587) T/F: A foreign key value can appear multiple times in a table
-v True
-> False
-
-209) In Android, all apps have to be reviewed and signed by Google
-> True
-v False
-
-121) SHA is perhaps the most widely used family of hash functions
-v True
-> False
-
-735) The advantage of a stream cipher is that you can reuse keys
-> True
-v False
-
-015) Some form of protocol is needed for public-key distribution
-v True
-> False
-
-584) T/F: A single countermeasure is sufficient for SQLi attacks
-> True
-v False
-
-205) In iOS, each file is encrypted using a unique, per-file key
-> True
-v False
-
-213) Malicious JavaScripts is a major threat to browser security
-v True
-> False
-
-142) The ciphertext-only attack is the easiest to defend against
-v True
-> False
-
-318) Insider attacks are among the easiest to detect and prevent
-> True
-v False
-
-244) An intruder can also be referred to as a hacker or cracker
-v True
-> False
-
-1139) the main elements of a RFID system are tags and readers.
-v True
-> False
-
-219) SQL injection attacks only lead to information disclosure
-> True
-v False
-
-879) External attacks are the only threats to dataase security
-> True
-v False
-
-938) Some APT attacks last for years before they are detected
-v True
-> False
-
-1) Access control is the central element of computer security
-v True
-> False
-
-65) S-AES is the most widely used multiple encryption scheme
-> True
-v False
-
-631) A data center generally includes backup power supplies
-v True
-> False
-
-1168) Programmers use backdoors to debug and test programs.
-v True
-> False
-
-864) ?No write down? is also referred to as the *-property
-v True
-> False
-
-1141) the Iot depends heavily on deeply embedded systems.
-v True
-> False
-
-135) Kerberos does not support inter-realm authentication
-> True
-v False
-
-1151) The "A" in the CIA triad stands for "authenticity".
-> True
-v False
-
-136) SHA-1 produces a hash value of _______ bits
-> 256
-> 512
-v 160
-> 128
-
-39) E-mail is a common method for spreading macro viruses
-v True
-> False
-
-35) It is not possible to spread a virus via a USB stick
-> True
-v False
-
-1097) Lower layer security does not impact upper layers.
-> True
-v False
-
-62) There are no practical cryptanalytic attacks on 3DES
-v True
-> False
-
-32) Keyware captures keystrokes on a compromised system
-> True
-v False
-
-04) The secret key is input to the encryption algorithm
-v True
-> False
-
-253) Anomaly detection is effective against misfeasors
-> True
-v False
-
-883) A macro virus infects executable protions of code
-> True
-v False
-
-38) A macro virus infects executable portions of code
-> True
-v False
-
-1098) The direct flame is the only threat from fire.
-> True
-v False
-
-702) A smart card contains an entire microprocessor
-v True
-> False
-
-346) Malware is another name for Malicious Software
-v True
-> False
-
-641) A _________ is a virtual table
-> tuple
-> query
-v view
-> DBMS
-
-7) Reliable input is an access control requirement
-v True
-> False
-
-835) Threats are attacks carried out
-True or False
-> True
-v False
-
-201) Even web searches have (often) been in HTTPS
-v True
-> False
-
-134) The ticket-granting ticket is never expired
-> True
-v False
-
-146) Timing attacks are only applicable to RSA
-> True
-v False
-
-1076) InvSubBytes is the inverse of ShiftRows.
-> True
-v False
-
-208) In iOS, each app runs in its own sandbox
-v True
-> False
-
-1153) Public-key cryptography is asymmetric.
-v True
-> False
-
-327) Bot programs are activated by a trigger
-v True
-> False
-
-1148) A user may belong to multiple groups.
-v True
-> False
-
-122) SHA-1 is considered to be very secure
-> True
-v False
-
-703) Keylogging is a form of host attack
-> True
-v False
-
-697) Memory cards store and process data
-> True
-v False
-
-44) Every bot has a distinct IP address
-v True
-> False
-
-1150) Threats are attacks carried out.
-> True
-v False
-
-144) AES uses a Feistel structure
-> True
-v False
-
-787) Search engines support HTTPS
-> True
-v False
-
-204) iOS has no vulnerability
-> True
-v False
diff --git a/legacy/Data/Questions/sicurezza_appello1.txt b/legacy/Data/Questions/sicurezza_appello1.txt
deleted file mode 100644
index cf3f06d..0000000
--- a/legacy/Data/Questions/sicurezza_appello1.txt
+++ /dev/null
@@ -1,197 +0,0 @@
-1) L'input affidabile (reliable) è un requisito per il controllo degli accessi
-v V
-> F
-
-2) I / Le __________ forniscono un mezzo per adattare RBAC alle specifiche delle politiche amministrative e di sicurezza in un'organizzazione
-> cardinalità (cardinality)
-v vincoli (constraints)
-> ruoli che si escludono a vicenda (mutually exclusive roles)
-> prerequisiti (prerequisites)
-
-3) _______________ è il metodo tradizionale per implementare il controllo degli accessi
-> MBAC
-> RBAC
-v DAC
-> MAC
-
-4) Qualsiasi programma di proprietà e con SetUID del "superutente" potenzialmente concede l'accesso illimitato al sistema a qualsiasi utente che esegue quel programma
-v V
-> F
-
-5) Le minacce (thrats) sono attacchi effettuati
-> V
-v F
-
-6) Masquerade, falsificazione e ripudio sono azioni di minaccia che causano conseguenze di minaccia di __________
-v Inganno (deception)
-> Usurpazione (usurpation)
-> Divulgazione non autorizzata (unauthorized disclosure)
-> Interruzione (disruption)
-
-7) La "A" nella triade CIA sta per "autenticità"
-> V
-v F
-
-8) Un difetto (flow) o debolezza (weakness) nella progettazione, implementazione o funzionamento e gestione di un sistema che potrebbe essere sfruttato per violare la politica di sicurezza del sistema è un / una __________
-> Contromisura
-v Vulnerabilità
-> Avversario
-> Rischio
-
-9) La presentazione o la generazione di informazioni di autenticazione che confermano il legame tra l'entità e l'identificatore è la ___________
-> Fase di autnticazione (authentication step)
-> Fase di conferma (confirmation step)
-> Fase di identificazione (identification step)
-v Fase di verifica (verification step)
-
-10) L'autenticazione dell'utente è la base per la maggior parte dei tipi di controllo degli accessi (Access control) e della responsabilità dell'utente (User accountability)
-v V
-> F
-
-11) Un attacco __________ coinvolge un avversario che ripete una risposta dell'utente acquisita in precedenza
-> Eavesdropping
-> Client
-v Replay
-> Trojan horse
-
-12) L'autenticazione dell'utente è una procedura che consente ai soggetti comunicanti di verificare che i contenuti di un messaggio ricevuto non siano stati alterati e che la fonte sia autentica
-> V
-v F
-
-13) Due svantaggi della crittografia dei database sono la gestione delle chiavi e la poca flessibilità
-v V
-> F
-
-14) Il / La / L' __________ è il processo di esecuzione di query autorizzate e deduzione di informazioni non autorizzate dalle risposte legittime ricevute
-> compromesso (compromise)
-v inferenza (inference)
-> perturbazione (perturbation)
-> partizionamento (partitioning)
-
-15) Un SQL Server consente agli utenti di creare ruoli a cui è possibile assegnare diritti di accesso a porzioni del database
-v V
-> F
-
-16) La crittografia è l'ultima linea di difesa nella sicurezza del database
-v V
-> F
-
-17) Un ______ attiva un bug nel software di gestione della rete del sistema, provocandone l'arresto anomalo e il sistema non può più comunicare sulla rete fino a quando questo software non viene ricaricato
-> pacchetto di echo (echo packet)
-> reflection attack
-> attacco flash flood (flash flood attack)
-v pacchetto avvelenato (poison packet)
-
-18) Gli attacchi Reflector e Amplifier utilizzano sistemi compromessi che eseguono i programmi dell'aggressore
-> V
-v F
-
-19) Un attacco DoS che prende di mira le risorse dell'applicazione in genere mira a sovraccaricare o arrestare in modo anomalo il software di gestione della rete
-> V
-v F
-
-20) Il ______ attacca la capacità di un server di rete di rispondere alle richieste di connessione TCP sovraccaricando le tabelle utilizzate per gestire tali connessioni
-> poison packet attack
-v SYN spoofing attack
-> DNS amplification attack
-> basic flooding attack
-
-21) Il codice metamorfico (metamorphic code) è un software che può essere spedito invariato a un insieme eterogenea di piattaforme ed eseguito con semantica identica
-> V
-v F
-
-22) I / Gli / La __________ si integrerà con il sistema operativo di un computer host e monitorerà il comportamento del programma in tempo reale per azioni dannose
-> scanner basati su fingerprint (fingerprint-based scanners)
-v scanner che bloccano il comportamento (behavior-blocking scanners)
-> tecnologie di decrittazione generica (generic decryption technology)
-> scanner euristici (heuristic scanners)
-
-23) Un macro virus infetta porzioni eseguibili di codice
-> V
-v F
-
-24) Un / Una __________ è un codice inserito in un malware che rimane dormiente finché non viene soddisfatta una condizione predefinita, che attiva un'azione non autorizzata
-> worm
-> trojan horse
-v logic bomb
-> trapdoor
-
-25) La / Le __________ possono impedire attacchi di buffer overflow, in genere a dati globali, che tentano di sovrascrivere regioni adiacenti nello spazio degli indirizzi dei processi, come la tabella di offset globale
-> MMU
-v pagine di protezione (guard pages)
-> Heaps
-> Tutto quanto elencato precedentemente
-
-26) Una conseguenza di un errore di buffer overflow è la / il / __________
-> corruzione dei dati utilizzati dal programma
-> trasferimento imprevisto del controllo del programma
-> possibile violazione dell'accesso alla memoria
-v tutto quanto elencato precedentemente
-
-27) Un overflow dello stack può provocare, su di un sistema, una qualche forma di attacco denial-of-service
-v V
-> F
-
-28) Java, anche se è un linguaggio di programmazione di alto livello, soffre ancora della vulnerabilità di buffer overflow perché consente di salvare più dati in un buffer di quanti ne possa contenere
-> V
-v F
-
-29) Un _________ controlla le caratteristiche di un singolo host e gli eventi che si verificano all'interno di tale host per attività sospette
-> rilevamento delle intrusioni (intrusion detection)
-> IDS basato sulla rete (network-based IDS)
-> intrusione nella sicurezza (security intrusion)
-v IDS basato sull'host (host-based IDS)
-
-30) Il _________ comporta la raccolta di dati relativi al comportamento degli utenti legittimi in un periodo di tempo
-> rilevamento basato sul profilo (profile-based detection)
-v rilevamento delle anomalie (anomaly detection)
-> rilevamento della firma (signature detection)
-> rilevamento di soglia (threshold detection)
-
-31) Un sensore NIDS è solitamente posizionato all'interno del firewall esterno
-v V
-> F
-
-32) Gli approcci di intrusion detection basati sulle firme (signature-based) tentano di definire i comportamenti normali, o attesi, mentre gli approcci basati su anomalia (anomaly-based) tentano di definire il comportamento corretto
-> V
-v F
-
-33) SHA-1 produce un valore di hash di ______ bits
-> 384
-v 160
-> 180
-> 256
-
-34) Una funzione hash come SHA-1 non è stata progettata per essere utilizzata come MAC e non può essere utilizzata direttamente a tale scopo perché non si basa su una chiave segreta
-v V
-> F
-
-35) Gli attacchi di tipo Timing (timing attacks) sono applicabili solo a RSA
-> V
-v F
-
-36) Gli attacchi _________ usano diversi approcci, tutti equivalenti, in termini di costo, a fattorizzare il prodotto di due numeri primi
-v matematici
-> a testo cifrato scelto
-> di Timing
-> di forza bruta
-
-37) Per la trasmissione orientata al flusso (stream-oriented) su un canale rumoroso, in genere si utilizza la modalità di cifratura a blocchi _______
-> CBC (Cipher Block Chaining)
-v OFB (Output Feedback)
-> ECB (Electronic Code Book)
-> CTR (Counter)
-
-38) Per la trasmissione generica orientata ai blocchi (block-oriented), in genere si utilizza la modalità di cifratura a blocchi ________
-> CFB (Cipher Feedback)
-> OFB (Output Feedback)
-v CBC (Cipher Block Chaining)
-> CTR (Counter)
-
-39) È possibile convertire qualsiasi cifrario a blocchi in un cifrario a flusso utilizzando la modalità Cipher Feedback (CFB)
-v V
-> F
-
-40) AES usa una struttura di Feistel
-> V
-v F
\ No newline at end of file
diff --git a/legacy/Data/Questions/so1.txt b/legacy/Data/Questions/so1.txt
deleted file mode 100644
index f1ac55b..0000000
--- a/legacy/Data/Questions/so1.txt
+++ /dev/null
@@ -1,815 +0,0 @@
-1) Quale delle seguenti affermazioni sulle directory di un file system è vera?
-> È sempre necessario identificare un file di un file system fornendone il path assoluto
-> È sempre necessario identificare un file di un file system fornendone il path relativo alla directory corrente
-> È sempre possibile dare lo stesso nome a file diversi
-v Nessuna delle altre opzioni è vera
-
-2) UNSAFE Quale delle seguenti affermazioni sulla concorrenza tra processi o thread è falsa?
-v La disabilitazione delle interruzioni impedisce la creazione di nuove interruzioni
-> L'abuso della disabilitazione delle interruzioni fa diminuire la multiprogrammazione, a parità di numero di processi
-> Se un processo può disabilitare le interruzioni tramite un'istruzione macchina dedicata, allora può far diminuire l'uso del processore
-> La disabilitazione delle interruzioni non funziona su sistemi con più processori o più core
-
-3) Assumendo un sistema monoprocessore, quale delle seguenti affermazioni è vera? 
-> Lo scheduler ha, tra i suoi obiettivi, quello di minimizzare il numero di processi che rispettano la propria deadline
-> Lo scheduler ha, tra i suoi obiettivi, quello di minimizzare il volume di lavoro nel tempo
-> Lo scheduler ha, tra i suoi obiettivi, quello di massimizzare il tempo di risposta
-v Lo scheduler ha, tra i suoi obiettivi, quello di minimizzare il tempo di inattività del processore
-
-4) Quale delle seguenti affermazioni sul modello dei processi in UNIX SVR4 System V Release 4 è falsa?
-> Se un processo è Zombie, allora è terminato ma il suo process control block è ancora in memoria
-> Asleep in Memory coincide con Blocked
-v Ha anche uno stato Zombie: serve per tutti i processi che sono terminati
-> Ha 9 stati (10 con Exit)
-
-5) Quale delle seguenti affermazioni sulla memoria virtuale con paginazione è falsa? 
-> Quando un indirizzo non viene trovato nel translation lookaside buffer, è necessario consultare la normale tabella delle pagine
-> Il translation lookaside buffer è una particolare cache, ma non è completamente trasparente al sistema operativo
-v Il translation lookaside buffer permette di accedere direttamente al contenuto degli indirizzi di memoria virtuali usati più di recente
-> In assenza di translation lookaside buffer, l'accesso ad un indirizzo virtuale può richiedere almeno 2 accessi in memoria
-
-6) Quale delle seguenti affermazioni sugli obiettivi di sicurezza di un sistema operativo è vera?
-> Per "disponibilità" dell'hardware si intende la garanzia che le workstation restino sempre fisse in un posto
-> Per "confidenzialità" dei dati si intende la garanzia che essi non possano essere generati automaticamente
-v Nessuna delle altre opzioni è vera
-> Per "integrità" dei dati si intende la garanzia che essi non vengano mai modificati
-
-7) Quale delle seguenti affermazioni sul buffering dell'I/O è vera? 
-> Nessuna delle altre opzioni è corretta
-> Avviene direttamente su disco, altrimenti si rischia il deadlock per interferenze con il DMA
-> Nel caso ci siano più buffer, vanno gestiti come nel problema dei lettori/scrittori
-v Può consistere nel completare un'istruzione di output I (è una i) dopo che alcune istruzioni successive ad I siano state eseguite 
-
-8) Quale delle seguenti affermazioni, riguardanti il joint progress diagram di 2 processi, è vera?
-v Nessuna delle altre opzioni è vera
-> Può essere usato per visualizzare le possibilità di deadlock, ma solo se i processi richiedono al massimo 2 risorse
-> Può essere usato per determinare quando uno dei due processi va in esecuzione a discapito dell'altro
-> Può essere usato per determinare quando uno dei due processi sperimenta un page fault
-
-9) Quale delle seguenti affermazioni sulla gerarchia della memoria è vera?
-> Nessuna delle altre opzioni è corretta
-> Andando dall'alto in basso, cresce il costo
-> Andando dall'alto in basso, diminuisce la capacità
-v Andando dall'alto in basso, diminuisce la frequenza di accesso alla memoria da parte del processore
-
-10) Quale dei seguenti elementi non fa parte del process control block?
-> Il puntatore alla tabella delle pagine
-v L’identificatore del thread
-> Lo stato o modalità
-> L’identificatore del processo
-
-11) Assumendo un sistema monoprocessore, quale delle seguenti affermazioni sugli algoritmi di scheduling è vera?
-v Nessuna delle altre opzioni è vera
-> Il quanto di tempo ottimale per lo scheduler round-robin è maggiore del tipico tempo di completa esecuzione di un processo interattivo
-> Lo scheduler First Come First Served favorisce i processi I/O-bound
-> Anche assumendo che tutti i processi prima o poi terminino, lo scheduler First Come First Served soffre di starvation
-
-
-14) Quale delle seguenti affermazioni sulla segmentazione della memoria è falsa? 
-> Diversi segmenti possono avere diverse lunghezze
-v Differentemente dalla paginazione, il programmatore assembler di un processo non interagisce esplicitamente con la gestione dei segmenti
-> Per accedere ad un indirizzo contenuto in un segmento di un processo, tale segmento dovrà essere posizionato in memoria principale
-> Un indirizzo di memoria principale va visto come un numero di segmento più uno spiazzamento all'interno di tale segmento
-
-15) Quale delle seguenti affermazioni sull'algoritmo per il rilevamento del deadlock visto a lezione è vera?
-> Richiede in input, per ogni processo p e per ogni risorsa r, il numero massimo di istanze di r che p chiederà nel corso della sua esecuzione
-> Se al passo 3 viene trovato un processo non marcato che soddisfi la condizione Qik ≤ wik, allora c'è un deadlock
-v I processi marcati sono quelli che non sono coinvolti in un deadlock
-> Nessuna delle altre opzioni è vera
-
-16) Assumendo un sistema monoprocessore, quale delle seguenti affermazioni sul long-term scheduler è falsa? 
-v Viene chiamato in causa esclusivamente quando viene creato un nuovo processo
-> Avendo le necessarie informazioni, una tipica strategia è mantenere una giusta proporzione, stabilita a priori, tra processi I/O-bound e CPU-bound
-> Avendo le necessarie informazioni, una tipica strategia è ammettere in memoria principale i processi che richiedono dispositivi di I/O diversi da quelli richiesti dai processi già attivi
-> Decide quali processi, tra quelli appena creati, possono essere ammessi in memoria principale per l'esecuzione
-
-17) Quale delle seguenti affermazioni sulla memoria virtuale con paginazione è vera? 
-v Il difetto principale del prepaging è che potrebbe portare in memoria pagine cui poi non si fa riferimento
-> Placement policy e replacement policy sono sinonimi ed indicano lo stesso insieme di metodologie
-> Nessuna delle altre opzioni è corretta
-> Il difetto principale del paging on demand è che causa molti page fault dopo alcuni secondi di esecuzione
-
-18) Quale dei seguenti requisiti deve soddisfare un meccanismo che offra la mutua esclusione?
-v Non deve essere fatta alcuna assunzione sulla velocità di esecuzione dei processi coinvolti
-> Se un processo fa richiesta di entrare nella sezione critica, deve poterlo fare subito
-> Se un processo non fa richiesta di entrare nella sezione critica, deve comunque accordarsi all'esecuzione degli altri processi
-> Si può assumere che un processo che non sia nella sezione critica prima o poi ci entri
-
-19) Quale delle seguenti affermazioni sulla memoria virtuale con paginazione è vera? 
-> Il principio di località afferma che poche pagine saranno sempre sufficienti per eseguire ogni processo senza thrashing
-> Il thrashing si verifica quando l'overhead dovuto alla gestione della paginazione è molto basso
-v Nessuna delle altre opzioni è corretta
-> La paginazione con memoria virtuale funziona bene nonostante il principio di località
-
-20) UNSAFE (sbagliata secondo Gabriele Pelissetto) Quale delle seguenti affermazioni sullo scambio messaggi per la gestione della concorrenza è vera? 
-> Nessuna delle altre opzioni è vera
-> L'implementazione delle primitive per lo scambio messaggi non è garantita atomica dal sistema operativo
-v Se un processo chiama receive, finché il messaggio non viene ricevuto, tutti gli altri processi che proveranno a chiamare receive verranno bloccati
-> Per garantire la mutua esclusione, occorre ricorrere al busy waiting se sia invio che ricezione sono non bloccanti
-
-21) Quali delle seguenti affermazioni sui file system è vera?
-> I dati possono essere ricavati dai metadati
-> I metadati possono essere ricavati dai dati
-v I file system, che adottano il metodo journaling, mantengono un log per le operazioni di sola scrittura da effettuare, realizzandole in seguito
-> Un volume coincide sempre con un disco, quindi se un computer ha 2 dischi avrà 2 volumi
-
-22) (UNSAFE secondo Gabriele Pelissetto vd. gruppo 5 di slide, slide 11) Quale delle seguenti affermazioni sui dispositivi di I/O è vera?
-v Nessuna delle altre opzioni è corretta
-> Il data rate confronta le velocità di 2 diversi dispositivi di I/O
-> Ciascun dispositivo di I/O può essere usato solo da un ben determinato tipo di applicazioni
-> Tutti i dispositivi di I/O scambiano informazioni con la CPU in blocchi, per motivi di efficienza
-
-23) Quale delle seguenti affermazioni sui metodi di gestione dello spazio libero su disco è vera?
-v Se viene usata la lista di blocchi liberi, c'è un overhead di spazio, contrariamente alla concatenazione di blocchi liberi
-> Nessuna delle altre opzioni è vera
-> Se ci sono blocchi da 1kB, e il disco contiene 1TB, l'occupazione dovuta alla lista di blocchi liberi è dell'1%
-> Se viene usata la lista di blocchi liberi, una parte viene memorizzata su disco ed una parte in memoria principale
-
-24) UNSAFE Quale delle seguenti azioni va effettuata sia per un process switch che per un mode switch, assumendo di essere in un SO nel quale le funzioni di sistema sono eseguite all'interno dei processi utente?
-v Salvataggio del contesto del programma
-> Aggiornamento delle strutture dati per la gestione della memoria
-> Spostamento del process control block nella coda appropriata (ready, blocked, ready/suspend)
-> Scelta di un altro processo da eseguire
-
-25) Quale delle seguenti affermazioni è vera?
-> Nessuna delle altre opzioni è corretta
-> Nell'algoritmo di sostituzione basato su frequenza a 2 segmenti della page cache, un blocco passa da un segmento ad un altro esclusivamente per scorrimento
-> L'algoritmo di LFU della page cache ha buone performance quando un settore viene acceduto molto spesso in poco tempo, per poi non essere più usato
-v L'algoritmo di sostituzione basato su frequenza a 2 segmenti della page cache può non avere buone performance quando un settore viene acceduto spesso, ma tra il primo accesso e quelli successivi ci sono N accessi ad altri settori, diversi tra loro, con N pari alla dimensione del segmento nuovo
-
-26) Quale delle seguenti affermazioni sul kernel di un sistema operativo è vera?
-> È responsabile dell'accensione del computer 
-> Viene swappato dal disco alla memoria principale ad ogni context switch 
-v È responsabile, tra le altre cose, della gestione dei processori
-> Nessuna delle altre opzioni è corretta
-
-27) Quale delle seguenti affermazioni sul controllo di accesso è vera?
-> Nel controllo di accesso basato su ruoli, ad ogni ruolo è assegnato un utente
-> Nessuna delle altre opzioni è vera
-> Nel controllo di accesso basato su ruoli, prima di stabilire se un'operazione è lecita, è necessario consultare una tabella soggetti-ruoli-oggetti
-v Nel controllo di accesso discrezionale, prima di stabilire se un'operazione è lecita, è necessario consultare una tabella soggetti-oggetti
-
-28) Assumendo un sistema monoprocessore, quale delle seguenti affermazioni sulla preemption è vera?
-> Se uno scheduler è non-preemptive, permette sempre ai suoi processi di essere eseguiti sul processore, senza interruzioni, fino al loro completamento
-v Se uno scheduler è non-preemptive, è possibile che un processo monopolizzi il processore, anche in presenza di altri processi ready
-> Se uno scheduler è preemptive, non è possibile che un processo monopolizzi il processore, anche in presenza di altri processi ready
-> Per avere un trattamento equo sui processi, è sufficiente usare uno scheduler preemptive
-
-29)  Assumendo un sistema monoprocessore, quale delle seguenti affermazioni sugli algoritmi di scheduling è vera?
-> Con lo scheduler Shortest Process Next, i processi con una grande immagine su RAM potrebbero soffrire di starvation
-v Lo scheduler round-robin virtuale migliora il round-robin classico, facendo sì che i processi I/O-bound non vengano sfavoriti
-> Lo scheduler First Come First Served "degenera" nello scheduler round-robin se il quanto di tempo è troppo lungo
-> Nessuna delle altre opzioni è vera
-
-30) Quale delle seguenti affermazioni sugli indirizzi di memoria principale è vera?
-> Un indirizzo fisico fa sempre riferimento alla memoria secondaria
-> Per rispettare il requisito di rilocazione, occorre trasformare indirizzi fisici in logici
-v Gli indirizzi relativi sono usati nella paginazione
-> Nessuna delle altre opzioni è corretta
-
-31) Quale delle seguenti affermazioni sui termini tipici della concorrenza è falsa?
-v Una sezione critica è una porzione di memoria che contiene almeno una variabile condivisa tra più processi
-> Una operazione atomica è una sequenza di istruzioni macchina tale che, se un processo la esegue, allora arriverà a termine senza interruzioni da altri processi
-> Il requisito di mutua esclusione prevede che un solo processo possa eseguire un certo segmento di codice o accedere ad una determinata risorsa
-> Una race condition è una violazione della mutua esclusione || È possibile che 2 distinti processi chiamino la stessa funzione atomica
-
-32) Quale dei seguenti elementi fa parte del process control block?
-v Nessuna delle altre opzioni contiene elementi del process control block
-> Le informazioni sul contesto del processo, aggiornate ad ogni istruzione eseguita
-> L'intera immagine del processo in memoria
-> La tabella delle pagine di secondo livello
-
-33) Quale delle seguenti informazioni non è presente in una tipica entry di una directory di un file system?
-v Il gruppo cui appartiene l'utente che ha creato il file
-> La data di creazione del file
-> Autorizzazioni per l'accesso al file
-> Dimensione del file
-
-34) Quale delle seguenti affermazioni sugli algoritmi di scheduling per i dischi è vera?
-> L'algoritmo random ha la stessa funzione dell'algoritmo ottimo dei rimpiazzamenti di pagina: ha delle prestazioni ottime non raggiungibili dagli altri algoritmi
-> Nessuna delle altre opzioni è corretta
-v L'algoritmo C-SCAN deriva da SCAN, ed è stato sviluppato per evitare di favorire le richieste di tracce ai bordi del disco
-> Per valutare le prestazioni dell'algoritmo con priorità è necessario fornire il ruolo dell'utente
-
-35) Quale delle seguenti affermazioni sugli algoritmi di scheduling per i dischi è vera?
-> Nessuna delle altre opzioni è corretta
-v L'algoritmo C-SCAN deriva da SCAN, ed è stato sviluppato per evitare di favorire le richieste di tracce ai bordi del disco
-> Per valutare le prestazioni dell'algoritmo con priorità è sufficiente fornire il ruolo degli utenti dei processi che effettuano le richieste
-> L'algoritmo random ha la stessa funzione dell'algoritmo ottimo dei rimpiazzamenti di pagina: ha delle prestazioni ottime non raggiungibili dagli altri algoritmi
-
-36) Quale delle seguenti affermazioni sul metodo di allocazione contigua dei file è vera? 
-> È possibile che ci sia frammentazione interna
-v La compattazione permette di memorizzare file che altrimenti non potrebbero esserlo (pur essendo la loro dimensione minore di quella dello spazio libero)
-> Non è necessaria la preallocazione
-> La tabella di allocazione dei file necessita di memorizzare, per ogni file, il solo blocco di partenza
-
-37) Quale delle seguenti affermazioni sulla paginazione della memoria è vera? 
-v Frame e pagine devono avere la stessa dimensione
-> Tutte le pagine di un processo dovranno essere, prima o poi, posizionate in un frame
-> Nessuna delle altre opzioni è corretta
-> Soffre del problema della frammentazione interna, e quindi necessita compattazione
-
-38) Quale delle seguenti affermazioni sul controllo di accesso è vera? 
-> Nel controllo di accesso basato su ruoli, ad ogni ruolo è assegnato un utente
-> Nel controllo di accesso basato su ruoli, prima di stabilire se un'operazione è lecita, è necessario consultare una tabella soggetti-ruoli-oggetti
-v Nel controllo di accesso discrezionale, prima di stabilire se un'operazione è lecita, è necessario consultare una tabella soggetti-oggetti
-> Nessuna delle altre opzioni è vera
-
-39) Quale delle seguenti affermazioni è falsa? 
-> Nel caso delle risorse riusabili, in un grafo dell'allocazione delle risorse ci possono essere più archi tra lo stesso nodo-processo e lo stesso nodo-risorsa
-> Nel caso delle risorse riusabili, in un grafo dell'allocazione delle risorse ci possono essere archi sia da nodi-processi a nodi-risorse che viceversa
-v Un grafo dell'allocazione delle risorse è un grafo diretto aciclico
-> In un grafo dell'allocazione delle risorse, all'interno di un nodo rappresentante una risorsa, c'è un pallino per ogni istanza di quella risorsa
-
-40) Quali delle seguenti affermazioni è vera? 
-> La confidenzialità di un sistema operativo consiste nel fatto che la shell del sistema operativo deve essere intuitiva e dare del tu agli utenti
-v La disponibilità (availability) di un sistema operativo consiste nel fatto che il sistema operativo deve essere sempre pronto a rispondere alle richieste di un utente
-> La disponibilità (availability) di un sistema operativo consiste nel fatto che devono esistere delle repository online che permettano sia di installare che di aggiornare il sistema operativo
-> La confidenzialità di un sistema operativo consiste nel fatto che il sistema operativo deve essere sempre pronto a rispondere alle richieste di un utente
-
-41) Quale delle seguenti affermazioni sulla memoria virtuale con paginazione è vera? 
-v Il difetto principale del prepaging è che potrebbe portare in memoria pagine cui poi non si fa riferimento
-> Nessuna delle altre opzioni è corretta
-> Il difetto principale del paging on demand è che, dopo una prima fase di assestamento, causa molti page fault
-> Placement policy e replacement policy sono sinonimi ed indicano lo stesso insieme di metodologie
-
-42) Quale delle seguenti affermazioni sui dispositivi di memoria di massa è vera? 
-v Nessuna delle altre opzioni è corretta
-> Un settore di un disco magnetico a testina mobile è l'area di una corona circolare del disco stesso
-> Una traccia di un disco magnetico a testina mobile è l'area compresa da 2 raggi del disco stesso
-> Per selezionare un settore su una traccia di un disco magnetico a testina mobile, è sufficiente posizionare la testina sulla giusta traccia
-
-44) Quale delle seguenti affermazioni sui semafori per la gestione della concorrenza è falsa? 
-> Semafori generali e semafori binari hanno lo stesso potere computazionale (ovvero, permettono di risolvere gli stessi problemi)
-> Le primitive sui semafori sono in grado di mettere un processo in blocked, senza usare, a tal proposito, il busy-waiting
-v Per implementare le primitive sui semafori, servono un contatore ed una coda, che saranno condivisi da tutti i semafori usati
-> L'implementazione delle primitive sui semafori è garantita atomica dal sistema operativo
-
-45) Quale delle seguenti affermazioni sugli algoritmi di scheduling per i dischi è falsa? 
-> Nell'algoritmo F-SCAN, immediatamente prima che vengano scambiati i contenuti delle code F ed R, la coda F è vuota, mentre la coda R contiene le richieste arrivate mentre si servivano le richieste dentro F
-> L'algoritmo Minimum Service Time può portare alla starvation di un processo, che non verrà quindi mai selezionato, se la richiesta era bloccante, per andare in esecuzione sul processore
-v L'algoritmo LIFO è il più equo nei confronti dei processi che effettuano le richieste al disco
-> Gli algoritmi Minimum Service Time, SCAN, C-SCAN, N-steps-SCAN ed F-SCAN non sono ottimizzati per essere usati su dischi con testine multiple selezionabili elettronicamente
-
-46) Quale delle seguenti affermazioni sui meccanismi per la gestione della concorrenza è vera? 
-v Senza usare né semafori, né scambio messaggi, né istruzioni macchina atomiche, è possibile scrivere processi che non soffrano di starvation per garantire la mutua esclusione tra 2 processi
-> Disabilitando gli interrupt, è possibile scrivere processi che non soffrano di starvation
-> Usando i semafori di qualsiasi tipo, è possibile scrivere processi che non soffrano di starvation
-> Usando le istruzioni macchina exchange e compare_and_swap, è possibile scrivere processi che non soffrano di starvation
-
-47) Assumendo un sistema monoprocessore, quale delle seguenti affermazioni sul long-term scheduler è falsa? 
-> Decide quali processi, tra quelli appena creati, possono essere ammessi in memoria principale per l'esecuzione
-> Avendo le necessarie informazioni, una tipica strategia è mantenere una giusta proporzione, stabilita a priori, tra processi I/O-bound e CPU-bound
-v Viene chiamato in causa esclusivamente quando viene creato un nuovo processo
-> Avendo le necessarie informazioni, una tipica strategia è ammettere in memoria principale i processi che richiedono dispositivi di I/O diversi da quelli richiesti dai processi già attivi
-
-48) Quale delle seguenti affermazioni sui metodi di gestione dello spazio libero su disco è vera? 
-> Se ci sono blocchi da 1kB, e il disco contiene 1TB, l'occupazione dovuta alla lista di blocchi liberi è dell'1%
-> Se viene usata la lista di blocchi liberi, tale lista viene interamente mantenuta in memoria principale
-> Nessuna delle altre opzioni è vera
-v Se viene usata la lista di blocchi liberi, c'è un overhead di spazio, contrariamente alla concatenazione di blocchi liberi
-
-49) Quale delle seguenti affermazioni sulle directory di un file system è vera?
-> È sempre necessario identificare un file di un file system fornendone il path relativo alla directory corrente
-> È sempre possibile dare lo stesso nome a file diversi
-v Nessuna delle altre opzioni è vera
-> È sempre necessario identificare un file di un file system fornendone il path assoluto
-
-50) Quale delle seguenti affermazioni sulla memoria cache è vera? 
-> La memoria cache è direttamente indirizzabile in assembler
-> Nessuna delle altre opzioni è corretta
-v È possibile che, in un dato istante, la cache e la memoria RAM non siano coerenti tra loro
-> L'algoritmo di rimpiazzamento per la cache stabilisce quale blocco di RAM deve essere sostituito da un blocco di cache
-
-51) Quale delle seguenti affermazioni sui problemi dei produttori/consumatori e dei lettori/scrittori, nelle accezioni viste a lezione, è vera? 
-v Per il problema dei produttori/consumatori, non deve essere mai possibile che più consumatori accedano contemporaneamente al buffer, mentre nel problema dei lettori/scrittori deve sempre possibile che più lettori, in assenza di scrittori, accedano all'area di memoria
-> Per il problema dei produttori/consumatori, non deve essere mai possibile che più produttori accedano contemporaneamente al buffer, mentre nel problema dei lettori/scrittori deve essere sempre possibile che più scrittori (in assenza di lettori) accedano all'area di memoria
-> Nessuna delle altre opzioni è corretta
-> Per il problema dei produttori/consumatori, deve essere sempre possibile che più consumatori accedano contemporaneamente al buffer, mentre nel problema dei lettori/scrittori non deve essere mai possibile che più scrittori accedano all'area di memoria
-
-52) Quale delle seguenti affermazioni, riguardanti il joint progress diagram di 2 processi, è vera? 
-> Può essere usato per determinare quando uno dei due processi sperimenta un page fault
-> Può essere usato per visualizzare le possibilità di deadlock, ma solo se i processi richiedono al massimo 2 risorse
-v Nessuna delle altre opzioni è vera
-> Può essere usato per determinare quando uno dei due processi manda un segnale all'altro
-
-53) Quale delle seguenti affermazioni sui (vecchi) metodi per il partizionamento della memoria è vera? 
-> Con il partizionamento fisso, le partizioni devono avere tutte la stessa dimensione
-> Con il buddy system, ogni indirizzo di memoria può ricadere in 2 porzioni
-> Con il partizionamento fisso, ci possono essere al massimo N processi attivi (ovvero, accettati per l'esecuzione), dove N è il numero di partizioni
-v Con il partizionamento dinamico, si manifesta il problema della frammentazione esterna
-
-54) Assumendo un sistema monoprocessore, quale delle seguenti affermazioni sulla preemption è vera? 
-> Se uno scheduler è preemptive e vi è più di 1 processo ready, non è possibile che un processo monopolizzi il processore
-> Per avere un trattamento equo sui processi, è sufficiente usare uno scheduler preemptive
-> Se uno scheduler è non-preemptive, permette sempre ai suoi processi di essere eseguiti senza interruzioni sul processore fino al loro completamento
-v Se uno scheduler è non-preemptive, è possibile che un processo monopolizzi il processore, anche in presenza di altri processi ready
-
-55) Nel modello dei processi a 5 stati, quali delle seguenti transizioni non è possibile? 
-v Blocked ==> Running
-> Running ==> Ready
-> Blocked ==> Exit
-> Blocked ==> Ready
-
-56) Quale delle seguenti affermazioni sul metodo di allocazione indicizzata dei file è vera? 
-> Il consolidamento permette sempre di ridurre la dimensione dell'indice
-v Se usato con porzioni di dimensione variabile, i blocchi indice devono contenere anche la lunghezza di ogni porzione
-> Nessuna delle altre opzioni è vera
-> Non c'è modo per il sistema operativo di distinguere tra blocchi con dati e blocchi con indici
-
-57) Quale delle seguenti affermazioni sul requisito di rilocazione nella gestione della memoria è vera? 
-v Nessuna delle altre opzioni è corretta
-> Se viene realizzato tramite sostituzione degli indirizzi nel programma sorgente (al momento della creazione del processo), allora il relativo processo dovrà cominciare sempre allo stesso indirizzo; tale indirizzo dovrà essere uguale per tutti i processi
-> Se viene realizzato tramite sostituzione degli indirizzi nel programma sorgente (al momento della creazione del processo), allora il relativo processo potrà trovarsi in diverse posizioni della memoria in diversi momenti del sua esecuzione
-> Se viene realizzato tramite sostituzione degli indirizzi nel programma sorgente (al momento della creazione del processo), serve hardware speciale
-
-58) Assumendo un sistema monoprocessore, quale delle seguenti affermazioni sulla preemption è vera?
-> Se uno scheduler è non-preemptive, permette sempre ai suoi processi di essere eseguiti sul processore, senza interruzioni, fino al loro completamento
-v Se uno scheduler è non-preemptive, è possibile che un processo monopolizzi il processore, anche in presenza di altri processi ready
-> Se uno scheduler è preemptive, non è possibile che un processo monopolizzi il processore, anche in presenza di altri processi ready
-> Per avere un trattamento equo sui processi, è sufficiente usare uno scheduler preemptive
-
-59) Quale dei seguenti requisiti deve soddisfare un meccanismo che offra la mutua esclusione? 
-v Non deve essere fatta alcuna assunzione sulla velocità di esecuzione dei processi coinvolti
-> Se un processo non fa richiesta di entrare nella sezione critica, deve comunque sincronizzarsi all'esecuzione degli altri processi
-> Se un processo è nella sezione critica, occorre che rilasci subito la sezione critica stessa
-> Se un processo fa richiesta di entrare nella sezione critica, deve poter entrare subito nella sezione critica stessa
-
-60) Assumendo un sistema monoprocessore, quale delle seguenti affermazioni sul dispatcher è falsa? 
-> Il resource balancing è un criterio di sistema non prestazionale
-> Il rispetto delle deadline è un criterio utente prestazionale
-> Il throughput è un criterio di sistema prestazionale
-v La predictability è un criterio utente prestazionale
-
-61) Quale delle seguenti affermazioni sugli interrupt (o eccezioni) è falsa? 
-> Devono essere gestiti da opportuno software di sistema
-v Una volta gestito l'interrupt o l'eccezione, quando (e se) si torna ad eseguire il processo interrotto, l'esecuzione ripartirà sempre dall'istruzione successiva a quella dove è stato ricevuto l'interrupt o l'eccezione
-> Normalmente, non vengono gestiti dal programmatore dell'applicazione che li ha causati
-> Possono essere creati direttamente dai dispositivi di I/O
-
-62) Quale delle seguenti affermazioni sulle istruzioni macchina speciali per la gestione della concorrenza è vera? 
-> Sono basate sul busy-waiting, ovvero sul fatto che un processo si mette autonomamente in stato blocked
-v Nessuna delle altre opzioni è vera
-> Non riescono ad evitare il manifestarsi del deadlock, a meno che non sia presente un sistema a priorità
-> Come per la disabilitazione delle interruzioni, non funzionano per architetture con più processori o core
-
-63) Quale delle seguenti affermazioni sui processi è vera? 
-> Nessuna delle altre opzioni è vera
-v Per la terminazione normale di un processo, è tipicamente prevista un'apposita system call, come ad esempio exit
-> Un processo può morire quando si effettua il process spawning
-> Un processo può essere creato dal modulo di gestione della memoria per gestire la traduzione da indirizzi virtuali a fisici
-
-64) (UNSAFE le decisioni dello scheduler possono influenzare la risposta) Quale delle seguenti affermazioni sui meccanismi software per la gestione della concorrenza è vera? 
-> Sia l'algoritmo di Dekker che quello di Peterson possono mettere in blocked uno dei 2 processi, quando ciò si rivela necessario
-> Sia l'algoritmo di Dekker che quello di Peterson non funzionano se l'hardware sottostante riordina gli accessi in memoria
-> Nell'algoritmo di Peterson, se la variabile turn è inizializzata ad 1, allora il processo 1 sarà sicuramente il primo ad entrare nella sezione critica nella prima iterazione
-v Nell'algoritmo di Dekker, se la variabile turn è inizializzata ad 1, allora il processo 1 sarà sicuramente il primo ad entrare nella sezione critica nella prima iterazione
-
-65) Quale delle seguenti affermazioni sugli i-node di Unix è falsa? 
-> Ogni directory è identificata da un i-node
-v Per modificare una directory, un utente deve aprire il file speciale corrispondente e poi modificarlo opportunamente
-> Ogni directory è un file speciale, organizzato come una lista di entry, ciascuna delle quali contiene il nome di un file ed il relativo i-node number
-> Ogni directory può contenere molti i-node
-
-66) Quale delle seguenti affermazioni è falsa? 
-v Nel caso di un sistema operativo a kernel separato, la gestione dei process switch è a sua volta un processo
-> Nel caso di un sistema operativo in cui le funzioni del sistema operativo vengono eseguite all'interno dei processi utente, non c'è bisogno di un process switch per eseguire una funzionalità del sistema operativo
-> Nel caso di un sistema operativo in cui le funzioni del sistema operativo vengono eseguite all'interno dei processi utente, se un processo effettua una syscall e poi può continuare ad essere eseguito, non avviene alcun process switch
-> Nel caso di un sistema operativo in cui le funzioni del sistema operativo vengono eseguite come processi separati, c'è sempre bisogno di un process switch per eseguire una funzionalità del sistema operativo
-
-67) (corretta secondo @loryspat e @notherealmarco, da controllare) Quale delle seguenti affermazioni sulla paginazione della memoria è vera? 
-> La differenza tra paginazione semplice e paginazione con memoria virtuale è che nella seconda viene richiesto che tutte le pagine di un processo siano in memoria principale, affinché il processo stesso possa essere eseguito
-> Con la paginazione con memoria virtuale, una sola pagina di ogni processo ready o in esecuzione è inizialmente caricata in memoria principale
-v La differenza tra paginazione semplice e paginazione con memoria virtuale è che nella prima viene richiesto che tutte le pagine di un processo siano in memoria principale, affinché il processo stesso possa essere eseguito
-> Nessuna delle altre opzioni è vera
-
-
-68) Quale delle seguenti affermazioni sul metodo di allocazione concatenata dei file è vera? 
-> Il consolidamento permette di memorizzare file che altrimenti non potrebbero esserlo (pur essendo la loro dimensione minore di quella dello spazio libero)
-> La tabella di allocazione dei file deve contenere l'intera catena
-v Nessuna delle altre opzioni è vera
-> Viene usato con porzioni di dimensione variabile, ma piccola
-
-69) Quale delle seguenti affermazioni sulla memoria virtuale con paginazione è vera? 
-> Nel caso di una tabella delle pagine a 2 livelli, viene tipicamente richiesto che tutte le tabelle delle pagine di secondo livello entrino in una pagina
-> Il numero di bit di un indirizzo virtuale è necessariamente diverso a seconda che si usi una tabella delle pagine ad 1 o a 2 livelli
-v Il numero di bit di una entry di una tabella delle pagine di ultimo livello è uguale al numero di bit di controllo più il logaritmo (arrotondato all'intero superiore) del massimo numero di frame in memoria principale
-> Nessuna delle altre opzioni è corretta
-
-70) (corretta secondo Simone Sestito e @loryspat) Quale delle seguenti affermazioni sul deadlock è falsa? 
-> Affinchè ci sia un deadlock, sono necessarie le condizioni di attesa circolare, hold-and-wait, mutua esclusione e no preemption
-v Per prevenire il deadlock, è necessario cercare di impedire almeno una delle 3 condizioni di mutua esclusione, hold-and-wait e no preemption
-> Affinchè il deadlock sia possibile, sono necessarie le condizioni di mutua esclusione, hold-and-wait e no preemption
-> Per prevenire il deadlock impedendo l'hold-and-wait, si può in alcuni casi imporre ai processi di richiedere tutte le risorse fin dall'inizio
-
-71) Quale delle seguenti affermazioni è vera? 
-> La modalità di un processo utente è sempre la modalità di sistema
-> La modalità di un processo utente è inizialmente la modalità utente; può diventare modalità sistema nel momento in cui va in esecuzione il dispatcher
-v Nessuna delle altre opzioni è vera
-> La modalità di un processo utente è sempre la modalità utente
-
-72) Quale delle seguenti affermazioni sulla memoria virtuale con paginazione è vera? 
-v Nessuna delle altre opzioni è corretta
-> Per ogni processo, il resident set contiene lo stesso numero di pagine
-> Un tipico algoritmo per il replacement scope è quello dell'orologio
-> La gestione del resident set tramite politica dinamica mira ad ampliare il numero di pagine di un processo durante l'esecuzione del processo stesso
-
-74) Quale delle seguenti affermazioni sulla concorrenza tra processi o thread è vera?
-v L'istruzione exchange non può ricevere costanti in input su nessun suo argomento, mentre per l'istruzione compare_and_swap questo non vale
-> Le istruzioni speciali exchange e compare_and_swap sono garantite atomiche dal sistema operativo
-> Per realizzare opportunamente l'istruzione compare_and_swap è sufficiente disabilitare le interruzioni
-> Nessuna delle altre opzioni è vera
-
-75)  Assumendo un sistema monoprocessore, quale delle seguenti affermazioni sul dispatcher è falsa?
-> Il response time è un criterio utente prestazionale
-> Il turnaround time (normalizzato o no) è un criterio utente prestazionale
-v Il throughput è un criterio di sistema non prestazionale
-> La fairness è un criterio di sistema non prestazionale
-
-76) Quale delle seguenti affermazioni sul file system FAT è vera?
-> Usa il metodo di allocazione contiguo
-> Ogni cluster del disco contiene sia dati del disco che l'indirizzo del prossimo cluster (o l'indicazione che si tratta dell'ultimo cluster)
-> La tabella di allocazione dei file contiene tante righe quanti sono i file memorizzati sul disco, più una riga speciale per i blocchi liberi
-v Nessuna delle altre opzioni è vera
-
-77) UNSAFE Quale delle seguenti affermazioni sulla memoria virtuale con paginazione è falsa?
-> Il translation lookaside buffer, su alcuni processori, contiene un campo per il PID dei processi
-> Il translation lookaside buffer funziona correttamente solo se tutti i frame validi contenuti al suo interno fanno riferimento a pagine effettivamente in RAM, e non swappate su disco
-v Il mapping associativo permette al translation lookaside buffer di trovare una data pagina semplicemente sommando il numero della pagina con l'indirizzo di partenza del translation lookaside buffer stesso
-> Quando un indirizzo viene trovato nel translation lookaside buffer, non è necessario consultare la normale tabella delle pagine
-
-78) Quale dei seguenti elementi non è una delle parti che definiscono un processo?
-> Il contatore di programma
-> La priorità
-> I dati contenuti nella porzione di memoria a lui dedicata
-v Informazioni sullo stato delle risorse
-
-
-79) UNSAFE Quale delle seguenti affermazioni, riguardanti la classificazione delle risorse di un sistema operativo e la loro relazione con il deadlock, è vera?
-> Nel caso delle risorse consumabili, se c'è un deadlock allora è stata richiesta almeno una risorsa già detenuta da un altro processo
-v Nel caso delle risorse consumabili, se c'è un deadlock allora c'è una successione circolare di processi, ciascuno dei quali richiede una risorsa al processo successivo, che però la deve ancora creare
-> Nel caso delle risorse riusabili, se c'è un deadlock allora è stata richiesta almeno una risorsa non ancora creata
-> Nel caso delle risorse riusabili, se c'è un deadlock allora c'è una successione circolare di processi, ciascuno dei quali richiede una risorsa al processo successivo, che però la deve ancora creare
-
-80) UNSAFE Si supponga che ci siano N processi attivi, giostrati da uno scheduler round-robin su un sistema monoprocessore. Quale delle seguenti affermazioni è vera?
-> Dal punto di vista del processore, ogni processo esegue sempre le proprie istruzioni senza interruzioni
-v Per realizzare correttamente un process switch, il SO avrà necessità di usare le informazioni sul contesto contenute nel process control block
-> Dal punto di vista di ogni processo, l'esecuzione avviene in interleaving con gli altri processi
-> Nessuna delle altre opzioni è vera
-
-81) Quale delle seguenti affermazioni sulla traduzione di un indirizzo virtuale in fisico, in un sistema con memoria virtuale con paginazione (avente tabella delle pagine ad 1 livello), è falsa?
-v L'hardware deve anche cercare il numero di pagina nelle entries della tabella delle pagine del processo in esecuzione. 
-> L'hardware deve anche estrarre dall'indirizzo virtuale il numero di pagina virtuale; tale operazione è equivalente ad una divisione intera
-> L'hardware deve anche usare il numero di pagina per accedere alla tabella delle pagine del processo in esecuzione. A tal proposito, deve conoscere l'inizio di tale tabella, che viene definito dal software (sistema operativo). Tale indirizzo può cambiare durante l'esecuzione del processo: sta al sistema operativo mantenerlo aggiornato
-> L'hardware deve anche usare il numero di frame ottenuto dalla tabella delle pagine per comporre, insieme con l'offset originale, l'indirizzo fisico. Tale operazione è equivalente ad uno shift seguito da una somma
-
-82) Quale delle seguenti operazioni non è tipicamente effettuata su un file?
-> Apertura
-v Connessione
-> Posizionamento (seek)
-> Lock/Unlock
-
-83) Quale delle seguenti affermazioni è falsa?
-v Diversi thread di uno stesso processo condividono lo stesso thread identifier
-> Tra le funzioni di sistema per i thread, è tipicamente prevista una funzione per bloccare e sbloccare esplicitamente i thread stessi
-> Diversi thread di uno stesso processo condividono lo stesso process identifier
-> Diversi thread di uno stesso processo condividono i file aperti
-
-84) Quale delle seguenti affermazioni sulla page cache è falsa?
-v Nell'algoritmo di sostituzione basato su frequenza a 3 segmenti della page cache, i contatori vengono sempre incrementati, tranne quando sono nel segmento vecchio
-> Nell'algoritmo di sostituzione basato su frequenza a 3 segmenti della page cache, i settori che possono essere sostituiti sono solo quelli del segmento vecchio
-> Nell'algoritmo di sostituzione basato su frequenza a 3 segmenti della page cache, l'unico segmento in cui i contatori non vengono incrementati e i settori non possono essere sostituti è quello nuovo
-> L'algoritmo di sostituzione basato su frequenza a 3 segmenti della page cache può avere buone performance anche quando dei settori vengono acceduti spesso, ma tra il primo accesso e quelli successivi ci sono molti altri accessi ad altri settori
-
-85) Quali delle seguenti affermazioni sulla efficienza di un sistema operativo è falsa?
-> Deve minimizzare il tempo di risposta, tenendo presenti eventuali priorità
-> Deve servire il maggior numero di utenti possibile, tenendo presenti eventuali livelli di accesso
-v Deve dare accesso alle risorse in modo equo ed egualitario tra tutti i processi
-> Deve massimizzare l'uso delle risorse per unità di tempo, tenendo presenti eventuali priorità
-
-88) Quale delle seguenti affermazioni sui metodi di gestione del deadlock è vera?
-> Nessuna delle altre opzioni è vera
-> L'unico metodo, che richiede di conoscere in anticipo il massimo numero di risorse che un processo dovrà chiedere, è quello per rilevare il deadlock
-> Il metodo più permissivo nei confronti delle richieste di risorse è quello che consiste nel prevenire il deadlock
-v L'unico metodo che non prevede mai la preemption delle risorse è quello che evita il deadlock
-
-89) Assumendo un sistema monoprocessore, quale delle seguenti affermazioni è falsa?
-> Lo scheduler ha, tra i suoi obiettivi, quello dell'equità tra i processi, a meno che non siano definite delle priorità
-> Lo scheduler va scritto in modo che il suo overhead sia basso
-v Lo scheduler ha, tra i suoi obiettivi, quello di evitare il deadlock
-> Lo scheduler ha, tra i suoi obiettivi, quello di massimizzare il volume di lavoro dei processi nel tempo
-
-90) Quale delle seguenti affermazioni sugli scheduler per architetture multiprocessore è vera?
-> Con l'assegnamento statico, si dà un processore a caso tra quelli liberi ai processi che mantengono un uso della RAM pressoché costante
-> Assegnando i processi del sistema operativo con l'assegnamento dinamico, si rischia di creare un bottleneck su un solo processore
-> Uno svantaggio dell'assegnamento statico è il suo overhead maggiore rispetto a quello dinamico
-v Nessuna delle altre opzioni è vera
-
-91) Quale delle seguenti affermazioni sull'algoritmo del banchiere per evitare il deadlock visto a lezione è falsa?
-v La matrice C - A può contenere elementi negativi, ma le matrici C ed A contengono solo elementi non negativi
-> Richiede in input, per ogni processo p e per ogni risorsa r, il numero massimo di istanze di r che p chiederà nel corso della sua esecuzione
-> All'inizio e alla fine di ogni invocazione dell'algoritmo, Vi = Ri - ∑j = 1, ..., nAi, j
-> Se si procede da uno stato ad un altro, necessariamente è stata fatta almeno una richiesta ad almeno una risorsa da parte di almeno un processo
-
-92) Assumendo un sistema monoprocessore, quale delle seguenti affermazioni sul dispatcher è falsa?
-> Il throughput è definito come il numero di processi completati per unità di tempo
-v Il turnaround time è definito, per un dato processo, come il tempo che intercorre tra la sua prima esecuzione sul processore e il suo completamento
-> Un dispatcher con buone prestazioni sul response time deve tipicamente sia minimizzare il valore medio di sistema del response time, sia massimizzare il numero di utenti con un basso valore per il response time
-> Il processor utilization è definito come il rapporto tra il tempo in cui il processore viene usato ed il tempo totale del sistema
-
-93) Quale delle seguenti affermazioni sugli i-node di Unix è vera?
-> Per ogni file-system su disco organizzato con i-node, tutti gli i-node di tutti i file su tale file-system sono memorizzati esclusivamente su disco
-v I puntatori a tripla indirezione di un i-node vengono usati solo se la dimensione del file lo richiede
-> Nessuna delle altre opzioni è vera
-> Ad ogni file effettivamente memorizzato su disco può essere associato un solo numero di i-node
-
-94) UNSAFE Quale delle seguenti affermazioni sul modello dei processi a 7 stati è vera?
-v Nessuna delle altre opzioni è vera
-> Gli stati Ready, New e Blocked del modello a 5 stati vengono sdoppiati, e ne viene creata una versione Suspend
-> Un processo è Suspend quando scade il timeout del dispatcher
-> È possibile la transizione Ready/Suspend ==> Blocked/Suspend
-
-95) Quale delle seguenti affermazioni sui dischi magnetici a testina mobile è vera? 
-> Per selezionare un settore su una traccia di un disco magnetico a testina mobile, bisogna prima far ruotare il disco fino ad arrivare alla giusta traccia, e poi posizionare la testina sul giusto settore
-> Una traccia di un disco è l'area compresa tra 2 raggi del disco stesso
-v Il tempo di accesso ad un disco magnetico a testina mobile tiene conto sia del tempo che occorre per posizionare la testina che del tempo che occorre per far ruotare il disco, ma non del tempo che occorre per effettuare effettivamente il trasferimento di dati
-> Nessuna delle altre opzioni è corretta
-
-98) UNSAFE Assumendo un sistema monoprocessore, quale delle seguenti affermazioni sugli algoritmi di scheduling è vera?
-v L'exponential averaging permette di stimare la dimensione dell'immagine di un processo, a partire dalle precedenti immagini di quello stesso processo
-> La funzione di decisione dello scheduler Highest Response Ratio Next considera tanto il tempo di esecuzione stimato quanto il tempo trascorso in attesa
-> L'exponential averaging è una tecnica applicabile dal solo scheduler Short Process Next
-> La funzione di decisione dello scheduler Shortest Remaining Time considera tanto il tempo di esecuzione richiesto quanto il tempo trascorso in attesa
-
-100) Quale delle seguenti affermazioni è vera sulla memoria virtuale con paginazione a segmentazione?
-v Sia la tabella dei segmenti che quella delle pagine di un processo contengono, in ciascuna entry, un bit per indicare se la pagina o il segmento sono stati modificati
-> Un indirizzo virtuale contiene anche un bit per indicare se la pagina corrispondente è o no in memoria principale
-> La tabella delle pagine di un processo contiene una pagina speciale dove è memorizzato il process control block del processo stesso
-> Ogni entry di una tabella delle pagine contiene un numero di pagina ed un offset
-
-99) (risposta corretta secondo @notherealmarco, Simone Sestito e Gabriele Pelissetto, non verificata da nessuna parte) Quale delle seguenti affermazioni sulla memoria virtuale con paginazione è vera?
-v Per avere un overhead accettabile, occorre demandare la traduzione degli indirizzi all'hardware, mentre al software resta da gestire prelievo, posizionamento e sostituzione delle pagine
-> Per avere un overhead accettabile, occorre demandare la traduzione degli indirizzi e la politica di sostituzione delle pagine all'hardware, mentre al software resta da gestire prelievo e posizionamento delle pagine
-> Per avere un overhead accettabile, occorre demandare all'hardware la traduzione degli indirizzi ed il prelievo, il posizionamento e la sostituzione delle pagine
-> Per avere un overhead accettabile, occorre demandare al software anche la traduzione degli indirizzi
-
-96) (risposta corretta secondo @notherealmarco e Gabriele Pelissetto, non verificata da nessuna parte) Riguardo alle differenze tra sistemi batch e sistemi time sharing (degli anni 60/70), quale delle seguenti affermazioni è falsa? 
-v I sistemi time-sharing puntavano a minimizzare l'uso del processore
-> Nei sistemi time-sharing, le direttive al sistema operativo arrivavano dai comandi digitati su terminali
-> Nei sistemi batch, le direttive al sistema operativo arrivavano dai comandi del job control language, che erano non-interattivi
-> I sistemi batch puntavano a massimizzare l'uso del processore
-
-img=https://i.imgur.com/orqyjeh.png
-12) Considerare un insieme di cinque processi P1, P2, P3, P4, P5 con i seguenti tempi di arrivo e tempi di esecuzione in millisecondi: Quale delle seguenti affermazioni è falsa?
-> Non ci sono sufficienti informazioni per determinare come si comporterebbe l'algoritmo di scheduling a feedback classico di Unix
-> Non ci sono sufficienti informazioni per determinare come si comporterebbe l'algoritmo di scheduling Virtual Round-Robin
-> Non ci sono sufficienti informazioni per determinare come si comporterebbe l'algoritmo di scheduling Round-Robin
-v Non ci sono sufficienti informazioni per determinare come si comporterebbe l'algoritmo di scheduling SRT
-
-img=https://i.imgur.com/orqyjeh.png
-13) Considerare un insieme di cinque processi P1, P2, P3, P4, P5 con i seguenti tempi di arrivo e tempi di esecuzione in millisecondi: Assegnare questo insieme di processi ad un processore usando l'algoritmo di scheduling SRT, fino a che non terminano tutti. Quale delle seguenti affermazioni è falsa?
-v Gli unici 2 processi che non sono serviti subito (ovvero, appena arrivati) sono P3 e P5
-> Il tempo medio di attesa è tra 10 ed 11 ms
-> Il processo con il più lungo tempo di attesa è P1
-> Il tempo medio di turnaround è tra 2 e 3 ms
-
-img=https://i.imgur.com/5nWWwyF.png
-101) Si consideri il seguente modo di implementare la mutua esclusione: Quale delle seguenti affermazioni è vera?
-> La soluzione non implementa correttamente la mutua esclusione, ma può essere corretta nel seguente modo: int bolt = 0; void P(int i) { int key; while(true) { do (exchange(key, bolt) == 0) while(key != 0); critical_section(); bolt = 0; key = 1; } } 
-> La soluzione non implementa correttamente la mutua esclusione, in quanto key deve essere una variabile globale
-v La soluzione non implementa correttamente la mutua esclusione, ma può essere corretta nel seguente modo: int bolt = 0; void P(int i) { int key; while(true) { key = 1; do (exchange(key, bolt) == 0) while(key != 0); critical_section(); bolt = 0; } } 
-> La soluzione implementa correttamente la mutua esclusione
-
-103) Quale delle seguenti affermazioni sulla memoria virtuale con paginazione è falsa?
-> Diminuire la dimensione delle pagine ha effetti positivi sul numero di pagine che possono trovarsi in memoria principale
-v Aumentare la dimensione delle pagine ha effetti positivi sulla frammentazione interna
-> Diminuire la dimensione delle pagine ha effetti negativi sulla dimensione della tabella delle pagine
-> Aumentare la dimensione delle pagine ha effetti negativi sulla multiprogrammazione
-
-104) Quale delle seguenti affermazioni sulla concorrenza tra processi o thread è falsa?
-v La disabilitazione delle interruzioni impedisce la creazione di nuove interruzioni
-> Se un processo utente può disabilitare le interruzioni tramite un'istruzione macchina dedicata, allora può far diminuire l'uso utile del processore
-> La disabilitazione delle interruzioni non funziona ai fini della concorrenza (gestione sezioni critiche) su sistemi con più processori o più core
-> L'abuso della disabilitazione delle interruzioni fa diminuire la multiprogrammazione, a parità di numero di processi
-
-105) Quale delle seguenti affermazioni non è vera?
-> il kernel rimane in memoria durante l'intera sessione del computer
-v il kernel è costituito da vari moduli che non possono essere caricati nel sistema operativo in esecuzione
-> il kernel è la prima parte del sistema operativo a essere caricata in memoria durante l'avvio
-> Il kernel è il programma che costituisce il nucleo centrale del sistema operativo.
-
-106) UNSAFE In generale, la CPU puo’ eseguire un'istruzione soltanto quando gli operandi si trovano:
-> In RAM, o in un livello qualsiasi della cache o nella memoria secondaria o nei registri CPU
-> In RAM o in un livello qualsiasi della cache o nei registri CPU
-> Nella cache di livello 1 (L1 cache) o nei registri CPU
-v Nei registri della CPU
-
-107) Il PCB (Process Control Block) e’:
-> Un campo dello stato di un processo che definisce quali operazioni di controllo dei dispositivi a blocchi sono state fatte dal processo
-v Una struttura dati mantenuta dal sistema operativo che contiene tutte le informazioni necessarie all’esecuzione, sospensione e ripresa dell’esecuzione di un processo
-> Una struttura dati mantenuta dal sistema operativo che contiene l’intera immagine di un processo
-> Un’interfaccia di controllo dei processi del sistema operativo
-
-108) Considera un Sistema Operativo con esecuzione all’interno dei processi utente. Quando un processo utente fa una chiamata di sistema, quale delle seguenti affermazioni e’ corretta
-> Il sistema operativo deve effettuare un process switch ed un mode switch per eseguire la funzione richiesta
-> Il sistema operativo deve effettuare soltanto un process switch per eseguire la funzione richiesta
-v Il sistema operativo deve effettuare soltanto un mode switch per eseguire la funzione richiesta
-> Il sistema operativo deve creare un nuovo processo e fare switch ad esso per eseguire la funzione richiesta
-
-109) Quale delle seguenti affermazioni e’ vera:
-> Il dispatcher e’ una componente del medium term scheduler
-> Il dispatcher si occupa di decidere l’ordine di sospensione dei processi
-v Il dispatcher si occupa di scambiare i processi in esecuzione sulla CPU (process switch)
-> Il dispatcher si occupa di scambiare i processi dalla memoria principale alla memoria secondaria
-
-110) In un sistema operativo con I/O buffering, quando c’e’ una scrittura su dispositivo di I/O quale delle seguenti affermazioni e’ vera:
-> Il sistema operativo copia immediatamente il contenuto della scrittura dalla memoria del processo direttamente alla memoria del dispositivo di I/O
-v Il sistema operativo copia immediatamente il contenuto della scrittura dalla memoria utente alla memoria del sistema operativo, e dalla memoria del sistema operativo alla memoria del dispositivo di I/O quando piu’ opportuno
-> Il sistema operativo copia quando piu’ opportuno il contenuto della scrittura dalla memoria del processo direttamente alla memoria del dispositivo di I/O
-> Nessuna delle altre opzioni e’ corretta
-
-111) L’algoritmo di scheduling C-SCAN:
-> Scrivere le richieste su disco in modo tale che il braccio meccanico si muova sempre in una direzione, fino a raggiungere l’ultima traccia, e poi torna indietro scrivendo tutte le richieste fino a raggiungere la prima traccia
-> Puo’ portare a starvation per alcuni processi
-> E’ meno fair (equo) dell’algoritmo SCAN
-v Non favorisce le richieste ai bordi rispetto a SCAN
-
-112) Quale dei seguenti sono requisiti per un File Management System?
-> Ogni utente dev’essere in grado di creare, cancellare, leggere, scrivere e modificare un file
-> Ogni utente deve poter accedere, in modo controllato, ai file di un altro utente
-> Ogni utente deve poter mantenere una copia di backup dei propri file
-v Tutte le opzioni sono requisiti
-
-113) Una sezione critica è un segmento di programma:
-> Che e’ racchiuso tra una coppia di operazioni di semaforo semWait e semSignal
-v In cui si accede a risorse condivise
-> Che evita i deadlock
-> Che deve essere eseguito in un determinato lasso di tempo.
-
-114) Quale dei seguenti NON è vero riguarda il Algoritmo di Dekker per gestire la concorrenza?
-> Garantisce la non-starvation
-> Non richiede nessun supporto dal SO.
-v Richiede supporto dal SO
-> E' deterministico.
-
-115) Quale delle affermazioni è vera riguardo al Translation lookaside buffer per la gestione della memoria?
-> Nel Translation lookaside buffer ci sono tag e chiavi con l'aiuto dei quali viene effettuata la mappatura.
-> Il TLB hit è una condizione in cui la voce desiderata viene trovata nel TLB.
-> Se la voce non viene trovata nel TLB (TLB miss), la CPU deve accedere alla tabella delle pagine nella memoria principale e quindi accedere al frame effettivo nella memoria principale.
-v Tutte le opzioni sono vere.
-
-116) Quale delle seguenti affermazioni sul long-term scheduler e’ vera:
-v Si occupa della decisione di quali processi debbano essere ammessi all’esecuzione nel sistema
-> Si occupa dell’organizzazione di lungo termine dell’ordine di esecuzione dei processi nella CPU
-> Si occupa dell’implementazione della funzione di swapping dei processi alla memoria secondaria
-> Si occupa della transizione dei processi tra gli stati running ed exit
-
-117) Nel modello dei processi a 5 stati, quale affermazione e’ falsa:
-v Un processo puo’ essere spostato allo stato suspended dallo stato blocked e ready
-> Un processo puo’ essere spostato dallo stato running allo stato ready o exit
-> Un processo puo’ essere spostato dallo stato blocked solo allo stato ready
-> Un processo puo’ essere spostato dallo stato ready allo stato running, blocked o exit
-
-118) Riguardo l’efficienza dal punto di vista dell’utilizzo utile della CPU, quale dei seguenti modelli di I/O e’ piu’ efficiente dal punto di vista dell’uso della CPU e perche’?
-> I/O programmato, perche’ consente al programmatore di fare uno scheduling esatto delle operazioni di I/O nei momenti piu’ opportuni
-> I/O basato su DMA (Accesso Diretto alla Memoria), perche’ la CPU deve soltanto occuparsi del trasferimento dei dati
-> I/O basato su interruzioni, perche’ il processore non deve controllare attivamente lo stato del dispositivo di I/O dopo aver effettuato la richiesta
-v I/O basato su DMA (Accesso Diretto alla Memoria), perche’ la CPU deve soltanto occuparsi di inviare la richiesta di I/O e leggere il risultato
-
-119) Dati due processi A e B e due risorse R1 ed R2, si ha sicuramente una situazione di deadlock se:
-v A richiede ed ottiene accesso ad R1, B richiede ed ottiene accesso ad R2. A richiede accesso ad R2, B richiede accesso ad R1
-> A richiede ed ottiene accesso ad R1, B richiede accesso ad R2. A richiede accesso ad R2. B richiede accesso ad R1
-> A richiede ed ottiene accesso ad R2, B richiede accesso ad R1 ed R2. A richiede ed ottiene accesso ad R1
-> B richiede ed ottiene accesso ad R1, A richiede ed ottiene accesso ad R2. B richiede accesso ad R2
-
-120) Quali delle seguenti affermazioni e' vera riguardo la preallocazione rispetto all'allocazione dinamica dello spazio per i file?
-> la preallocazione è più efficiente nell'utilizzo dello spazio su disco
-v nessuna delle opzioni è corretta
-> l'allocazione dinamica rischia di sprecare spazio disco in caso gli utenti/applicazioni sovrastimino la dimensione dei file, mentre questo non è il caso con la preallocazione
-> L'allocazione dinamica impone un overhead di gestione minore per il sistema operativo
-
-121) Quale delle seguenti affermazioni sul file system NTFS è vera?
-v NTFS può, ove possibile, includere direttamente i dati di un file nella master file table
-> NTFS non prevede la possibilità di avere record estesi
-> nessuna delle altre opzioni è vera
-> In NTFS, le informazioni relative alla sequenza di blocchi che contengono il file è interamente contenuta nel record base
-
-122) Quale delle seguenti affermazioni riguardo la rilocazione degli indirizzi di memoria è vera?
-> Nei sistemi con hardware dedicato per la rilocazione, il base register (registro base) viene impostato una sola volta, quando il programma viene caricato in memoria per la prima volta
-> In un sistema con rilocazione a run time, i sistemi di protezione che verificano che un processo non vada ad accedere alla memoria di un'altro processo possono essere eseguiti a tempo di compilazione, prima di eseguire il programma
-> In un sistema a rilocazione con indirizzi logici, non è necessario avere hardware dedicato per effettuare la rilocazione
-v In un sistema a rilocazione con indirizzi assoluti, se si conosce l'indirizzo di memoria dove verrà caricato il programma, il compilatore può inserire direttamente gli indirizzi di memoria corretti nel codice oggetto (programma compilato)
-
-123) Quale delle seguenti affermazioni è vera riguardo il concetto di Thrashing?
-> Il SO impiega la maggior parte del suo tempo a swappare pezzi di processi, anziché ad eseguire istruzioni
-> provoca il deterioramento o il crollo delle prestazioni del computer
-> quasi ogni richiesta di pagine da luogo ad una page fault
-v Tutte le opzioni sono vere
-
-124) Il sistema di partizionamento fisso per la memoria principale:
-> Permette di avere partizioni di lunghezza diversa e di modificarle a runtime
-> Nessuna delle opzioni è vera
-> Consente una efficiente della memoria se ci sono molti processi di piccole dimensioni 
-v Impone un numero massimo di processi che possono essere in memoria principale
-
-125) Quale delle seguenti non è un vantaggio dell’attacco dizionario?
-> Semplice da effettuare
-> Versatilità
-v Velocità di computazione in real time degli hash
-> Disponibilità di molti tool per automatizzazione
-
-126) Nello scheduler a breve ed a lungo termine la distizione principale è:
-> Il tipo di processi che gestiscono
-v La frequenza di esecuzione
-> La lunghezza delle loro code
-> Nessuna delle opzioni è corretta
-
-127) Quale dei seguenti NON è un vantaggio della multiprogrammazione?
-> Riduzione dei tempi di risposta
-> Possibilità di assegnare priorità ai lavori
-> Aumento del throughput
-v Riduzione dell’overhead del sistema operativo
-
-128) ___> fornisce l’indirizzo della prossima istruzione che deve essere eseguita dal processo corrente?
-> Lo stack del processo
-> Il bus di sistema
-> Nessuno 
-v Program Counter
-
-129) Quale dei seguenti NON è un valido schema di prevenzione del deadlock?
-> Rilasciare tutte le risorse prima di richiederne una nuova
-v Non chiedere mai una risorsa dopo averne rilasciate altre
-> Si definisce un ordinamento crescente delle risorse, una risorsa viene data solo se esegue quelle che il processo già detiene
-> Richiedere e allocare tutte le risorse necessarie prima dell’esecuzione
-
-130) UNSAFE Quale dei seguenti NON è vero riguardo l’algoritmo di Dekker per gestire la concorrenza?
-v Non usa busy waiting
-> Garantisce la non-starvation
-> Tutte le opzioni elencate
-> Garantisce il non-deadlock
-
-131) Quale delle seguenti non è una tabella di controllo del sistema operativo?
-v Tabella dei processi sospesi
-> Tabelle di memoria
-> Tabelle di controllo di accesso
-> Tabelle di I/O
-
-132) In un sistema con modello di interruzioni (interrupt) annidate, se un interrupt (I-2) è ricevuto durante la gestione di un altro interrupt(I-1)
-v La cpu sospende l’esecuzione del codice corrente, ed avvia l’handler del nuovo interrupt ricevuto
-> La cpu completa l’esecuzione del codice corrente, e successivamente avvia l’handler del nuovo interrupt ricevuto
-> La cpu gestisce entrambi gli handler in parallelo
-> La cpu termina (aborts,kills) l’esecuzione del codice corrente, ed avvia l’handler del nuovo interrupt ricevuto
-
-133) Il numero di processi completati per unità di tempo è chiamato _____
-> Produzione
-v Throughput
-> Capacità
-> Nessuno
-
-134) Quale dei seguenti sono obiettivi per un file Management System?
-v Tutte le opzioni elencate
-> Fornire supporto per l’I/O da più utenti in contemporanea
-> Minimizzare i dati persi o distrutti
-> Fornire un insieme di interfacce standard per i processi utente
-
-135) In un sistema operativo con allocazione dei file indicizzata, quale delle seguenti opzioni è vera:
-> La tabella di allocazione contiene soltanto l'indirizzo di un blocco, e questo blocco contiene sempre tutte le entry per ogni porzione allocata al file
-> La tabella di allocazione contiene l'indirizzo del primo blocco del file, e ciascun blocco contiene l'indirizzo del prossimo blocco del file
-v La tabella di allocazione contiene soltanto l'indirizzo di un blocco, e questo blocco contiene le entry delle porzioni di file allocate oppure l'indirizzo di altri blocchi usati a loro volta per indicizzare le porzioni di file allocate
-> La tabella di allocazione dei file contiene l'indirizzo di un blocco e la lista dei blocchi del file
-
-136) Quale delle seguenti affermazioni riguardo algoritmi di scheduling del disco è vera
-> L'algoritmo SCAN può portare a starvation delle richieste
-> L'algoritmo FSCAN è una versione di SCAN che rimuove il problema della starvation delle richieste, ma che rende l'algoritmo meno fair rispetto a SCAN
-> L'algoritmo Minimo Tempo di Servizio non richiede di conoscere la posizione della testina del disco per operare
-v N-step-SCAN è una generalizzazione di FSCAN che è fair e può avere prestazioni molto simili a quelle di SCAN
-
-137) Quali dei seguenti NON è un tipo di scheduling dei sistemi operativi:
-> Short term scheduling
-> Long term scheduling
-> Disk scheduling
-v File scheduling
-
-138) Nei sistemi operativi che usano paginazione SEMPLICE per la gestione della memoria
-> ai processi devono essere allocati frame di memoria necessariamente contigui per poter consentire l'esecuzione del processo
-> il sistema operativo deve utilizzare la tabella delle pagine per tradurre gli indirizzi. Qualora una pagina non sia presente in memoria principale, il sistema la deve caricare dinamicamente per consentire il proseguimento dell'esecuzione di un processo
-> non c'è necessità di traduzione degli indirizzi, in quanto tutte le pagine di un processo sono sempre caricate in un frame nella memoria principale
-v nessuna delle altre opzioni è corretta
-
-139) Nei sistemi operativi che usano journaling logico
-> non c'è possibilità di perdita dei dati in quanto, in caso di arresto imprevisto, il sistema operativo può usare il journal per ricostruire interamente le operazioni non andate a buon fine
-> il sistema operativo usa il journal solo per copiare i dati prima di farne la scrittura anche nel file system, ma non lo utilizza per i metadati
-v il sistema operativo usa il journal solo per copiare i metadati prima di aggiornare le strutture del file system, ma non lo utilizza per i dati
-> nessuna delle opzioni è corretta
-
-140) Il sistema operativo linux per la gestione dei file
-v nessuna delle altre opzioni è corretta
-> utilizza un sistema misto di allocazione contigua e concatenata in modo da minimizzare l'overhead di sistema e massimizzare le performance
-> utilizza un sistema di allocazione concatenata basato sulla struttura dati conosciuta come inode
-> usa gli inode per tenere traccia dei blocchi su disco allocati a ciascun file. Ogni inode contiene al suo interno la lista completa di tutti i blocchi su disco che compongono il file corrispondente
-
-141) Nei sistemi Unix
-> gli hard links sono dei file speciali che contengono il cammino completo sul file system di un altro file, effettivamente creando un "puntatore" a quel file
-v gli hard link sono puntatori diretti al descrittore di un file (inode). Un contatore viene utilizzato per tenere traccia di quanti hard link puntino ad un determinato inode. Questo fa si che il file non possa essere cancellato fintantoché ci sono hard link che continuano a puntarlo
-> possono esistere hard link a file non più esistenti, ad esempio se il file a cui l'hard link puntava viene cancellato
-> nessuna delle altre risposte è corretta
\ No newline at end of file
diff --git a/legacy/Data/Questions/so1_new.json b/legacy/Data/Questions/so1_new.json
deleted file mode 100644
index 5c415fa..0000000
--- a/legacy/Data/Questions/so1_new.json
+++ /dev/null
@@ -1,1400 +0,0 @@
-[
-   {
-      "quest":"Il sistema operativo",
-      "answers":[
-         "Coincide con il kernel",
-         "Costituisce l'interfaccia tra la macchina fisica (hardware) e le applicazioni utente",
-         "È soggetto alle politiche di scheduling",
-         "Risiede in memoria principale anche in seguito allo shutdown della macchina"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"In un sistema operativo microkernel",
-      "answers":[
-         "Alcune delle funzionalità sono implementate in spazio utente anziché all'interno del kernel",
-         "I processi utente possono interagire direttamente con il sistema,evitando l'uso di system call",
-         "La comunicazione tra le varie componenti del sistema è più efficiente",
-         "Non sono previsti meccanismi di protezione  "
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"In un sistema operativo strutturato secondo un approccio microkernel",
-      "answers":[
-         "Non necessita di avere due modalità di utilizzo della CPU (user vs.kernel mode)",
-         "Non necessita di meccanismi di comunicazione tra porzioni diverse del sistema operativo",
-         "E' più efficiente di un sistema monolitico",
-         "Ad eccezione delle funzionalità fondamentali, implementa tutto il resto in spazio utente"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"L'insieme di istruzioni del livello macchina:",
-      "answers":[
-         "Sono composte da un codice operativo e da zero o più operandi",
-         "Sono definite da uno specifico linguaggio macchina",
-         "Sono un'astrazione dell'architettura hardware",
-         "Tutte le risposte precedenti sono corrette"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"I registri interni della CPU e la cache sono unità di memoria:",
-      "answers":[
-         "Non volatili",
-         "Gestite interamente dall'architettura a livello hardware",
-         "Gestite interamente dal sistema operativo",
-         "Molto economiche e altamente performanti"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"La transizione da user a kernel mode avviene quando:",
-      "answers":[
-         "Un programma esegue una chiamata di funzione",
-         "Si avvia il computer (bootstrap)",
-         "Si esegue la prima istruzione di un programma",
-         "Scade il quanto di tempo assegnato al processo in esecuzione"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Il device controller di un dispositivo di I/O:",
-      "answers":[
-         "Contiene dei registri che ne indicano lo stato",
-         "Contiene dei registri che ne consentono il controllo da parte della CPU",
-         "Contiene dei registri per lo scambio di dati con la CPU",
-         "Tutte le risposte precedenti sono corrette"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Le chiamate di sistema:",
-      "answers":[
-         "Sono sempre bloccanti",
-         "Causano la terminazione del processo in corso e l'avvio di un nuovo processo",
-         "Devono essere implementate in spazio utente",
-         "Devono essere implementate in spazio kernel"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Una chiamata di sistema bloccante",
-      "answers":[
-         "Sposta in coda pronti (ready) il processo che la esegue",
-         "Interrompe definitivamente il processo che la esegue",
-         "Interrompe temporaneamente il processo che la esegue",
-         "Necessità che il processo che la esegue ne verifichi periodicamente l'esito (polling)"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Il system call handler:",
-      "answers":[
-         "È invocato dallo scheduler del sistema operativo",
-         "Viene invocato alla scadenza del quanto temporale",
-         "Viene eseguito in spazio utente",
-         "Gestisce le chiamate di sistema tramite la system call table"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":" Il codice generico del system call handler:",
-      "answers":[
-         "Viene eseguito in spazio utente",
-         "È indicizzato tramite la interrupt vector table (IVT)",
-         "Viene invocato alla scadenza del quanto temporale",
-         "Viene invocato dallo scheduler del sistema operativo"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"L'interrupt vector table(IVT):",
-      "answers":[
-         "Si aggiorna dinamicamente ad ogni interruzione",
-         "E' una struttura dati che contiene puntatori ai vari gestori(handler) delle interruzioni",
-         "E' una struttura dati che è associata a ciascun processo",
-         "E' una struttura dati che contiene puntatori a codici di errori"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"La system-call table:",
-      "answers":[
-         "Contiene tante entry quanto sono le chiamate di sistema supportare",
-         "Contiene tante entry quante sono le interruzioni supportare",
-         "Contiene tante entry quanti sono i dispositivi di I/O presenti nel sistema",
-         "Contiene tante entry quanti sono i processi in esecuzione"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"La system-call table è una struttura dati gestita:",
-      "answers":[
-         "Dai dispositivi di I/O",
-         "Dal processo utente",
-         "Sia dal kernel del sistema operativo che dal processo utente",
-         "Dal kernel del sistema operativo"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Se si cambia l'implementazione di una chiamata di sistema esistente:",
-      "answers":[
-         "E' sempre necessario modificare il codice utente che ne fa uso",
-         "Non è mai necessario modificare il codice utente che ne fa uso",
-         "Non è necessario modificare il codice utente che ne fa uso, a patto che cambi anche l'interfaccia (API) della chiamata di sistema",
-         "Non è necessario modificare il codice utente che ne fa uso, a patto che non cambi anche l’interfaccia (API) della chiamata di sistema"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Un processore impiega 5 cicli di clock per eseguire un'istruzione (CPI = 5), ossia per completare l'intero ciclo fetch-decode-execute. Assumendo che la frequenza di clock del processore sia pari a 5 MHz, quante istruzioni è in grado di eseguire in un secondo? (Si ricordi che 1 MHz = 1*10^6 cicli al secondo)",
-      "answers":[
-         "1*10^3",
-         "Decido di NON rispondere a questa domanda",
-         "25*10^3",
-         "1*10^6",
-         "25*10^6"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Data una CPU multicore con 𝑚unità(cores), il numero di processi/thread che ad un certo istante si trovano nella “coda” di esecuzione(running):",
-      "answers":[
-         "Può essere superiore a 𝑚",
-         "E’ esattamente pari a 𝑚",
-         "I dati sono insufficienti per rispondere alla domanda",
-         "E' al massimo pari a 𝑚"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"La creazione di un nuovo processo da parte di un processo avviene tramite:",
-      "answers":[
-         "Una chiamata di sistema",
-         "Una chiamata di funzione",
-         "L'invio di un interruzione",
-         "Nessuna delle risposte precedenti è corretta"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"Il sistema operativo tiene traccia dello stato di un processo tramite:",
-      "answers":[
-         "Un'apposita area dedicata e protetta della memoria principale",
-         "Un apposito registro interno della CPU",
-         "Un'apposita area dedicata e protetta della memoria cache",
-         "Un apposito campo all'interno del process control block (PCB)"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Un processo in esecuzione sulla CPU passa in stato ready quando:",
-      "answers":[
-         "Riceve un segnale di interruzione da parte di un dispositivo di I/O",
-         "Fa richiesta di input da parte dell’utente",
-         "Fa richiesta di una pagina che non è presente in memoria principale",
-         "Esegue una chiamata di funzione"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"Un processo in esecuzione sulla CPU passa in stato waiting quando:",
-      "answers":[
-         "Riceve un segnale da parte di un dispositivo di I/O",
-         "Termina il quanto di tempo ad esso assegnato",
-         "Apre una connessione di rete (ad es., un socket TCP)",
-         "Esegue una chiamata di funzione"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Un processo in esecuzione sulla CPU passa in stato waiting quando:",
-      "answers":[
-         "Fa richiesta di input da parte dell'utente",
-         "Esegue una chiamata di funzione",
-         "Termina il quanto di tempo ad esso assegnato",
-         "Riceve un segnale di interruzione da parte di un dispositivo di I/O"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"Un processo in esecuzione sulla CPU passa in stato waiting quando:",
-      "answers":[
-         "Termina il quanto di tempo ad esso assegnato",
-         "L'utente trascina il dispositivo di puntamento(e.g. mouse)",
-         "Esegue una chiamata di funzione",
-         "Riceve un segnale di interruzione da parte di un dispositivo di I/O"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Quanti processi saranno presenti nel sistema a seguito di queste chiamata: pid_1 = fork(); pid_2 = fork(); pid_3 = fork();?",
-      "answers":[
-         "8",
-         "7",
-         "4",
-         "3"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"I processi CPU-bound che non eseguono richieste di I/O:",
-      "answers":[
-         "Hanno una priorità alta",
-         "Hanno una priorità bassa",
-         "Sono processi mediamente brevi",
-         "Possono non rilasciare mai la CPU volontariamente"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Lo scheduler della CPU si attiva:",
-      "answers":[
-         "Quando un processo tenta di eseguire una scrittura su discord",
-         "Quando il codice di un programma esegue una divisione per zero",
-         "Quando scade il quanto di tempo",
-         "Tutte le risposte precedenti sono corrette"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Lo scheduling preemptive(basato su time slice o quanto temporale):",
-      "answers":[
-         "Da la priorità ai processi CPU-bound",
-         "Si attiva solamenta alla scadenza del quanto temporale(time slice)",
-         "Si attiva solamente a fronte di una chiamata di sistema",
-         "Fornisce un limite superiore al tempo di CPU assegnato a ciascun processo"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"In un sistema uniprocessore (single core) time-sharing in cui i processi in esecuzione sono tutti puramente CPU-bound:",
-      "answers":[
-         "L'impiego dei multi-threading consente di migliorare la latenza del sistema",
-         "L'impiego del multi-threading consente di diminuire il tempo di completamente di ciascun processo",
-         "L'impiego del multi-threading consente di migliorare il throughput del sistema",
-         "L'impiego dei multi-threading non costituisce alcun vantaggio"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"In caso di scheduling preemptive, lo scheduler interviene:",
-      "answers":[
-         "Quando un processo passa dallo stato running allo stato waiting",
-         "Quando un processo passa dallo stato running allo stato ready",
-         "Quando un processo passa dallo stato waiting allo stato ready",
-         "Tutte le risposte precedenti sono corrette"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Se un processo arriva nella coda dei pronti all'istante t.0 = 2e termina all'istante t.f = 15, il suo tempo di turnaround equivale a",
-      "answers":[
-         "13",
-         "2",
-         "I dati sono insufficienti per rispondere alla domanda",
-         "15"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"Se un processo arriva nella coda dei pronti all’istante 𝑡0 = 3 e termina all’istante 𝑡𝑓 = 25, il tempo di attesa equivale a",
-      "answers":[
-         "3",
-         "22",
-         "25",
-         "I dati sono insufficienti per rispondere alla domanda"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"I thread di uno stesso processo condividono:",
-      "answers":[
-         "Lo stack",
-         "Le variabili globali",
-         "I valori dei registri della CPU",
-         "Nessuna delle informazioni elencate sopra"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Lo user thread:",
-      "answers":[
-         "Necessita del supporto di una opportuna thread table a livello kernel",
-         "E' la più piccola unità schedulabile sulla CPU dal sistema operativo",
-         "E' gestito in spazio utente tramite un'apposita libreria",
-         "Coincide sempre con uno ed un solo kernel thread"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Nel modello di thread mapping cosiddetto one-to-one:",
-      "answers":[
-         "Consente di gestire i thread tramite un'apposita libreria a livello utente",
-         "Può essere implementato solo su sistemi multiprocessore",
-         "Causa il blocco di tutti i thread di un processo se anche uno solo di questi thread esegue una chiamata di sistema bloccante",
-         "Consente di gestire i thread a livello del kernel del sistema operativo"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Nel modello di thread mapping cosiddetto many-to-one:",
-      "answers":[
-         "Molti user thread possono essere distribuiti su più CPU (se presenti)",
-         "L'effetto di una chiamata bloccante da parte di uno user thread non blocca gli altri thread da cui è composto il processo",
-         "Molti user thread sono mappati su un singolo kernel thread",
-         "Molti kernel thread sono mappati su un singolo user thread"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Il modello di thread mapping considerato many-to-many",
-      "answers":[
-         "Non prevede alcun limite al numero di kernel thread",
-         "Può essere implementato solo su sistemi multiprocessore",
-         "Causa il blocco di tutti i thread di un processo se anche uno solo di questi thread esegue una chiamata di sistema bloccante",
-         "E' il compromesso tra un'implementazione dei thread puramente user level e una puramente kernel level"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Si parla di parallelismo quando:",
-      "answers":[
-         "Vengono eseguiti processi single-threaded su CPU multicore",
-         "Vengono eseguiti processi multi-threaded su CPU single core",
-         "Vengono eseguiti processi multi-threaded su CPU multicore",
-         "Tutte le risposte precedenti sono corrette"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Si parla di concorrenza quando:",
-      "answers":[
-         "Vengono eseguiti processi multi-threaded su CPU single core",
-         "Vengono eseguiti processi single-threaded su CPU single core",
-         "Vengono eseguiti processi single-threaded su CPU multicore",
-         "Vengono eseguiti processi multi-threaded su CPU multicore"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"La comunicazione tra thread dello stesso processo rispetto a quella tra processi diversi:",
-      "answers":[
-         "È più lenta poiché i thread sono gestiti da librerie di alto livello",
-         "È più veloce poiché i thread non eseguono context switch",
-         "È più veloce poiché i thread condividono lo stesso spazio di indirizzamento",
-         "Non c'è alcuna differenza sostanziale in termini di performance"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Il kernel thread:",
-      "answers":[
-         "Coincide sempre con uno ed un solo user thread",
-         "È gestito in spazio utente tramite un'apposita libreria",
-         "È la più piccola unità schedulabile sulla CPU dal sistema operativo",
-         "È il termine con cui si identificano i processi propri del sistemaoperativo (i.e., non i processi utente)"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"L'uso di una primitiva di sincronizzazione lock prevede che:",
-      "answers":[
-         "La lock sia inizialmente libera",
-         "La lock venga acquisita prima dell'ingresso nella sezione critica",
-         "La lock venga rilasciata dopo l'uscita dalla sezione critica",
-         "Tutte le condizioni precedenti devono essere verificate"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"L'acquisizione di una lock:",
-      "answers":[
-         "Deve avvenire in modo atomico, evitando che lo scheduler interrompa l'acquisizione",
-         "Necessita obbligatoriamente del supporto di istruzioni hardware atomiche",
-         "Necessita obbligatoriamente che il sistema operativo disabiliti le interruzioni",
-         "Nessuna delle risposte precedenti è corretta"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"Un semaforo può essere utilizzato per:",
-      "answers":[
-         "Forzare le politiche di scheduling tra processi/thread",
-         "Accedere al codice del kernel",
-         "Lo scambio di messaggi tra processi/thread",
-         "Gestire le interruzioni che giungono alla CPU"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"L'invocazione del metodo wait() su un semaforo il cui valore è pari a 2:",
-      "answers":[
-         "Lascia invariato il valore del semaforo a 2 e fa proseguire il processo che ha eseguito l'invocazione (al netto delle politiche di scheduling)",
-         "Decrementa il valore del semaforo a 1 e blocca il processo che ha eseguito l'invocazione",
-         "Incrementa il valore del semaforo a 3 e fa proseguire il processo che ha eseguito l'invocazione (al netto delle politiche di scheduling)",
-         "Decrementa il valore del semaforo a 1 e fa proseguire il processo che ha eseguito l'invocazione (al netto delle politiche di scheduling)"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"L'istruzione test-and-set:",
-      "answers":[
-         "È un'istruzione atomica che consente di implementare le primitive di sincronizzazione",
-         "È un'istruzione atomica che consente di disabilitare le interruzioni",
-         "È un'istruzione atomica che consente di aggiornare i valori di più registri simultaneamente",
-         "È un'istruzione atomica che consente di resettare il valore di un semaforo"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"La differenza tra deadlock e starvation risiede nel fatto che:",
-      "answers":[
-         "Si riferiscono a codice utente e codice di sistema (rispettivamente)",
-         "Nel caso di starvation tutto il sistema è completamente bloccato",
-         "Non vi è alcuna differenza",
-         "Nel caso di deadlock tutto il sistema è completamente bloccato"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Con il termine address binding si intende:",
-      "answers":[
-         "Il processo di traduzione da indirizzi logici a indirizzi fisici",
-         "Il processo di inizializzazione delle variabili globali di un programma",
-         "Il processo di collegamento tra il codice compilato ed eventuali librerie esterne",
-         "Nessuna delle risposte precedenti è corretta"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"Lo swapping consente di:",
-      "answers":[
-         "Implementare la rilocazione dinamica del codice di un processo",
-         "Risolvere il problema della frammentazione esterna",
-         "Trasferire temporaneamente su disco i processi che non sono attualmente in esecuzione",
-         "Scambiare le aree di memoria occupate da due o più processi"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"La gestione 'paginata' della memoria (paging):",
-      "answers":[
-         "Prevede che lo spazio di indirizzamento logico di un processo sia non-contiguo e suddiviso in blocchi di dimensioni fissate (pages)",
-         "Non richiede alcun supporto hardware per essere implementata in modo efficiente",
-         "Prevede che lo spazio di indirizzamento fisico di un processo sia non-contiguo e suddiviso in blocchi di dimensioni fissate (frames)",
-         "Risolve il problema della frammentazione interna"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"La cache TLB (Translation Look-aside Buffer)",
-      "answers":[
-         "E' condivisa tra tutti i processi del sistema",
-         "Consente una traduzione mediamente più rapida degli indirizzi logici",
-         "Contiene un sottoinsieme delle entry della page table",
-         "Tutte le risposte precedenti sono corrette"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"La dimensione (i.e., il numero di entry) della page table:",
-      "answers":[
-         "È direttamente proporzionale alla dimensione (fissata) delle pagine",
-         "Si adatta a seconda delle richieste di accesso alla memoria di ciascun processo",
-         "Dipende dalla dimensione (fissata) delle pagine",
-         "Varia dinamicamente a seconda del processo"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"La dimensione (i.e., il numero di entry) della page table:",
-      "answers":[
-         "Varia dinamicamente a seconda del processo",
-         "E' direttamente proporzionale alla dimensione (fissata)",
-         "E' inversamente proporzionale alla dimensione (fissata) delle pagine",
-         "Si adatta a seconda delle richieste di accesso alla memoria di ciascun processo"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Un compilatore genera l'indirizzo logico 576 per riferirsi ad una certa locazione di memoria fisica. Assumendo che la traduzione degli indirizzi avvenga tramite rilocazione statica con indirizzo fisico base = 24, quale sarà l'indirizzo fisico corrispondente?",
-      "answers":[
-         "576",
-         "552",
-         "600",
-         "I dati sono insufficienti per rispondere al problema"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Si consideri un processo di dimensione pari a 2,488 bytes e un blocco di memoria libero di dimensione pari a 2,699 bytes. In questo caso, assumendo il vincolo di allocazione contigua della memoria, la scelta più conveniente è:",
-      "answers":[
-         "Allocare l'intero blocco al processo, sprecando 211 bytes(frammentazione interna)",
-         " Allocare la porzione del blocco necessaria al processo e aggiungere alla lista dei blocchi liberi i 211 bytes rimanente(frammentazione esterna)",
-         "Attendere che vi sia un blocco di dimensione multipla rispetto a quella del processo",
-         "Attendere che vi sia un blocco di dimensione inferiore adatto a contenere il processo"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"Si consideri un processo di dimensione pari a 4,996 e un blocco di memoria libero di dimensione pari a 5,016 bytes. In questo caso, assumendo il vincolo di allocazione contigua della memoria, la scelta più conveniente è:",
-      "answers":[
-         "Attendere che vi sia un blocco di dimensione inferiore adatto a contenere il processo",
-         "Allocare l'intero blocco al processo, sprecando 20 bytes(frammentazione interna)",
-         "Attendere che vi sia un blocco di dimensione multipla rispetto a quella dei processi",
-         "Allocare la porzione del blocco necessaria al processo e aggiungere alla lista dei blocchi liberi i 20 bytes rimanenti(frammentazione esterna)"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Si supponga che un processo P necessiti di un'area di memoria libera pari a 99 KiB per essere allocato in modo contiguo in memoria principale. Se la lista dei blocchi di memoria libera contiene i seguenti elementi: A, B, C, D le cui dimensioni sono rispettivamente 102 KiB, 99 KiB, 256 KiB e 128 KiB, quale blocco verrà allocato per P assumendo una politica Worst-Fit?",
-      "answers":[
-         "blocco A",
-         "blocco C",
-         "blocco B",
-         "blocco D"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":" Si supponga che un processo P necessiti di un'area di memoria libera pari a 99 KiB per essere allocato in modo contiguo in memoria principale. Se la lista dei blocchi di memoria libera contiene i seguenti elementi: A, B, C, D, E, F le cui dimensioni sono rispettivamente 300 KiB, 600 KiB, 350 KiB, 200 KiB, 750 KiB e 125 KiB, quale blocco verrà allocato per P assumendo una politica Worst-Fit?",
-      "answers":[
-         "blocco B",
-         "Non è possibile soddisfare la richiesta, pertanto P dovrà attendere",
-         "C e i restati 25 KiB vengono allocati su A",
-         "blocco E"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Si supponga che un processo P necessiti di un'area di memoria libera pari a 128 KiB per essere allocato in modo contiguo in memoria principale. Se la lista dei blocchi di memoria libera contiene i seguenti elementi: A, B, C, D le cui dimensioni sono rispettivamente 105 KiB, 916 KiB, 129 KiB e 80 KiB, quale blocco verrà allocato per P assumendo una politica First-Fit?",
-      "answers":[
-         "blocco A",
-         "blocco D",
-         "blocco B",
-         "blocco C"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Si supponga che un processo P necessiti di un'area di memoria libera pari a 115 KiB per essere allocato in modo contiguo in memoria principale. Se la lista dei blocchi di memoria libera contiene i seguenti elementi: A, B, C, D,E,F le cui dimensioni sono rispettivamente 300 KiB, 600 KiB, 350 KiB, 200 KiB,750 KiB e 125 KiB quale blocco verrà allocato per P assumendo una politica First-Fit?",
-      "answers":[
-         "blocco A",
-         "blocco F",
-         "blocco E",
-         "blocco D"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"Si supponga che un processo P necessiti di un'area di memoria libera pari a 375 KiB per essere allocato in modo contiguo in memoria principale. Se la lista dei blocchi di memoria libera contiene i seguenti elementi: A, B, C, D,E,F le cui dimensioni sono rispettivamente 300 KiB, 600 KiB, 350 KiB, 200 KiB,750 KiB e 125 KiB quale blocco verrà allocato per P assumendo una politica Best-Fit?",
-      "answers":[
-         "blocco B",
-         "blocco C e i restanti 25 Kib vengono allocati su A",
-         "blocco E",
-         "Non è possibile soddisfare la richiesta, pertanto P dovrà attendere"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"Si supponga che un processo P necessiti di un'area di memoria libera pari a 34 KiB per essere allocato in modo contiguo in memoria principale. Se la lista dei blocchi di memoria libera contiene i seguenti elementi: A, B, C, D le cui dimensioni sono rispettivamente 36 KiB, 90 KiB, 42 KiB e 35 KiB, quale blocco verrà allocato per P assumendo una politica Best-Fit?",
-      "answers":[
-         "blocco A",
-         "blocco B",
-         "blocco C",
-         "blocco D"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Si supponga di avere una memoria M di capacità pari a 4 KiB, ossia 4,096 bytes. Assumendo che l'indirizzamento avvenga con lunghezza di parola (word size) pari 2 bytes e che M utilizzi una gestione paginata con blocchi di dimensione pari a S = 128 bytes, quanti bit sono necessari per identificare l'indice di pagina (p) e l'offset (interno alla pagina), rispettivamente?",
-      "answers":[
-         "p=6; offset=5",
-         "b.p=7; offset=5",
-         "p=5; offset=7",
-         "p=5; offset=6"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Si consideri una memoria M di capacità pari a 512 bytes con frame di dimensione pari a 16 bytes. Dato l'indirizzo del byte 197, quale sarà l'indirizzo di pagina (p) e l'offset (interno alla pagina):",
-      "answers":[
-         "p=5; offset=12",
-         "I dati sono insufficienti per rispondere alla domanda",
-         "p=13; offset=0",
-         "p=12; offset=5"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Si consideri una memoria M di capacità pari a 100 bytes con frame di dimensione pari a 10 bytes. Dato l’indirizzo del byte 37, quale sarà l’indirizzo di pagina (p) e l’offset (interno alla pagina).",
-      "answers":[
-         "p=3; offset=7",
-         "I dati sono insufficienti per rispondere alla domanda",
-         "p=7; offset=3",
-         "p=0; offset=37"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"Si consideri un processo di dimensione pari a 2,097 bytes e un blocco di memoria libero di dimensione pari a 2,104 bytes. In questo caso, assumendo il vincolo di allocazione contigua della memoria, la scelta più conveniente è:",
-      "answers":[
-         "Attendere che vi sia un blocco di dimensione multipla rispetto a quella del processo",
-         "Allocare l'intero blocco al processo, sprecando 7 bytes (frammentazione interna)",
-         "Attendere che vi sia un blocco di dimensione inferiore adatto a contenere il processo",
-         "Allocare la porzione del blocco necessaria al processo e aggiungere alla lista dei blocchi liberi i 7 bytes rimanenti (frammentazione esterna)"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Si supponga di avere una memoria M di capacità pari a 2 KiB, ossia 2,048 bytes. Assumendo che l’indirizzamento avvenga con lunghezza di parola (word size) pari a 4 bytes, quanti bit sono necessari ad indirizzare le parole contenute in M?",
-      "answers":[
-         "2",
-         "9",
-         "11",
-         "I dati sono insufficienti per rispondere al problema"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Si supponga di avere una memoria M di capacità pari a 4 KiB ossia 4,096 bytes. Assumendo che l’indirizzamento avvenga con lunghezza di parola (word size) pari a 2 bytes, quanti bit sono necessari ad indirizzare le parole contenute in M?",
-      "answers":[
-         "10",
-         "11",
-         "12",
-         "I dati sono insufficienti per rispondere alla domanda"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Si supponga di avere una memoria M di capacità pari a 8 KiB, ossia 8,192 bytes. Assumendo che l'indirizzamento avvenga con lunghezza di parola (word size) pari al singolo byte e che M utilizzi una gestione paginata con blocchi di dimensione pari a S = 128 bytes, quale dimensione (intesa come numero di entry) ha la corrispondente page table T?",
-      "answers":[
-         "I dati sono insufficienti per rispondere al problema",
-         "13",
-         "64",
-         "7"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Si supponga di avere una memoria M di capacità pari a 8 KiB, ossia 8,192 bytes. Assumendo che l’indirizzamento avvenga con lunghezza di parola (word size) pari a 4 bytes e che M utilizzi una gestione paginata con blocchi di dimensione pari a S = 256 bytes, quale sarà il numero di entry della corrispondente page table T?",
-      "answers":[
-         "32",
-         "2048",
-         "8",
-         "5"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"Si supponga di avere una memoria M di capacità pari a 16 KiB, ossia 16,384 bytes. Assumendo che l’indirizzamento avvenga con lunghezza di parola (word size) pari a 4 bytes e che M utilizzi una gestione paginata con blocchi di dimensione pari a S = 64 bytes, quale sarà il numero di entry della corrispondente page table T?",
-      "answers":[
-         "a",
-         "b",
-         "c",
-         "I dati sono insufficienti per rispondere al problema"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Si consideri un sistema operativo che utilizza indirizzi logici da 21 bit, indirizzo fisico da 16 bit e memoria paginata in cui ciascuna pagina ha dimensione 2 KiB(2048 bytes). Qual è la dimensione massima di memoria fisica supportata dal sistema?",
-      "answers":[
-         "32 KiB",
-         "64 KiB",
-         "2 MiB",
-         "Non esiste un limite fisico alla memoria supportata dal sistema"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"La memoria virtuale consente di:",
-      "answers":[
-         "Aumentare l'efficienza delle operazioni di I/O",
-         "Mantenere allocate in memoria fisica solo alcune pagine dello spazio di indirizzamento logico di un processo",
-         "Diminuire il grado di multiprogrammazione del sistema",
-         "Eseguire un processo direttamente dai dispositivi di memoria secondaria (e.g., disco)"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Se un'istruzione idempotente genera un page fault:",
-      "answers":[
-         "Il processo di cui fa parte l'istruzione termina",
-         "Le istruzioni idempotenti non possono generare page fault",
-         "L'istruzione non verrà più eseguita una volta effettuato il ritorno dalla gestione del page fault",
-         "L'istruzione verrà nuovamente eseguita al ritorno dalla gestione del page fault"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":".Il problema della frammentazione esterna:",
-      "answers":[
-         "Necessita di un supporto hardware per essere risolto",
-         "Non è risolvibile a meno di un riavvio del sistema",
-         "E’ una conseguenza del vincolo di allocazione contigua della memoria",
-         "Causa un’interruzione hardware"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Il problema della frammentazione esterna",
-      "answers":[
-         "Non è risolvibile a meno di un riavvio del sistema",
-         "Causa un’interruzione hardware",
-         "Necessita di un supporto hardware per essere risolto",
-         "E’ dovuto all’ allocazione/deallocazione di blocchi contigui di memoria"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Il working set è:",
-      "answers":[
-         "Fissato per ogni quanto di tempo",
-         "Relativamente grande rispetto all’intero spazio di indirizzamento di un processo",
-         "Relativamente piccolo rispetto all’intero spazio di indirizzamento di un processo",
-         "Fissato per l’intera esecuzione di un processo"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Si consideri un sistema che implementa la politica LRU per la sostituzione dei frame mediante l’uso di un timestamp. Ad ogni richiesta di accesso ad un determinato frame occorre:",
-      "answers":[
-         "Incrementare una variabile di tipo contatore",
-         "Aggiornare il valore del timestamp con quello corrente",
-         "Impostare un bit di validità",
-         "Nessuna delle precedenti risposte è corretta"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Data una memoria composta da 3 frame fisici e un processo composto da 5 pagine virtuali: A, B, C, D, E, si calcoli il numero di page fault che si verificano a fronte delle seguenti richieste da parte del processo: B, C, C, B, A, E, B, A, E, D, B. Si assuma che nessuna pagina del processo sia inizialmente caricata in memoria e che si utilizzi un algoritmo LRU di sostituzione delle pagine.",
-      "answers":[
-         "4",
-         "5",
-         "6",
-         "7"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Data una memoria composta da 3 frame fisici e un processo composto da 5 pagine virtuali: A, B, C, D, E, si calcoli il numero di page fault che si verificano a fronte delle seguenti richieste da parte del processo: D, B, A, C, C, E, A, D, B, E, D, A. Si assuma che nessuna pagina del processo sia inizialmente caricata in memoria e che si utilizzi un algoritmo LRU di sostituzione delle pagine.",
-      "answers":[
-         "10",
-         "7",
-         "9",
-         "6"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Data una memoria composta da 3 frame fisici e un processo composto da 5 pagine virtuali: A, B, C, D, E, si calcoli il numero di page fault che si verificano a fronte delle seguenti richieste da parte del processo: C,B,C,B,A,E,B,A. Si assuma che nessuna pagina del processo sia inizialmente caricata in memoria e che si utilizzi un algoritmo LRU di sostituzione delle pagine.",
-      "answers":[
-         "2",
-         "4",
-         "5",
-         "1"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Data una memoria fisica composta da 3 frame fisici e un processo composto da 5 pagine virtuali: A, B, C, D, E, si calcoli il numero di page fault che si verificano a fronte delle seguenti richieste da parte del processo: A, B, E, C, E, D, D, A, B. Si assuma che nessuna pagina del processo sia inizialmente caricata in memoria e che si utilizzi un algoritmo FIFO di sostituzione delle",
-      "answers":[
-         "6",
-         "7",
-         "4",
-         "8"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Data una memoria composta da 3 frame fisici e un processo composto da 5 pagine virtuali: A, B, C, D, E, si calcoli il numero di page fault che si verificano a fronte delle seguenti richieste da parte del processo: D, A, C, B, B, A, C, B, D, E, A. Si assuma che nessuna pagina del processo sia inizialmente caricata in memoria e che si utilizzi un algoritmo FIFO di sostituzione delle pagine.",
-      "answers":[
-         "6",
-         "7",
-         "5",
-         "4"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Data una memoria composta da 3 frame fisici e un processo composto da 5 pagine virtuali: A, B, C, D, E si calcoli il numero di page fault che si verificano a fronte delle seguenti richieste da parte del processo: E, B, E, C, D, E, A, B, E. Si assuma che nessuna pagina del processo sia inizialmente caricata in memoria e che si utilizzi un algoritmo FIFO di sostituzione delle pagine.",
-      "answers":[
-         "7",
-         "8",
-         "6",
-         "5"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"L'allocazione contigua di un file su disco:",
-      "answers":[
-         "È ottima sia per l'accesso diretto (random) che per quello sequenziale",
-         "Presenta il problema della frammentazione",
-         "Necessita il mantenimento dei blocchi liberi all'interno di una opportuna struttura dati",
-         "Tutte le risposte precedenti sono corrette"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"L’allocazione contigua di un file su un disco è la scelta preferibile quando il disco è:",
-      "answers":[
-         "Un CD/DVD-ROM in sola lettura",
-         "Un disco magnetico",
-         "Un disco a stato solido",
-         "In nessuno dei casi precedenti"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"In un disco magnetico, il seek time:",
-      "answers":[
-         "È il tempo necessario al disco per posizionare le proprie testine su uno specifico settore",
-         "Include il tempo di trasferimento alla memoria principale",
-         "È il tempo necessario al disco per posizionare le proprie testine su uno specifico cilindro",
-         "È trascurabile rispetto all'intero tempo necessario al trasferimento dei dati"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Un disco è composto da 15 cilindri, ciascuno di capacità pari a 500 MB. Qual è la capacità totale del disco?",
-      "answers":[
-         "7.5 GB",
-         "75 GB",
-         "750 MB",
-         "I dati sono insufficienti per rispondere al problema4"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"Si supponga che il tempo di accesso alla memoria fisica sia tMA = 50 nsec. e che il tempo per la gestione di un page fault tFAULT  sia pari a 15 msec. Assumendo che la probabilità che si verifichi un page fault sia p = 0.0002, qual è il tempo complessivo atteso di accesso alla memoria?",
-      "answers":[
-         "~30.5 nsec",
-         "~30.5 microsec",
-         "~3.05 microsec",
-         "~305 nsec"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Si supponga che il tempo di accesso alla memoria fisica sia tMA = 25 nsec. e che il tempo per la gestione di un page fault  tFAULT sia pari a 30 msec. Assumendo che la probabilità che si verifichi un page fault sia p = 0.005, qual è il tempo complessivo atteso di accesso alla memoria?",
-      "answers":[
-         "~150.025 microsec",
-         "~15.025 nsec",
-         "~150.025 nsec",
-         "~15.025 microsec"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"Si supponga che il tempo di accesso alla memoria fisica sia tMA = 50 nsec. e che il tempo per la gestione di un page fault tFAULT sia pari a 25 msec. Assumendo che il tempo medio di accesso alla memoria sia pari a 0.5 microsec, qual è la probabilità p che si verifichi un page fault?",
-      "answers":[
-         "~0.02%",
-         "~0.2%",
-         "~0.002%",
-         "~0.0002%"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Si supponga che il tempo di accesso alla memoria fisica sia tMA  = 60 nsec. e che il tempo per la gestione di un page fault tFAULT  sia pari a 5 msec. Quale dovrà essere il valore della probabilità che si verifichi un fault () se si vuole garantire che il tempo atteso di accesso alla memoria sia al più il 20% più lento di tMA ? (Si ricordi che 1 msec = 10^3 microsec = 10^6 nsec)",
-      "answers":[
-         "I dati sono insufficienti per rispondere alla domanda",
-         "~0,00024%",
-         " ~0,000024%",
-         " ~0,0000024%"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Si consideri un disco magnetico composto da 128 cilindri/tracce, numerati da 0 a 127 (0 indice del cilindro/traccia più esterno/a rispetto al centro del disco), la cui testina si trova inizialmente sul cilindro 42. Si calcoli il numero di cilindri/tracce attraversate dalla testina del disco, assumendo che la sequenza di richieste: 74, 50, 32, 55, 81 venga gestita da un algoritmo di scheduling SSTF (Shortest Seek Time First) e trascurando il tempo di rotazione.",
-      "answers":[
-         "86",
-         "49",
-         "123",
-         "88"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Si consideri un disco magnetico composto da 128 cilindri/tracce, numerati da 0 a 127 (0 indice del cilindro/traccia più esterno/a rispetto al centro del disco), la cui testina si trova inizialmente sul cilindro 87. Si calcoli il numero di cilindri/tracce attraversate dalla testina del disco, assumendo che la sequenza di richieste: 43, 81, 36, 25, 127 venga gestita da un algoritmo di scheduling FCFS (First Come First Served) e trascurando il tempo di rotazione.",
-      "answers":[
-         "290",
-         "240",
-         "238",
-         "265"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Il tempo di trasferimento totale per un'operazione di I/O da disco magnetico è pari a 30 msec. Sapendo che: il seek time complessivo è pari a 18 msec, il rotational delay complessivo è pari a 7 msec e che il transfer rate è pari a 1.5 Gbit/sec, qual è la quantità totale di dati trasferita? (Si ricordi che 1 B = 1 byte = 8 bit e 1 MB = 10^3 KB = 10^6 B)",
-      "answers":[
-         "9.375 MB",
-         "7.5 MB",
-         "937.5 KB",
-         "I dati sono insufficienti per rispondere alla domanda"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Il tempo di trasferimento totale per un'operazione di I/O da disco magnetico è pari a 40 msec. Sapendo che: il seek time complessivo è pari a 18 msec, il rotational delay complessivo è pari a 7 msec e che il transfer rate è pari a 5 Gbit/sec, qual è la quantità totale di dati trasferita? (Si ricordi che 1 B = 1 byte = 8 bit e 1 MB = 10^3 KB = 10^6 B)",
-      "answers":[
-         "9375 MB",
-         "70 MB",
-         "70 KB",
-         "I dati sono insufficienti per rispondere alla domanda"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"Il tempo di trasferimento totale per un'operazione di I/O da disco magnetico è pari a 36 msec. Sapendo che il seek time complessivo è pari a 13 msec e che sono stati trasferiti 2MB ad una velocità pari a 1 Gbit/sec qual è il rotational delay del disco?(Si ricordi che 1 B = 1 byte = 8 bit)",
-      "answers":[
-         "7 msec",
-         "2 msec",
-         "16 msec",
-         "I dati sono insufficiente per rispondere alla domanda"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"La tabella globale dei file aperti (global open file table):",
-      "answers":[
-         "È condivisa tra tutti i processi",
-         "Contiene una entry per ciascun file in uso",
-         "Mantiene un contatore per ciascun file in uso",
-         "Tutte le risposte precedenti sono corrette"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"La tabella locale dei file aperti (local open file table):",
-      "answers":[
-         "Contiene informazioni di protezione di ciascun file riferita da un processo",
-         "Contiene un puntatore alla locazione sul disco di ciascun file riferito da un processo",
-         "Contiene un puntatore alla tabella globale dei file aperti per ciascun file riferito da un processo",
-         "E’ condivisa tra più processi"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Un possibile esempio di applicazione che necessita accesso sequenziale ad un file è:",
-      "answers":[
-         "Un compilatore",
-         "Un sistema di ricerca all'interno di una base di dati",
-         "Un sistema di ricerca di contatti telefonici",
-         "Nessuna delle risposte precedenti è corretta"
-      ],
-      "correct":0,
-      "image":""
-   },
-   {
-      "quest":"L’allocazione di un file indicizzata è preferibile quando il file in questione:",
-      "answers":[
-         "E’ di piccole dimensioni,indipendentemente dal modo in cui viene acceduto",
-         "E’ di grandi dimensioni, indipendentemente dal modo in cui viene acceduto",
-         "E’ di grandi dimensioni ed è tipicamente acceduto in modo sequenziale",
-         "E’ di grandi dimensioni ed è tipicamente acceduto in modo casuale(diretto)"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"L’allocazione di un file basata su linked list(liste puntate) è preferibile quando il file in questione",
-      "answers":[
-         "E’ di piccolo dimensioni, indipendentemente dal modo in cui viene acceduto",
-         "E’ di grandi dimensioni ed è tipicamente acceduto in modo casuale(diretto)",
-         "E’ di grandi dimensioni, indipendentemente dal modo in cui viene acceduto",
-         "E’ di grandi dimensioni ed è tipicamente acceduto in modo sequenziale"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"In un sistema UNIX-like, un file che ha i seguenti privilegi: 101000000 ",
-      "answers":[
-         "Consente al solo proprietario del file di esercitare diritti di lettura e un sistema UNIX-like, un file che ha i seguenti privilegi: 101000000:",
-         "Consente al solo proprietario del file di esercitare diritti di lettura ed esecuzione (sul file)",
-         "Consente al solo proprietario del file di esercitare diritti di scrittura ed esecuzione (sul file)",
-         "Non dà alcun diritto al proprietario del file"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"In un sistema UNIX-like, un file che ha i seguenti privilegi: 011000000 ",
-      "answers":[
-         "Consente al solo proprietario del file di esercitare diritti di lettura e scrittura (sul file)",
-         "Consente al solo proprietario del file di esercitare diritti di lettura ed esecuzione (sul file)",
-         "Non dà alcun diritto al proprietario del file",
-         "Consente al solo proprietario del file di esercitare diritti di scrittura ed esecuzione (sul file)"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"In un sistema UNIX-like, un file che ha i seguenti privilegi: 111101101",
-      "answers":[
-         "Consente al proprietario del file di esercitare tutti i diritti(sul file) e fornisce agli altri utenti solo diritti di scrittura ed esecuzione",
-         "Consente al proprietario del file di esercitare tutti i diritti(sul file) e fornisce agli altri utenti solo diritti di lettura ed scrittura",
-         "Consente al proprietario del file di esercitare tutti i diritti(sul file) e fornisce agli altri utenti solo diritti di lettura ed esecuzione",
-         "Consente a chiunque di esercitare tutti i diritti (sul file)"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Il comando UNIX ln file_1 file_2",
-      "answers":[
-         "Crea un hard link con il file file_2(sorgente) in cui nome è file_1(destinazione)",
-         "Crea un hard link con il file file_1(sorgente) il cui nome è file_2(destinazione)",
-         "Crea un soft link con il file file_1(sorgente) il cui nome è file_2(destinazione)",
-         "Crea un soft link con il file file_2(sorgente) il cui nome è file_1(destinazione)"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Il comando UNIX ln -s file_1 file2:",
-      "answers":[
-         "Crea un hard link con il file file_2(sorgente) in cui nome è file_1(destinazione)",
-         "Crea un hard link con il file file_1(sorgente) il cui nome è file_2(destinazione)",
-         "Crea un soft link con il file file_1(sorgente) il cui nome è file_2(destinazione)",
-         "Crea un soft link con il file file_2(sorgente) il cui nome è file_1(destinazione)"
-      ],
-      "correct":2,
-      "image":""
-   },
-   {
-      "quest":"Si consideri un file system organizzato con file descriptor indicizzati multi-livello (multi-level indexed files), contenente i riferimenti diretti a 10 blocchi a cui si aggiunge un livello di riferimento indiretto a 100 blocchi e un ulteriore doppio livello di riferimento indiretto, sempre da 100 blocchi ciascuno. Assumendo che ciascun blocco abbia dimensione pari a 2 KiB, qual è la dimensione massima del file supportata?",
-      "answers":[
-         "~20.2 KB",
-         "~20.2 MB",
-         "~20.7 KB",
-         "~20.7 KB"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Si consideri un disco magnetico composto da 200 cilindri/tracce, numerati da 0 a 199(0 indice del cilindro/traccia più esterno/a rispetto al centro del disco), la cui testina si trova inizialmente sul cilindro 53. Si calcoli il numero di cilindri/tracce attraversate dalla testina del disco, assumendo che la sequenza di richieste: 98,183,37,122,14,85,67 venga gestita da un algoritmo di scheduling FCFS (First Come First Served) e trascurando il tempo di rotazione.",
-      "answers":[
-         "595",
-         "558",
-         "650",
-         "638"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Si consideri un disco magnetico composto da 200 cilindri/tracce, numerati da 0 a 199(0 indice del cilindro/traccia più esterno/a rispetto al centro del disco), la cui testina si trova inizialmente sul cilindro 53. Si calcoli il numero di cilindri/tracce attraversate dalla testina del disco, assumendo che la sequenza di richieste: 98,183,37,122,14,65,67 venga gestita da un algoritmo di scheduling FCFS (First Come First Served) e trascurando il tempo di rotazione.",
-      "answers":[
-         "650",
-         "522",
-         "638",
-         "595"
-      ],
-      "correct":1,
-      "image":""
-   },
-   {
-      "quest":"Si consideri un disco magnetico composto da 100 cilindri/tracce, numerati da 0 a 99 (0 indice del cilindro/traccia più esterno/a rispetto al centro del disco), la cui testina si trova inizialmente sul cilindro 11. Si calcoli il numero di cilindri/tracce attraversate dalla testina del disco, assumendo che la sequenza di richieste: 24, 16, 77, 49, 82 venga gestita da un algoritmo di scheduling SCAN (non-ottimizzato), che la testina si stia muovendo verso l'esterno (i.e., verso i cilindri con numeri più bassi) e trascurando il tempo di rotazione.",
-      "answers":[
-         "76",
-         "87",
-         "46",
-         "93"
-      ],
-      "correct":3,
-      "image":""
-   },
-   {
-      "quest":"Data la porzione di codice in figura, indicare quale sarà il valore della variabile value che verrà stampato alla line 18:",
-      "answers":[
-         "5",
-         "20",
-         "15",
-         "I dati sono insufficiente per rispondere alla domanda"
-      ],
-      "correct":0,
-      "image":"25.png"
-   },
-   {
-      "quest":"Data la porzione di codice in figura, indicare il corrispondente albero dei processi generati:",
-      "answers":[
-         "A",
-         "B",
-         "C",
-         "D"
-      ],
-      "correct":1,
-      "image":"26.png"
-   },
-   {
-      "quest":"Data la porzione di codice in figura, indicare il corrispondente albero dei, indicare il corrispondente albero dei processi generati:",
-      "answers":[
-         "A",
-         "B",
-         "C",
-         "D"
-      ],
-      "correct":1,
-      "image":"27.png"
-   },
-   {
-      "quest":"Si considerino i 5 processo della figura seguente e 3 politiche di scheduling: FCFS, SJF (non-preemptive) e RR con time slice pari a 2 unità di tempo. Qual è la politica che garantisce il minor tempo di attesa (in coda pronti) al processo C?",
-      "answers":[
-         "FCFS",
-         "RR",
-         "SJF",
-         "Tutte e tre le politiche garantiscono al processo C lo stesso tempo di attesa"
-      ],
-      "correct":0,
-      "image":"35.png"
-   },
-   {
-      "quest":"Calcolare il tempo medio di attesa (average waiting time) dei seguenti processi, assumendo una politica di scheduling round robin con time slice = 3, nessuna attività di I/O e context switch trascurabile:",
-      "answers":[
-         "6.5",
-         "6.75",
-         "7.15",
-         "5,85"
-      ],
-      "correct":1,
-      "image":"36.png"
-   },
-   {
-      "quest":"Calcolare il tempo medio di attesa (average waiting time) dei seguenti processi, assumendo una politica di scheduling Round Robin con time slice q= 4. Nel calcolo, si consideri il tempo necessario ad eseguire il context switch trascurabile:",
-      "answers":[
-         "4.85",
-         "4.25",
-         "4.5",
-         "4.75"
-      ],
-      "correct":1,
-      "image":"37.png"
-   },
-   {
-      "quest":"Calcolare il tempo medio di attesa (average waiting time) dei seguenti processi, assumendo una politica di scheduling Shortest Job First preemptive (SJF). Nel calcolo, si consideri trascurabile il tempo necessario ad eseguire il context switch:",
-      "answers":[
-         "6",
-         "5.75",
-         "4.5",
-         "5"
-      ],
-      "correct":1,
-      "image":"38.png"
-   },
-   {
-      "quest":"Calcolare il tempo medio di attesa (average waiting time) dei seguenti processi, assumendo una politica di scheduling First Come First Served (FCFS) e che il processo A esegua all'istante t=2 una chiamata di I/O che si completerà dopo 4 unità di tempo, ossia all'istante t=6. Nel calcolo, si consideri trascurabile il tempo necessario ad eseguire il context switch:",
-      "answers":[
-         "4.5",
-         "5.5",
-         "7.5",
-         "6.5"
-      ],
-      "correct":0,
-      "image":"39.png"
-   },
-   {
-      "quest":"Calcolare il tempo medio di attesa (average waiting time) dei seguenti processi, assumendo una politica di scheduling First Come First Served (FCFS) e che il processo B esegua all'istante t=6 una chiamata di I/O che si completerà dopo 3 unità di tempo, ossia all'istante t=9. Nel calcolo, si consideri trascurabile il tempo necessario ad eseguire il context switch:",
-      "answers":[
-         "4.5",
-         "5.25",
-         "4",
-         "4.25"
-      ],
-      "correct":2,
-      "image":"40.png"
-   },
-   {
-      "quest":"",
-      "answers":[
-         "72",
-         "73",
-         "74",
-         "I dati sono insufficienti per rispondere alla domanda"
-      ],
-      "correct":1,
-      "image":"56.png"
-   },
-   {
-      "quest":"",
-      "answers":[
-         "23",
-         "24",
-         "25",
-         "I dati sono insufficienti per rispondere alla domanda"
-      ],
-      "correct":2,
-      "image":"57.png"
-   },
-   {
-      "quest":"",
-      "answers":[
-         "18",
-         "19",
-         "20",
-         "I dati sono insufficienti per rispondere alla domanda"
-      ],
-      "correct":0,
-      "image":"58.png"
-   },
-   {
-      "quest":"Il seguente Resource Allocation Graph (RAG) mostra un sistema il cui stato:",
-      "answers":[
-         "Dipende dalle scelte dello scheduler del sistema operativo",
-         "Presenta deadlock",
-         "Non presenta deadlock",
-         "È impossibile rispondere"
-      ],
-      "correct":2,
-      "image":"59.png"
-   },
-   {
-      "quest":"Il seguente Resource Allocation Graph (RAG) mostra un sistema il cui stato:",
-      "answers":[
-         "Dipende dalle scelte dello scheduler del sistema operativo",
-         "Presente deadlock",
-         "Non presenta deadlock",
-         "E’ impossibile rispondere"
-      ],
-      "correct":2,
-      "image":"60.png"
-   },
-   {
-      "quest":"Il seguente Resource Allocation Graph (RAG) mostra un sistema il cui stato:",
-      "answers":[
-         "Sicuramente presenta deadlock",
-         "Potrebbe presentare deadlock",
-         "Sicuramente non presenta deadlock",
-         "E’ impossibile rispondere"
-      ],
-      "correct":2,
-      "image":"61.png"
-   },
-   {
-      "quest":"Il seguente Resource Allocation Graph(RAG) mostra un sistema che:",
-      "answers":[
-         "Sicuramente presenta deadlock",
-         "Potrebbe presentare deadlock",
-         "Sicuramente non presenta deadlock",
-         "E’ impossibile rispondere"
-      ],
-      "correct":0,
-      "image":"62.png"
-   },
-   {
-      "quest":"Si consideri un disco magnetico composto da 100 cilindri/tracce, numerati da 0 a 99 (0 indice del cilindro/traccia più esterno/a rispetto al centro del disco), la cui testina si trova inizialmente sul cilindro 11. Si calcoli il numero di cilindri/tracce attraversate dalla testina del disco, assumendo che la sequenza di richieste: 24, 16, 77, 49, 82 venga gestita da un algoritmo di scheduling SCAN (non-ottimizzato), che la testina si stia muovendo verso l'esterno (i.e., verso i cilindri con numeri più bassi) e trascurando il tempo di rotazione.",
-      "answers":[
-         "76",
-         "87",
-         "46",
-         "93"
-      ],
-      "correct":2,
-      "image":""
-   }
-]
diff --git a/legacy/Data/Questions/so1_unive.txt b/legacy/Data/Questions/so1_unive.txt
deleted file mode 100644
index 077f11c..0000000
--- a/legacy/Data/Questions/so1_unive.txt
+++ /dev/null
@@ -1,311 +0,0 @@
-1) La tecnica di gestione della memoria con paginazione e tabelle delle pagine multilivello porta _______ dimensione della tabella delle pagine in memoria e _____ l’overhead di memoria nelle operazioni di gestione.
-v "ad una riduzione della" e "può ridurre"
-> "ad un aumento della" e "può aumentare"
-> "ad un aumento della" e "può ridurre"
-> "ad una riduzione della" e "può aumentare"
-
-2) La tecnica di gestione della memoria con paginazione basata su tabella inversa delle pagine _______ l’indirizzo della memoria secondaria e la tabella ha una dimensione pari alla cardinalità del _______.
-> "non memorizza" e "numero di pagine riferite"
-v "non memorizza" e "numero di page frame"
-> "memorizza" e "numero di page frame"
-
-3) La tecnica di gestione della memoria con paginazione e sostituzione delle pagine ‘Far’ sostituisce la pagina più lontana nel grafo delle pagine da _______, dove il grafo rappresenta le pagine come _______.
-> "l'ultitima pagina riferita" e "nodi"
-> "qualsiasi pagina riferita" e "entità"
-v "qualsiasi pagina riferita" e "nodi"
-
-4) Nella gestione della memoria basata sulla segmentazione si possono verificare errori di traduzione, nella traduzione si controllano i campi _____ e si può avere un’eccezione di _______
-v "bit di residenza, di protezione, di lunghezza" e "overflow del segmento / protezione del segmento"
-> "bit di validità" e "validità del segmento"
-> "bit di residenza, e di validitù" e "overflow del segmento / protezione del segmento"
-
-5) Le strategie di sostituzione di pagina globali rispetto a quelle locali _______
-> non ignorano i comportamenti dei singoli processi.
-> tengono conto dello stato del processo
-v ignorano i comportamenti dei singoli processi.
-
-6) La strategia di sostituzione di pagina a orologio _____
-v è una variante della strategia FIFO
-> è una variante della strategia LIFO
-> ignora possibili collisioni
-
-7) Il modello working set nella gestione della memoria con paginazione si basa sull’osservazione della dipendenza del _______ dalla quantità di memoria per le pagine di un processo.
-v tasso di page fault
-> grado di multiprogrammazione
-> tempo in cui una pagina è caricata in memoria
-
-8) Il working set definisce un ______ durante l’intervallo di tempo [t – w, t]
-> tempo limite
-v insieme di pagine riferite
-> approssimazione
-
-9) La strategia del working set unito all’algoritmo del clock per gestire i page fault si basa su una ______
-v lista circolare
-> coda di massima priorità
-> lista doppiamente linkata
-
-10) Nella gestione della memoria virtuale, la tecnica di traduzione dell'indirizzo da virtuale a reale si basa sulla tabella delle pagine. Per migliorare le prestazioni della traduzione in alcuni casi tale tabella _____. E Per la miglior gestione della sostituzione di pagine si usano ______
-v "può essere tutta o in parte inserita in memoria associativa" e "bit di modifica e di riferimento"
-> "può essere inserita interamente in memoria secondaria" e "bit di modifica e di riferimento"
-> "può essere tutta o in parte inserita in memoria associativa" e "variabili globali"
-
-11) Nella tecnica di paginazione per la gestione della memoria, la scelta della dimensione della pagina di piccole dimensioni ______ la frammentazione interna, _____ la quantità di memoria per mantenere il working set di un processo e può ______ la dimensione della tabella delle pagine.
-v "può ridurre" e "può ridurre" e "aumentare"
-> "può ridurre" e "può ridurre" e "dimunuire"
-> "può aumentare" e "può aumentare" e "aumentare"
-
-12) La tecnica di gestione basata su DMA permette di interagire con il dispositivo ______ e le interruzioni ______
-v "indipendentemente dalla CPU" e "sono ridotte"
-> "tramite la CPU" e "sono ridotte"
-> "indipendentemente dalla CPU" e "possono aumentare"
-
-13) In un file system quando ad un record fisico corrisponde un record logico si parla di file con ______
-v record non bloccati
-> indipendenza logica
-> record bloccanti
-
-14) La variazione della posizione fisica di un file rende un hard link non valido e un soft link _____ 
-v rimane valido
-> viene invalidato di conseguenza
-
-15) In un file system la dimensione di un blocco influenza alcuni indici di prestazioni. All’aumentare della dimensione del blocco si osserva ______ e _____
-> "un minor spreco di spazio" e "un maggior spreco di tempo"
-> "un minor spreco di spazio" e "un minor spreco di tempo"
-v "un maggior spreco di spazio" e "un minor spreco di tempo"
-
-16) Per migliorare le prestazioni del file system con il metodo della allocazione non contigua e tabellare si usa una tabella per memorizzare i puntatori ai blocchi. La sua dimensione cresce con ______
-> il solo aumentare dei puntatori ai blocchi
-> il solo aumentare dei blocchi
-v #blocchi x indirizzo di blocco
-
-17) In una allocazione contigua di file su un dispositivo di memoria secondaria, considerando un disco, i record logici sono ______. Questa tecnica permette generalmente di ottenere ______ prestazioni; inoltre può dare luogo al fenomeno della ______. 
-> "fisicamente adiacenti" e "buone" e "frammentazione interna"
-v "fisicamente adiacenti" e "scarse" e "frammentazione esterna"
-> "fisicamente adiacenti" e "scarse" e "frammentazione interna"
-
-18) In un file system le tecniche di backup e recovery includono backup fisico e logico. Il backup incrementale si applica per _____
-v il backup logico che memorizza solo i dati del file system che sono stati modificati rispetto al backup precedente
-> dati critici o sensibili
-> risorse limitate
-> ripristino rapido
-
-19) Per effettuare backup e recovery in file system si utilizzano principalmente tecniche di _____. Un backup incrementale si basa su ______. Un backup logico ha il vantaggio di _____.
-> "esportazione delle copie" e "memorizzazione dei dati critici o sensibili" e "garantire i dati in ogni copia"
-v "ridondanza con copie multiple" e "memorizzazione dei soli dati modificati all’ultimo backup" e "mantenere la struttura del file system"
-> "ridondanza con copie multiple" e "memorizzazione dei dati di tutti i backup" e "mantenere la struttura del file system"
-
-20) Nella gestione dei dispositivi di I/O i metodi che comprendo l’ I/O programmato con busy waiting che è caratterizzato da ______.
-> complessità esponenziale
-> la necessità di performance discrete
-v semplicità
-
-21) Nella gerarchia di gestione dei dispositivi di I/O i gestori degli interrupt ______ dall’utente e si trovano concettualmente ______ dei driver dei dispositivi. Un driver di dispositivo si trova tipicamente ______
-v "non sono visibili" e "sotto livello" e "nel nucleo"
-> "non sono visibili" e "sotto livello" e "a livello applicazione"
-> "visibili" e "sotto livello" e "nel nucleo"
-> "visibli" e "sotto livello" e "a livello applicazione"
-
-22) I sistemi RAID per la gestione dei dischi per incrementare l’affidabilità usano un meccanismo di ______, per incrementare le prestazioni usano _____ 
-v "ridondanza" e "distribuzione e partizione sulle copie dei dischi trasparenti"
-> "trasparenza" e "copie scalabili orizzontalmente"
-> "ridondanza" e "copie di blocchi di memoria salvati nella memoria secondaria secondo algoritmi appositi"
-
-23) Gli algoritmo di scheduling del disco di tipo SCAN includono il C-SCAN che _____, le varianti ‘Freeze’ e ‘N-step’ che _____.
-> "aumenta inizialmente i tempi di risposta a favore di una maggiore organizzazione dei dati per accessi futuri" e "permettono di velocizzare la ricerca"
-v "riduce la varianza dei tempi di risposta, a scapito del throughput e del tempo medio di risposta" e "prevengono l’attesa infinita / riducono la varianza dei tempi di risposta."
-> "riduce il tempo di latenza" e "possono portare a una lunga latenza di accesso se le richieste sono disperse su posizioni diverse del disco"
-
-24) Il primo algoritmo di scheduling SCAN ricerca del cilindro _____
-v tempo più breve di seek in una direzione preferita
-> tempo più lungo di seek in una direzione preferita
-> nessuna delle precedenti
-
-25) La formattazione di un disco con la tecnica dell’interleaving si applica per gestire il problema ______
-v della deviazione del cilindro tra le tracce
-> della fremmentazione
-> della latenza casuale
-> della complessità di allucazione dei file
-
-26) L’algoritmo di scheduling del disco Shortest Seek Time First fornisce ______ rispetto all algoritmo FIFO. 
-> nessuna delle altre
-v throughput maggiore
-> throughput minore
-> latenza maggiore
-
-27) L’algoritmo di scheduling del disco SCAN si basa su una ricerca del cilindro  ______
-> cercando i dati più vicino alle posizioni correnti delle teste di lettura/scrittura del disco.
-v in direzioni variabili quando si raggiunge un estremo
-> cercando i dati prioritizzando le posizioni più distanti delle teste di lettura/scrittura del disco
-
-28) Nel sistema operativo Windows, gli oggetti sono nomi di ____
-v risorse logiche
-> risorse fisiche
-> collegamenti simbolici
-
-29) Ogni oggetto nel sistema Windows: 
-> condivide delle risorse con altri oggetti
-> nessuna delle due
-v "può essere con o senza nome" e "può avere puntatori e handle (hanno significato diverso)"
-
-30) In un sistema operativo Windows le interruzioni sono organizzate in livelli di priorità che includono i livelli, nell’ordine, dal basso: _____ e i thread sono schedulati con una disciplina a _____ 
-> "hardware e critiche, chiamate differite, chiamate di procedura asincrone, passivo" e "Priority Scheduling"
-v "passivo, chiamate di procedura asincrone, chiamate differite, hardware e critiche" e " priorità di code round robin"
-> "passivo, chiamate di procedura asincrone, chiamate differite, hardware e critiche" e "Multilevel Feedback Queue Scheduling"
-
-31) Nel sistema operativo Windows, il nucleo NTOS include: 
-v Le tradizionali chiamate di sistema
-> le interfacce utente
-> nessuna delle precedenti
-
-32) Nel sistema operativo Windows, il livello Executive si trova:
-> sopra al livello nucleo
-> sotto al livello applicazione di sistema
-> sotto al livello applicazioni utenti
-> nel Kernel Executive Layer
-v sotto al livello nucleo
-
-33) Il sistema operativo Linux ha una organizzazione della memoria basata su ______. Le tabelle delle pagine sono organizzate ______. La memoria fisica è divisa in ____
-> "algoritmi di scheduling" e "in colonne" e "blocchi"
-> "paginazione" e "secondo uno schema creato al momento"  e "aree di utilizzo" 
-v "paginazione" e "su tre o quattro livelli" e "tre zone e in pagine"
-> nessuna delle precedenti
-
-34) Il sistema opeartivo Linux: 
-> e di tipo microkernel 
-v è di tipo monolitico, ma con componenti modulari
-> ha un kernel organizzato a livelli
-
-35) Nel sistema sistema opeartivo Linux con porting si intende:  
-> l'esportazione di componenti del kernel
-> l'aggiunta di feature da un kernel all'altro
-v il processo di modifica del nucleo per supportare una nuova piattaforma
-
-36) [GENERAZIONI] Algoritmi di scheduling di processi basati sui quanti di tempo
-v III Generazione
-> IV Generazione
-> I generazione
-> V Generaione
-> II Generazine
-
-37) [GENERAZIONI] Definizione e uso della memoria virutale:
-v III Generazione
-> IV Generazione
-> I generazione
-> V Generaione
-> II Generazine
-
-38) [GENERAZIONI] Interfacce grafiche: IV Generazione 
-> III Generazione
-v IV Generazione
-> I generazione
-> V Generaione
-> II Generazine
-
-39) Quale di queste istruzioni dovrebbe essere consentità solo in modalità nucleo disabilitare gli interrupt: _____; leggere il dispositivo che calcola l’ora corrente: _____; impostare il dispositivo che calcola l’ora corrente: ______;
-v "anche utente" e "anche utente" e "solo nucleo"
-> "solo nucleo" e "solo nucleo" e "solo nucleo"
-> "solo utente" e "solo nucleo" e "anche utente"
-
-40) [architetture ideali] efficienza e prestazioni:
-v monolitico
-> microkernel
-> a livelli
-
-41) [architetture ideali] flessibilità e modificabilità:
-> monolitico
-v microkernel
-> a livelli
-
-42) [architetture ideali] isolamento delle funzioni:
-> monolitico
-> microkernel
-v a livelli
-
-43) In un file system che contiene un insieme di record, un record fisico corrisponde a un record logico se si parla di file con :
-> record definiti
-v record non bloccati 
-> record bloccati 
-> record di dimensioni variabili
-
-44) L'uso di link in un file system permette di creare dei collegamenti ai file. Se un file viene ritoccato fisicamente nel sistema, un eventuale hard link al file ______ e un eventuale soft link ______ .
-> "rimane valido" e "diventa non più valido"
-> "rimane valido" e "diventa valido"
-v "diventa non più valido" e "rimane valido"
-> "viene collegato ad un diverso file" e "è indefinito"
-
-45) Considerare un sistema operativo della IV generazione, include la caratteristica "sviluppo di interfacce grafiche"?
-> no, nella V generazione
-> no, nella III generazione
-> no, nella II generazione
-v sì, nella IV generazione
-
-46) Considerare un sistema operativo della IV generazione, include la caratteristica "gestione vincoli real-time"?
-> no, nella V generazione
-v no, nella III generazione
-> no, nella II generazione
-> sì, nella IV generazione
-
-47) Considerare un sistema operativo della IV generazione, include la caratteristica "memoria virtuale"?
-> no, nella V generazione
-v no, nella III generazione
-> no, nella II generazione
-> sì, nella IV generazione
-
-48) Considerare un sistema operativo della IV generazione, include la caratteristica "scheduling di processi basato sul tempo"?
-> no, nella V generazione
-v no, nella III generazione
-> no, nella II generazione
-> sì, nella IV generazione
-
-49) Considerare un sistema operativo per un moderno sistema di elaborazione con connessione ad una rete. Il sistema operativo: 
-> aumenta il livello di comunicazione fra moduli
-> usa un approccio a livelli
-v supporta funzioni per connessione alla rete
-> nessuna delle precedenti
-
-50) Considerare un sistema operativo per un moderno sistema di elaborazione con connessione ad una rete. Il sistema operativo: 
-> aumenta il livello di comunicazione fra moduli
-v gestisce un sistema connesso alla rete
-> usa un approccio a livelli
-> gestisce un singolo client connesso alla rete
-
-51) I sistemi time-sharing e i sistemi con multiprogrammazione in che relazione sono fra loro?
-v il sistema time-sharing prevede anche multiprogrammazione
-> il sistema time-sharing dipende dal livello di multiprogrammazione
-> il sistema con multiprogrammazione può comportarsi come un sistema time-sharing 
-
-52) Considerando gli stati di un processo, se un processo è dispatched se:
-> passa dallo stato "Esecuzione" allo stato "Pronto"
-> passa dallo stato "Esecuzione" allo stato "Bloccato"
-> passa dallo stato "Bloccato" allo stato "Pronto"
-v passa dallo stato "Pronto" allo stato "Esecuzione"
-
-52) Considerando gli stati di un processo, un processo che riceve una notifica attesa di un evento:
-> passa dallo stato "Esecuzione" allo stato "Pronto"
-> passa dallo stato "Esecuzione" allo stato "Bloccato"
-v passa dallo stato "Bloccato" allo stato "Pronto"
-> passa dallo stato "Pronto" allo stato "Esecuzione"
-
-53) Considerando gli stati di un processo, se il processo si blocca in attesa di un evento esterno:
-> passa dallo stato "Esecuzione" allo stato "Pronto"
-v passa dallo stato "Esecuzione" allo stato "Bloccato"
-> passa dallo stato "Bloccato" allo stato "Pronto"
-> passa dallo stato "Pronto" allo stato "Esecuzione"
-
-54) In una allocazione contigua di file su un dispositivo di memoria secondaria, considerando un disco, i record logici sono _____ .
-> dipendenti l'uno dall'altro 
-> anche fisici
-v fisicamente adiacenti
-> fisicamente lontani l'uno dall'altro
-
-55) L'allocazione contigua di file su un dispositivo di memoria secondaria, considerando un disco, permette generalmente: 
-> di ottenere ottime prestazioni
-> frammentazione interna 
-v di ottenere scarse prestazioni
-> nessuna delle precedenti
-
-55) L'allocazione contigua di file su un dispositivo di memoria secondaria, considerando un disco, permette generalmente: 
-> di ottenere ottime prestazioni
-> frammentazione interna 
-v frammentazione esterna
-> nessuna delle precedenti
\ No newline at end of file
diff --git a/legacy/Data/Questions/so2.txt b/legacy/Data/Questions/so2.txt
deleted file mode 100644
index 9831a40..0000000
--- a/legacy/Data/Questions/so2.txt
+++ /dev/null
@@ -1,1220 +0,0 @@
-1. A quanti gruppi può appartenere un utente nel SO Linux?
-v Ad almeno un gruppo
-> Ad un solo gruppo
-> A zero o più gruppi
-
-2. Si supponga che nel sistema esiste un gruppo "studente" ed anche l'utente "utente1".
-Si supponga quindi di eseguire il comando <code>adduser utente1 studente</code>.
-Quale delle seguenti affermazioni è sbagliata?
-v Il comando genera un errore perché per aggiungere un utente ad un gruppo si può utilizzare solo il comando addgroup 
-> Se "utente1" non appartiene al gruppo "studente" lo aggiunge a tale gruppo altrimenti non lo aggiunge
-> Aggiunge utente1 al gruppo studente oppure genera un messaggio del tipo L'utente «utente1» fa già parte del gruppo «studente»
-
-3. Si supponga che nel sistema esiste un gruppo "studente" e non esista ancora l'utente "utente1".
-Si supponga quindi di eseguire il comando <code>sudo adduser utente1 studente</code>
-Quale sarà il risultato?
-v Da errore perché utente1 non esiste
-> Crea utente1 e, oltre a creare il gruppo utente1 lo aggiunge al gruppo studente
-> Crea utente1, lo aggiunge al gruppo studente e non crea il gruppo utente1
-
-4. Supponga di eseguire, come utente sudoer, i seguenti comandi: C1) sudo ls /home, C2) sudo su --command=’ls /homè. Quale affermazioneè corretta?
-> C2 da errore "comando non trovato"
-v C1 e C2 sono equivalenti
-> C2 esegue una setUID mentre C1 no
-
-5. Quale è la differenza tra i comandi sudo e su
-> sudo è un comando che permette di eseguire altri comandi come root; su è una scorciatoia per invocare il comando sudo
-v su è un comando che permette di cambiare utente. sudo è un camando che permette di eseguire altri comandi come super-utente 
-> sudo si riferisce ad un gruppo di utenti. su è invece un comando che permette di cambiare utente
-
-6. Di quante sezioni è composto il man di Linux?
-> 5
-> 7
-v 9
-
-7. Supponga di voler creare un file vuoto e di voler settare il tempo di ultimo accesso al "2 giugno 2020 ore 12:00". Quale dei seguenti comandi è corretto?
-v touch -at202006021200 filename
-> touch -cat202006021200 filename
-> touch -ct202006021200 filename
-
-8. Quale è il risultato del comando touch nomefile?
-> Crea un file vuoto con nome nomefile
-v Aggiorna, al tempo corrente, gli atttributi atime e mtime di nomefile 
-> Crea un file vuoto con nome nomefile e ctime uguale al tempo corrente. Se si usa l'opzione -t o -d si può specificare un altro tempo di creazione 
-
-9. I premessi di acceesso della directory /tmp sono <code>1777/drwxrwxrwt</code>
-Cosa significa?
-> Il bit SetGid è settato
-> Lo sticky bit non è settatto
-v Lo sticky bit è settato
-
-10. Supponga di voler mostrare l’albero delle directory con radice dir1 e con profondità 3.
-Quale tra i seguenti comandi è il più apprropriato usare?(uscito 2 volte)
-> tree -d 3 dir1
-v tree -L 3 dir1
-> tree --max-depth=3 dir1
-
-11. Supponiamo vogliate visualizzare l’albero delle directory con radice nella vostra home. In particolare volete visualizzare solo le directory e non i file in esse contenuti.
-Quali tra i seguenti comandi è il più appropriato?
-v tree -d ~
-> tree -d -L 3 /home/myhomedir
-> tree -a ~
-
-12. Si supponga di avere un file di testo (filein) e di voler copiare in un altro file (fileout) i primi 100 caratteri. Quale di questi comandi è corretto?
-v dd if=filein of=fileout bs=100 count=1
-> dd if=filein of=fileout bs=1 skip=1 count=100
-> dd if=filein of=fileout bs=10 skip=10 count=10
-
-13. Si supponga di avere un file di testo (filein) contenente 1000 caratteri e di voler copiare in un altro file (fileout) 100 caratteri a partire dal decimo. Quale di questi comandi non produce il risultato atteso?
-> dd if=filein of=fileout bs=1 skip=10 count=100
-v dd if=filein of=fileout bs=100 seek=10 count=1
-> dd if=filein of=fileout bs=10 skip=1 count=10
-
-14. Quanti job in background crea il comando seguente?
-<code>sleep 30 | sleep 15 | sleep 10 &</code> 
-v 1
-> Nessuno, da errore
-> 3
-
-15. Quanti file system principali ha linux?
-> dipende dal numero di filesystem mondati al boot
-v 1
-> dipende dal numero di dischi installati
-
-16. In che file è contenuta la lista dei filesystem montati al boot?
-> /etc/mdev
-> /etc/mtab
-v /etc/fstab
-
-17. perché il comando passwd (ovvero il file eseguibile /usr/bin/passwd) ha il SetUID bit settato?
-v Per consentire a qualsiasi utente di modificare la propria password
-> Per evitare che un utente possa cancellare il file eseguibile passwd
-> Per evitare che un utente possa modificare le password degli altri utenti
-
-18. Supponiamo di avere il seguente makefile (memorizzato in un file di nome makefile):
-<pre>merge_sorted_lists: merge_sorted_lists.c
-gcc -Wall -Wextra -O3 merge_sorted_lists.c \
--o merge_sorted_lists
-sort_file_int: sort_file_int.c
-gcc -Wall -Wextra -O3 sort_file_int.c \
--o sort_file_int
-.PHONY: clean
-clean:
-rm -f *.o merge_sorted_lists</pre>
-supponendo che non esistono entrambi i file merge_sorted_lists e sort_file_int e lanciando il comando make, quale target viene eseguito?
-<b>Adesso posso scrivere in bold con l'HTML nelle domande yeee</b>
-v merge_sorted_list
-> entrambi
-> nessuno dei due. Va specificato quale vogliamo eseguire con il comando make <nome_target>
-
-19.	Assumiamo di compilare un file .c nei seguenti modi
-<pre>gcc file.c -o file1.o
-gcc -g file.c -o file2.o
-</pre>
-perché le dimensioni di file2.o sono diverse da quelle di file1.o?
-> perché file2.o è stato ottimizzato, per occupare meno spazio in memoria, rispetto a file1.o
-v perché file2.o contiene informazioni aggiuntive rispetto a file1.o utili per il debug
-> non è vero che i due comandi di compilazione producono file di dimensioni diverse
-
-20.	Assuma di avere due shell aperte, etichettate come shell_1 e shell_2 e supponga di eseguire la sequenza di comandi che segue
-(shell_i: cmd indica che cmd è eseguitto nella shell_i, i=1,2).
-<pre>shell_1: xterm
-shell_2: ps -C xterm
-#restituisce xtermPID
-shell_2: kill -s SIGSTOP xtermPID
-shell_2: kill -s SIGCONT xtermPID</pre>
-Quale è il loro effetto su processo xterm?
-<code>
-(NOTA BENE: la risposta 3 viene data come corretta all'esame, anche se errata)
-</code>
-> Il processo xterm viene prima mandato in esecuzione in background e poi riportato in foreground
-v Il processo xterm viene mandato in esecuzione in background 
-> Il processo xterm viene prima portato nello stato stopped (T) e poi mandato in esecuzione in foreground
-
-21.	Si assuma di avere due shell aperte, etichettate come shell_1 e shell_2 e si consideri la seguente sequenza di comandi
-(shell_i:cmd indica che cmd è eseguitto nella shell i, i=1,2)
-<pre>shell_1: xterm
-shell_2: ps -C xterm
-#restituisce xtermPID
-shell_2: kill -s SIGSTOP xtermPID</pre>
-Quale è il loro effetto?
-> Il processo xterm viene terminato con segnale SIGSTOP
-> Il processo xterm viene mandato in esecuzione in background
-v Il processo xterm viene messo in stato stopped (T)
-
-22.	Supponga di avere 2 file hw1.c e hw2.c contenenti il seguente codice(uscita 2 volte)
-hw1.c:
-<pre>#include <stdio.h>
-#include "hw2.c"
-int f(int argc, char *args[]) {
-  printf("Hello World!\n");
-  return 256;
-}
-</pre>
-hw2.c:<pre>
-int f(int argc, char *args[]);
-int main(int argc, char *args[]) {
-  return f(argc, args);
-}
-</pre>
-Quale dei seguenti comandi di compilazione genera errore?
-> gcc -Wall hw1.c -o hw.out
-v gcc -Wall hw1.c hw2.c -o hw.out
-> gcc hw1.c
-
-23.	Supponiamo di avere il file eseguibile (ottenuto dalla compilazione di una programma C) mioprogramma
-Questi due modi di invocare il programma sono equivalenti?
-<code>$ ./mioprogramma A B C</code>
-<code>$ ./mioprogramma < input.txt</code>
-dove input.txt contiene A B C
-v no, nel primo caso A B C vengono caricati in argv, nel secondo caso vengono inviati sullo stdin
-> dipende dalla logica del codice
-> si sono equivalenti
-
-24.	Quale è la differenza tra thread posix e processo linux (uscito 2 volte)
-> Thread concorrenti condividono codice, segmento dati e file; i processi concorrenti pure
-> Thread concorrenti condividono lo stack; i processi concorrenti anche
-v Thread concorrenti condividono codice, segmento dati e file; i processi concorrenti no
-
-25.	Per mostare il pid dei job in esecuzione in backgroud quali di questi comandi è corretto?
-v jobs -p
-> ps -p -u
-> jobs
-
-26. Quale di queste stringhe non è valida come identificatore in C?
-> _voltage
-> rerun
-v x-axis
-
-27. Quale di queste stringe è valida come identificatore in C?
-v _voltage
-> x-ray
-> return
-
-28. Si consideri la seguente funzione  f
-<pre>char *f(char *a, const char *b, size_t n) {
-    size_t i;
-    for (i = 0; i < n && b[i] != '\0'; i++)
-        a[i] = b[i];
-    for ( ; i < n; i++)
-           a[i] = '\0';
-        return a;
-}</pre>
-Cosa  produce come risultato quando eseguita?
-> Copia esattamente n caratteri della stringa b nella stringa a e restituisce a
-> Concatena al piò n caratteri della stringa  b alla stringa a e restituisce a
-v Copia al piò n caratteri della stringa b nella stringa a e restituisce a
-
-29. Si consideri la seguente funzione  f
-<pre>char *f(char *a, const char *b, size_t n) {
-    size_t l = strlen(a);
-    size_t i;
-    for (i = 0 ; i < n && b[i] != '\0' ; i++)
-        a[l + i] = b[i];
-    a[l + i] = '\0';
-return a;
-}</pre>
-Cosa  produce come risultato quando eseguita?
-> Copia al piò n caratteri della stringa b in a e restituisce a
-> Copia esattamente n caratteri della stringa b nella stringa a e restituisce a
-v Concatena i primi n caratteri della stringa b alla stringa  a  e restituisce a
-
-30. Si consideri la seguente dichiarazione di struttura
-<pre>struct point2D {
-    double x; // coordinata x
-    double y; // coordinata y
-}  pA={0, 0}, pB={1, 5};</pre>
-Quale delle seguenti assegnazioni è corretta?
-> pA -> x = pB -> x; pA -> y = pB -> y;
-> pA = &pB
-v pA = pB;
-
-31. Si consideri il seguente ciclo for
-<pre>int scoreCount, a;
-for(scoreCount=0; scanf("%d",&a)==1; scoreCount++);</pre>
-Cosa produrebbe come risultato, se eseguito?
-> Legge una sola volta da stdin e  poi termina, qualunque sia l'input
-> Legge  da stdin senza mai terminare
-v Legge ripetutamente numeri interi da stdin fintanto che è fornito un input di tipo diverso (ad esempio un carattere)
-
-32. Consideri  il seguente frammento  di codice
-<pre>int *ptr = malloc(sizeof(int));
-ptr = ptr+1;</pre>
-assumendo la malloc assegni a ptr la locazione di memoria 0x55c2b1268420 cosa contiene ptr dopo l’incremento?
-> <code>0x55c2b1268421</code>
-> l'incremento della variabile prt genera un errore di segmentazione in fase di esecuzione
-v <code>0x55c2b1268424</code>
-
-33. Cosa  stampa su stdout la seguente chiamata a printf? 
-<code>printf("aaaaa\nbbbbb\f\rccccc\r\fddddd\reeeee\n");</code>
-v aaaaa bbbbb ccccc eeeee
-> aaaaa bbbbb ccccc ddddd
-> aaaaa bbbbb ccccc ddddd eeeee
-
-34. Si consideri il seguente frammento di codice
-<pre>char **mptr, **mptr1, *ptr1;
-int i;
-mptr = calloc(10,sizeof(char *));
-mptr1 = mptr;
-for(i=0;i<10;i++){
-    mptr[i]=(char *)malloc(10);    
-}</pre>
-Per de-allocare tutta la memoria allocata, quale delle seguenti opzioni è coretta?
-> for(i=0;i<10;i++) free(mptr1[i]);
-v for(i=0;i<10;i++) free(mptr1[i]); free(mptr1);
-> free(mptr1);
-
-35. Si consideri il seguente frammento di codice
-<pre>char **mptr, *ptr1;
-int i;
-mptr = calloc(10,sizeof(char *));
-for(i=0;i<10;i++){
-    mptr[i]=(char *)malloc(10);    
-}</pre>
-Quale delle seguenti strategie di de-allocazione crea un memory leakage?
-> free(mptr);
-> for(i=0;i<10;i++) free(mptr[i]);
-v entrambe, ovvero sia (1) che (2)
-
-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?
-v perché cerca il file "stdio.h" nella directory corrente
-> La compilazione non genera errori a meno che il file non esista nel filesystem
-> perché il file stdio.h potrebbe non esistere
-
-37. Quale delle seguenti dichiarazioni di variabile inizializza una stringa?
-> <code>char r[10] = {`L´,`9´,` ´,`4´,`a´,`p`,`r´};</code>
-v <code>char r[] = ``L9 4apr´´;</code>
-> <code>char r[] = {`L´,`9´,` ´,`4´,`a´,`p`,`r´};</code> 
-
-38. Quale è il modo corretto per controllare che due stringhe str1 e str2 sono uguali?
-<code>if strcmp(s1,s2)==0 { printf("stringhe uguali") }</code>
-<code>if (s1==s2) { printf("stringhe uguali") }</code>
-<code>if strcmp(s1,s2) { printf("stringhe uguali") }</code>
-
-39. Si consideri il seguente frammento di codice
-<pre>
-FILE * pFile;
-pFile = open("myfile.txt","rw+");
-fprintf(pFile, "%f %s", 3.1416, "PI");
-</pre>
-Assumendo che myfile.txt non esiste, quale delle seguenti affermazioni è vera?
-v Il programma genera  un errore in fase di esecuzione
-> Il programma genera errore in fase di compilazione
-> Il programma scrive sul file myfile.txt la stringa 3.1416 PI
-
-40. Cosa fa il seguente segmento di codice se eseguito?
-<pre>scanf(“%d",&num); 
-do; {
-printf(“%d\n",num); 
-scanf(“%d",&num);
-}  while(num!=0);</pre>
-> Stampa il valore di num almeno una  volta
-> Cicla infinitamente se num è diverso da 0
-> Popipopi S.p.A. > CD Click s.r.l.
-v Genera errore  in fase di compilazione
-
-41. Si consideri il frammento di codice
-<pre>i=0; c=0; p=1;
-while (i++ < 10)
-c=c+1;
-p--;</pre>
-che valore conterrà p al termine dell'esecuzione del frammento di codice?
-v 0
-> -10
-> -9
-
-42. Supponiamo di eseguire  separatamente i seguenti frammenti di codice
-<b>Frammento_1</b>
-<pre>close(2);
-if (fopen(".","r")) {
-           perror("main");
-}</pre>
-<b>Frammento_2</b>
-<pre>close(2);
-if (fopen(".","r")) {
-               printf("main: %s \n", strerror(errno));
-}</pre>
-Quale delle seguenti affermazioni è falsa?
-> Il frammento_1 non produce alcun output sul terminale
-v La loro esecuzione produce sul terminale due stringhe identiche
-> Il frammento_2 produce un output sullo stdout
-
-43. Consideriamo queste due line di codice
-1. <code>printf("main:%s\n",strerror(errno));</code>
-2. <code>perror("main");</code>
-Quali delle seguenti affermazioni è corretta?
-<code>
-(NOTA BENE: la risposta 1 viene data come corretta all'esame, anche se in realtà differiscono di uno spazio)
-</code>
-v Producono stringhe diverse e la prima la invia su stdout mentre la seconda su stderr.
-> Inviano la stessa stringa su stdout
-> producono la stessa stringa ma la 1 la invia su stdout, mentre la 2 su stderr 
-
-44. Quale delle seguenti funzioni di libreria alloca memoria nello stack?
-> void *calloc( size_t nmemb, size_t size );
-v void *alloca( size_t size );
-> void *malloc( size_t size );
-
-45. Un processo può allocare memoria nello stack?
-> no un processo può allocare memoria sono nell'heap
-> si mediante la funziona di libreria malloc(3)
-v si mediante la funzione di libreria alloca(3) 
-
-46. Quale è la differenza tra la system call _exit(2) e la funzione di libreria exit(3)? (uscita 2 volte) 
-> _exit(2) chiude tutti i file descriptor mentre exit(3) no
-v _exit(2) non invoca gli handler registrati con  atexit e on_exit mentre exit(3) li invoca
-> _exit(2) invoca gli handler registrati con atexit e on_exit mentre exit(3) non li invoca
-
-47. Quale attributi di un processo sono ereditati dal processo figlio?
-> parent pid, timer, contatori risorse 
-v working directory, descrittori dei file, memoria condivisa
-> timer, lock, coda dei segnali
-
-48. Si consideri il seguente frammento di codice
-<pre>pid_t pID = fork();
-if (pID == 0) {
-    Blocco_1
-} else if (pID < 0) {
-    Blocco_2
-} else {
-  Blocco_3
-}</pre>
-Quale blocco di codice (tra Bloccco_1,  Blocco_2 e  Blocco_3) verrà eseguito dal processo figlio?
-> Blocco_3
-v Blocco_1
-> Blocco_2
-
-49. Si consideri il seguente frammento di codice
-<pre>pid_t pID = fork();
-if (pID == 0) {
-    Blocco_1
-} else if (pID < 0) {
-    Blocco_2
-} else {
-  Blocco_3
-}</pre>
-Quale blocco di codice (tra Bloccco_1,  Blocco_2 e  Blocco_3) verrà eseguito dal processo padre?
-v Blocco_3
-> Blocco_1
-> Blocco_2
-
-50. Supponiamo che la system call
-<code>pid_t waitpid(pid_t pid, int *status, int options);</code>
-sia invocata con valore di pid uguale a 0. Quale è il suo comportamento?
-Scegli un'alternativa:
-> attende la terminazione di qualunque processo figlio il cui gruppo ID del processo sia diverso da quello del processo chiamante
-v attende la terminazione di qualunque processo figlio il cui gruppo ID  sia uguale a quello del processo chiamante (ovvero il processo padre)
-> attende la terminazione di qualunque processo figlio
-
-51. Si consideri  il seguente frammento  di codice  (i numeri a lato sono i numeri di riga delle istruzioni)(uscita 2 volte)
-<pre>1.    Pthread_t tid;
-2.    pthread_create(&tid, ... )
-3.    pthread_create(&tid, ...)
-4.    pthread_join(tid, ...);
-5.    printf("joined");</pre>
-quale  delle seguenti affermazioni è falsa?
-> la stringa "joined" è inviata su stdout solo quando  il thread creato a riga 3 è terminato
-v la stringa "joined" è inviata su stdout quando entrambi i thread sono terminati
-> la chiamata pthread_join(...) attende la terminazione del thread con identificatore tid
-
-52. Si considerino i seguenti frammenti di codice  (R1 e R2)
-<pre>R1: strPtr=(char *) calloc(SIZE_OF_ARRAY, sizeof(char) );
-R2: strPtr=(char *) malloc(SIZE_OF_ARRAY);
-    memset(strPtr, ´\0´, SIZE_OF_ARRAY);</pre>
-v R1 e R2 producono lo stesso risultato
-> R2 dopo aver allocato la memoria la inizializza, mentre R1 no
-> 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.
-
-53. Consideriamo la seguente invocazione della funzione realloc
-<code>strptr1=(char *) realloc(strptr, 10 * SIZE_OF_ARRAY);</code>
-strptr1 può essere diverso da strptr?
-> si, la realloc modifica sempre l'indirizzo di partenza dell'area di memoria ridimensionata
-> no, strptr1 è sempre uguale a strptr
-v sì se a seguito del ridimensionamento della memoria allocata non è possibile trovare un numero sufficiente di locazioni contigue a partire dal strptr 
-
-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.
-Quale, tra  le system call, o combinazione di system call di seguito riportate è possibile utilizzare?
-v sigaction(2)
-> sigaction(2) seguita da una fork(2) che esegue l’handler del segnale
-> signal(2) seguita da una fork(2) che esegue l’handler del segnale
-
-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?
-> open( "filename", O_RDWR | O_CREAT | S_IRUSR | S_IWUSR);
-> open("filename",O_RDWR | O_CREAT, S_IRUSR & S_IWUSR);
-v open( "filename", O_RDWR | O_CREAT, S_IRUSR | S_IWUSR);
-
-56. Si consideri la system call
-<pre>int open(const char *pathname, int flags);
-nel caso venga invocata con il flag impostato a
-O_CREAT | O_EXCL | O_RDONLY</pre>
-Quale è il comportamento atteso?
-v Se il file non esiste viene creato ed aperto in lettura, se invece esiste ritorna errore
-> Se il file non esiste lo crea e lo apre in lettura, altrimenti lo apre in lettura
-> 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
-
-57. Si consideri il seguente frammento di codice
-<pre>char* file = argv[1];
-int fd;
-struct flock lock;
-fd = open (file, O_WRONLY);
-memset (&lock, 0, sizeof(lock));
-lock.l_type = F_WRLCK;
-fcntl (fd, F_SETLKW, &lock);
-....</pre>
-Quale è il suo comportamento?
-> mette un lock mandatory in scrittura sul file file
-> mette un lock advisory in scrittura sul file file
-v mette un lock bloccante in scrittura sul file file.
-
-58. Quale è la differenza tra i seguenti frammenti di codice?
-<pre>C1: int fd, fd1;
-    fd=open(“filename", O_RDWR);
-    fd1=fd;
-</pre>
-<pre>C2: int fd,fd1;
-    fd=open(“filename", O_RDWR);
-    fd1=dup(fd);</pre>
-> Dopo l’esecuzione di C1 e C2 fd1 contiene lo stesso valore
-> Dopo l’esecuzione di C1 i due file descriptor puntano allo stesso file, mentre dopo l’esecuzione di  C2 il file filename viene duplicato
-v 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
-
-59. Si consideri  il  seguente frammento di codice
-<pre>int fd,fd1;
-struct stat buf,
-buf1;
-fd=open(“filename", O_RDWR);
-fd1=dup(fd); 
-fstat(fd,&buf);
-fstat(fd1,&buf1);</pre>
-v buf.st_ino è uguale a buf1.st_ino
-> buf.st_ino è diverso da buf1.st_ino
-> st_ino non è membro della struttura stat
-
-60. Supponiamo di avere il seguente  frammento di codice
-<pre>struct dirent *dentry; //directory stream
-    char *filename;
-    DIR *dstr=opendir(“mydir");
-    while ((dentry=readdir(dstr)) != NULL) {
-        /* Memorizzai nome file nella  directory  in filename  */
-         }</pre>
-Quale 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 ?
-v filename = dentry --> d_name;
-> filename = dentry.filename;
-> filename = dentry --> filename;
-
-61. Quali attributi di processo sono preservati dalla system call execve(2)?
-> Memory locks
-> Timer
-v Umask
-
-62. Si consideri la system call execve(2). Quale delle seguenti affermazioni è corretta?
-> 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)
-v la execve(2) permette di sostituire l'immagine di un processo con quella di un file eseguibile o di uno script di shell eseguibile
-> la execve(2) è una estensione della funzione system(3). Infatti, execve(2) può eseguire un qualsiasi programma, incluso uno script di shell.
-
-64. Supponiamo di aver mappato un file in memoria con la system call mmap(2). A cosa serve invocare la msync(2)?
-v 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. 
-> è necessario invocare sempre la msync(2) se non si vogliono perdere le modifiche fatte in memoria.
-> non serve invocare la mysinc perché quando si chiude il file descriptor tutte le modifiche fatte in memoria vengono scritte su disco
-
-65. Quale delle seguenti affermazioni sui processi Linux è falsa?
-> In un determinato istante, non possono esserci 2 processi distinti con lo stesso PID
-v Per creare i PID dei processi si usano dei numeri interi che crescono sempre
-> In istanti diversi, possono esserci 2 processi distinti con lo stesso PID
-> Ogni processo può conoscere il suo PID
-
-66. Quale delle seguenti affermazioni sui processi Linux è vera?
-> 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
-> Un processo diventa zombie se termina prima di almeno uno dei processi che abbia eventualmente creato
-> Ogni processo può conoscere il proprio PID, ma non quello del processo che l'ha creato
-v Con l'eccezione del primo processo, tutti i processi sono creati con una fork
-
-67. Quale delle seguenti affermazioni sui processi Linux è falsa?
-v Digitare un comando sulla shell genera sempre un nuovo processo
-> Esistono file che non possono essere eseguiti per diventare processi
-> Affinché un file possa diventare un processo è necessario che abbia i permessi di esecuzione
-> Qualsiasi computazione eseguita dal sistema operativo è contenuta dentro un qualche processo
-
-68. Quale delle seguenti affermazioni sui processi Linux è vera?
-v Eseguendo k volte un file eseguibile, si generano k diversi processi
-> Per poter lanciare un file eseguibile, è prima necessario aspettare che il comando precedente sia terminato
-> Tutti i processi sono sempre in stato di RUNNING
-> Un processo è sempre un'istanza di uno script bash
-
-69. Un programma scritto in linguaggio C:
-> Rappresenta le stringhe ESCLUSIVAMENTE come array di caratteri terminate dal carattere ‘\n’
-> Rappresenta le stringhe ESCLUSIVAMENTE come array di caratteri terminate dal carattere ‘^M’
-> Rappresenta le stringhe ESCLUSIVAMENTE come array di caratteri terminate dal carattere ‘0’
-v Rappresenta le stringhe come array di caratteri terminate dal carattere ‘\0’
-
-70. Quale delle seguenti affermazioni è vera?
-> Linus Torvalds ha riscritto i pacchetti di Unix, creando i pacchetti GNU
-> Tutte le opzioni sono false
-> Linus Torvalds ha scritto il primo kernel di Linux all'inizio degli anni '80
-v Richard Stallman ha descritto per primo la licenza GPL
-
-71. Quali delle seguenti affermazioni è vera?
-> A. Nessuna delle opzioni è vera
-> È possibile montare un filesystem solo se è dichiarato nel file /etc/fstab
-v È possibile montare un filesystem solo se è dichiarato nel file /etc/mtab
-> D. Ad ogni filesystem corrisponde un disco fisico o parte di esso (partizione)
-
-72. Si supponga di avere il seguente frammento di codice:
-<code>FILE *stream = fopen(NOMEFILE, "w");</code>
-Quale dei seguenti frammenti di codice ha lo stesso effetto?
-> <code>int fd = open(NOMEFILE, O_WRONLY | O_CREAT, 0666);</code>
-> <code>int fd = open(NOMEFILE, O_WRONLY | O_TRUNC);</code>
-> <code>int fd = open(NOMEFILE, O_WRONLY);</code>
-v <code>int fd = open(NOMEFILE, O_WRONLY | O_CREAT | O_TRUNC, 0666);</code>
-
-73. 10. (questa domanda ha una crisi d'identità) Quale delle seguenti affermazioni sulle syscall di Linux che riguardano i files è falsa?
-> 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
-v Per richiedere un lock su un file (o su una porzione di esso), occorre chiamare la syscall ioctl
-> È possibile usare la syscall select sia in modo bloccante che in modo non bloccante
-> Le syscall ioctl e fcntl ammettono 2 o 3 argomenti, a seconda dell'operazione
-
-74. 11. (☢ UNSAFE, segnalate a @notherealmarco se è corretta o meno 🙏) Quale delle seguenti affermazioni sui segnali Linux è vera?
-> Tutti i segnali, se non opportunamente catturati, provocano la terminazione del processo, con l'eccezione del segnale STOP
-> Per un processo è sempre possibile ridefinire il comportamento di un qualsiasi segnale
-> È possibile per un qualunque processo inviare un segnale ad un qualsiasi altro processo dello stesso utente
-v Nessuna delle altre affermazioni è vera
-
-75. 12. Quale delle seguenti affermazioni sugli errori delle syscall di Linux è vera?
-> 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);
-v Per stampare su stdout la spiegazione di un errore verificatosi in una syscall si può effettuare la seguente chiamata: printf("%s\n", strerror(errno));
-> Per stampare su stdout la spiegazione di un errore verificatosi in una syscall è sufficiente chiamare perror
-> Per stampare su stdout la spiegazione di un errore verificatosi in una syscall è necessario scrivere uno switch sulla variabile globale errno
-
-76. Si supponga di avere il seguente frammento di codice:
-FILE *stream = fopen("file_esistente.txt", "r");
-fseek(stream, -100, SEEK_END);
-long pos = ftell(stream);
-Quale dei seguenti frammenti di codice ha lo stesso effetto?
-a.<pre>
-int fd = open("file_esistente.txt", O_RDONLY);
-lseek(fd, -100, SEEK_END);
-long pos = lseek(fd, 0, SEEK_END);
-</pre>
-b.<pre>
-int fd = open("file_esistente.txt", O_RDONLY);
-lseek(fd, -100, SEEK_END);
-long pos = lseek(fd, 0, SEEK_CUR);
-</pre>
-c.<pre>
-int fd = open("file_esistente.txt", O_RDONLY);
-lseek(fd, -100, SEEK_END);
-long pos = lseek(fd, -100, SEEK_END);
-</pre>
-d.<pre>
-int fd = open("file_esistente.txt", O_RDONLY);
-lseek(fd, -100, SEEK_END);
-long pos = ltell(fd);
-</pre>
-> a
-v b
-> c
-> d
-
-76. Si consideri la seguente funzione <code>f</code>
-<pre>
-char *f(char *dest, const char *src, size_t n) {
-    size_t i;
-    for (i = 0; i < n && src[i] != '\0'; i++)
-        dest[i] = src[i];
-for ( ; i < n; i++)
-dest[i] = '\0';
-return dest;
-}
-</pre>
-Cosa produce come risultato quando eseguita?
-> Genera sempre errore in fase di esecuzione perché non c'è alcun controllo sulla dimensione delle stringhe
-> Concatena la stringa src a dest e restituisce dest
-v Copia la stringa src in dest e restituisce dest
-
-77. Si consideri il seguente frammento di codice
-<pre>
-sigset_t set, oset, pset;
-...
-sigemptyset( &set );
-sigaddset( &set, SIGINT );
-sigaddset( &set, SIGUSR1 );
-sigprocmask( SIG_BLOCK, &set, &oset );
-...
-</pre>
-v Prepara una sezione critica (ovvero dopo la sigprocmask può inizare la sezione critica)
-> Disabilita tutti i segnali tranne SIGINT e SIGUSR1
-> Termina una sezione critica precedentemente iniziata
-
-78. Sia mylink un hard link al file myfile (<code>ln myfile mylink</code>).
-Quale di queste afferrmazioni è vera?
-> myfile e mylink hanno dimensione diversa
-v myfile e mylink hanno lo stesso numero di inode
-> myfile e mylink hanno un diverso numero di inode
-
-79. Supponendo di essere "loggato" in una shell come utente1.
-Quali dei seguenti è un path assoluto?
-> dir1/dir11/dir112/filename
-v <code>~/utente1/dir1/dir11/dir112/filename oppure ~/dir1/dir11/dir112/filename</code>
-
-80. Si supponga che nel sistema esiste un gruppo "studente".
-Si supponga di voler creare "utente1" e di volerlo aggiungere al gruppo studente.
-Quale dei seguenti comandi è corrretto?
-v <code>adduser utente1; adduser utente1 studente</code>
-> <code>adduser utente1 utente1 studente</code>
-> <code>adduser utente1 studente</code>
-
-81. Si considerino le seguenti dichiarazioni di variabili:
-<pre>
-int vect[10];
-int *ptr = NULL;
-</pre>
-Quale delle seguneti assegnazioni è corretta per far sì che ptr contanga il puntatore al vettore vect?
-v ptr = vect;
-> ptr = &vect
-> ptr = vect[1];
-
-82. Si supponda di avere 2 file hw1.c e hw2.c contenenti il seguente codice
-<pre>
-hw1.c:
-#include <stdio.h>
-#include "hw.2.c"
-int f(int argc, char *args[]) {
-printf("Hello World!\n");
-return 256;
-}
-</pre>
-<pre>
-hw2.c:
-int f(int argc, char *args[]);
-int main(int argc, char *args[]) {
-return f(argc, args);
-}
-</pre>
-Quale dei seguneti comandi di compilazione non genera errore?
-v <code>gcc -Wall hw1.c hw2.c -o hw.out</code> oppure <code>gcc -Wall hw1.c -o hw.out</code>
-> <code>gcc -Wall hw2.c -o hw.out</code>
-
-83. Si consideri il seguente frammento di codice
-<pre>
-pid_t pID = fork();
-if (pID == 0) {
-    Blocco_1
-} else if (pID < 0) {
-    Blocco_2
-} else {
-    Blocco_3
-}
-</pre>
-Quale blocco di codice (tra Bloccco_1, Blocco_2 e Blocco_3) verrà eseguito nel caso in cui la fork non vada a buon fine?
-> Blocco_1
-> Blocco_3
-v Blocco_2
-
-84. Si consideri il seguente frammento di codice
-<pre>
-for (i=0;((i<n1)&&(i<n2));i++)
-    m2[i]=m1[i];
-</pre>
-quando termina il ciclo for?
-> Termina solo se n1 è uguale a n2
-> Quando si raggiunge il più grande tra n1 e n2
-v Quando si raggiunge il più piccolo tra n1 e n2
-
-85. A seguito di una chiamata a fork(2), quale dei seguenti attributi del processo padre non è ereditato dal processo figlio?
-> groups id
-v coda dei segnali
-> descrittori dei file
-
-86. Si consideri il seguente frammento di codice
-<pre>
-struct stat *s;
-fd=open(“filename");
-fchmod(fd,00744);
-fstat(fd,s);
-</pre>
-Per visualizzare su sdtout i permessi di accesso a "filename", quale tra le seguenti opzioni è la più appropriata?
-> <code>printf("New File mode %x\n", s.st_mode);</code>
-v <code>printf("New File mode %o\n", s.st_mode);</code>
-> <code>printf("New File mode %s\n", s.st_mode);</code>
-
-87. Si consideri il seguente frammento di codice
-<pre>
-int n=2;
-int r=2 * (n++);
-</pre>
-<pre>
-int n=2;
-int r1=2 * (++n);
-</pre>
-Quale valori assumeranno le variabili r e r1 dopo l'esecuzione?
-> r = r1 = 4
-> r=6 e r1=4
-v r=4 e r1=6
-
-88. Supponiamo di avere la seguenti variabili
-<code>int x=1, y=7;</code>
-Quale delle seguneti espressioni è falsa?
-v <code>(x & y) == 7</code>
-> <code>(x | y) == 7</code>
-> <code>(x || y) == (x & y)</code>
-
-89. Per visualizzare l’atime di un file quale dei seguenti comandi è corretto?
-> <code>ls -lc nomefile</code>
-v <code>ls -lu nomefile</code>
-> <code>ls -la nomefile</code>
-
-90. Quali attributi del processo sono preservati dalla funzione di libreria execve()?
-> Memory locks
-> Timer
-v Umask
-
-91. I permessi di accesso del file eseguibile <code>/usr/bin/passwd</code> sono <code>4755/-rwsr-xr-x</code>
-Cosa significa?
-> Il bit SetUid non è settato
-> Lo sticky bit è settato
-v Il bit SetUid è settato
-
-92. Si assuma di avere due shell aperte, etichettate come shell_1 e shell_2 e si consideri la seguente sequenza di comandi
-(shell_i:cmd indica che cmd è eseguitto nella  shell i, i=1,2).
-<pre>
-shell_1: xterm
-shell_2: ps -C xterm
-#restituisce xtermPID
-shell_2: kill -s SIGINT xtermPID
-</pre>
-Quale è il loro effetto?
-> Il processo xterm viene messo nello stato  stopped (T)
-v Il processo xterm viene terminato con segnale SIGINT
-> Il processo xterm viene messo in background
-
-93. Supponiamo di aver dichiarato ed inizializzato le seguenti variabili
-<code>int x = 1, y = 7;</code>
-Quale delle seguenti espressioni è vera (true)?
-v (x & y) == (x && y)
-> (x && y) == 7
-> (x & y) == (x | y)
-
-94. Si consideri la seguente funzione fa
-<pre>
-char *f(char *dest, const char *src, size_t n) {
-    size_t dest_len = strlen(dest);
-    size_t i;
-    for (i = 0; i < n && src[i] != '\0'; i++)
-        dest[dest_len + i] = src[i];
-    dest[dest_len + i] = '\0';
-return dest;
-}
-</pre>
-> Copia la stringa src in dest e restituisce dest
-v Concatena la stringa src a dest e restituisce dest
-> Genera sempre errore in fase di esecuzione perché non c'è alcun controllo sulla dimensione delle stringhe
-
-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.
-Quale di questi comandi è corretto?
-> <code>cp -n10 -i100 filein fileout</code>
-v <code>dd if=filein of=fileout bs=1 skip=10 count=100</code>
-> <code>dd if=filein of=fileout bs=100 skip=10 count = 1</code>
-
-96. Sia mylink un soft link al file myfile (<code>ln -s myfile mylink</code>).
-Quale di queste affermazioni è vera?
-v myfile e mylink hanno un diverso numero di inode
-> myfile e mylink hanno lo stesso numero di inode
-> myfile e mylink hanno la stessa dimensione
-
-97. Si consideri il codice
-<pre>
-struct stat *s;
-fd = open("filename");
-fstat(fs, s);
-</pre>
-Come faccio a sapere se il file "filename" è un link?
-v Se S_ISLINK(s) == 1
-> Se s.st_size == 0
-> Se s_st_nlink == 1
-
-98. Quale tra i seguenti comandi è il modo più corretto per verificare a quali gruppi appartiene un utente?
-> <code>groups nomeutente</code>
-> <code>cat /etc/groups | grep nomeutente</code>
-
-99. Cosa fa sto ciclo?
-<code>for(scoreCount = 0; scanf("%d", &a) == 1; scoreCount++);</code>
-v Legge ripetutamente numeri interi da stdin
-> Legge una sola volta da stdin e poi termina
-> Legge da stdin senza mai terminare
-
-100. Quale delle seguenti funzioni di libreria non alloca nell'heap?
-> calloc
-> malloc
-v alloca
-
-101. Si consideri il seguente frammento di codice
-<pre>
-sigset_t set, oset, pset;
-...
-sigemptyset( &set );
-sigaddset( &set, SIGINT );
-sigaddset( &set, SIGUSR1 );
-sigprocmask( SIG_BLOCK, &set, &oset );
-...
-</pre>
-> Termina una sezione critica precedentemente iniziata
-> Disabilita tutti i segnali tranne SIGINT e SIGUSR1
-v Disabilita i segnali SIGINT e SIGUSR1
-
-102. Per visualizzare contemporaneamente l'access time e status change time di un file, quale dei seguenti comandi è corretto?
-v stat nomefile
-> ls -la nomefile
-> ls -lac nomefile
-
-103. Consideri  il seguente frammento  di codice
-<pre>int *ptr = malloc(sizeof(int));
-ptr = ptr+1;</pre>
-assumendo la malloc assegni a ptr la locazione di memoria 0x55c2b1268420 cosa contiene ptr dopo l’incremento?
-> <code>0x55c2b1268421</code>
-> <code>0x55c2b1268428</code>
-v <code>0x55c2b1268424</code>
-
-104. Che cosa si intende per sudoer nel gergo Linux?
-> Un comando per essere aggiunti al gruppo sudo
-> Un gruppo che permette ai suoi membri di eseguire comandi come super-utente
-v Un utente che appartiene al gruppo di utenti sudo
-
-105. Assumiamo che quando viene creata una directory i suoi permessi di accesso sono 0644.
-Quale sarà la umask?
-> 0644
-> 0022
-v 0133
-
-106. Se una directory ha i permessi di accesso settati come 0222, quali operazioni è possibile fare su di essa?
-v Nessuna operazione
-> Operazioni di scrittura ed e possibile visualizzarne il contenuto senza vedere gli attributi dei file
-> Operazioni di scrittura
-
-107. Assumete di voler visualizzare il numero di inode di un file, quale dei seguenti comandi è più corretto usare?
-> ls -l -n nomefile
-> stat -f nomefile
-v ls -1 -i nomefile
-
-108. Quando si esegue il comando ls -l viene mostrato, come prima informazione, il totale (vedi figura, ma non sul bot :p)
-Quale è il significato di questo campo?
-v Dimensione della directory espressa in numero di blocchi su disco
-> Dimensione della directory espressa in numero di file contenuti in essa e in tutte le sotto-directory
-> Numero totale di sotto directory
-
-109. Si consideri il seguente frammento di codice:
-<pre>
-int num = 5;
-int *numPtr;
-numPtr = &num;
-*numPtr = 10;
-</pre>
-Dopo la sua esecuzione, quale sara' il valore contenuto il num ?
-> 5
-v 10
-> 0x123AF345 (indirizzo di memoria)
-
-110. Si consideri il seguente frammento di codice:
-<pre>
-int n= 2;
-int r= 2*(n++); // r = 2 * 2, n = 3
-int r1= 2*(++n); // n = 3 + 1, r1 = 2 * 4
-</pre>
-Quale delle seguenti espressioni sarà vera (true) una volta eseguito il codice?
-v r < r1
-> r > r1
-> r == r1
-
-112. Si consideri il comando
-<code>gcc -c file.c -o file.o</code>
-Quali delle seguenti affermazioni perché falsa?
-> Il comando produce un file oggetto a partire da un file precompilato
-> Il comando produce un file oggetto
-v Il comando produce un file eseguibile
-
-113. Cosa produce il seguente comando?
-<code>gcc file.o file2.o file3.o</code>
-v Un file eseguibile a.out
-> Nulla, la sintassi è sbagliata
-> Fa il linking dei file oggetto ma non produce nessun risultato finché non si specifica l'output
-
-114. Si consideri il seguente frammento di codice. Cosa fa una volta eseguito?
-<pre>
-scanf("%d",&num);
-while(num!=0); {
-    printf("%d\n",num);
-    scanf("%d",&num);
-}
-</pre>
-> stampa il valore di num almeno una volta
-v cicla infinitamente se num != 0
-> stampa il valore di num se num != 0
-
-115. Cosa produce il seguente comando come risultato?
-<code>cat /etc/group | grep nomeutente</code>
-v Visualizza su stdout tutti i gruppi a cui appartiene l'utente "nomeutente", incluso il gruppo "nomeutente" (se esiste)
-> Visualizza su stdout la lista dei gruppi a cui appartiene il gruppo "nomeutente" (se esiste)
-> Genera un errore in quanto il file /etc/group non esiste
-
-116. Nel caso in cui la system call <code>pid_t waitpid(pid_t pid, int *status, int options);</code>
-sia invocata con valore di pid uguale a -1. Quale è il suo comportamento?
-> Attende la terminazione di qualunque processo figlio il cui gruppo ID del processo sia diverso da quello del processo chiamante
-v Attende la terminazione di un qualunque processo figlio
-> Attende la terminazione di qualunque processo figlio il cui gruppo ID del processo sia uguale a quello del processo chiamante
-
-117. Quali dei seguenti comandi permette di creare un intero path di directory?
-> mkdir /dir1/dir2/dir3
-v mkdir -p /dir1/dir2/dir3
-> mkdir -m /dir1/dir2/dir3
-
-118. Supponiamo di avere un file di nome filename e di creare un link a filename con il comando
-<code>ln filename link1</code>
-quale delle seguenti affermazioni è vera?
-v filename e link1 hanno lo stesso inode
-> link1 occupa zero blocchi su disco anche se filename ne occupa un numero diverso da 0
-> filename e link1 hanno inode diverso
-
-119. Quali dei seguenti comandi change dir usa un path assoluto? (# indica il prompt di sistema)
-> # cd ../studente/download
-> # cd Immagini/../Immagini/faces/
-v # cd ~/Lezione1/esempi/filesystem
-
-120. Quali sono i permessi MINIMI che devono essere assegnati ad una directory affinchperché sia possibile:
-- leggere il contenuto della directory inclusi gli attributi dei file;
-- impostare la directory come cwd;
-- attraversare la directory.
-> rwx
-v r-x
-> rw-
-
-121. Supponiamo di avere il seguente makefile (memorizzato in un file di nome makefile):
-<pre>
-merge_sorted_lists: merge_sorted_lists.c
-        gcc -Wall -Wextra -O3 merge_sorted_lists.c \
-        -o merge_sorted_lists
-sort_file_int: sort_file_int.c
-        gcc -Wall -Wextra -O3 sort_file_int.c \
-        -o sort_file_int
-.PHONY: clean
-clean:
-        rm -f *.o merge_sorted_lists
-</pre>
-In quali condizioni viene eseguito il target sort_file_int? 
-> Sempre, se invochiamo il comando <code>make sort_file_int</code>
-v Se invochiamo il comando <code>make sort_file_int</code>. e se sort_file_int.c perché stato modificato dopo la data di creazione di sort_file_int.o
-> Il target sort_file_int non verrà mai eseguito
-
-122. SI consideri il seguente frammento di codice:
-<pre>
-int x, y, nread;
-float xx, yy;
-nread=scanf("%d %d",&x, &y);
-printf("x=%d, y=%d, nread=%d \n",x,y,nread);
-printf("xx=%f, yy=%f, nread=%d \n",xx,yy,nread);
-nread=scanf("%f %f",&xx, &yy);
-</pre>
-Assumiamo che, in fase di esecuzione, la prima scanf legge su stdin la sequenza
-<b>1 w</b>
-Quale sara' il valore di nread dopo l'esecuzione della seconda scanf?
-v 0
-> 2
-> dipende dall'input letto su stdin dalla seconda scanf
-
-123. Si consideri il seguente frammento di codice
-<pre>
- 1: #include <stdio.h>
- 2:  ....
- 3: 
- 4:  char str [80];
- 5:  float f;
- 6:  FILE * pFile;
- 7:
- 8:  pFile = fopen ("myfile.txt","w+");
- 9:  fprintf (pFile, "%f %s\n", 3.1416, "PI");
- 10: close(pFile);
- 11: rewind (pFile);
- 12: fscanf (pFile, "%f", &f);
- 13: fscanf (pFile, "%s", str);
-</pre>
-Le chiamate di funzione a riga 10, 11, 12 e 13 vengono eseguite tutte?
-v Sì
-> Viene eseguita solo riga 10 poi genera errore ed il programma termina
-> No, nessuna
-
-124. Cosa fa il seguente segmento di codice?
-<pre>
-scanf(“%d”,&num); 
-do {
-printf(“%d\n”,num); 
-scanf(“%d”,&num);
-} while(num!=0);
-</pre>
-> stampa il valore di num se num è diverso da 0
-> Il ciclo do-while entra in un loop infinito
-v stampa il valore di num almeno una volta
-
-125. Supponiamo di aver inizializzato un puntatore ad una variabile intera in questo modo
-<pre>
-int num=5, *ptrnum;
-ptrnum=&num;
-</pre>
-> ptrnum = (int *) 10;
-> ptrnum = 10;
-v *ptrnum = 10;
-
-126. Quale dei seguenti dichiarazioni di variabile perché non valida, generando quindi un errore di compilazione?
-v int goto=1;
-> int goTo=1;
-> int go_to=1;
-
-127. Si consideri il seguente frammento di codice
-<pre>
-int scoreCount, a;        
-for(scoreCount=0; scanf("%d",&a)==1; scoreCount++);
-</pre>
-Se la sequenza letta in input dall scanf è
-<pre>
-1 3 7 2 12 w
-</pre>
-Quale valore assumerà scoreCount al termine del ciclo?
-> Il ciclo non termina. La scanf va in errore quando viene letta la w
-v 5
-> 6
-
-128. Si consideri il frammento di codice
-<pre>
-  int K=10, c=0, p=1;
-  while (++K > 10)
-    c=c+1;
-  p--;
-</pre>
-che valore conterrà la variabile K al termine dell'esecuzione del frammento di codice?
-> 11
-v L'esecuziuone del frammento di codice non termina perché Il ciclo entra in un loop infinito
-> 10
-
-129. In quale situazione le system call dup(2) e dup2(2) hanno lo stesso comportamento?
-> Nel caso in cui gli passiamo gli stessi parametri
-> Nel casa in cui invochiamo la dup2(2) settando a NULL il valore del nuovo file descriptor
-v 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
-
-130. Quali dei seguenti attributi di un processo non perché preservato a seguito di una chiamata alla funzione di libreria execve()?
-> Groups id
-v Memory mapping
-> File locks
-
-131. Quale attributi di un processo non sono ereditati dal processo figlio?
-> Descrittori dei file; terminale di controllo; memoria condivisa
-v I timer, i record lock e i memory lock; i contatori delle risorse 
-> Real ed effective user e group ID; working directory; ambiente del processo
-
-132. Si consideri il seguente frammento di codice
-<pre>
-char* file = argv[1];
- int fd;
- struct flock lock;
- fd = open (file, O_WRONLY);
- memset (&lock, 0, sizeof(lock));
- lock.l_type = F_WRLCK; 
- fcntl (fd, F_GETLK, &lock);
-</pre>
-Quale è il comportamento della system call fcntl?
-> 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
-v 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
-> 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
-
-133. Un processo puo' allocare memoria solo nell'heap?
-> Sì, mediante la funziona di libreria malloc(3) e calloc(3)
-> Sì, mediante le funzioni di libreria malloc(3), calloc(3) e alloca(3)
-v No. Può allocare anche memoria nello stack mediante la funzione di libreria alloca(3)
-
-134. Supponiamo di aver utilizzato, nella nostra funzione C, la funzione di libreria alloca(3) per allocare un'area di memoria.
-È necessario liberare tale area di memoria mediante una free(3) prima della terminazione della funzione?
-v No. l'area di memoria allocata nello stack viene liberata automaticamente
-> Sì, ma mediante la chiamata di funzione dealloca(3) e non mediante la free(3) 
-> Sì, bisogna sempre liberare la memoria per evitare dei memory leak
-
-135. Si consideri la variabile globale errno.
-Se una system call termina con successo, e immediatamente dopo la sua terminazione ispezioniamo il contenuto di errno, cosa otteniamo?
-> Il valore zero essendo la system call terminata con successo
-> Il codice di terminazione (con successo) in quanto non c'è una effettiva differenza tra codice di errore o di terminazione con successo
-v Il codice di errore generato dall'ultima system call o funzione di libreria la cui esecuzione è terminata con errore
-
-136. Si consideri la system call
-<code>
-int open(const char *pathname, int flags);
-</code>
-nel caso venga invocata con il flag impostato a
-<code>
-O_CREAT | O_EXCL | O_WRONLY
-</code>
-Quale è il comportamento atteso?
-v Se il file non esiste viene creato ed aperto in scrittura, se invece esiste ritorna errore
-> 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
-> Se il file non esiste lo crea e lo apre in scrittura, altrimenti lo apre in lettura
-
-137. Assumete di voler visualizzare il numero di inode di un file, quale dei seguenti comandi non produce l'output desiderato?
-v stat -f nomefile
-> ls -l -i nomefile
-> stat nomefile
-
-138. Supponiamo di avere un file nomefile memorizzato nel nostro filesystem.
-Quale perché il risultato del comando touch nomefile?
-v Aggiorna, al tempo corrente, gli atttributi atime e mtime di nomefile  
-> Crea un file vuoto con nome nomefile in sostituzione dell'esistente
-> Crea un file vuoto con nome nomefile in sostituzione dell'esistente e valore del ctime aggiornato al tempo corrente
-
-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?
-v 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
-> perché il file stdio.h potrebbe non esistere nella directory /usr/include, dove la direttiva dice di cercarlo
-> L'inserimento della direttiva non genererà mai errori
-
-140. Dopo aver esegguito il comando
-<code>cpp helloworld.c > hw
-</code>
-cosa conterrà il file hw?
-> Un file identico a helloworld.c
-> L'input per il debugger relativo al file helloworld.c
-v Il precompilato di helloworld.c
-
-141. Quale perché il modo corretto per controllare che due stringhe str1 e str2 sono uguali?
-> <code>if (s1==s2) { printf("stringhe uguali") }</code>
-v <code>if strcmp(s1,s2) == 0 { printf("stringhe uguali") }</code>
-> <code>if strcmp(s1,s2) { printf("stringhe uguali") }</code>
-
-142. Si consideri il seguente frammento di codice
-<pre>
-int i, n1=10, n2=100;	
-for (i=0;((i<n1)&&(i<n2));i++)
-    m2[i]=m1[i];
-</pre>
-quando termina il ciclo for?
-v Quando il valore di i è uguale a n1
-> Quando il valore di i è uguale a n2
-> Non termina perché n1 è diverso da n2
-
-143. Supponiamo di eseguire  separatamente i seguenti frammenti di codice
-<b>Frammento_1</b>
-<pre>close(2);
-if (fopen(".","r")) {
-           perror("main");
-}</pre>
-<b>Frammento_2</b>
-<pre>close(2);
-if (fopen(".","r")) {
-               printf("main: %s \n", strerror(errno));
-}</pre>
-Quale delle seguenti affermazioni è vera?
-v Il frammento_1 non produce alcun output sul terminale
-> La loro esecuzione produce sul terminale due stringhe identiche
-> La loro esecuzione produce sul terminale due stringhe diverse
-
-51. Si consideri  il seguente frammento  di codice  (i numeri a lato sono i numeri di riga delle istruzioni)(uscita 2 volte)
-<pre>1.    Pthread_t tid;
-2.    pthread_create(&tid, ... )
-3.    pthread_create(&tid, ...)
-4.    pthread_join(tid, ...);
-5.    printf("joined");</pre>
-quale  delle seguenti affermazioni è vera?
-v la stringa "joined" è inviata su stdout solo quando  il thread creato a riga 3 è terminato
-> la stringa "joined" è inviata su stdout quando entrambi i thread sono terminati
-> la stringa "joined" è inviata su stdout quando uno dei due thread (non importa quale) è terminato
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0000_102/correct.txt b/legacy/Data/ingsw/0000_102/correct.txt
deleted file mode 100644
index 6613ca3..0000000
--- a/legacy/Data/ingsw/0000_102/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index e13f059..0000000
--- a/legacy/Data/ingsw/0000_102/quest.txt
+++ /dev/null
@@ -1,20 +0,0 @@
-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
deleted file mode 100644
index 9e9ca26..0000000
--- a/legacy/Data/ingsw/0000_102/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 2a2414b..0000000
--- a/legacy/Data/ingsw/0000_102/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0000_2/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c5fe9fb..0000000
--- a/legacy/Data/ingsw/0000_2/quest.txt
+++ /dev/null
@@ -1,57 +0,0 @@
-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 <stdio.h>
-
-#include <stdlib.h>
-
-#include <assert.h>
-
-#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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0000_2/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0000_2/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0000_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ba81b1a..0000000
--- a/legacy/Data/ingsw/0000_3/quest.txt
+++ /dev/null
@@ -1,45 +0,0 @@
-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 <stdio.h>
-
-#include <stdlib.h>
-
-#include <assert.h>
-
-#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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0000_3/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0000_3/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1ef5b94..0000000
--- a/legacy/Data/ingsw/0000_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index f07b439..0000000
--- a/legacy/Data/ingsw/0000_32/quest.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-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
deleted file mode 100644
index 6946352..0000000
--- a/legacy/Data/ingsw/0000_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index f9b6750..0000000
--- a/legacy/Data/ingsw/0000_32/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 998dfca..0000000
--- a/legacy/Data/ingsw/0000_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7d22084..0000000
--- a/legacy/Data/ingsw/0000_4/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b34acfc..0000000
--- a/legacy/Data/ingsw/0000_4/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9cfa092..0000000
--- a/legacy/Data/ingsw/0000_4/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ae41872..0000000
--- a/legacy/Data/ingsw/0000_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8632d4d..0000000
--- a/legacy/Data/ingsw/0000_7/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c2fa097..0000000
--- a/legacy/Data/ingsw/0000_7/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 85de863..0000000
--- a/legacy/Data/ingsw/0000_7/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index aef914a..0000000
--- a/legacy/Data/ingsw/0000_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e821a05..0000000
--- a/legacy/Data/ingsw/0000_8/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/ingsw/0000_8/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/ingsw/0000_8/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/ingsw/0120_0/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1b78d21..0000000
--- a/legacy/Data/ingsw/0120_0/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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
deleted file mode 100644
index 5464d05..0000000
--- a/legacy/Data/ingsw/0120_0/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/ingsw/0120_0/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 279908a..0000000
--- a/legacy/Data/ingsw/0120_1/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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 <pre 0.5*x) or (y > 0.7*x)) ;
-algorithm
-when edge(wz) then
-wy := true;
-end when;
-end Monitor;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0120_1/quest.txt b/legacy/Data/ingsw/0120_1/quest.txt
deleted file mode 100644
index 5922b9f..0000000
--- a/legacy/Data/ingsw/0120_1/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 867889a..0000000
--- a/legacy/Data/ingsw/0120_1/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_1/wrong2.txt b/legacy/Data/ingsw/0120_1/wrong2.txt
deleted file mode 100644
index a159504..0000000
--- a/legacy/Data/ingsw/0120_1/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_10/correct.txt b/legacy/Data/ingsw/0120_10/correct.txt
deleted file mode 100644
index fffebc7..0000000
--- a/legacy/Data/ingsw/0120_10/correct.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_10/quest.txt b/legacy/Data/ingsw/0120_10/quest.txt
deleted file mode 100644
index e11a044..0000000
--- a/legacy/Data/ingsw/0120_10/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index c5ef6d8..0000000
--- a/legacy/Data/ingsw/0120_10/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_10/wrong2.txt b/legacy/Data/ingsw/0120_10/wrong2.txt
deleted file mode 100644
index 06e9d5a..0000000
--- a/legacy/Data/ingsw/0120_10/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_11/correct.txt b/legacy/Data/ingsw/0120_11/correct.txt
deleted file mode 100644
index 1a8a50a..0000000
--- a/legacy/Data/ingsw/0120_11/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 793b220..0000000
--- a/legacy/Data/ingsw/0120_11/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fac8307..0000000
--- a/legacy/Data/ingsw/0120_11/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3fdb31e..0000000
--- a/legacy/Data/ingsw/0120_11/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b9f32a6..0000000
--- a/legacy/Data/ingsw/0120_12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index aed3c79..0000000
--- a/legacy/Data/ingsw/0120_12/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 70022eb..0000000
--- a/legacy/Data/ingsw/0120_12/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3143da9..0000000
--- a/legacy/Data/ingsw/0120_12/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e74b1fc..0000000
--- a/legacy/Data/ingsw/0120_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c1cd6d0..0000000
--- a/legacy/Data/ingsw/0120_13/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index d63544a..0000000
--- a/legacy/Data/ingsw/0120_13/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1753a91..0000000
--- a/legacy/Data/ingsw/0120_13/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 475d1ef..0000000
--- a/legacy/Data/ingsw/0120_14/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index 36947c2..0000000
--- a/legacy/Data/ingsw/0120_14/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index a6df32d..0000000
--- a/legacy/Data/ingsw/0120_14/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index 0aaedb8..0000000
--- a/legacy/Data/ingsw/0120_14/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index aef914a..0000000
--- a/legacy/Data/ingsw/0120_15/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9af4805..0000000
--- a/legacy/Data/ingsw/0120_15/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/ingsw/0120_15/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/ingsw/0120_15/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0902686..0000000
--- a/legacy/Data/ingsw/0120_16/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f6839df..0000000
--- a/legacy/Data/ingsw/0120_16/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-"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
deleted file mode 100644
index 6084c49..0000000
--- a/legacy/Data/ingsw/0120_16/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 396c8d3..0000000
--- a/legacy/Data/ingsw/0120_16/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/ingsw/0120_17/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fc7cc95..0000000
--- a/legacy/Data/ingsw/0120_17/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 2a47a95..0000000
--- a/legacy/Data/ingsw/0120_17/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b7bbee2..0000000
--- a/legacy/Data/ingsw/0120_17/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0120_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fd2ddc5..0000000
--- a/legacy/Data/ingsw/0120_18/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0120_18/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0120_18/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e13eda2..0000000
--- a/legacy/Data/ingsw/0120_19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b59a64d..0000000
--- a/legacy/Data/ingsw/0120_19/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b24f900..0000000
--- a/legacy/Data/ingsw/0120_19/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 884d6b1..0000000
--- a/legacy/Data/ingsw/0120_19/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2ca9276..0000000
--- a/legacy/Data/ingsw/0120_2/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7cf45ee..0000000
--- a/legacy/Data/ingsw/0120_2/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/ingsw/0120_2/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/ingsw/0120_2/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7311d41..0000000
--- a/legacy/Data/ingsw/0120_20/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 173901c..0000000
--- a/legacy/Data/ingsw/0120_20/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index 3e327ab..0000000
--- a/legacy/Data/ingsw/0120_20/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7e48e4f..0000000
--- a/legacy/Data/ingsw/0120_20/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 98939be..0000000
--- a/legacy/Data/ingsw/0120_21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5e04a05..0000000
--- a/legacy/Data/ingsw/0120_21/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index db2276d..0000000
--- a/legacy/Data/ingsw/0120_21/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 56ea6ac..0000000
--- a/legacy/Data/ingsw/0120_21/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 306d75a..0000000
--- a/legacy/Data/ingsw/0120_22/quest.txt
+++ /dev/null
@@ -1,32 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0120_22/wrong2.txt b/legacy/Data/ingsw/0120_22/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0120_22/wrong3.txt b/legacy/Data/ingsw/0120_22/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0120_23/correct.txt b/legacy/Data/ingsw/0120_23/correct.txt
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/ingsw/0120_23/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6f49368..0000000
--- a/legacy/Data/ingsw/0120_23/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/ingsw/0120_23/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5464d05..0000000
--- a/legacy/Data/ingsw/0120_23/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0120_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 702f202..0000000
--- a/legacy/Data/ingsw/0120_24/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0120_24/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0120_24/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5e6a3b5..0000000
--- a/legacy/Data/ingsw/0120_25/quest.txt
+++ /dev/null
@@ -1,37 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0120_25/wrong2.txt b/legacy/Data/ingsw/0120_25/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0120_25/wrong3.txt b/legacy/Data/ingsw/0120_25/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0120_26/correct.txt b/legacy/Data/ingsw/0120_26/correct.txt
deleted file mode 100644
index 1c7da8c..0000000
--- a/legacy/Data/ingsw/0120_26/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 458f85c..0000000
--- a/legacy/Data/ingsw/0120_26/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 7eb6830..0000000
--- a/legacy/Data/ingsw/0120_26/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8a346b7..0000000
--- a/legacy/Data/ingsw/0120_26/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5f37ecc..0000000
--- a/legacy/Data/ingsw/0120_27/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_27/quest.txt b/legacy/Data/ingsw/0120_27/quest.txt
deleted file mode 100644
index 864cc93..0000000
--- a/legacy/Data/ingsw/0120_27/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 8856598..0000000
--- a/legacy/Data/ingsw/0120_27/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_27/wrong2.txt b/legacy/Data/ingsw/0120_27/wrong2.txt
deleted file mode 100644
index 2057e11..0000000
--- a/legacy/Data/ingsw/0120_27/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_28/quest.txt b/legacy/Data/ingsw/0120_28/quest.txt
deleted file mode 100644
index 5826ea3..0000000
--- a/legacy/Data/ingsw/0120_28/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index bfb3c5d..0000000
--- a/legacy/Data/ingsw/0120_28/wrong1.txt
+++ /dev/null
@@ -1,38 +0,0 @@
-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
deleted file mode 100644
index c5d8c6b..0000000
--- a/legacy/Data/ingsw/0120_28/wrong2.txt
+++ /dev/null
@@ -1,33 +0,0 @@
-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
deleted file mode 100644
index 40db007..0000000
--- a/legacy/Data/ingsw/0120_28/wrong3.txt
+++ /dev/null
@@ -1,33 +0,0 @@
-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
deleted file mode 100644
index 080c618..0000000
--- a/legacy/Data/ingsw/0120_29/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_29/quest.txt b/legacy/Data/ingsw/0120_29/quest.txt
deleted file mode 100644
index 576af1a..0000000
--- a/legacy/Data/ingsw/0120_29/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 5ea42fe..0000000
--- a/legacy/Data/ingsw/0120_29/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_29/wrong2.txt b/legacy/Data/ingsw/0120_29/wrong2.txt
deleted file mode 100644
index a55c0a4..0000000
--- a/legacy/Data/ingsw/0120_29/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_3/correct.txt b/legacy/Data/ingsw/0120_3/correct.txt
deleted file mode 100644
index e940faa..0000000
--- a/legacy/Data/ingsw/0120_3/correct.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 2758118..0000000
--- a/legacy/Data/ingsw/0120_3/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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
deleted file mode 100644
index ad32d88..0000000
--- a/legacy/Data/ingsw/0120_3/wrong1.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 642ec6b..0000000
--- a/legacy/Data/ingsw/0120_3/wrong2.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index a40ea7d..0000000
--- a/legacy/Data/ingsw/0120_30/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index dbd72c0..0000000
--- a/legacy/Data/ingsw/0120_30/quest.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-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
deleted file mode 100644
index 5b77112..0000000
--- a/legacy/Data/ingsw/0120_30/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index abe0eaa..0000000
--- a/legacy/Data/ingsw/0120_30/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 3bb4f54..0000000
--- a/legacy/Data/ingsw/0120_31/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6c8f77e..0000000
--- a/legacy/Data/ingsw/0120_31/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0120_31/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/ingsw/0120_31/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0120_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index dcec721..0000000
--- a/legacy/Data/ingsw/0120_32/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0120_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0120_32/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a7029bc..0000000
--- a/legacy/Data/ingsw/0120_33/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e5fbc81..0000000
--- a/legacy/Data/ingsw/0120_33/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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;
-</pre>
-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
deleted file mode 100644
index a82929b..0000000
--- a/legacy/Data/ingsw/0120_33/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 710b111..0000000
--- a/legacy/Data/ingsw/0120_33/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 29d0647..0000000
--- a/legacy/Data/ingsw/0120_34/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 160702f..0000000
--- a/legacy/Data/ingsw/0120_34/wrong1.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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
deleted file mode 100644
index 3c05a37..0000000
--- a/legacy/Data/ingsw/0120_34/wrong2.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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
deleted file mode 100644
index bdfb644..0000000
--- a/legacy/Data/ingsw/0120_34/wrong3.txt
+++ /dev/null
@@ -1,37 +0,0 @@
-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
deleted file mode 100644
index 99379e6..0000000
--- a/legacy/Data/ingsw/0120_35/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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
deleted file mode 100644
index cbf1814..0000000
--- a/legacy/Data/ingsw/0120_35/wrong1.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 03b9f52..0000000
--- a/legacy/Data/ingsw/0120_35/wrong2.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 6fcb8b5..0000000
--- a/legacy/Data/ingsw/0120_35/wrong3.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/ingsw/0120_36/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6f256c3..0000000
--- a/legacy/Data/ingsw/0120_36/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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
deleted file mode 100644
index 5464d05..0000000
--- a/legacy/Data/ingsw/0120_36/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index cf27703..0000000
--- a/legacy/Data/ingsw/0120_36/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bc5692f..0000000
--- a/legacy/Data/ingsw/0120_37/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index cdbc688..0000000
--- a/legacy/Data/ingsw/0120_37/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0120_37/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/0120_37/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 25ac15c..0000000
--- a/legacy/Data/ingsw/0120_38/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_38/quest.txt b/legacy/Data/ingsw/0120_38/quest.txt
deleted file mode 100644
index b420aaf..0000000
--- a/legacy/Data/ingsw/0120_38/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 157567e..0000000
--- a/legacy/Data/ingsw/0120_38/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_38/wrong2.txt b/legacy/Data/ingsw/0120_38/wrong2.txt
deleted file mode 100644
index d021c3b..0000000
--- a/legacy/Data/ingsw/0120_38/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_39/quest.txt b/legacy/Data/ingsw/0120_39/quest.txt
deleted file mode 100644
index 4777dbc..0000000
--- a/legacy/Data/ingsw/0120_39/quest.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0120_39/wrong2.txt b/legacy/Data/ingsw/0120_39/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0120_39/wrong3.txt b/legacy/Data/ingsw/0120_39/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0120_4/correct.txt b/legacy/Data/ingsw/0120_4/correct.txt
deleted file mode 100644
index ddb0d65..0000000
--- a/legacy/Data/ingsw/0120_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d1cf8cb..0000000
--- a/legacy/Data/ingsw/0120_4/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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;
-</pre>
-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
deleted file mode 100644
index 3e05ae7..0000000
--- a/legacy/Data/ingsw/0120_4/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7c7a691..0000000
--- a/legacy/Data/ingsw/0120_4/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 31a01d5..0000000
--- a/legacy/Data/ingsw/0120_40/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 74a4d32..0000000
--- a/legacy/Data/ingsw/0120_40/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index 549dba8..0000000
--- a/legacy/Data/ingsw/0120_40/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0c564f7..0000000
--- a/legacy/Data/ingsw/0120_40/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7a6c6b9..0000000
--- a/legacy/Data/ingsw/0120_41/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 47201e7..0000000
--- a/legacy/Data/ingsw/0120_41/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 997967b..0000000
--- a/legacy/Data/ingsw/0120_41/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2df501e..0000000
--- a/legacy/Data/ingsw/0120_41/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/ingsw/0120_42/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4650bbb..0000000
--- a/legacy/Data/ingsw/0120_42/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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
deleted file mode 100644
index 1c07658..0000000
--- a/legacy/Data/ingsw/0120_42/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0120_42/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8636c5a..0000000
--- a/legacy/Data/ingsw/0120_43/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 0ca6415..0000000
--- a/legacy/Data/ingsw/0120_43/wrong1.txt
+++ /dev/null
@@ -1,32 +0,0 @@
-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
deleted file mode 100644
index a5879aa..0000000
--- a/legacy/Data/ingsw/0120_43/wrong2.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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
deleted file mode 100644
index b4f56fb..0000000
--- a/legacy/Data/ingsw/0120_43/wrong3.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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
deleted file mode 100644
index 232aedf..0000000
--- a/legacy/Data/ingsw/0120_44/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index e44e320..0000000
--- a/legacy/Data/ingsw/0120_44/quest.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-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
deleted file mode 100644
index 5d5c9a4..0000000
--- a/legacy/Data/ingsw/0120_44/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 2b6c292..0000000
--- a/legacy/Data/ingsw/0120_44/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 4818a62..0000000
--- a/legacy/Data/ingsw/0120_45/quest.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0120_45/wrong2.txt b/legacy/Data/ingsw/0120_45/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0120_45/wrong3.txt b/legacy/Data/ingsw/0120_45/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0120_46/correct.txt b/legacy/Data/ingsw/0120_46/correct.txt
deleted file mode 100644
index 3fb437d..0000000
--- a/legacy/Data/ingsw/0120_46/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6205846..0000000
--- a/legacy/Data/ingsw/0120_46/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index c64601b..0000000
--- a/legacy/Data/ingsw/0120_46/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fc54e00..0000000
--- a/legacy/Data/ingsw/0120_46/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/ingsw/0120_47/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7710e8f..0000000
--- a/legacy/Data/ingsw/0120_47/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9e12d11..0000000
--- a/legacy/Data/ingsw/0120_47/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/ingsw/0120_47/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 519c7fd..0000000
--- a/legacy/Data/ingsw/0120_48/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_48/quest.txt b/legacy/Data/ingsw/0120_48/quest.txt
deleted file mode 100644
index 22c683f..0000000
--- a/legacy/Data/ingsw/0120_48/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 5229f7e..0000000
--- a/legacy/Data/ingsw/0120_48/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_48/wrong2.txt b/legacy/Data/ingsw/0120_48/wrong2.txt
deleted file mode 100644
index c2e617d..0000000
--- a/legacy/Data/ingsw/0120_48/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_49/correct.txt b/legacy/Data/ingsw/0120_49/correct.txt
deleted file mode 100644
index 2a2ecea..0000000
--- a/legacy/Data/ingsw/0120_49/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2d6940a..0000000
--- a/legacy/Data/ingsw/0120_49/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index d68fd15..0000000
--- a/legacy/Data/ingsw/0120_49/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9927a93..0000000
--- a/legacy/Data/ingsw/0120_49/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3e68301..0000000
--- a/legacy/Data/ingsw/0120_5/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 6c46c45..0000000
--- a/legacy/Data/ingsw/0120_5/wrong1.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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
deleted file mode 100644
index 39e7bfc..0000000
--- a/legacy/Data/ingsw/0120_5/wrong2.txt
+++ /dev/null
@@ -1,37 +0,0 @@
-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
deleted file mode 100644
index 93e29a3..0000000
--- a/legacy/Data/ingsw/0120_5/wrong3.txt
+++ /dev/null
@@ -1,28 +0,0 @@
-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
deleted file mode 100644
index 7c149d8..0000000
--- a/legacy/Data/ingsw/0120_6/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8bba4b8..0000000
--- a/legacy/Data/ingsw/0120_6/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/ingsw/0120_6/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3461684..0000000
--- a/legacy/Data/ingsw/0120_6/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b559d4a..0000000
--- a/legacy/Data/ingsw/0120_7/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_7/quest.txt b/legacy/Data/ingsw/0120_7/quest.txt
deleted file mode 100644
index 031c331..0000000
--- a/legacy/Data/ingsw/0120_7/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 4b8db59..0000000
--- a/legacy/Data/ingsw/0120_7/wrong1.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_7/wrong2.txt b/legacy/Data/ingsw/0120_7/wrong2.txt
deleted file mode 100644
index 05ce544..0000000
--- a/legacy/Data/ingsw/0120_7/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0120_8/correct.txt b/legacy/Data/ingsw/0120_8/correct.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/0120_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2809138..0000000
--- a/legacy/Data/ingsw/0120_8/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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
deleted file mode 100644
index 1a8a508..0000000
--- a/legacy/Data/ingsw/0120_8/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/ingsw/0120_8/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ce9968f..0000000
--- a/legacy/Data/ingsw/0120_9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4962ecf..0000000
--- a/legacy/Data/ingsw/0120_9/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index e8f9017..0000000
--- a/legacy/Data/ingsw/0120_9/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/ingsw/0120_9/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0121_34/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6dbca93..0000000
--- a/legacy/Data/ingsw/0121_34/quest.txt
+++ /dev/null
@@ -1,53 +0,0 @@
-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 <stdio.h>
-
-#include <stdlib.h>
-
-#include <assert.h>
-
-#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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0121_34/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0121_34/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a40ea7d..0000000
--- a/legacy/Data/ingsw/0210_0/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 2d895ca..0000000
--- a/legacy/Data/ingsw/0210_0/quest.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-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
deleted file mode 100644
index abe0eaa..0000000
--- a/legacy/Data/ingsw/0210_0/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 5b77112..0000000
--- a/legacy/Data/ingsw/0210_0/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 89110fc..0000000
--- a/legacy/Data/ingsw/0210_1/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 0487745..0000000
--- a/legacy/Data/ingsw/0210_1/wrong1.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 6b9f4b0..0000000
--- a/legacy/Data/ingsw/0210_1/wrong2.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index bf32c35..0000000
--- a/legacy/Data/ingsw/0210_1/wrong3.txt
+++ /dev/null
@@ -1,40 +0,0 @@
-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
deleted file mode 100644
index ddb0d65..0000000
--- a/legacy/Data/ingsw/0210_10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d1cf8cb..0000000
--- a/legacy/Data/ingsw/0210_10/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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;
-</pre>
-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
deleted file mode 100644
index 7c7a691..0000000
--- a/legacy/Data/ingsw/0210_10/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3e05ae7..0000000
--- a/legacy/Data/ingsw/0210_10/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 57dc789..0000000
--- a/legacy/Data/ingsw/0210_11/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 157d205..0000000
--- a/legacy/Data/ingsw/0210_11/wrong1.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 04886bb..0000000
--- a/legacy/Data/ingsw/0210_11/wrong2.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 903ba76..0000000
--- a/legacy/Data/ingsw/0210_11/wrong3.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 86ee3d4..0000000
--- a/legacy/Data/ingsw/0210_12/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index c7f67fe..0000000
--- a/legacy/Data/ingsw/0210_12/wrong1.txt
+++ /dev/null
@@ -1,38 +0,0 @@
-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
deleted file mode 100644
index b84dfd6..0000000
--- a/legacy/Data/ingsw/0210_12/wrong2.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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
deleted file mode 100644
index 162b572..0000000
--- a/legacy/Data/ingsw/0210_12/wrong3.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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
deleted file mode 100644
index 25ac15c..0000000
--- a/legacy/Data/ingsw/0210_13/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0210_13/quest.txt b/legacy/Data/ingsw/0210_13/quest.txt
deleted file mode 100644
index b420aaf..0000000
--- a/legacy/Data/ingsw/0210_13/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index d021c3b..0000000
--- a/legacy/Data/ingsw/0210_13/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0210_13/wrong2.txt b/legacy/Data/ingsw/0210_13/wrong2.txt
deleted file mode 100644
index 157567e..0000000
--- a/legacy/Data/ingsw/0210_13/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0210_14/correct.txt b/legacy/Data/ingsw/0210_14/correct.txt
deleted file mode 100644
index e74b1fc..0000000
--- a/legacy/Data/ingsw/0210_14/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c1cd6d0..0000000
--- a/legacy/Data/ingsw/0210_14/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index d63544a..0000000
--- a/legacy/Data/ingsw/0210_14/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1753a91..0000000
--- a/legacy/Data/ingsw/0210_14/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 519c7fd..0000000
--- a/legacy/Data/ingsw/0210_15/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0210_15/quest.txt b/legacy/Data/ingsw/0210_15/quest.txt
deleted file mode 100644
index 22c683f..0000000
--- a/legacy/Data/ingsw/0210_15/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 5229f7e..0000000
--- a/legacy/Data/ingsw/0210_15/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0210_15/wrong2.txt b/legacy/Data/ingsw/0210_15/wrong2.txt
deleted file mode 100644
index 2029293..0000000
--- a/legacy/Data/ingsw/0210_15/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_16/correct.txt b/legacy/Data/ingsw/0210_16/correct.txt
deleted file mode 100644
index 293ebbc..0000000
--- a/legacy/Data/ingsw/0210_16/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_16/quest.txt b/legacy/Data/ingsw/0210_16/quest.txt
deleted file mode 100644
index 5922b9f..0000000
--- a/legacy/Data/ingsw/0210_16/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index d7890b2..0000000
--- a/legacy/Data/ingsw/0210_16/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_16/wrong2.txt b/legacy/Data/ingsw/0210_16/wrong2.txt
deleted file mode 100644
index d50b268..0000000
--- a/legacy/Data/ingsw/0210_16/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_17/correct.txt b/legacy/Data/ingsw/0210_17/correct.txt
deleted file mode 100644
index 2ca9276..0000000
--- a/legacy/Data/ingsw/0210_17/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5fa40ee..0000000
--- a/legacy/Data/ingsw/0210_17/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/ingsw/0210_17/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/ingsw/0210_17/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1a8a50a..0000000
--- a/legacy/Data/ingsw/0210_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 793b220..0000000
--- a/legacy/Data/ingsw/0210_18/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fac8307..0000000
--- a/legacy/Data/ingsw/0210_18/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3fdb31e..0000000
--- a/legacy/Data/ingsw/0210_18/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/ingsw/0210_19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e786bcf..0000000
--- a/legacy/Data/ingsw/0210_19/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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
deleted file mode 100644
index 1c07658..0000000
--- a/legacy/Data/ingsw/0210_19/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/ingsw/0210_19/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f9f8976..0000000
--- a/legacy/Data/ingsw/0210_2/quest.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0210_2/wrong2.txt b/legacy/Data/ingsw/0210_2/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0210_2/wrong3.txt b/legacy/Data/ingsw/0210_2/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0210_20/correct.txt b/legacy/Data/ingsw/0210_20/correct.txt
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/ingsw/0210_20/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7710e8f..0000000
--- a/legacy/Data/ingsw/0210_20/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9e12d11..0000000
--- a/legacy/Data/ingsw/0210_20/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/ingsw/0210_20/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ad21063..0000000
--- a/legacy/Data/ingsw/0210_21/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_21/quest.txt b/legacy/Data/ingsw/0210_21/quest.txt
deleted file mode 100644
index 031c331..0000000
--- a/legacy/Data/ingsw/0210_21/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index b14ac60..0000000
--- a/legacy/Data/ingsw/0210_21/wrong1.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_21/wrong2.txt b/legacy/Data/ingsw/0210_21/wrong2.txt
deleted file mode 100644
index e4201ab..0000000
--- a/legacy/Data/ingsw/0210_21/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_22/correct.txt b/legacy/Data/ingsw/0210_22/correct.txt
deleted file mode 100644
index a7029bc..0000000
--- a/legacy/Data/ingsw/0210_22/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e5fbc81..0000000
--- a/legacy/Data/ingsw/0210_22/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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;
-</pre>
-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
deleted file mode 100644
index 710b111..0000000
--- a/legacy/Data/ingsw/0210_22/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a82929b..0000000
--- a/legacy/Data/ingsw/0210_22/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0210_23/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index adede32..0000000
--- a/legacy/Data/ingsw/0210_23/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0210_23/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0210_23/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2a2ecea..0000000
--- a/legacy/Data/ingsw/0210_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d188da2..0000000
--- a/legacy/Data/ingsw/0210_24/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 9927a93..0000000
--- a/legacy/Data/ingsw/0210_24/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d68fd15..0000000
--- a/legacy/Data/ingsw/0210_24/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 43dc0c9..0000000
--- a/legacy/Data/ingsw/0210_25/correct.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index f6744fd..0000000
--- a/legacy/Data/ingsw/0210_25/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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
deleted file mode 100644
index 6a97baf..0000000
--- a/legacy/Data/ingsw/0210_25/wrong1.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 3f63933..0000000
--- a/legacy/Data/ingsw/0210_25/wrong2.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index b9f32a6..0000000
--- a/legacy/Data/ingsw/0210_26/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d318528..0000000
--- a/legacy/Data/ingsw/0210_26/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 3143da9..0000000
--- a/legacy/Data/ingsw/0210_26/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 70022eb..0000000
--- a/legacy/Data/ingsw/0210_26/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 75e942b..0000000
--- a/legacy/Data/ingsw/0210_27/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index c296b22..0000000
--- a/legacy/Data/ingsw/0210_27/wrong1.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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
deleted file mode 100644
index d21df5d..0000000
--- a/legacy/Data/ingsw/0210_27/wrong2.txt
+++ /dev/null
@@ -1,32 +0,0 @@
-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
deleted file mode 100644
index 421d23f..0000000
--- a/legacy/Data/ingsw/0210_27/wrong3.txt
+++ /dev/null
@@ -1,37 +0,0 @@
-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
deleted file mode 100644
index 932f11d..0000000
--- a/legacy/Data/ingsw/0210_28/quest.txt
+++ /dev/null
@@ -1,38 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0210_28/wrong2.txt b/legacy/Data/ingsw/0210_28/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0210_28/wrong3.txt b/legacy/Data/ingsw/0210_28/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0210_29/correct.txt b/legacy/Data/ingsw/0210_29/correct.txt
deleted file mode 100644
index 0902686..0000000
--- a/legacy/Data/ingsw/0210_29/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f6839df..0000000
--- a/legacy/Data/ingsw/0210_29/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-"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
deleted file mode 100644
index 6084c49..0000000
--- a/legacy/Data/ingsw/0210_29/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 396c8d3..0000000
--- a/legacy/Data/ingsw/0210_29/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 985c244..0000000
--- a/legacy/Data/ingsw/0210_3/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index ed5ad19..0000000
--- a/legacy/Data/ingsw/0210_3/wrong1.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-#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
deleted file mode 100644
index 69b9722..0000000
--- a/legacy/Data/ingsw/0210_3/wrong2.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-#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
deleted file mode 100644
index a26ce6e..0000000
--- a/legacy/Data/ingsw/0210_3/wrong3.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-#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
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/ingsw/0210_30/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a27fc55..0000000
--- a/legacy/Data/ingsw/0210_30/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/ingsw/0210_30/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/ingsw/0210_30/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0210_31/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 65cfd2d..0000000
--- a/legacy/Data/ingsw/0210_31/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0210_31/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0210_31/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/ingsw/0210_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index cb591da..0000000
--- a/legacy/Data/ingsw/0210_32/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 1c07658..0000000
--- a/legacy/Data/ingsw/0210_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/ingsw/0210_32/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1c7da8c..0000000
--- a/legacy/Data/ingsw/0210_33/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index cf9113a..0000000
--- a/legacy/Data/ingsw/0210_33/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 7eb6830..0000000
--- a/legacy/Data/ingsw/0210_33/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8a346b7..0000000
--- a/legacy/Data/ingsw/0210_33/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 33e1f49..0000000
--- a/legacy/Data/ingsw/0210_34/quest.txt
+++ /dev/null
@@ -1,34 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0210_34/wrong2.txt b/legacy/Data/ingsw/0210_34/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0210_34/wrong3.txt b/legacy/Data/ingsw/0210_34/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0210_35/correct.txt b/legacy/Data/ingsw/0210_35/correct.txt
deleted file mode 100644
index 7c149d8..0000000
--- a/legacy/Data/ingsw/0210_35/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8bba4b8..0000000
--- a/legacy/Data/ingsw/0210_35/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3461684..0000000
--- a/legacy/Data/ingsw/0210_35/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/ingsw/0210_35/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3f63933..0000000
--- a/legacy/Data/ingsw/0210_36/correct.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 595ab5d..0000000
--- a/legacy/Data/ingsw/0210_36/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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
deleted file mode 100644
index 6a97baf..0000000
--- a/legacy/Data/ingsw/0210_36/wrong1.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index e607157..0000000
--- a/legacy/Data/ingsw/0210_36/wrong2.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 5743032..0000000
--- a/legacy/Data/ingsw/0210_37/quest.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0210_37/wrong2.txt b/legacy/Data/ingsw/0210_37/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0210_37/wrong3.txt b/legacy/Data/ingsw/0210_37/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0210_38/correct.txt b/legacy/Data/ingsw/0210_38/correct.txt
deleted file mode 100644
index 232aedf..0000000
--- a/legacy/Data/ingsw/0210_38/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index b2bed72..0000000
--- a/legacy/Data/ingsw/0210_38/quest.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-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
deleted file mode 100644
index 2b6c292..0000000
--- a/legacy/Data/ingsw/0210_38/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 5d5c9a4..0000000
--- a/legacy/Data/ingsw/0210_38/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 8785661..0000000
--- a/legacy/Data/ingsw/0210_39/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index 36947c2..0000000
--- a/legacy/Data/ingsw/0210_39/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 0aaedb8..0000000
--- a/legacy/Data/ingsw/0210_39/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index a6df32d..0000000
--- a/legacy/Data/ingsw/0210_39/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/ingsw/0210_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 84d1f53..0000000
--- a/legacy/Data/ingsw/0210_4/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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
deleted file mode 100644
index 1a8a508..0000000
--- a/legacy/Data/ingsw/0210_4/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/0210_4/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/0210_40/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a550159..0000000
--- a/legacy/Data/ingsw/0210_40/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/ingsw/0210_40/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/ingsw/0210_40/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5f76c88..0000000
--- a/legacy/Data/ingsw/0210_41/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index cdbd481..0000000
--- a/legacy/Data/ingsw/0210_41/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 2ca9276..0000000
--- a/legacy/Data/ingsw/0210_41/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c376ef7..0000000
--- a/legacy/Data/ingsw/0210_41/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8e91c31..0000000
--- a/legacy/Data/ingsw/0210_42/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 512c141..0000000
--- a/legacy/Data/ingsw/0210_42/wrong1.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 77d39c1..0000000
--- a/legacy/Data/ingsw/0210_42/wrong2.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index b9a8baf..0000000
--- a/legacy/Data/ingsw/0210_42/wrong3.txt
+++ /dev/null
@@ -1,39 +0,0 @@
-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
deleted file mode 100644
index 4c75070..0000000
--- a/legacy/Data/ingsw/0210_43/correct.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_43/quest.txt b/legacy/Data/ingsw/0210_43/quest.txt
deleted file mode 100644
index e11a044..0000000
--- a/legacy/Data/ingsw/0210_43/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 6dafe94..0000000
--- a/legacy/Data/ingsw/0210_43/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_43/wrong2.txt b/legacy/Data/ingsw/0210_43/wrong2.txt
deleted file mode 100644
index a3d79a4..0000000
--- a/legacy/Data/ingsw/0210_43/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_44/quest.txt b/legacy/Data/ingsw/0210_44/quest.txt
deleted file mode 100644
index 5c4c81d..0000000
--- a/legacy/Data/ingsw/0210_44/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 421b38f..0000000
--- a/legacy/Data/ingsw/0210_44/wrong1.txt
+++ /dev/null
@@ -1,34 +0,0 @@
-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
deleted file mode 100644
index f385f1c..0000000
--- a/legacy/Data/ingsw/0210_44/wrong2.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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
deleted file mode 100644
index 1034e02..0000000
--- a/legacy/Data/ingsw/0210_44/wrong3.txt
+++ /dev/null
@@ -1,32 +0,0 @@
-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
deleted file mode 100644
index 4a8e634..0000000
--- a/legacy/Data/ingsw/0210_45/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_45/quest.txt b/legacy/Data/ingsw/0210_45/quest.txt
deleted file mode 100644
index 576af1a..0000000
--- a/legacy/Data/ingsw/0210_45/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 68aa37a..0000000
--- a/legacy/Data/ingsw/0210_45/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_45/wrong2.txt b/legacy/Data/ingsw/0210_45/wrong2.txt
deleted file mode 100644
index a43796b..0000000
--- a/legacy/Data/ingsw/0210_45/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_46/correct.txt b/legacy/Data/ingsw/0210_46/correct.txt
deleted file mode 100644
index 001b1d9..0000000
--- a/legacy/Data/ingsw/0210_46/correct.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 9f5199d..0000000
--- a/legacy/Data/ingsw/0210_46/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index fc95495..0000000
--- a/legacy/Data/ingsw/0210_46/wrong1.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index eaf9272..0000000
--- a/legacy/Data/ingsw/0210_46/wrong2.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0210_47/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4344b75..0000000
--- a/legacy/Data/ingsw/0210_47/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0210_47/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0210_47/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7311d41..0000000
--- a/legacy/Data/ingsw/0210_48/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d3a9fe2..0000000
--- a/legacy/Data/ingsw/0210_48/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index 7e48e4f..0000000
--- a/legacy/Data/ingsw/0210_48/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3e327ab..0000000
--- a/legacy/Data/ingsw/0210_48/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/ingsw/0210_49/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8cb7d37..0000000
--- a/legacy/Data/ingsw/0210_49/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/ingsw/0210_49/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/ingsw/0210_49/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e582263..0000000
--- a/legacy/Data/ingsw/0210_5/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_5/quest.txt b/legacy/Data/ingsw/0210_5/quest.txt
deleted file mode 100644
index 864cc93..0000000
--- a/legacy/Data/ingsw/0210_5/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 0f38391..0000000
--- a/legacy/Data/ingsw/0210_5/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_5/wrong2.txt b/legacy/Data/ingsw/0210_5/wrong2.txt
deleted file mode 100644
index 590f7e1..0000000
--- a/legacy/Data/ingsw/0210_5/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_6/correct.txt b/legacy/Data/ingsw/0210_6/correct.txt
deleted file mode 100644
index c37d6ae..0000000
--- a/legacy/Data/ingsw/0210_6/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_6/quest.txt b/legacy/Data/ingsw/0210_6/quest.txt
deleted file mode 100644
index 003d1dd..0000000
--- a/legacy/Data/ingsw/0210_6/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 14bd900..0000000
--- a/legacy/Data/ingsw/0210_6/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_6/wrong2.txt b/legacy/Data/ingsw/0210_6/wrong2.txt
deleted file mode 100644
index edea147..0000000
--- a/legacy/Data/ingsw/0210_6/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0210_7/correct.txt b/legacy/Data/ingsw/0210_7/correct.txt
deleted file mode 100644
index 31a01d5..0000000
--- a/legacy/Data/ingsw/0210_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d649932..0000000
--- a/legacy/Data/ingsw/0210_7/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index 549dba8..0000000
--- a/legacy/Data/ingsw/0210_7/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0c564f7..0000000
--- a/legacy/Data/ingsw/0210_7/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 81a4b93..0000000
--- a/legacy/Data/ingsw/0210_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 236ccc7..0000000
--- a/legacy/Data/ingsw/0210_8/quest.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-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
deleted file mode 100644
index f52d5ae..0000000
--- a/legacy/Data/ingsw/0210_8/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d246b94..0000000
--- a/legacy/Data/ingsw/0210_8/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fcfd787..0000000
--- a/legacy/Data/ingsw/0210_9/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index acd5e00..0000000
--- a/legacy/Data/ingsw/0210_9/wrong1.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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
deleted file mode 100644
index 298890c..0000000
--- a/legacy/Data/ingsw/0210_9/wrong2.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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
deleted file mode 100644
index 3b3e08a..0000000
--- a/legacy/Data/ingsw/0210_9/wrong3.txt
+++ /dev/null
@@ -1,32 +0,0 @@
-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
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/ingsw/0221_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 937eabd..0000000
--- a/legacy/Data/ingsw/0221_18/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/ingsw/0221_18/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9e12d11..0000000
--- a/legacy/Data/ingsw/0221_18/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7c149d8..0000000
--- a/legacy/Data/ingsw/0221_28/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c71c807..0000000
--- a/legacy/Data/ingsw/0221_28/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3461684..0000000
--- a/legacy/Data/ingsw/0221_28/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/ingsw/0221_28/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e7c5bb8..0000000
--- a/legacy/Data/ingsw/0221_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5552f2f..0000000
--- a/legacy/Data/ingsw/0221_32/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bfb5124..0000000
--- a/legacy/Data/ingsw/0221_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2b6e242..0000000
--- a/legacy/Data/ingsw/0221_32/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/ingsw/0222_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ce59bae..0000000
--- a/legacy/Data/ingsw/0222_24/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0222_24/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0222_24/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/ingsw/0222_27/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b1548b4..0000000
--- a/legacy/Data/ingsw/0222_27/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0222_27/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0222_27/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0222_33/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 857057e..0000000
--- a/legacy/Data/ingsw/0222_33/quest.txt
+++ /dev/null
@@ -1,45 +0,0 @@
-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 <stdio.h>
-
-#include <stdlib.h>
-
-#include <assert.h>
-
-#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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0222_33/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0222_33/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0222_35/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 216c715..0000000
--- a/legacy/Data/ingsw/0222_35/quest.txt
+++ /dev/null
@@ -1,52 +0,0 @@
-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 <stdio.h>
-
-#include <stdlib.h>
-
-#include <assert.h>
-
-#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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0222_35/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0222_35/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0222_39/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0e6f9c0..0000000
--- a/legacy/Data/ingsw/0222_39/quest.txt
+++ /dev/null
@@ -1,55 +0,0 @@
-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 <stdio.h>
-
-#include <stdlib.h>
-
-#include <assert.h>
-
-#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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0222_39/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0222_39/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0222_41/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 77ee0c6..0000000
--- a/legacy/Data/ingsw/0222_41/quest.txt
+++ /dev/null
@@ -1,55 +0,0 @@
-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 <stdio.h>
-
-#include <stdlib.h>
-
-#include <assert.h>
-
-#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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0222_41/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0222_41/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0222_5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 52b1367..0000000
--- a/legacy/Data/ingsw/0222_5/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0222_5/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 711ba55..0000000
--- a/legacy/Data/ingsw/0222_5/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/ingsw/0222_50/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a3effb0..0000000
--- a/legacy/Data/ingsw/0222_50/quest.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0222_50/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0222_50/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0222_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 97e921b..0000000
--- a/legacy/Data/ingsw/0222_7/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 711ba55..0000000
--- a/legacy/Data/ingsw/0222_7/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0222_7/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f3da655..0000000
--- a/legacy/Data/ingsw/0321_1/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5d8e650..0000000
--- a/legacy/Data/ingsw/0321_1/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 316107c..0000000
--- a/legacy/Data/ingsw/0321_1/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 82fe5c7..0000000
--- a/legacy/Data/ingsw/0321_1/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 466ac31..0000000
--- a/legacy/Data/ingsw/0321_10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c35e04d..0000000
--- a/legacy/Data/ingsw/0321_10/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9a5ec0f..0000000
--- a/legacy/Data/ingsw/0321_10/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e43ca64..0000000
--- a/legacy/Data/ingsw/0321_10/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b1a56d9..0000000
--- a/legacy/Data/ingsw/0321_11/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e383a9d..0000000
--- a/legacy/Data/ingsw/0321_11/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 769cb45..0000000
--- a/legacy/Data/ingsw/0321_11/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-3*(A + p)
diff --git a/legacy/Data/ingsw/0321_11/wrong 2.txt b/legacy/Data/ingsw/0321_11/wrong 2.txt
deleted file mode 100644
index 1045d03..0000000
--- a/legacy/Data/ingsw/0321_11/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 04fb622..0000000
--- a/legacy/Data/ingsw/0321_12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-P = 1/10
diff --git a/legacy/Data/ingsw/0321_12/quest.txt b/legacy/Data/ingsw/0321_12/quest.txt
deleted file mode 100644
index 98d8c9c..0000000
--- a/legacy/Data/ingsw/0321_12/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 76d3cf5..0000000
--- a/legacy/Data/ingsw/0321_12/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-P = 1/1000
diff --git a/legacy/Data/ingsw/0321_12/wrong 2.txt b/legacy/Data/ingsw/0321_12/wrong 2.txt
deleted file mode 100644
index 79f61ef..0000000
--- a/legacy/Data/ingsw/0321_12/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-P=1/10000
diff --git a/legacy/Data/ingsw/0321_13/correct.txt b/legacy/Data/ingsw/0321_13/correct.txt
deleted file mode 100644
index e639181..0000000
--- a/legacy/Data/ingsw/0321_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-S = (1/b)*ln(C/R)
diff --git a/legacy/Data/ingsw/0321_13/quest.txt b/legacy/Data/ingsw/0321_13/quest.txt
deleted file mode 100644
index 074190a..0000000
--- a/legacy/Data/ingsw/0321_13/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 587fc4b..0000000
--- a/legacy/Data/ingsw/0321_13/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7e82f01..0000000
--- a/legacy/Data/ingsw/0321_13/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-S = b*ln(R/C)
diff --git a/legacy/Data/ingsw/0321_14/correct.txt b/legacy/Data/ingsw/0321_14/correct.txt
deleted file mode 100644
index b74296c..0000000
--- a/legacy/Data/ingsw/0321_14/correct.txt
+++ /dev/null
@@ -1,68 +0,0 @@
-<pre>
-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;
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_14/quest.txt b/legacy/Data/ingsw/0321_14/quest.txt
deleted file mode 100644
index 35d991e..0000000
--- a/legacy/Data/ingsw/0321_14/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index c7e45ef..0000000
--- a/legacy/Data/ingsw/0321_14/wrong 1.txt	
+++ /dev/null
@@ -1,68 +0,0 @@
-<pre>
-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;
-
-</pre>
\ 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
deleted file mode 100644
index 099e40c..0000000
--- a/legacy/Data/ingsw/0321_14/wrong 2.txt	
+++ /dev/null
@@ -1,67 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_15/correct.txt b/legacy/Data/ingsw/0321_15/correct.txt
deleted file mode 100644
index 2563af3..0000000
--- a/legacy/Data/ingsw/0321_15/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9a415e5..0000000
--- a/legacy/Data/ingsw/0321_15/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index feae3c0..0000000
--- a/legacy/Data/ingsw/0321_15/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Basato sul riuso
diff --git a/legacy/Data/ingsw/0321_15/wrong 2.txt b/legacy/Data/ingsw/0321_15/wrong 2.txt
deleted file mode 100644
index f28b849..0000000
--- a/legacy/Data/ingsw/0321_15/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 58e85d7..0000000
--- a/legacy/Data/ingsw/0321_16/correct.txt
+++ /dev/null
@@ -1,40 +0,0 @@
-<pre>
-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;
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_16/quest.txt b/legacy/Data/ingsw/0321_16/quest.txt
deleted file mode 100644
index ca5c33a..0000000
--- a/legacy/Data/ingsw/0321_16/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 16efe9b..0000000
--- a/legacy/Data/ingsw/0321_16/wrong 1.txt	
+++ /dev/null
@@ -1,40 +0,0 @@
-<pre>
-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;
-
-</pre>
\ 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
deleted file mode 100644
index 6e931cd..0000000
--- a/legacy/Data/ingsw/0321_16/wrong 2.txt	
+++ /dev/null
@@ -1,39 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_17/correct.txt b/legacy/Data/ingsw/0321_17/correct.txt
deleted file mode 100644
index 3e05ae7..0000000
--- a/legacy/Data/ingsw/0321_17/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fd92d29..0000000
--- a/legacy/Data/ingsw/0321_17/quest.txt
+++ /dev/null
@@ -1,31 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena i requisiti per il sistema monitorato sono violati.
-<pre>
-//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;//
-</pre>
-
-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
deleted file mode 100644
index 7e7f05d..0000000
--- a/legacy/Data/ingsw/0321_17/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 750bfd2..0000000
--- a/legacy/Data/ingsw/0321_17/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 20bf664..0000000
--- a/legacy/Data/ingsw/0321_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Sviluppo Plan-driven.
diff --git a/legacy/Data/ingsw/0321_18/quest.txt b/legacy/Data/ingsw/0321_18/quest.txt
deleted file mode 100644
index 367a9e2..0000000
--- a/legacy/Data/ingsw/0321_18/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 61e542a..0000000
--- a/legacy/Data/ingsw/0321_18/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 04301d6..0000000
--- a/legacy/Data/ingsw/0321_18/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Extreme programming.
diff --git a/legacy/Data/ingsw/0321_19/correct.txt b/legacy/Data/ingsw/0321_19/correct.txt
deleted file mode 100644
index 6bbf6f3..0000000
--- a/legacy/Data/ingsw/0321_19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d0df919..0000000
--- a/legacy/Data/ingsw/0321_19/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 45da4a7..0000000
--- a/legacy/Data/ingsw/0321_19/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ddbf5eb..0000000
--- a/legacy/Data/ingsw/0321_19/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index cee9602..0000000
--- a/legacy/Data/ingsw/0321_2/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bdf9fb8..0000000
--- a/legacy/Data/ingsw/0321_2/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 66185ec..0000000
--- a/legacy/Data/ingsw/0321_2/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2079027..0000000
--- a/legacy/Data/ingsw/0321_2/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f331550..0000000
--- a/legacy/Data/ingsw/0321_20/correct.txt
+++ /dev/null
@@ -1,69 +0,0 @@
-<pre>
-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;
-
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_20/quest.txt b/legacy/Data/ingsw/0321_20/quest.txt
deleted file mode 100644
index 82d67f0..0000000
--- a/legacy/Data/ingsw/0321_20/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 18b6dcd..0000000
--- a/legacy/Data/ingsw/0321_20/wrong 1.txt	
+++ /dev/null
@@ -1,67 +0,0 @@
-<pre>
-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;
-</pre>
diff --git a/legacy/Data/ingsw/0321_20/wrong 2.txt b/legacy/Data/ingsw/0321_20/wrong 2.txt
deleted file mode 100644
index f66d694..0000000
--- a/legacy/Data/ingsw/0321_20/wrong 2.txt	
+++ /dev/null
@@ -1,68 +0,0 @@
-<pre>
-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;
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_21/correct.txt b/legacy/Data/ingsw/0321_21/correct.txt
deleted file mode 100644
index 37e1847..0000000
--- a/legacy/Data/ingsw/0321_21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 269050d..0000000
--- a/legacy/Data/ingsw/0321_21/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index eb880d8..0000000
--- a/legacy/Data/ingsw/0321_21/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1f25f6d..0000000
--- a/legacy/Data/ingsw/0321_21/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 986f4e1..0000000
--- a/legacy/Data/ingsw/0321_23/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fe96eab..0000000
--- a/legacy/Data/ingsw/0321_23/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 06e87ff..0000000
--- a/legacy/Data/ingsw/0321_23/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d291b48..0000000
--- a/legacy/Data/ingsw/0321_23/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d4074cf..0000000
--- a/legacy/Data/ingsw/0321_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b8b36ab..0000000
--- a/legacy/Data/ingsw/0321_24/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bc8b2f6..0000000
--- a/legacy/Data/ingsw/0321_24/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a801d80..0000000
--- a/legacy/Data/ingsw/0321_24/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Testare le interfacce di ciascuna componente.
diff --git a/legacy/Data/ingsw/0321_27/correct.txt b/legacy/Data/ingsw/0321_27/correct.txt
deleted file mode 100644
index 35e7b12..0000000
--- a/legacy/Data/ingsw/0321_27/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-2*A*(p +1)
diff --git a/legacy/Data/ingsw/0321_27/quest.txt b/legacy/Data/ingsw/0321_27/quest.txt
deleted file mode 100644
index 67e890e..0000000
--- a/legacy/Data/ingsw/0321_27/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b84e570..0000000
--- a/legacy/Data/ingsw/0321_27/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-2*A*(p + 2)
diff --git a/legacy/Data/ingsw/0321_27/wrong 2.txt b/legacy/Data/ingsw/0321_27/wrong 2.txt
deleted file mode 100644
index ebab514..0000000
--- a/legacy/Data/ingsw/0321_27/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 489e74c..0000000
--- a/legacy/Data/ingsw/0321_28/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7441816..0000000
--- a/legacy/Data/ingsw/0321_28/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bf91afb..0000000
--- a/legacy/Data/ingsw/0321_28/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23cbd0e..0000000
--- a/legacy/Data/ingsw/0321_28/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index aed001f..0000000
--- a/legacy/Data/ingsw/0321_29/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9eb2619..0000000
--- a/legacy/Data/ingsw/0321_29/quest.txt
+++ /dev/null
@@ -1,31 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato.
-<pre>
-
-// 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; //
-</pre>
-
-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
deleted file mode 100644
index bc08e8a..0000000
--- a/legacy/Data/ingsw/0321_29/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 52ad14a..0000000
--- a/legacy/Data/ingsw/0321_29/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8cd4fca..0000000
--- a/legacy/Data/ingsw/0321_30/correct.txt
+++ /dev/null
@@ -1,26 +0,0 @@
-<pre>
-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;
-
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_30/quest.txt b/legacy/Data/ingsw/0321_30/quest.txt
deleted file mode 100644
index 6b6eb9d..0000000
--- a/legacy/Data/ingsw/0321_30/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d9a0133..0000000
--- a/legacy/Data/ingsw/0321_30/wrong 1.txt	
+++ /dev/null
@@ -1,26 +0,0 @@
-<pre>
-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;
-
-</pre>
\ 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
deleted file mode 100644
index e11b34d..0000000
--- a/legacy/Data/ingsw/0321_30/wrong 2.txt	
+++ /dev/null
@@ -1,25 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_31/correct.txt b/legacy/Data/ingsw/0321_31/correct.txt
deleted file mode 100644
index 07800da..0000000
--- a/legacy/Data/ingsw/0321_31/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 6e4c617..0000000
--- a/legacy/Data/ingsw/0321_31/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8c7e5a6..0000000
--- a/legacy/Data/ingsw/0321_31/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 14dff62..0000000
--- a/legacy/Data/ingsw/0321_31/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1c03108..0000000
--- a/legacy/Data/ingsw/0321_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 49d08f9..0000000
--- a/legacy/Data/ingsw/0321_32/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5187be2..0000000
--- a/legacy/Data/ingsw/0321_32/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 52330c1..0000000
--- a/legacy/Data/ingsw/0321_32/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f8c9568..0000000
--- a/legacy/Data/ingsw/0321_36/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c00055b..0000000
--- a/legacy/Data/ingsw/0321_36/quest.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-Si consideri il seguente modello Modelica:
-<pre>
-// class System
-
-Integer x;
-
-initial equation
-
-x = 0;
-
-equation
-
-when sample(0, 2) then
-
-    x = 1 - pre(x);
-
-end when;
-
-end System; //
-</pre>
-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
deleted file mode 100644
index a7af2cb..0000000
--- a/legacy/Data/ingsw/0321_36/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f485a50..0000000
--- a/legacy/Data/ingsw/0321_36/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ee47430..0000000
--- a/legacy/Data/ingsw/0321_37/correct.txt
+++ /dev/null
@@ -1,27 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_37/quest.txt b/legacy/Data/ingsw/0321_37/quest.txt
deleted file mode 100644
index a90ebb5..0000000
--- a/legacy/Data/ingsw/0321_37/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 98dc977..0000000
--- a/legacy/Data/ingsw/0321_37/wrong 1.txt	
+++ /dev/null
@@ -1,28 +0,0 @@
-<pre>
-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;
-
-</pre>
\ 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
deleted file mode 100644
index dda46fb..0000000
--- a/legacy/Data/ingsw/0321_37/wrong 2.txt	
+++ /dev/null
@@ -1,27 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_38/correct.txt b/legacy/Data/ingsw/0321_38/correct.txt
deleted file mode 100644
index 1a8a50a..0000000
--- a/legacy/Data/ingsw/0321_38/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 580fc18..0000000
--- a/legacy/Data/ingsw/0321_38/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3fdb31e..0000000
--- a/legacy/Data/ingsw/0321_38/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fac8307..0000000
--- a/legacy/Data/ingsw/0321_38/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2736f39..0000000
--- a/legacy/Data/ingsw/0321_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index aec403c..0000000
--- a/legacy/Data/ingsw/0321_4/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 66061d9..0000000
--- a/legacy/Data/ingsw/0321_4/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index dd9b48a..0000000
--- a/legacy/Data/ingsw/0321_4/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b126cfb..0000000
--- a/legacy/Data/ingsw/0321_40/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 91423cc..0000000
--- a/legacy/Data/ingsw/0321_40/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-"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
deleted file mode 100644
index c09e71c..0000000
--- a/legacy/Data/ingsw/0321_40/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4c69e5b..0000000
--- a/legacy/Data/ingsw/0321_40/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0b6b40f..0000000
--- a/legacy/Data/ingsw/0321_8/correct.txt
+++ /dev/null
@@ -1,53 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_8/quest.txt b/legacy/Data/ingsw/0321_8/quest.txt
deleted file mode 100644
index 01ba436..0000000
--- a/legacy/Data/ingsw/0321_8/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6a2cd60..0000000
--- a/legacy/Data/ingsw/0321_8/wrong 1.txt	
+++ /dev/null
@@ -1,54 +0,0 @@
-<pre>
-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;
-
-</pre>
\ 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
deleted file mode 100644
index 34bb9bd..0000000
--- a/legacy/Data/ingsw/0321_8/wrong 2.txt	
+++ /dev/null
@@ -1,53 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0321_9/correct.txt b/legacy/Data/ingsw/0321_9/correct.txt
deleted file mode 100644
index 936832d..0000000
--- a/legacy/Data/ingsw/0321_9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9f5e001..0000000
--- a/legacy/Data/ingsw/0321_9/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 316107c..0000000
--- a/legacy/Data/ingsw/0321_9/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 68f09b9..0000000
--- a/legacy/Data/ingsw/0321_9/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3fb437d..0000000
--- a/legacy/Data/ingsw/0324_0/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 858d9c6..0000000
--- a/legacy/Data/ingsw/0324_0/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index c64601b..0000000
--- a/legacy/Data/ingsw/0324_0/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fc54e00..0000000
--- a/legacy/Data/ingsw/0324_0/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a4a7e01..0000000
--- a/legacy/Data/ingsw/0324_1/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 4bcd55f..0000000
--- a/legacy/Data/ingsw/0324_1/wrong1.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index a3caf2e..0000000
--- a/legacy/Data/ingsw/0324_1/wrong2.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 1d08fb4..0000000
--- a/legacy/Data/ingsw/0324_1/wrong3.txt
+++ /dev/null
@@ -1,46 +0,0 @@
-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
deleted file mode 100644
index aef914a..0000000
--- a/legacy/Data/ingsw/0324_10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9af4805..0000000
--- a/legacy/Data/ingsw/0324_10/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/ingsw/0324_10/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/ingsw/0324_10/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 26df850..0000000
--- a/legacy/Data/ingsw/0324_11/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 2f7168f..0000000
--- a/legacy/Data/ingsw/0324_11/wrong1.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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
deleted file mode 100644
index c3b40d2..0000000
--- a/legacy/Data/ingsw/0324_11/wrong2.txt
+++ /dev/null
@@ -1,34 +0,0 @@
-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
deleted file mode 100644
index 9116c62..0000000
--- a/legacy/Data/ingsw/0324_11/wrong3.txt
+++ /dev/null
@@ -1,37 +0,0 @@
-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
deleted file mode 100644
index e74b1fc..0000000
--- a/legacy/Data/ingsw/0324_12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c1cd6d0..0000000
--- a/legacy/Data/ingsw/0324_12/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index d63544a..0000000
--- a/legacy/Data/ingsw/0324_12/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1753a91..0000000
--- a/legacy/Data/ingsw/0324_12/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0324_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4344b75..0000000
--- a/legacy/Data/ingsw/0324_13/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0324_13/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0324_13/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1c7da8c..0000000
--- a/legacy/Data/ingsw/0324_14/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b9ba678..0000000
--- a/legacy/Data/ingsw/0324_14/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 7eb6830..0000000
--- a/legacy/Data/ingsw/0324_14/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8a346b7..0000000
--- a/legacy/Data/ingsw/0324_14/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a40ea7d..0000000
--- a/legacy/Data/ingsw/0324_15/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 2d895ca..0000000
--- a/legacy/Data/ingsw/0324_15/quest.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-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
deleted file mode 100644
index 5b77112..0000000
--- a/legacy/Data/ingsw/0324_15/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index abe0eaa..0000000
--- a/legacy/Data/ingsw/0324_15/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 1a8a50a..0000000
--- a/legacy/Data/ingsw/0324_16/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 793b220..0000000
--- a/legacy/Data/ingsw/0324_16/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fac8307..0000000
--- a/legacy/Data/ingsw/0324_16/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3fdb31e..0000000
--- a/legacy/Data/ingsw/0324_16/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/ingsw/0324_17/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1f51ab1..0000000
--- a/legacy/Data/ingsw/0324_17/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/ingsw/0324_17/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/ingsw/0324_17/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7311d41..0000000
--- a/legacy/Data/ingsw/0324_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d3a9fe2..0000000
--- a/legacy/Data/ingsw/0324_18/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index 3e327ab..0000000
--- a/legacy/Data/ingsw/0324_18/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7e48e4f..0000000
--- a/legacy/Data/ingsw/0324_18/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6b560cf..0000000
--- a/legacy/Data/ingsw/0324_19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b7a608e..0000000
--- a/legacy/Data/ingsw/0324_19/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/ingsw/0324_19/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/ingsw/0324_19/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0324_2/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index adede32..0000000
--- a/legacy/Data/ingsw/0324_2/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0324_2/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0324_2/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 90b2f35..0000000
--- a/legacy/Data/ingsw/0324_20/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9d685ad..0000000
--- a/legacy/Data/ingsw/0324_20/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0324_20/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/ingsw/0324_20/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 31a01d5..0000000
--- a/legacy/Data/ingsw/0324_21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d649932..0000000
--- a/legacy/Data/ingsw/0324_21/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index 0c564f7..0000000
--- a/legacy/Data/ingsw/0324_21/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 549dba8..0000000
--- a/legacy/Data/ingsw/0324_21/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0324_22/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 65cfd2d..0000000
--- a/legacy/Data/ingsw/0324_22/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0324_22/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0324_22/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0324_23/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c9ea208..0000000
--- a/legacy/Data/ingsw/0324_23/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/ingsw/0324_23/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1a8a508..0000000
--- a/legacy/Data/ingsw/0324_23/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e13eda2..0000000
--- a/legacy/Data/ingsw/0324_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b59a64d..0000000
--- a/legacy/Data/ingsw/0324_24/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b24f900..0000000
--- a/legacy/Data/ingsw/0324_24/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 884d6b1..0000000
--- a/legacy/Data/ingsw/0324_24/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7c149d8..0000000
--- a/legacy/Data/ingsw/0324_25/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8bba4b8..0000000
--- a/legacy/Data/ingsw/0324_25/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3461684..0000000
--- a/legacy/Data/ingsw/0324_25/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/ingsw/0324_25/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index aef871e..0000000
--- a/legacy/Data/ingsw/0324_26/quest.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0324_26/wrong2.txt b/legacy/Data/ingsw/0324_26/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0324_26/wrong3.txt b/legacy/Data/ingsw/0324_26/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0324_27/correct.txt b/legacy/Data/ingsw/0324_27/correct.txt
deleted file mode 100644
index e582263..0000000
--- a/legacy/Data/ingsw/0324_27/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_27/quest.txt b/legacy/Data/ingsw/0324_27/quest.txt
deleted file mode 100644
index 864cc93..0000000
--- a/legacy/Data/ingsw/0324_27/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 590f7e1..0000000
--- a/legacy/Data/ingsw/0324_27/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_27/wrong2.txt b/legacy/Data/ingsw/0324_27/wrong2.txt
deleted file mode 100644
index 0f38391..0000000
--- a/legacy/Data/ingsw/0324_27/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_28/correct.txt b/legacy/Data/ingsw/0324_28/correct.txt
deleted file mode 100644
index 4c75070..0000000
--- a/legacy/Data/ingsw/0324_28/correct.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_28/quest.txt b/legacy/Data/ingsw/0324_28/quest.txt
deleted file mode 100644
index e11a044..0000000
--- a/legacy/Data/ingsw/0324_28/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 6dafe94..0000000
--- a/legacy/Data/ingsw/0324_28/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_28/wrong2.txt b/legacy/Data/ingsw/0324_28/wrong2.txt
deleted file mode 100644
index a3d79a4..0000000
--- a/legacy/Data/ingsw/0324_28/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_29/correct.txt b/legacy/Data/ingsw/0324_29/correct.txt
deleted file mode 100644
index e7c5bb8..0000000
--- a/legacy/Data/ingsw/0324_29/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 296cdcb..0000000
--- a/legacy/Data/ingsw/0324_29/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2b6e242..0000000
--- a/legacy/Data/ingsw/0324_29/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bfb5124..0000000
--- a/legacy/Data/ingsw/0324_29/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/ingsw/0324_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b865ed9..0000000
--- a/legacy/Data/ingsw/0324_3/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/0324_3/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0324_3/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 985c244..0000000
--- a/legacy/Data/ingsw/0324_30/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 69b9722..0000000
--- a/legacy/Data/ingsw/0324_30/wrong1.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-#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
deleted file mode 100644
index a26ce6e..0000000
--- a/legacy/Data/ingsw/0324_30/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-#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
deleted file mode 100644
index ed5ad19..0000000
--- a/legacy/Data/ingsw/0324_30/wrong3.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-#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
deleted file mode 100644
index 293ebbc..0000000
--- a/legacy/Data/ingsw/0324_31/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_31/quest.txt b/legacy/Data/ingsw/0324_31/quest.txt
deleted file mode 100644
index 5922b9f..0000000
--- a/legacy/Data/ingsw/0324_31/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index d50b268..0000000
--- a/legacy/Data/ingsw/0324_31/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_31/wrong2.txt b/legacy/Data/ingsw/0324_31/wrong2.txt
deleted file mode 100644
index d7890b2..0000000
--- a/legacy/Data/ingsw/0324_31/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_32/correct.txt b/legacy/Data/ingsw/0324_32/correct.txt
deleted file mode 100644
index 2a2ecea..0000000
--- a/legacy/Data/ingsw/0324_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5d96d42..0000000
--- a/legacy/Data/ingsw/0324_32/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 9927a93..0000000
--- a/legacy/Data/ingsw/0324_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d68fd15..0000000
--- a/legacy/Data/ingsw/0324_32/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 232aedf..0000000
--- a/legacy/Data/ingsw/0324_33/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index b2bed72..0000000
--- a/legacy/Data/ingsw/0324_33/quest.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-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
deleted file mode 100644
index 5d5c9a4..0000000
--- a/legacy/Data/ingsw/0324_33/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 2b6c292..0000000
--- a/legacy/Data/ingsw/0324_33/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index ad21063..0000000
--- a/legacy/Data/ingsw/0324_34/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_34/quest.txt b/legacy/Data/ingsw/0324_34/quest.txt
deleted file mode 100644
index 031c331..0000000
--- a/legacy/Data/ingsw/0324_34/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index b14ac60..0000000
--- a/legacy/Data/ingsw/0324_34/wrong1.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_34/wrong2.txt b/legacy/Data/ingsw/0324_34/wrong2.txt
deleted file mode 100644
index e4201ab..0000000
--- a/legacy/Data/ingsw/0324_34/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_35/quest.txt b/legacy/Data/ingsw/0324_35/quest.txt
deleted file mode 100644
index 627c57e..0000000
--- a/legacy/Data/ingsw/0324_35/quest.txt
+++ /dev/null
@@ -1,39 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0324_35/wrong2.txt b/legacy/Data/ingsw/0324_35/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0324_35/wrong3.txt b/legacy/Data/ingsw/0324_35/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0324_36/correct.txt b/legacy/Data/ingsw/0324_36/correct.txt
deleted file mode 100644
index b9f32a6..0000000
--- a/legacy/Data/ingsw/0324_36/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 36471c2..0000000
--- a/legacy/Data/ingsw/0324_36/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 3143da9..0000000
--- a/legacy/Data/ingsw/0324_36/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 70022eb..0000000
--- a/legacy/Data/ingsw/0324_36/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0324_37/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fc6a5e1..0000000
--- a/legacy/Data/ingsw/0324_37/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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
deleted file mode 100644
index 90b2f35..0000000
--- a/legacy/Data/ingsw/0324_37/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/ingsw/0324_37/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 98939be..0000000
--- a/legacy/Data/ingsw/0324_38/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d24403f..0000000
--- a/legacy/Data/ingsw/0324_38/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 56ea6ac..0000000
--- a/legacy/Data/ingsw/0324_38/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index db2276d..0000000
--- a/legacy/Data/ingsw/0324_38/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 4a8e634..0000000
--- a/legacy/Data/ingsw/0324_39/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_39/quest.txt b/legacy/Data/ingsw/0324_39/quest.txt
deleted file mode 100644
index 576af1a..0000000
--- a/legacy/Data/ingsw/0324_39/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index a43796b..0000000
--- a/legacy/Data/ingsw/0324_39/wrong1.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_39/wrong2.txt b/legacy/Data/ingsw/0324_39/wrong2.txt
deleted file mode 100644
index 68aa37a..0000000
--- a/legacy/Data/ingsw/0324_39/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_4/correct.txt b/legacy/Data/ingsw/0324_4/correct.txt
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/ingsw/0324_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 40b7789..0000000
--- a/legacy/Data/ingsw/0324_4/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 2a47a95..0000000
--- a/legacy/Data/ingsw/0324_4/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b7bbee2..0000000
--- a/legacy/Data/ingsw/0324_4/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ce9968f..0000000
--- a/legacy/Data/ingsw/0324_40/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fbee794..0000000
--- a/legacy/Data/ingsw/0324_40/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/ingsw/0324_40/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e8f9017..0000000
--- a/legacy/Data/ingsw/0324_40/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bfb2790..0000000
--- a/legacy/Data/ingsw/0324_41/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 1fad89a..0000000
--- a/legacy/Data/ingsw/0324_41/wrong1.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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
deleted file mode 100644
index 882ae3e..0000000
--- a/legacy/Data/ingsw/0324_41/wrong2.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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
deleted file mode 100644
index e5618fa..0000000
--- a/legacy/Data/ingsw/0324_41/wrong3.txt
+++ /dev/null
@@ -1,34 +0,0 @@
-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
deleted file mode 100644
index 071ac68..0000000
--- a/legacy/Data/ingsw/0324_42/quest.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0324_42/wrong2.txt b/legacy/Data/ingsw/0324_42/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0324_42/wrong3.txt b/legacy/Data/ingsw/0324_42/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0324_43/correct.txt b/legacy/Data/ingsw/0324_43/correct.txt
deleted file mode 100644
index 5464d05..0000000
--- a/legacy/Data/ingsw/0324_43/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 710edb6..0000000
--- a/legacy/Data/ingsw/0324_43/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/ingsw/0324_43/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/ingsw/0324_43/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8785661..0000000
--- a/legacy/Data/ingsw/0324_44/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index 36947c2..0000000
--- a/legacy/Data/ingsw/0324_44/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 0aaedb8..0000000
--- a/legacy/Data/ingsw/0324_44/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index a6df32d..0000000
--- a/legacy/Data/ingsw/0324_44/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index c37d6ae..0000000
--- a/legacy/Data/ingsw/0324_45/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_45/quest.txt b/legacy/Data/ingsw/0324_45/quest.txt
deleted file mode 100644
index 003d1dd..0000000
--- a/legacy/Data/ingsw/0324_45/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index edea147..0000000
--- a/legacy/Data/ingsw/0324_45/wrong1.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_45/wrong2.txt b/legacy/Data/ingsw/0324_45/wrong2.txt
deleted file mode 100644
index 14bd900..0000000
--- a/legacy/Data/ingsw/0324_45/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_46/correct.txt b/legacy/Data/ingsw/0324_46/correct.txt
deleted file mode 100644
index a98afd2..0000000
--- a/legacy/Data/ingsw/0324_46/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_46/quest.txt b/legacy/Data/ingsw/0324_46/quest.txt
deleted file mode 100644
index b420aaf..0000000
--- a/legacy/Data/ingsw/0324_46/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 66064fe..0000000
--- a/legacy/Data/ingsw/0324_46/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_46/wrong2.txt b/legacy/Data/ingsw/0324_46/wrong2.txt
deleted file mode 100644
index c71f1f5..0000000
--- a/legacy/Data/ingsw/0324_46/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_47/quest.txt b/legacy/Data/ingsw/0324_47/quest.txt
deleted file mode 100644
index 0240bc8..0000000
--- a/legacy/Data/ingsw/0324_47/quest.txt
+++ /dev/null
@@ -1,18 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0324_47/wrong2.txt b/legacy/Data/ingsw/0324_47/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0324_47/wrong3.txt b/legacy/Data/ingsw/0324_47/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0324_48/quest.txt b/legacy/Data/ingsw/0324_48/quest.txt
deleted file mode 100644
index 1109458..0000000
--- a/legacy/Data/ingsw/0324_48/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 4bcd55f..0000000
--- a/legacy/Data/ingsw/0324_48/wrong1.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index 19be218..0000000
--- a/legacy/Data/ingsw/0324_48/wrong2.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 3387be9..0000000
--- a/legacy/Data/ingsw/0324_48/wrong3.txt
+++ /dev/null
@@ -1,49 +0,0 @@
-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
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/ingsw/0324_49/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7710e8f..0000000
--- a/legacy/Data/ingsw/0324_49/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9e12d11..0000000
--- a/legacy/Data/ingsw/0324_49/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/ingsw/0324_49/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 81a4b93..0000000
--- a/legacy/Data/ingsw/0324_5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 236ccc7..0000000
--- a/legacy/Data/ingsw/0324_5/quest.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-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
deleted file mode 100644
index d246b94..0000000
--- a/legacy/Data/ingsw/0324_5/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f52d5ae..0000000
--- a/legacy/Data/ingsw/0324_5/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/ingsw/0324_6/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f6ffda4..0000000
--- a/legacy/Data/ingsw/0324_6/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/ingsw/0324_6/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/ingsw/0324_6/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 43dc0c9..0000000
--- a/legacy/Data/ingsw/0324_7/correct.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index f6744fd..0000000
--- a/legacy/Data/ingsw/0324_7/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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
deleted file mode 100644
index 3f63933..0000000
--- a/legacy/Data/ingsw/0324_7/wrong1.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 6a97baf..0000000
--- a/legacy/Data/ingsw/0324_7/wrong2.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index b8bf06e..0000000
--- a/legacy/Data/ingsw/0324_8/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_8/quest.txt b/legacy/Data/ingsw/0324_8/quest.txt
deleted file mode 100644
index 22c683f..0000000
--- a/legacy/Data/ingsw/0324_8/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 2029293..0000000
--- a/legacy/Data/ingsw/0324_8/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_8/wrong2.txt b/legacy/Data/ingsw/0324_8/wrong2.txt
deleted file mode 100644
index bc8720d..0000000
--- a/legacy/Data/ingsw/0324_8/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0324_9/correct.txt b/legacy/Data/ingsw/0324_9/correct.txt
deleted file mode 100644
index 7a6c6b9..0000000
--- a/legacy/Data/ingsw/0324_9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 47201e7..0000000
--- a/legacy/Data/ingsw/0324_9/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 2df501e..0000000
--- a/legacy/Data/ingsw/0324_9/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 997967b..0000000
--- a/legacy/Data/ingsw/0324_9/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0422-16/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1b18990..0000000
--- a/legacy/Data/ingsw/0422-16/quest.txt
+++ /dev/null
@@ -1,20 +0,0 @@
-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
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/ingsw/0422-16/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0422-16/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1f3419c..0000000
--- a/legacy/Data/ingsw/0613_0/quest.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0613_0/wrong2.txt b/legacy/Data/ingsw/0613_0/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0613_0/wrong3.txt b/legacy/Data/ingsw/0613_0/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0613_1/correct.txt b/legacy/Data/ingsw/0613_1/correct.txt
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/ingsw/0613_1/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 654955e..0000000
--- a/legacy/Data/ingsw/0613_1/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 2a47a95..0000000
--- a/legacy/Data/ingsw/0613_1/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b7bbee2..0000000
--- a/legacy/Data/ingsw/0613_1/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0613_10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9e4d3a9..0000000
--- a/legacy/Data/ingsw/0613_10/quest.txt
+++ /dev/null
@@ -1,31 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0613_10/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0613_10/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index aef914a..0000000
--- a/legacy/Data/ingsw/0613_11/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9af4805..0000000
--- a/legacy/Data/ingsw/0613_11/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index eb23d05..0000000
--- a/legacy/Data/ingsw/0613_11/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 32c628c..0000000
--- a/legacy/Data/ingsw/0613_11/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 475d1ef..0000000
--- a/legacy/Data/ingsw/0613_12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index 36947c2..0000000
--- a/legacy/Data/ingsw/0613_12/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 0aaedb8..0000000
--- a/legacy/Data/ingsw/0613_12/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index a6df32d..0000000
--- a/legacy/Data/ingsw/0613_12/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index 12d93cc..0000000
--- a/legacy/Data/ingsw/0613_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6f20250..0000000
--- a/legacy/Data/ingsw/0613_13/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/ingsw/0613_13/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5464d05..0000000
--- a/legacy/Data/ingsw/0613_13/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b95c7d3..0000000
--- a/legacy/Data/ingsw/0613_14/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0613_14/wrong2.txt b/legacy/Data/ingsw/0613_14/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0613_14/wrong3.txt b/legacy/Data/ingsw/0613_14/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0613_15/correct.txt b/legacy/Data/ingsw/0613_15/correct.txt
deleted file mode 100644
index b8bf06e..0000000
--- a/legacy/Data/ingsw/0613_15/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_15/quest.txt b/legacy/Data/ingsw/0613_15/quest.txt
deleted file mode 100644
index 22c683f..0000000
--- a/legacy/Data/ingsw/0613_15/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index bc8720d..0000000
--- a/legacy/Data/ingsw/0613_15/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_15/wrong2.txt b/legacy/Data/ingsw/0613_15/wrong2.txt
deleted file mode 100644
index 2029293..0000000
--- a/legacy/Data/ingsw/0613_15/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_16/correct.txt b/legacy/Data/ingsw/0613_16/correct.txt
deleted file mode 100644
index e582263..0000000
--- a/legacy/Data/ingsw/0613_16/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_16/quest.txt b/legacy/Data/ingsw/0613_16/quest.txt
deleted file mode 100644
index 864cc93..0000000
--- a/legacy/Data/ingsw/0613_16/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 590f7e1..0000000
--- a/legacy/Data/ingsw/0613_16/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_16/wrong2.txt b/legacy/Data/ingsw/0613_16/wrong2.txt
deleted file mode 100644
index 0f38391..0000000
--- a/legacy/Data/ingsw/0613_16/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_17/correct.txt b/legacy/Data/ingsw/0613_17/correct.txt
deleted file mode 100644
index c37d6ae..0000000
--- a/legacy/Data/ingsw/0613_17/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_17/quest.txt b/legacy/Data/ingsw/0613_17/quest.txt
deleted file mode 100644
index 003d1dd..0000000
--- a/legacy/Data/ingsw/0613_17/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 14bd900..0000000
--- a/legacy/Data/ingsw/0613_17/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_17/wrong2.txt b/legacy/Data/ingsw/0613_17/wrong2.txt
deleted file mode 100644
index edea147..0000000
--- a/legacy/Data/ingsw/0613_17/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_18/correct.txt b/legacy/Data/ingsw/0613_18/correct.txt
deleted file mode 100644
index 98939be..0000000
--- a/legacy/Data/ingsw/0613_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 91edad5..0000000
--- a/legacy/Data/ingsw/0613_18/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 56ea6ac..0000000
--- a/legacy/Data/ingsw/0613_18/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index db2276d..0000000
--- a/legacy/Data/ingsw/0613_18/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 052028b..0000000
--- a/legacy/Data/ingsw/0613_19/quest.txt
+++ /dev/null
@@ -1,37 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0613_19/wrong2.txt b/legacy/Data/ingsw/0613_19/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0613_19/wrong3.txt b/legacy/Data/ingsw/0613_19/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0613_2/quest.txt b/legacy/Data/ingsw/0613_2/quest.txt
deleted file mode 100644
index fcb1323..0000000
--- a/legacy/Data/ingsw/0613_2/quest.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-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
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0613_2/wrong2.txt b/legacy/Data/ingsw/0613_2/wrong2.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0613_2/wrong3.txt b/legacy/Data/ingsw/0613_2/wrong3.txt
deleted file mode 100644
index e69de29..0000000
diff --git a/legacy/Data/ingsw/0613_20/correct.txt b/legacy/Data/ingsw/0613_20/correct.txt
deleted file mode 100644
index 2a2ecea..0000000
--- a/legacy/Data/ingsw/0613_20/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 79b69ac..0000000
--- a/legacy/Data/ingsw/0613_20/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index d68fd15..0000000
--- a/legacy/Data/ingsw/0613_20/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9927a93..0000000
--- a/legacy/Data/ingsw/0613_20/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 936832d..0000000
--- a/legacy/Data/ingsw/0613_21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 07ce5c9..0000000
--- a/legacy/Data/ingsw/0613_21/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 316107c..0000000
--- a/legacy/Data/ingsw/0613_21/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 68f09b9..0000000
--- a/legacy/Data/ingsw/0613_21/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2ca9276..0000000
--- a/legacy/Data/ingsw/0613_22/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index aef94a6..0000000
--- a/legacy/Data/ingsw/0613_22/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 5623b39..0000000
--- a/legacy/Data/ingsw/0613_22/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c376ef7..0000000
--- a/legacy/Data/ingsw/0613_22/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4a8e634..0000000
--- a/legacy/Data/ingsw/0613_23/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_23/quest.txt b/legacy/Data/ingsw/0613_23/quest.txt
deleted file mode 100644
index 576af1a..0000000
--- a/legacy/Data/ingsw/0613_23/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 68aa37a..0000000
--- a/legacy/Data/ingsw/0613_23/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_23/wrong2.txt b/legacy/Data/ingsw/0613_23/wrong2.txt
deleted file mode 100644
index a43796b..0000000
--- a/legacy/Data/ingsw/0613_23/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_24/correct.txt b/legacy/Data/ingsw/0613_24/correct.txt
deleted file mode 100644
index 5464d05..0000000
--- a/legacy/Data/ingsw/0613_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9534ab3..0000000
--- a/legacy/Data/ingsw/0613_24/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/ingsw/0613_24/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index cf27703..0000000
--- a/legacy/Data/ingsw/0613_24/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e74b1fc..0000000
--- a/legacy/Data/ingsw/0613_25/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c1cd6d0..0000000
--- a/legacy/Data/ingsw/0613_25/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index d63544a..0000000
--- a/legacy/Data/ingsw/0613_25/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1753a91..0000000
--- a/legacy/Data/ingsw/0613_25/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0613_26/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index dcec721..0000000
--- a/legacy/Data/ingsw/0613_26/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0613_26/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0613_26/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 35670bc..0000000
--- a/legacy/Data/ingsw/0613_27/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 4bcd55f..0000000
--- a/legacy/Data/ingsw/0613_27/wrong1.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index 19be218..0000000
--- a/legacy/Data/ingsw/0613_27/wrong2.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 29daf30..0000000
--- a/legacy/Data/ingsw/0613_27/wrong3.txt
+++ /dev/null
@@ -1,49 +0,0 @@
-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
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/ingsw/0613_28/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 32aecd3..0000000
--- a/legacy/Data/ingsw/0613_28/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/ingsw/0613_28/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 90b2f35..0000000
--- a/legacy/Data/ingsw/0613_28/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7a6c6b9..0000000
--- a/legacy/Data/ingsw/0613_29/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 47201e7..0000000
--- a/legacy/Data/ingsw/0613_29/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 997967b..0000000
--- a/legacy/Data/ingsw/0613_29/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2df501e..0000000
--- a/legacy/Data/ingsw/0613_29/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3fb437d..0000000
--- a/legacy/Data/ingsw/0613_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d8bc097..0000000
--- a/legacy/Data/ingsw/0613_3/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index fc54e00..0000000
--- a/legacy/Data/ingsw/0613_3/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c64601b..0000000
--- a/legacy/Data/ingsw/0613_3/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/ingsw/0613_30/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 56ab57a..0000000
--- a/legacy/Data/ingsw/0613_30/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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
deleted file mode 100644
index 90b2f35..0000000
--- a/legacy/Data/ingsw/0613_30/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/ingsw/0613_30/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/ingsw/0613_31/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9f9ed74..0000000
--- a/legacy/Data/ingsw/0613_31/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0613_31/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/0613_31/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/ingsw/0613_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1724f1c..0000000
--- a/legacy/Data/ingsw/0613_32/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/ingsw/0613_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index cf27703..0000000
--- a/legacy/Data/ingsw/0613_32/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e940faa..0000000
--- a/legacy/Data/ingsw/0613_33/correct.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 2758118..0000000
--- a/legacy/Data/ingsw/0613_33/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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
deleted file mode 100644
index ad32d88..0000000
--- a/legacy/Data/ingsw/0613_33/wrong1.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 642ec6b..0000000
--- a/legacy/Data/ingsw/0613_33/wrong2.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index e7c5bb8..0000000
--- a/legacy/Data/ingsw/0613_34/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 296cdcb..0000000
--- a/legacy/Data/ingsw/0613_34/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bfb5124..0000000
--- a/legacy/Data/ingsw/0613_34/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2b6e242..0000000
--- a/legacy/Data/ingsw/0613_34/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ad21063..0000000
--- a/legacy/Data/ingsw/0613_35/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_35/quest.txt b/legacy/Data/ingsw/0613_35/quest.txt
deleted file mode 100644
index 031c331..0000000
--- a/legacy/Data/ingsw/0613_35/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index b14ac60..0000000
--- a/legacy/Data/ingsw/0613_35/wrong1.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_35/wrong2.txt b/legacy/Data/ingsw/0613_35/wrong2.txt
deleted file mode 100644
index e4201ab..0000000
--- a/legacy/Data/ingsw/0613_35/wrong2.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_36/correct.txt b/legacy/Data/ingsw/0613_36/correct.txt
deleted file mode 100644
index 1c7da8c..0000000
--- a/legacy/Data/ingsw/0613_36/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 58782d5..0000000
--- a/legacy/Data/ingsw/0613_36/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 8a346b7..0000000
--- a/legacy/Data/ingsw/0613_36/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7eb6830..0000000
--- a/legacy/Data/ingsw/0613_36/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a7029bc..0000000
--- a/legacy/Data/ingsw/0613_37/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e5fbc81..0000000
--- a/legacy/Data/ingsw/0613_37/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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;
-</pre>
-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
deleted file mode 100644
index 710b111..0000000
--- a/legacy/Data/ingsw/0613_37/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a82929b..0000000
--- a/legacy/Data/ingsw/0613_37/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 230115c..0000000
--- a/legacy/Data/ingsw/0613_38/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 00b636b..0000000
--- a/legacy/Data/ingsw/0613_38/wrong1.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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
deleted file mode 100644
index dc39134..0000000
--- a/legacy/Data/ingsw/0613_38/wrong2.txt
+++ /dev/null
@@ -1,34 +0,0 @@
-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
deleted file mode 100644
index 6a9ef82..0000000
--- a/legacy/Data/ingsw/0613_38/wrong3.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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
deleted file mode 100644
index b9f32a6..0000000
--- a/legacy/Data/ingsw/0613_39/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 24a64fe..0000000
--- a/legacy/Data/ingsw/0613_39/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 70022eb..0000000
--- a/legacy/Data/ingsw/0613_39/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3143da9..0000000
--- a/legacy/Data/ingsw/0613_39/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0613_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5cf5cae..0000000
--- a/legacy/Data/ingsw/0613_4/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/ingsw/0613_4/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 90b2f35..0000000
--- a/legacy/Data/ingsw/0613_4/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2959407..0000000
--- a/legacy/Data/ingsw/0613_40/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index f919b6b..0000000
--- a/legacy/Data/ingsw/0613_40/wrong1.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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
deleted file mode 100644
index fc9e0aa..0000000
--- a/legacy/Data/ingsw/0613_40/wrong2.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-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
deleted file mode 100644
index e537817..0000000
--- a/legacy/Data/ingsw/0613_40/wrong3.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-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
deleted file mode 100644
index 99379e6..0000000
--- a/legacy/Data/ingsw/0613_41/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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
deleted file mode 100644
index cbf1814..0000000
--- a/legacy/Data/ingsw/0613_41/wrong1.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 6fcb8b5..0000000
--- a/legacy/Data/ingsw/0613_41/wrong2.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 03b9f52..0000000
--- a/legacy/Data/ingsw/0613_41/wrong3.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0613_42/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2bda796..0000000
--- a/legacy/Data/ingsw/0613_42/quest.txt
+++ /dev/null
@@ -1,29 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0613_42/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0613_42/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 293ebbc..0000000
--- a/legacy/Data/ingsw/0613_43/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_43/quest.txt b/legacy/Data/ingsw/0613_43/quest.txt
deleted file mode 100644
index 5922b9f..0000000
--- a/legacy/Data/ingsw/0613_43/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index d7890b2..0000000
--- a/legacy/Data/ingsw/0613_43/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_43/wrong2.txt b/legacy/Data/ingsw/0613_43/wrong2.txt
deleted file mode 100644
index d50b268..0000000
--- a/legacy/Data/ingsw/0613_43/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_44/correct.txt b/legacy/Data/ingsw/0613_44/correct.txt
deleted file mode 100644
index 1a8a50a..0000000
--- a/legacy/Data/ingsw/0613_44/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 793b220..0000000
--- a/legacy/Data/ingsw/0613_44/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fac8307..0000000
--- a/legacy/Data/ingsw/0613_44/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3fdb31e..0000000
--- a/legacy/Data/ingsw/0613_44/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 232aedf..0000000
--- a/legacy/Data/ingsw/0613_45/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index e44e320..0000000
--- a/legacy/Data/ingsw/0613_45/quest.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-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
deleted file mode 100644
index 5d5c9a4..0000000
--- a/legacy/Data/ingsw/0613_45/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 2b6c292..0000000
--- a/legacy/Data/ingsw/0613_45/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0613_46/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 03acbcc..0000000
--- a/legacy/Data/ingsw/0613_46/quest.txt
+++ /dev/null
@@ -1,30 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0613_46/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0613_46/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f3da655..0000000
--- a/legacy/Data/ingsw/0613_47/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6395b05..0000000
--- a/legacy/Data/ingsw/0613_47/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 316107c..0000000
--- a/legacy/Data/ingsw/0613_47/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 82fe5c7..0000000
--- a/legacy/Data/ingsw/0613_47/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ce9968f..0000000
--- a/legacy/Data/ingsw/0613_48/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index adccf3a..0000000
--- a/legacy/Data/ingsw/0613_48/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/ingsw/0613_48/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e8f9017..0000000
--- a/legacy/Data/ingsw/0613_48/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4c75070..0000000
--- a/legacy/Data/ingsw/0613_49/correct.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_49/quest.txt b/legacy/Data/ingsw/0613_49/quest.txt
deleted file mode 100644
index e11a044..0000000
--- a/legacy/Data/ingsw/0613_49/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 6dafe94..0000000
--- a/legacy/Data/ingsw/0613_49/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_49/wrong2.txt b/legacy/Data/ingsw/0613_49/wrong2.txt
deleted file mode 100644
index a3d79a4..0000000
--- a/legacy/Data/ingsw/0613_49/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_5/correct.txt b/legacy/Data/ingsw/0613_5/correct.txt
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0613_5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 579b39b..0000000
--- a/legacy/Data/ingsw/0613_5/quest.txt
+++ /dev/null
@@ -1,29 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0613_5/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0613_5/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a98afd2..0000000
--- a/legacy/Data/ingsw/0613_6/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_6/quest.txt b/legacy/Data/ingsw/0613_6/quest.txt
deleted file mode 100644
index b420aaf..0000000
--- a/legacy/Data/ingsw/0613_6/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 66064fe..0000000
--- a/legacy/Data/ingsw/0613_6/wrong1.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_6/wrong2.txt b/legacy/Data/ingsw/0613_6/wrong2.txt
deleted file mode 100644
index c71f1f5..0000000
--- a/legacy/Data/ingsw/0613_6/wrong2.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0613_7/correct.txt b/legacy/Data/ingsw/0613_7/correct.txt
deleted file mode 100644
index a40ea7d..0000000
--- a/legacy/Data/ingsw/0613_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index dbd72c0..0000000
--- a/legacy/Data/ingsw/0613_7/quest.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-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
deleted file mode 100644
index abe0eaa..0000000
--- a/legacy/Data/ingsw/0613_7/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 5b77112..0000000
--- a/legacy/Data/ingsw/0613_7/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 489e74c..0000000
--- a/legacy/Data/ingsw/0613_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 570368e..0000000
--- a/legacy/Data/ingsw/0613_8/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bf91afb..0000000
--- a/legacy/Data/ingsw/0613_8/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23cbd0e..0000000
--- a/legacy/Data/ingsw/0613_8/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 89f55eb..0000000
--- a/legacy/Data/ingsw/0613_9/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 4bcd55f..0000000
--- a/legacy/Data/ingsw/0613_9/wrong1.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index 2c10a10..0000000
--- a/legacy/Data/ingsw/0613_9/wrong2.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 7ddc09e..0000000
--- a/legacy/Data/ingsw/0613_9/wrong3.txt
+++ /dev/null
@@ -1,46 +0,0 @@
-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
deleted file mode 100644
index 81ceb23..0000000
--- a/legacy/Data/ingsw/0621_0/correct.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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
deleted file mode 100644
index 2eb7f69..0000000
--- a/legacy/Data/ingsw/0621_0/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index e09501c..0000000
--- a/legacy/Data/ingsw/0621_0/wrong0.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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
deleted file mode 100644
index f7ab72e..0000000
--- a/legacy/Data/ingsw/0621_0/wrong1.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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
deleted file mode 100644
index b740a0a..0000000
--- a/legacy/Data/ingsw/0621_1/correct.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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
deleted file mode 100644
index 5a1289f..0000000
--- a/legacy/Data/ingsw/0621_1/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 57fc69d..0000000
--- a/legacy/Data/ingsw/0621_1/wrong1.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 3390b13..0000000
--- a/legacy/Data/ingsw/0621_1/wrong2.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index f8c9568..0000000
--- a/legacy/Data/ingsw/0621_10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ba1496d..0000000
--- a/legacy/Data/ingsw/0621_10/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-Si consideri il seguente modello Modelica:
-<html>
-class System
-Integer x;
-initial equation
-x = 0;
-equation
-when sample(0, 2) then
-    x = 1 - pre(x);
-end when;
-end System;
-</html>
-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
deleted file mode 100644
index f485a50..0000000
--- a/legacy/Data/ingsw/0621_10/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a7af2cb..0000000
--- a/legacy/Data/ingsw/0621_10/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0c54a95..0000000
--- a/legacy/Data/ingsw/0621_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3c60626..0000000
--- a/legacy/Data/ingsw/0621_13/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9d2b250..0000000
--- a/legacy/Data/ingsw/0621_13/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b37e1a6..0000000
--- a/legacy/Data/ingsw/0621_13/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a4a8878..0000000
--- a/legacy/Data/ingsw/0621_14/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8bbcdb8..0000000
--- a/legacy/Data/ingsw/0621_14/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3214f65..0000000
--- a/legacy/Data/ingsw/0621_14/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6a9cb98..0000000
--- a/legacy/Data/ingsw/0621_14/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3f5bba6..0000000
--- a/legacy/Data/ingsw/0621_17/correct.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index de77723..0000000
--- a/legacy/Data/ingsw/0621_17/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index d23fe8e..0000000
--- a/legacy/Data/ingsw/0621_17/wrong0.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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
deleted file mode 100644
index 33310f9..0000000
--- a/legacy/Data/ingsw/0621_17/wrong1.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index d3826b5..0000000
--- a/legacy/Data/ingsw/0621_19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b3ee6d9..0000000
--- a/legacy/Data/ingsw/0621_19/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-Si consideri il seguente modello Modelica.
-<html>
-class System
-Boolean x;
-initial equation
-x = false;
-equation
-when sample(0, 2) then
-    x = not (pre(x));
-end when;
-end System;
-</html>
-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
deleted file mode 100644
index 6245a2f..0000000
--- a/legacy/Data/ingsw/0621_19/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0ba96d3..0000000
--- a/legacy/Data/ingsw/0621_19/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23cbd0e..0000000
--- a/legacy/Data/ingsw/0621_2/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c91abc9..0000000
--- a/legacy/Data/ingsw/0621_2/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 489e74c..0000000
--- a/legacy/Data/ingsw/0621_2/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 63ca2eb..0000000
--- a/legacy/Data/ingsw/0621_2/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c24cae9..0000000
--- a/legacy/Data/ingsw/0621_21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 77c80a6..0000000
--- a/legacy/Data/ingsw/0621_21/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a9b1c29..0000000
--- a/legacy/Data/ingsw/0621_21/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6e771e9..0000000
--- a/legacy/Data/ingsw/0621_21/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 83f9204..0000000
--- a/legacy/Data/ingsw/0621_22/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5d926db..0000000
--- a/legacy/Data/ingsw/0621_22/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d2eb66b..0000000
--- a/legacy/Data/ingsw/0621_22/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index dbdbad5..0000000
--- a/legacy/Data/ingsw/0621_22/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a7029bc..0000000
--- a/legacy/Data/ingsw/0621_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e943282..0000000
--- a/legacy/Data/ingsw/0621_24/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato.
-<html>
-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;
-</html>
-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
deleted file mode 100644
index 710b111..0000000
--- a/legacy/Data/ingsw/0621_24/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a82929b..0000000
--- a/legacy/Data/ingsw/0621_24/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 68bfd31..0000000
--- a/legacy/Data/ingsw/0621_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4589c15..0000000
--- a/legacy/Data/ingsw/0621_3/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ab58544..0000000
--- a/legacy/Data/ingsw/0621_3/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f021931..0000000
--- a/legacy/Data/ingsw/0621_3/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ddb0d65..0000000
--- a/legacy/Data/ingsw/0621_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7004fa1..0000000
--- a/legacy/Data/ingsw/0621_32/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena i requisiti per il sistema monitorato sono violati.
-<html>
-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;
-</html>
-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
deleted file mode 100644
index 3e05ae7..0000000
--- a/legacy/Data/ingsw/0621_32/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7c7a691..0000000
--- a/legacy/Data/ingsw/0621_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0dcbeca..0000000
--- a/legacy/Data/ingsw/0621_35/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f3019d0..0000000
--- a/legacy/Data/ingsw/0621_35/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2891ab7..0000000
--- a/legacy/Data/ingsw/0621_35/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index cf5eab4..0000000
--- a/legacy/Data/ingsw/0621_35/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fc560a2..0000000
--- a/legacy/Data/ingsw/0621_36/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index 6473814..0000000
--- a/legacy/Data/ingsw/0621_36/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 61fa628..0000000
--- a/legacy/Data/ingsw/0621_36/wrong0.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index c8a2c3d..0000000
--- a/legacy/Data/ingsw/0621_36/wrong1.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index 91e6e0a..0000000
--- a/legacy/Data/ingsw/0621_39/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 406c612..0000000
--- a/legacy/Data/ingsw/0621_39/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0f68af0..0000000
--- a/legacy/Data/ingsw/0621_39/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 908366a..0000000
--- a/legacy/Data/ingsw/0621_39/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 81653ea..0000000
--- a/legacy/Data/ingsw/0621_6/correct.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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
deleted file mode 100644
index 8bc0606..0000000
--- a/legacy/Data/ingsw/0621_6/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 4c7125e..0000000
--- a/legacy/Data/ingsw/0621_6/wrong0.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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
deleted file mode 100644
index 47cf8cd..0000000
--- a/legacy/Data/ingsw/0621_6/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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
deleted file mode 100644
index 81653ea..0000000
--- a/legacy/Data/ingsw/0621_6/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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
deleted file mode 100644
index 4bef521..0000000
--- a/legacy/Data/ingsw/0621_9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 47b8c7e..0000000
--- a/legacy/Data/ingsw/0621_9/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d37b8fe..0000000
--- a/legacy/Data/ingsw/0621_9/wrong0.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 53c7eb8..0000000
--- a/legacy/Data/ingsw/0621_9/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8da85a2..0000000
--- a/legacy/Data/ingsw/0622_1/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 045f2d6..0000000
--- a/legacy/Data/ingsw/0622_1/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0b3e0a6..0000000
--- a/legacy/Data/ingsw/0622_1/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9463411..0000000
--- a/legacy/Data/ingsw/0622_1/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f8ae137..0000000
--- a/legacy/Data/ingsw/0622_2/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7083f7d..0000000
--- a/legacy/Data/ingsw/0622_2/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a211371..0000000
--- a/legacy/Data/ingsw/0622_2/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0b3e0a6..0000000
--- a/legacy/Data/ingsw/0622_2/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 07c6432..0000000
--- a/legacy/Data/ingsw/0622_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 641cce2..0000000
--- a/legacy/Data/ingsw/0622_3/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 45842b7..0000000
--- a/legacy/Data/ingsw/0622_3/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 137b176..0000000
--- a/legacy/Data/ingsw/0622_3/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7c67f71..0000000
--- a/legacy/Data/ingsw/0622_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0c283e9..0000000
--- a/legacy/Data/ingsw/0622_4/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7695ad8..0000000
--- a/legacy/Data/ingsw/0622_4/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1acd587..0000000
--- a/legacy/Data/ingsw/0622_4/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4d597fb..0000000
--- a/legacy/Data/ingsw/0622_5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5e83ec2..0000000
--- a/legacy/Data/ingsw/0622_5/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 137b176..0000000
--- a/legacy/Data/ingsw/0622_5/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fcb0699..0000000
--- a/legacy/Data/ingsw/0622_5/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ea557e9..0000000
--- a/legacy/Data/ingsw/0622_6/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b5b9386..0000000
--- a/legacy/Data/ingsw/0622_6/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 137b176..0000000
--- a/legacy/Data/ingsw/0622_6/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fcb0699..0000000
--- a/legacy/Data/ingsw/0622_6/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8eb46f4..0000000
--- a/legacy/Data/ingsw/0622_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3ab551d..0000000
--- a/legacy/Data/ingsw/0622_7/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fcb0699..0000000
--- a/legacy/Data/ingsw/0622_7/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 137b176..0000000
--- a/legacy/Data/ingsw/0622_7/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 60eaa92..0000000
--- a/legacy/Data/ingsw/0622_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 31346ae..0000000
--- a/legacy/Data/ingsw/0622_8/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 3e13d27..0000000
--- a/legacy/Data/ingsw/0622_8/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 06a3fbf..0000000
--- a/legacy/Data/ingsw/0622_8/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 997967b..0000000
--- a/legacy/Data/ingsw/0622_9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index da5f8a9..0000000
--- a/legacy/Data/ingsw/0622_9/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2df501e..0000000
--- a/legacy/Data/ingsw/0622_9/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7a6c6b9..0000000
--- a/legacy/Data/ingsw/0622_9/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f8c9568..0000000
--- a/legacy/Data/ingsw/0721_1/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c5af322..0000000
--- a/legacy/Data/ingsw/0721_1/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-Si consideri il seguente modello Modelica:
-<pre>
-class System
-Integer x;
-initial equation
-x = 0;
-equation
-when sample(0, 2) then
-    x = 1 - pre(x);
-end when;
-end System;
-</pre>
-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
deleted file mode 100644
index f485a50..0000000
--- a/legacy/Data/ingsw/0721_1/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a7af2cb..0000000
--- a/legacy/Data/ingsw/0721_1/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f4e4c53..0000000
--- a/legacy/Data/ingsw/0721_10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4a711a4..0000000
--- a/legacy/Data/ingsw/0721_10/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4885062..0000000
--- a/legacy/Data/ingsw/0721_10/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bd881bc..0000000
--- a/legacy/Data/ingsw/0721_10/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9b5317b..0000000
--- a/legacy/Data/ingsw/0721_13/correct.txt
+++ /dev/null
@@ -1,18 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_13/quest.txt b/legacy/Data/ingsw/0721_13/quest.txt
deleted file mode 100644
index c105449..0000000
--- a/legacy/Data/ingsw/0721_13/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 9b5317b..0000000
--- a/legacy/Data/ingsw/0721_13/wrong1.txt
+++ /dev/null
@@ -1,18 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_13/wrong2.txt b/legacy/Data/ingsw/0721_13/wrong2.txt
deleted file mode 100644
index 78c7306..0000000
--- a/legacy/Data/ingsw/0721_13/wrong2.txt
+++ /dev/null
@@ -1,18 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_15/correct.txt b/legacy/Data/ingsw/0721_15/correct.txt
deleted file mode 100644
index 355e195..0000000
--- a/legacy/Data/ingsw/0721_15/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 15dbdf2..0000000
--- a/legacy/Data/ingsw/0721_15/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6806506..0000000
--- a/legacy/Data/ingsw/0721_15/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 586ebee..0000000
--- a/legacy/Data/ingsw/0721_15/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d3826b5..0000000
--- a/legacy/Data/ingsw/0721_17/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4e55a8a..0000000
--- a/legacy/Data/ingsw/0721_17/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-Si consideri il seguente modello Modelica.
-<pre>
-class System
-Boolean x;
-initial equation
-x = false;
-equation
-when sample(0, 2) then
-    x = not (pre(x));
-end when;
-end System;
-</pre>
-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
deleted file mode 100644
index 6245a2f..0000000
--- a/legacy/Data/ingsw/0721_17/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0ba96d3..0000000
--- a/legacy/Data/ingsw/0721_17/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index eea60e9..0000000
--- a/legacy/Data/ingsw/0721_18/correct.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_18/quest.txt b/legacy/Data/ingsw/0721_18/quest.txt
deleted file mode 100644
index c46480d..0000000
--- a/legacy/Data/ingsw/0721_18/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index f66dbc7..0000000
--- a/legacy/Data/ingsw/0721_18/wrong1.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_18/wrong2.txt b/legacy/Data/ingsw/0721_18/wrong2.txt
deleted file mode 100644
index 2192e79..0000000
--- a/legacy/Data/ingsw/0721_18/wrong2.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_19/correct.txt b/legacy/Data/ingsw/0721_19/correct.txt
deleted file mode 100644
index 44ac343..0000000
--- a/legacy/Data/ingsw/0721_19/correct.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_19/quest.txt b/legacy/Data/ingsw/0721_19/quest.txt
deleted file mode 100644
index 6229852..0000000
--- a/legacy/Data/ingsw/0721_19/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 45f3fbe..0000000
--- a/legacy/Data/ingsw/0721_19/wrong1.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_19/wrong2.txt b/legacy/Data/ingsw/0721_19/wrong2.txt
deleted file mode 100644
index f6b2fef..0000000
--- a/legacy/Data/ingsw/0721_19/wrong2.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_21/correct.txt b/legacy/Data/ingsw/0721_21/correct.txt
deleted file mode 100644
index 67edba8..0000000
--- a/legacy/Data/ingsw/0721_21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 02d9102..0000000
--- a/legacy/Data/ingsw/0721_21/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2c917d7..0000000
--- a/legacy/Data/ingsw/0721_21/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1aa1cd5..0000000
--- a/legacy/Data/ingsw/0721_21/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c0acec0..0000000
--- a/legacy/Data/ingsw/0721_28/correct.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_28/quest.txt b/legacy/Data/ingsw/0721_28/quest.txt
deleted file mode 100644
index 04a9c59..0000000
--- a/legacy/Data/ingsw/0721_28/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index af5ef9e..0000000
--- a/legacy/Data/ingsw/0721_28/wrong1.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_28/wrong2.txt b/legacy/Data/ingsw/0721_28/wrong2.txt
deleted file mode 100644
index 7e94fc7..0000000
--- a/legacy/Data/ingsw/0721_28/wrong2.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_29/correct.txt b/legacy/Data/ingsw/0721_29/correct.txt
deleted file mode 100644
index cb4fc9a..0000000
--- a/legacy/Data/ingsw/0721_29/correct.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_29/quest.txt b/legacy/Data/ingsw/0721_29/quest.txt
deleted file mode 100644
index 8f5424d..0000000
--- a/legacy/Data/ingsw/0721_29/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index f32ca15..0000000
--- a/legacy/Data/ingsw/0721_29/wrong1.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_29/wrong2.txt b/legacy/Data/ingsw/0721_29/wrong2.txt
deleted file mode 100644
index 38e1c17..0000000
--- a/legacy/Data/ingsw/0721_29/wrong2.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_32/correct.txt b/legacy/Data/ingsw/0721_32/correct.txt
deleted file mode 100644
index e13eda2..0000000
--- a/legacy/Data/ingsw/0721_32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ea06339..0000000
--- a/legacy/Data/ingsw/0721_32/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b24f900..0000000
--- a/legacy/Data/ingsw/0721_32/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 884d6b1..0000000
--- a/legacy/Data/ingsw/0721_32/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9f4a8bf..0000000
--- a/legacy/Data/ingsw/0721_33/correct.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_33/quest.txt b/legacy/Data/ingsw/0721_33/quest.txt
deleted file mode 100644
index 496b6af..0000000
--- a/legacy/Data/ingsw/0721_33/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 8e7ebc7..0000000
--- a/legacy/Data/ingsw/0721_33/wrong1.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_33/wrong2.txt b/legacy/Data/ingsw/0721_33/wrong2.txt
deleted file mode 100644
index 2fd0f2e..0000000
--- a/legacy/Data/ingsw/0721_33/wrong2.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_34/correct.txt b/legacy/Data/ingsw/0721_34/correct.txt
deleted file mode 100644
index 5bca5f8..0000000
--- a/legacy/Data/ingsw/0721_34/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 561755a..0000000
--- a/legacy/Data/ingsw/0721_34/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7a3fe03..0000000
--- a/legacy/Data/ingsw/0721_34/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d4074cf..0000000
--- a/legacy/Data/ingsw/0721_34/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3a0f9a1..0000000
--- a/legacy/Data/ingsw/0721_36/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f7ef080..0000000
--- a/legacy/Data/ingsw/0721_36/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6633b8c..0000000
--- a/legacy/Data/ingsw/0721_36/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7edd4bc..0000000
--- a/legacy/Data/ingsw/0721_36/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fe4a402..0000000
--- a/legacy/Data/ingsw/0721_4/correct.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_4/quest.txt b/legacy/Data/ingsw/0721_4/quest.txt
deleted file mode 100644
index f50c002..0000000
--- a/legacy/Data/ingsw/0721_4/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index ad42984..0000000
--- a/legacy/Data/ingsw/0721_4/wrong1.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_4/wrong2.txt b/legacy/Data/ingsw/0721_4/wrong2.txt
deleted file mode 100644
index bb62616..0000000
--- a/legacy/Data/ingsw/0721_4/wrong2.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_5/correct.txt b/legacy/Data/ingsw/0721_5/correct.txt
deleted file mode 100644
index 0902686..0000000
--- a/legacy/Data/ingsw/0721_5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c5dbb4e..0000000
--- a/legacy/Data/ingsw/0721_5/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-"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
deleted file mode 100644
index 396c8d3..0000000
--- a/legacy/Data/ingsw/0721_5/wrong1.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6084c49..0000000
--- a/legacy/Data/ingsw/0721_5/wrong2.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fc3d081..0000000
--- a/legacy/Data/ingsw/0721_6/correct.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_6/quest.txt b/legacy/Data/ingsw/0721_6/quest.txt
deleted file mode 100644
index 40a0c99..0000000
--- a/legacy/Data/ingsw/0721_6/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index eeb1bba..0000000
--- a/legacy/Data/ingsw/0721_6/wrong1.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_6/wrong2.txt b/legacy/Data/ingsw/0721_6/wrong2.txt
deleted file mode 100644
index eb68041..0000000
--- a/legacy/Data/ingsw/0721_6/wrong2.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_8/correct.txt b/legacy/Data/ingsw/0721_8/correct.txt
deleted file mode 100644
index 99b5226..0000000
--- a/legacy/Data/ingsw/0721_8/correct.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_8/quest.txt b/legacy/Data/ingsw/0721_8/quest.txt
deleted file mode 100644
index ebf5ec9..0000000
--- a/legacy/Data/ingsw/0721_8/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 75546bd..0000000
--- a/legacy/Data/ingsw/0721_8/wrong1.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0721_8/wrong2.txt b/legacy/Data/ingsw/0721_8/wrong2.txt
deleted file mode 100644
index ed6823c..0000000
--- a/legacy/Data/ingsw/0721_8/wrong2.txt
+++ /dev/null
@@ -1,35 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/0722_1/correct.txt b/legacy/Data/ingsw/0722_1/correct.txt
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/0722_1/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e6594c7..0000000
--- a/legacy/Data/ingsw/0722_1/quest.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0722_1/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/ingsw/0722_1/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0722_10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c18ff48..0000000
--- a/legacy/Data/ingsw/0722_10/quest.txt
+++ /dev/null
@@ -1,20 +0,0 @@
-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
deleted file mode 100644
index 52f25fe..0000000
--- a/legacy/Data/ingsw/0722_10/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/ingsw/0722_10/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f293f3e..0000000
--- a/legacy/Data/ingsw/0722_11/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 709cf96..0000000
--- a/legacy/Data/ingsw/0722_11/quest.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-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
deleted file mode 100644
index eafabb1..0000000
--- a/legacy/Data/ingsw/0722_11/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index fc010a3..0000000
--- a/legacy/Data/ingsw/0722_11/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 8785661..0000000
--- a/legacy/Data/ingsw/0722_12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index 58ef38e..0000000
--- a/legacy/Data/ingsw/0722_12/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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
deleted file mode 100644
index a6df32d..0000000
--- a/legacy/Data/ingsw/0722_12/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index 0aaedb8..0000000
--- a/legacy/Data/ingsw/0722_12/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/ingsw/0722_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 83987bd..0000000
--- a/legacy/Data/ingsw/0722_13/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index eb5e1cd..0000000
--- a/legacy/Data/ingsw/0722_13/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index cf27703..0000000
--- a/legacy/Data/ingsw/0722_13/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0722_14/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f3d1bcd..0000000
--- a/legacy/Data/ingsw/0722_14/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0722_14/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0722_14/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/ingsw/0722_15/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 035eb2b..0000000
--- a/legacy/Data/ingsw/0722_15/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/0722_15/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/ingsw/0722_15/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0722_16/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 12ae518..0000000
--- a/legacy/Data/ingsw/0722_16/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0722_16/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0722_16/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0722_17/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3150037..0000000
--- a/legacy/Data/ingsw/0722_17/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0722_17/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0722_17/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/0722_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ca50f58..0000000
--- a/legacy/Data/ingsw/0722_18/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/ingsw/0722_18/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a8aead7..0000000
--- a/legacy/Data/ingsw/0722_18/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/ingsw/0722_19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a412231..0000000
--- a/legacy/Data/ingsw/0722_19/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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
deleted file mode 100644
index eb5e1cd..0000000
--- a/legacy/Data/ingsw/0722_19/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a29d476..0000000
--- a/legacy/Data/ingsw/0722_19/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7d0c43c..0000000
--- a/legacy/Data/ingsw/0722_2/correct.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 8210340..0000000
--- a/legacy/Data/ingsw/0722_2/quest.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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
deleted file mode 100644
index 392cc67..0000000
--- a/legacy/Data/ingsw/0722_2/wrong 1.txt	
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 2fde3f0..0000000
--- a/legacy/Data/ingsw/0722_2/wrong 2.txt	
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/ingsw/0722_20/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index afddbb1..0000000
--- a/legacy/Data/ingsw/0722_20/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0722_20/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/0722_20/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0722_21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 37d7e62..0000000
--- a/legacy/Data/ingsw/0722_21/quest.txt
+++ /dev/null
@@ -1,20 +0,0 @@
-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
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/ingsw/0722_21/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 90b2f35..0000000
--- a/legacy/Data/ingsw/0722_21/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/ingsw/0722_22/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fdca1b9..0000000
--- a/legacy/Data/ingsw/0722_22/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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
deleted file mode 100644
index 1c07658..0000000
--- a/legacy/Data/ingsw/0722_22/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/0722_22/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0722_23/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2e81fc7..0000000
--- a/legacy/Data/ingsw/0722_23/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0722_23/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0722_23/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a40ea7d..0000000
--- a/legacy/Data/ingsw/0722_24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 5b1bcf2..0000000
--- a/legacy/Data/ingsw/0722_24/quest.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-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
deleted file mode 100644
index 5b77112..0000000
--- a/legacy/Data/ingsw/0722_24/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index abe0eaa..0000000
--- a/legacy/Data/ingsw/0722_24/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 39d8c13..0000000
--- a/legacy/Data/ingsw/0722_25/correct.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 23565d6..0000000
--- a/legacy/Data/ingsw/0722_25/quest.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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
deleted file mode 100644
index c5c0179..0000000
--- a/legacy/Data/ingsw/0722_25/wrong 1.txt	
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index e4e10cc..0000000
--- a/legacy/Data/ingsw/0722_25/wrong 2.txt	
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 7311d41..0000000
--- a/legacy/Data/ingsw/0722_26/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 78ad81f..0000000
--- a/legacy/Data/ingsw/0722_26/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index 7e48e4f..0000000
--- a/legacy/Data/ingsw/0722_26/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3e327ab..0000000
--- a/legacy/Data/ingsw/0722_26/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0722_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ac6007d..0000000
--- a/legacy/Data/ingsw/0722_3/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0722_3/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0722_3/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/ingsw/0722_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 681243a..0000000
--- a/legacy/Data/ingsw/0722_4/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index 52f25fe..0000000
--- a/legacy/Data/ingsw/0722_4/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0722_4/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index cf27703..0000000
--- a/legacy/Data/ingsw/0722_5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5201b57..0000000
--- a/legacy/Data/ingsw/0722_5/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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
deleted file mode 100644
index 2d5aeb0..0000000
--- a/legacy/Data/ingsw/0722_5/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index eb5e1cd..0000000
--- a/legacy/Data/ingsw/0722_5/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8d957c2..0000000
--- a/legacy/Data/ingsw/0722_6/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 363e53e..0000000
--- a/legacy/Data/ingsw/0722_6/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0722_6/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/ingsw/0722_6/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 711ba55..0000000
--- a/legacy/Data/ingsw/0722_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b33abf0..0000000
--- a/legacy/Data/ingsw/0722_7/quest.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/ingsw/0722_7/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 52f25fe..0000000
--- a/legacy/Data/ingsw/0722_7/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 31a01d5..0000000
--- a/legacy/Data/ingsw/0722_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 462c3bb..0000000
--- a/legacy/Data/ingsw/0722_8/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index 549dba8..0000000
--- a/legacy/Data/ingsw/0722_8/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0c564f7..0000000
--- a/legacy/Data/ingsw/0722_8/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/ingsw/0722_9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2b0b595..0000000
--- a/legacy/Data/ingsw/0722_9/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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
deleted file mode 100644
index 1c07658..0000000
--- a/legacy/Data/ingsw/0722_9/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0722_9/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index cefc84a..0000000
--- a/legacy/Data/ingsw/0922_10/correct.txt
+++ /dev/null
@@ -1,69 +0,0 @@
-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
deleted file mode 100644
index 9dd6e3b..0000000
--- a/legacy/Data/ingsw/0922_10/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index cc2b129..0000000
--- a/legacy/Data/ingsw/0922_10/wrong 1.txt	
+++ /dev/null
@@ -1,67 +0,0 @@
-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
deleted file mode 100644
index f0f54bf..0000000
--- a/legacy/Data/ingsw/0922_10/wrong 2.txt	
+++ /dev/null
@@ -1,69 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0922_11/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 55e0e6a..0000000
--- a/legacy/Data/ingsw/0922_11/quest.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0922_11/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/0922_11/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/ingsw/0922_12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index dd553a4..0000000
--- a/legacy/Data/ingsw/0922_12/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0922_12/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0922_12/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/0922_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7e33553..0000000
--- a/legacy/Data/ingsw/0922_13/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0922_13/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f91ad01..0000000
--- a/legacy/Data/ingsw/0922_13/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7734d60..0000000
--- a/legacy/Data/ingsw/0922_14/correct.txt
+++ /dev/null
@@ -1,71 +0,0 @@
-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
deleted file mode 100644
index 6afe072..0000000
--- a/legacy/Data/ingsw/0922_14/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index fd1c3a4..0000000
--- a/legacy/Data/ingsw/0922_14/wrong 1.txt	
+++ /dev/null
@@ -1,71 +0,0 @@
-
-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
deleted file mode 100644
index 763d3a6..0000000
--- a/legacy/Data/ingsw/0922_14/wrong 2.txt	
+++ /dev/null
@@ -1,69 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0922_15/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a64d8e6..0000000
--- a/legacy/Data/ingsw/0922_15/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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
deleted file mode 100644
index 7b19605..0000000
--- a/legacy/Data/ingsw/0922_15/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1e091a3..0000000
--- a/legacy/Data/ingsw/0922_15/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8dd7202..0000000
--- a/legacy/Data/ingsw/0922_16/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index df0415d..0000000
--- a/legacy/Data/ingsw/0922_16/quest.txt
+++ /dev/null
@@ -1,75 +0,0 @@
-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
deleted file mode 100644
index db7cce6..0000000
--- a/legacy/Data/ingsw/0922_16/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f0634e5..0000000
--- a/legacy/Data/ingsw/0922_16/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9a7cc7e..0000000
--- a/legacy/Data/ingsw/0922_17/correct.txt
+++ /dev/null
@@ -1,69 +0,0 @@
-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
deleted file mode 100644
index 5ebf9be..0000000
--- a/legacy/Data/ingsw/0922_17/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index b635e9d..0000000
--- a/legacy/Data/ingsw/0922_17/wrong 1.txt	
+++ /dev/null
@@ -1,74 +0,0 @@
-
-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
deleted file mode 100644
index 7006918..0000000
--- a/legacy/Data/ingsw/0922_17/wrong 2.txt	
+++ /dev/null
@@ -1,69 +0,0 @@
-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
deleted file mode 100644
index 9667516..0000000
--- a/legacy/Data/ingsw/0922_18/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3d86edf..0000000
--- a/legacy/Data/ingsw/0922_18/quest.txt
+++ /dev/null
@@ -1,75 +0,0 @@
-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
deleted file mode 100644
index a9214bc..0000000
--- a/legacy/Data/ingsw/0922_18/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2a58fb7..0000000
--- a/legacy/Data/ingsw/0922_18/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index faa122e..0000000
--- a/legacy/Data/ingsw/0922_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7159aee..0000000
--- a/legacy/Data/ingsw/0922_3/quest.txt
+++ /dev/null
@@ -1,77 +0,0 @@
-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
deleted file mode 100644
index 6e77050..0000000
--- a/legacy/Data/ingsw/0922_3/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c7e9639..0000000
--- a/legacy/Data/ingsw/0922_3/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7b19605..0000000
--- a/legacy/Data/ingsw/0922_4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2eeb93f..0000000
--- a/legacy/Data/ingsw/0922_4/quest.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/0922_4/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/0922_4/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e0afa1b..0000000
--- a/legacy/Data/ingsw/0922_5/correct.txt
+++ /dev/null
@@ -1,67 +0,0 @@
-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
deleted file mode 100644
index 6cbb6d3..0000000
--- a/legacy/Data/ingsw/0922_5/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 53db382..0000000
--- a/legacy/Data/ingsw/0922_5/wrong 1.txt	
+++ /dev/null
@@ -1,69 +0,0 @@
-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
deleted file mode 100644
index 11f8d0b..0000000
--- a/legacy/Data/ingsw/0922_5/wrong 2.txt	
+++ /dev/null
@@ -1,71 +0,0 @@
-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
deleted file mode 100644
index d494d0a..0000000
--- a/legacy/Data/ingsw/0922_6/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index daf5598..0000000
--- a/legacy/Data/ingsw/0922_6/quest.txt
+++ /dev/null
@@ -1,73 +0,0 @@
-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
deleted file mode 100644
index 2a0dce8..0000000
--- a/legacy/Data/ingsw/0922_6/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e4e9137..0000000
--- a/legacy/Data/ingsw/0922_6/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fae4f5e..0000000
--- a/legacy/Data/ingsw/0922_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d94d7c9..0000000
--- a/legacy/Data/ingsw/0922_7/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0922_7/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/0922_7/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0922_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 983cffc..0000000
--- a/legacy/Data/ingsw/0922_8/quest.txt
+++ /dev/null
@@ -1,18 +0,0 @@
-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
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/ingsw/0922_8/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/ingsw/0922_8/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/ingsw/0922_9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 13fde42..0000000
--- a/legacy/Data/ingsw/0922_9/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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
deleted file mode 100644
index f6a4b07..0000000
--- a/legacy/Data/ingsw/0922_9/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/0922_9/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 00cf334..0000000
--- a/legacy/Data/ingsw/10/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6befac6..0000000
--- a/legacy/Data/ingsw/10/quest.txt
+++ /dev/null
@@ -1,26 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato:
-<pre>
-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;
-</pre>
-
-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
deleted file mode 100644
index fe0ce72..0000000
--- a/legacy/Data/ingsw/10/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5303e44..0000000
--- a/legacy/Data/ingsw/10/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c24cae9..0000000
--- a/legacy/Data/ingsw/11/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 77a393f..0000000
--- a/legacy/Data/ingsw/11/quest.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-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
deleted file mode 100644
index 6e771e9..0000000
--- a/legacy/Data/ingsw/11/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a9b1c29..0000000
--- a/legacy/Data/ingsw/11/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index fd39f0f..0000000
--- a/legacy/Data/ingsw/1122_1/correct.txt
+++ /dev/null
@@ -1,44 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_1/quest.txt b/legacy/Data/ingsw/1122_1/quest.txt
deleted file mode 100644
index df0e6be..0000000
--- a/legacy/Data/ingsw/1122_1/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index febcca9..0000000
--- a/legacy/Data/ingsw/1122_1/wrong 1.txt	
+++ /dev/null
@@ -1,77 +0,0 @@
-<pre>
-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;
-</pre>
\ 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
deleted file mode 100644
index 94279c9..0000000
--- a/legacy/Data/ingsw/1122_1/wrong 2.txt	
+++ /dev/null
@@ -1,67 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_10/correct.txt b/legacy/Data/ingsw/1122_10/correct.txt
deleted file mode 100644
index e940faa..0000000
--- a/legacy/Data/ingsw/1122_10/correct.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index c939cfb..0000000
--- a/legacy/Data/ingsw/1122_10/quest.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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
deleted file mode 100644
index 03abba5..0000000
--- a/legacy/Data/ingsw/1122_10/wrong 1.txt	
+++ /dev/null
@@ -1,10 +0,0 @@
-
-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
deleted file mode 100644
index a820d7a..0000000
--- a/legacy/Data/ingsw/1122_10/wrong 2.txt	
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index e74b1fc..0000000
--- a/legacy/Data/ingsw/1122_11/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b46cb2b..0000000
--- a/legacy/Data/ingsw/1122_11/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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
deleted file mode 100644
index d63544a..0000000
--- a/legacy/Data/ingsw/1122_11/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1753a91..0000000
--- a/legacy/Data/ingsw/1122_11/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95722a4..0000000
--- a/legacy/Data/ingsw/1122_12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 464b817..0000000
--- a/legacy/Data/ingsw/1122_12/quest.txt
+++ /dev/null
@@ -1,76 +0,0 @@
-Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente?
-
-
-<pre>
-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;
-</pre>
\ 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
deleted file mode 100644
index c737a86..0000000
--- a/legacy/Data/ingsw/1122_12/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 27b6d1e..0000000
--- a/legacy/Data/ingsw/1122_12/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/ingsw/1122_13/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d57a552..0000000
--- a/legacy/Data/ingsw/1122_13/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index b7bbee2..0000000
--- a/legacy/Data/ingsw/1122_13/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2a47a95..0000000
--- a/legacy/Data/ingsw/1122_13/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 97f2744..0000000
--- a/legacy/Data/ingsw/1122_14/correct.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-#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);
-}
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_14/quest.txt b/legacy/Data/ingsw/1122_14/quest.txt
deleted file mode 100644
index bd20578..0000000
--- a/legacy/Data/ingsw/1122_14/quest.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-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
deleted file mode 100644
index 189d31d..0000000
--- a/legacy/Data/ingsw/1122_14/wrong 1.txt	
+++ /dev/null
@@ -1,29 +0,0 @@
-<pre>
-#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);
-
-}
-</pre>
\ 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
deleted file mode 100644
index 4a9e2c8..0000000
--- a/legacy/Data/ingsw/1122_14/wrong 2.txt	
+++ /dev/null
@@ -1,29 +0,0 @@
-<pre>
-#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);
-
-}
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_15/correct.txt b/legacy/Data/ingsw/1122_15/correct.txt
deleted file mode 100644
index 1a8a508..0000000
--- a/legacy/Data/ingsw/1122_15/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 0d7fe08..0000000
--- a/legacy/Data/ingsw/1122_15/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/1122_15/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/ingsw/1122_15/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7a6c6b9..0000000
--- a/legacy/Data/ingsw/1122_16/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index db10798..0000000
--- a/legacy/Data/ingsw/1122_16/quest.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-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
deleted file mode 100644
index 2df501e..0000000
--- a/legacy/Data/ingsw/1122_16/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 997967b..0000000
--- a/legacy/Data/ingsw/1122_16/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e0bba82..0000000
--- a/legacy/Data/ingsw/1122_19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 28aa70c..0000000
--- a/legacy/Data/ingsw/1122_19/quest.txt
+++ /dev/null
@@ -1,75 +0,0 @@
-Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente?
-
-<pre>
-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;
-</pre>
\ 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
deleted file mode 100644
index 75dcbd7..0000000
--- a/legacy/Data/ingsw/1122_19/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5e5c30f..0000000
--- a/legacy/Data/ingsw/1122_19/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ad21063..0000000
--- a/legacy/Data/ingsw/1122_2/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_2/quest.txt b/legacy/Data/ingsw/1122_2/quest.txt
deleted file mode 100644
index 2ef9a23..0000000
--- a/legacy/Data/ingsw/1122_2/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index b0c70b4..0000000
--- a/legacy/Data/ingsw/1122_2/wrong 1.txt	
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ 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
deleted file mode 100644
index 50c4137..0000000
--- a/legacy/Data/ingsw/1122_2/wrong 2.txt	
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_20/correct.txt b/legacy/Data/ingsw/1122_20/correct.txt
deleted file mode 100644
index 81a4b93..0000000
--- a/legacy/Data/ingsw/1122_20/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 139b0a2..0000000
--- a/legacy/Data/ingsw/1122_20/quest.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-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:
-
------------
-<pre>
-int f(int x, int y)  {   
-
-int z, k;
-
-z = 1;   k = 0;
-
-while (k < x)  { z = y*z;  k = k + 1; }
-
-return (z);
-
-}
-</pre>
-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
deleted file mode 100644
index f52d5ae..0000000
--- a/legacy/Data/ingsw/1122_20/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d246b94..0000000
--- a/legacy/Data/ingsw/1122_20/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e582263..0000000
--- a/legacy/Data/ingsw/1122_21/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_21/quest.txt b/legacy/Data/ingsw/1122_21/quest.txt
deleted file mode 100644
index 9f10cbc..0000000
--- a/legacy/Data/ingsw/1122_21/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 93791b3..0000000
--- a/legacy/Data/ingsw/1122_21/wrong 1.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-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;
-</pre>
\ 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
deleted file mode 100644
index 826c225..0000000
--- a/legacy/Data/ingsw/1122_21/wrong 2.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_22/correct.txt b/legacy/Data/ingsw/1122_22/correct.txt
deleted file mode 100644
index b110af1..0000000
--- a/legacy/Data/ingsw/1122_22/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a116140..0000000
--- a/legacy/Data/ingsw/1122_22/quest.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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
deleted file mode 100644
index cf27703..0000000
--- a/legacy/Data/ingsw/1122_22/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index eb5e1cd..0000000
--- a/legacy/Data/ingsw/1122_22/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 37bad47..0000000
--- a/legacy/Data/ingsw/1122_23/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 63f2e9f..0000000
--- a/legacy/Data/ingsw/1122_23/quest.txt
+++ /dev/null
@@ -1,29 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena i requisiti per il sistema monitorato sono violati.
-<pre>
-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;
-</pre>
-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
deleted file mode 100644
index 6fa1af9..0000000
--- a/legacy/Data/ingsw/1122_23/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b383e07..0000000
--- a/legacy/Data/ingsw/1122_23/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 293ebbc..0000000
--- a/legacy/Data/ingsw/1122_24/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_24/quest.txt b/legacy/Data/ingsw/1122_24/quest.txt
deleted file mode 100644
index 0accc5f..0000000
--- a/legacy/Data/ingsw/1122_24/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 835a5ac..0000000
--- a/legacy/Data/ingsw/1122_24/wrong 1.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-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;
-</pre>
\ 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
deleted file mode 100644
index 5a7d171..0000000
--- a/legacy/Data/ingsw/1122_24/wrong 2.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_25/correct.txt b/legacy/Data/ingsw/1122_25/correct.txt
deleted file mode 100644
index b9f32a6..0000000
--- a/legacy/Data/ingsw/1122_25/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4087608..0000000
--- a/legacy/Data/ingsw/1122_25/quest.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-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
deleted file mode 100644
index 3143da9..0000000
--- a/legacy/Data/ingsw/1122_25/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b9f32a6..0000000
--- a/legacy/Data/ingsw/1122_25/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2f4c4c9..0000000
--- a/legacy/Data/ingsw/1122_26/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 514a3fa..0000000
--- a/legacy/Data/ingsw/1122_26/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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:
-
------------
-<pre>
-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()  */
-</pre>
-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
deleted file mode 100644
index a82e779..0000000
--- a/legacy/Data/ingsw/1122_26/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 82d4c38..0000000
--- a/legacy/Data/ingsw/1122_26/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/ingsw/1122_27/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 59f8742..0000000
--- a/legacy/Data/ingsw/1122_27/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 2ca9276..0000000
--- a/legacy/Data/ingsw/1122_27/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6da4c51..0000000
--- a/legacy/Data/ingsw/1122_27/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c3fc7c1..0000000
--- a/legacy/Data/ingsw/1122_28/correct.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-<pre>
-int f(in x, int y) 
-
-{ 
-int z, w;
-assert( (z + w < 1) || (z + w > 7));
-.....
-}
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_28/quest.txt b/legacy/Data/ingsw/1122_28/quest.txt
deleted file mode 100644
index 733c0cb..0000000
--- a/legacy/Data/ingsw/1122_28/quest.txt
+++ /dev/null
@@ -1,7 +0,0 @@
-Pre-condizioni,  invarianti e post-condizioni di un programma possono essere definiti usando la macro del C assert() (in <assert.h>).  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
deleted file mode 100644
index 1b8fa8b..0000000
--- a/legacy/Data/ingsw/1122_28/wrong 1.txt	
+++ /dev/null
@@ -1,13 +0,0 @@
-<pre>
-int f(in x, int y) 
-
-{ 
-
-int z, w;
-
-assert( (z + w <= 1) || (z + w >= 7));
-
-.....
-
-}
-</pre>
\ 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
deleted file mode 100644
index b0705b4..0000000
--- a/legacy/Data/ingsw/1122_28/wrong 2.txt	
+++ /dev/null
@@ -1,13 +0,0 @@
-<pre>
-int f(in x, int y) 
-
-{ 
-
-int z, w;
-
-assert( (z + w > 1) || (z + w < 7));
-
-.....
-
-}
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_29/correct.txt b/legacy/Data/ingsw/1122_29/correct.txt
deleted file mode 100644
index 2d46409..0000000
--- a/legacy/Data/ingsw/1122_29/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 52863ce..0000000
--- a/legacy/Data/ingsw/1122_29/quest.txt
+++ /dev/null
@@ -1,70 +0,0 @@
-Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente ?
-<pre>
-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;
-</pre>
\ 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
deleted file mode 100644
index b008b75..0000000
--- a/legacy/Data/ingsw/1122_29/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 861967c..0000000
--- a/legacy/Data/ingsw/1122_29/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6d02149..0000000
--- a/legacy/Data/ingsw/1122_3/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ddcf7c8..0000000
--- a/legacy/Data/ingsw/1122_3/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-"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
deleted file mode 100644
index fb5bb3e..0000000
--- a/legacy/Data/ingsw/1122_3/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2c39a1a..0000000
--- a/legacy/Data/ingsw/1122_3/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2a2ecea..0000000
--- a/legacy/Data/ingsw/1122_30/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8b8cea7..0000000
--- a/legacy/Data/ingsw/1122_30/quest.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-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
deleted file mode 100644
index 9927a93..0000000
--- a/legacy/Data/ingsw/1122_30/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d68fd15..0000000
--- a/legacy/Data/ingsw/1122_30/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a98afd2..0000000
--- a/legacy/Data/ingsw/1122_31/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_31/quest.txt b/legacy/Data/ingsw/1122_31/quest.txt
deleted file mode 100644
index 7314e2c..0000000
--- a/legacy/Data/ingsw/1122_31/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 8f1589e..0000000
--- a/legacy/Data/ingsw/1122_31/wrong 1.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-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;
-</pre>
\ 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
deleted file mode 100644
index 8fd5deb..0000000
--- a/legacy/Data/ingsw/1122_31/wrong 2.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_33/correct.txt b/legacy/Data/ingsw/1122_33/correct.txt
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/1122_33/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6283906..0000000
--- a/legacy/Data/ingsw/1122_33/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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:
-
------------
-<pre>
-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()  */
-</pre>
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/1122_33/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/1122_33/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bc5692f..0000000
--- a/legacy/Data/ingsw/1122_34/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 09970ee..0000000
--- a/legacy/Data/ingsw/1122_34/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index 1a8a508..0000000
--- a/legacy/Data/ingsw/1122_34/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/1122_34/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 98939be..0000000
--- a/legacy/Data/ingsw/1122_35/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 215b21b..0000000
--- a/legacy/Data/ingsw/1122_35/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 56ea6ac..0000000
--- a/legacy/Data/ingsw/1122_35/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index db2276d..0000000
--- a/legacy/Data/ingsw/1122_35/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index a66c9ae..0000000
--- a/legacy/Data/ingsw/1122_36/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index da5d010..0000000
--- a/legacy/Data/ingsw/1122_36/quest.txt
+++ /dev/null
@@ -1,26 +0,0 @@
-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:
-<pre>
-(x + y <= 3) 
-((x + y <= 3) || (x - y > 7))
-</pre>
-
-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:
-<pre>
-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
-}
-</pre>
-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
deleted file mode 100644
index abe0eaa..0000000
--- a/legacy/Data/ingsw/1122_36/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index ea25d73..0000000
--- a/legacy/Data/ingsw/1122_36/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index deba1f5..0000000
--- a/legacy/Data/ingsw/1122_37/correct.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_37/quest.txt b/legacy/Data/ingsw/1122_37/quest.txt
deleted file mode 100644
index 843e4e9..0000000
--- a/legacy/Data/ingsw/1122_37/quest.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-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
deleted file mode 100644
index 6a0d3e9..0000000
--- a/legacy/Data/ingsw/1122_37/wrong 1.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-<pre>
-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;
-</pre>
\ 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
deleted file mode 100644
index f2a9214..0000000
--- a/legacy/Data/ingsw/1122_37/wrong 2.txt	
+++ /dev/null
@@ -1,20 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_38/correct.txt b/legacy/Data/ingsw/1122_38/correct.txt
deleted file mode 100644
index a7029bc..0000000
--- a/legacy/Data/ingsw/1122_38/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 24d3f68..0000000
--- a/legacy/Data/ingsw/1122_38/quest.txt
+++ /dev/null
@@ -1,29 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena il sistema viola il requisito monitorato.
-<pre>
-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;
-</pre>
-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
deleted file mode 100644
index 710b111..0000000
--- a/legacy/Data/ingsw/1122_38/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a82929b..0000000
--- a/legacy/Data/ingsw/1122_38/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8bec3c6..0000000
--- a/legacy/Data/ingsw/1122_39/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index 5826af4..0000000
--- a/legacy/Data/ingsw/1122_39/quest.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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:
------------
-<pre>
-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()  */
-</pre>
-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
deleted file mode 100644
index 08bfca1..0000000
--- a/legacy/Data/ingsw/1122_39/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index 256a361..0000000
--- a/legacy/Data/ingsw/1122_39/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index 9ddc3d7..0000000
--- a/legacy/Data/ingsw/1122_4/correct.txt
+++ /dev/null
@@ -1,45 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_4/quest.txt b/legacy/Data/ingsw/1122_4/quest.txt
deleted file mode 100644
index 4181719..0000000
--- a/legacy/Data/ingsw/1122_4/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index c92e243..0000000
--- a/legacy/Data/ingsw/1122_4/wrong 1.txt	
+++ /dev/null
@@ -1,67 +0,0 @@
-<pre>
-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;
-</pre>
\ 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
deleted file mode 100644
index ef7bdb0..0000000
--- a/legacy/Data/ingsw/1122_4/wrong 2.txt	
+++ /dev/null
@@ -1,69 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_40/correct.txt b/legacy/Data/ingsw/1122_40/correct.txt
deleted file mode 100644
index 6b560cf..0000000
--- a/legacy/Data/ingsw/1122_40/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 62c01e2..0000000
--- a/legacy/Data/ingsw/1122_40/quest.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-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
deleted file mode 100644
index d4b5815..0000000
--- a/legacy/Data/ingsw/1122_40/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/ingsw/1122_40/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/1122_42/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 67b07dc..0000000
--- a/legacy/Data/ingsw/1122_42/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-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:
-
------------
-<pre>
-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()  */
-</pre>
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/1122_42/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23e721f..0000000
--- a/legacy/Data/ingsw/1122_42/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bc5692f..0000000
--- a/legacy/Data/ingsw/1122_43/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1045bb8..0000000
--- a/legacy/Data/ingsw/1122_43/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/1122_43/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1a8a508..0000000
--- a/legacy/Data/ingsw/1122_43/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2fd674f..0000000
--- a/legacy/Data/ingsw/1122_44/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6428a0e..0000000
--- a/legacy/Data/ingsw/1122_44/quest.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-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
deleted file mode 100644
index a2507e5..0000000
--- a/legacy/Data/ingsw/1122_44/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 95bc750..0000000
--- a/legacy/Data/ingsw/1122_44/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3fb437d..0000000
--- a/legacy/Data/ingsw/1122_45/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1454704..0000000
--- a/legacy/Data/ingsw/1122_45/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index fc54e00..0000000
--- a/legacy/Data/ingsw/1122_45/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c64601b..0000000
--- a/legacy/Data/ingsw/1122_45/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 973ef63..0000000
--- a/legacy/Data/ingsw/1122_46/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5bf1a08..0000000
--- a/legacy/Data/ingsw/1122_46/quest.txt
+++ /dev/null
@@ -1,14 +0,0 @@
-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
deleted file mode 100644
index d4625fd..0000000
--- a/legacy/Data/ingsw/1122_46/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4e45af2..0000000
--- a/legacy/Data/ingsw/1122_46/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 475d1ef..0000000
--- a/legacy/Data/ingsw/1122_47/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index 3631f63..0000000
--- a/legacy/Data/ingsw/1122_47/quest.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-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
deleted file mode 100644
index 0aaedb8..0000000
--- a/legacy/Data/ingsw/1122_47/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index a6df32d..0000000
--- a/legacy/Data/ingsw/1122_47/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-{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
deleted file mode 100644
index f293f3e..0000000
--- a/legacy/Data/ingsw/1122_48/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index 4fc3c18..0000000
--- a/legacy/Data/ingsw/1122_48/quest.txt
+++ /dev/null
@@ -1,24 +0,0 @@
-Una Condition è una proposizione booleana, cioè una espressione con valore booleano che non può essere decomposta in espressioni boolean più semplici. Ad esempio, <code>(x + y <= 3)</code> è una condition.
-
-Una Decision è una espressione booleana composta da conditions e zero o più operatori booleani. Ad esempio, sono decisions:
-<pre>
-(x + y <= 3) 
-((x + y <= 3) || (x - y > 7))
-</pre>
-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:
-<pre>
-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 ?
-</pre>
\ 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
deleted file mode 100644
index fc010a3..0000000
--- a/legacy/Data/ingsw/1122_48/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index eafabb1..0000000
--- a/legacy/Data/ingsw/1122_48/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-(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
deleted file mode 100644
index d4b5815..0000000
--- a/legacy/Data/ingsw/1122_49/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e591c8c..0000000
--- a/legacy/Data/ingsw/1122_49/quest.txt
+++ /dev/null
@@ -1,12 +0,0 @@
-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
deleted file mode 100644
index eb5e1cd..0000000
--- a/legacy/Data/ingsw/1122_49/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8b0c318..0000000
--- a/legacy/Data/ingsw/1122_49/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f64e200..0000000
--- a/legacy/Data/ingsw/1122_5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bcbb3d8..0000000
--- a/legacy/Data/ingsw/1122_5/quest.txt
+++ /dev/null
@@ -1,68 +0,0 @@
-Si consideri il seguente modello Modelica. Quale dei seguenti state diagram lo rappresenta correttamente?
-<pre>
-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;
-</pre>
\ 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
deleted file mode 100644
index 03aeaee..0000000
--- a/legacy/Data/ingsw/1122_5/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ade29f4..0000000
--- a/legacy/Data/ingsw/1122_5/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7470aaf..0000000
--- a/legacy/Data/ingsw/1122_50/correct.txt
+++ /dev/null
@@ -1,69 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_50/quest.txt b/legacy/Data/ingsw/1122_50/quest.txt
deleted file mode 100644
index 971e607..0000000
--- a/legacy/Data/ingsw/1122_50/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index e77e043..0000000
--- a/legacy/Data/ingsw/1122_50/wrong 1.txt	
+++ /dev/null
@@ -1,69 +0,0 @@
-<pre>
-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;
-</pre>
\ 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
deleted file mode 100644
index 03c4dea..0000000
--- a/legacy/Data/ingsw/1122_50/wrong 2.txt	
+++ /dev/null
@@ -1,71 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_6/correct.txt b/legacy/Data/ingsw/1122_6/correct.txt
deleted file mode 100644
index cf8581f..0000000
--- a/legacy/Data/ingsw/1122_6/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b17d629..0000000
--- a/legacy/Data/ingsw/1122_6/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2cddbca..0000000
--- a/legacy/Data/ingsw/1122_6/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 04f8a5e..0000000
--- a/legacy/Data/ingsw/1122_6/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ce9968f..0000000
--- a/legacy/Data/ingsw/1122_7/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8db1ade..0000000
--- a/legacy/Data/ingsw/1122_7/quest.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-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
deleted file mode 100644
index e8f9017..0000000
--- a/legacy/Data/ingsw/1122_7/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index f2bb2d0..0000000
--- a/legacy/Data/ingsw/1122_7/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1c7da8c..0000000
--- a/legacy/Data/ingsw/1122_8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1f66143..0000000
--- a/legacy/Data/ingsw/1122_8/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index 7eb6830..0000000
--- a/legacy/Data/ingsw/1122_8/wrong 1.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8a346b7..0000000
--- a/legacy/Data/ingsw/1122_8/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a7a3133..0000000
--- a/legacy/Data/ingsw/1122_9/correct.txt
+++ /dev/null
@@ -1,44 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/1122_9/quest.txt b/legacy/Data/ingsw/1122_9/quest.txt
deleted file mode 100644
index 0e4c593..0000000
--- a/legacy/Data/ingsw/1122_9/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index ea67dd7..0000000
--- a/legacy/Data/ingsw/1122_9/wrong 1.txt	
+++ /dev/null
@@ -1,71 +0,0 @@
-<pre>
-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;
-</pre>
\ 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
deleted file mode 100644
index 578bb6b..0000000
--- a/legacy/Data/ingsw/1122_9/wrong 2.txt	
+++ /dev/null
@@ -1,76 +0,0 @@
-<pre>
-
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/12/correct.txt b/legacy/Data/ingsw/12/correct.txt
deleted file mode 100644
index 3769c66..0000000
--- a/legacy/Data/ingsw/12/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 48d53db..0000000
--- a/legacy/Data/ingsw/12/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 9d2b250..0000000
--- a/legacy/Data/ingsw/12/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-Sviluppo Iterativo
\ No newline at end of file
diff --git a/legacy/Data/ingsw/12/wrong.txt b/legacy/Data/ingsw/12/wrong.txt
deleted file mode 100644
index 541e265..0000000
--- a/legacy/Data/ingsw/12/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-Sviluppo Agile
\ No newline at end of file
diff --git a/legacy/Data/ingsw/16/correct.txt b/legacy/Data/ingsw/16/correct.txt
deleted file mode 100644
index 445c2fd..0000000
--- a/legacy/Data/ingsw/16/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/5gsmkFI.png
diff --git a/legacy/Data/ingsw/16/quest.txt b/legacy/Data/ingsw/16/quest.txt
deleted file mode 100644
index ce9037d..0000000
--- a/legacy/Data/ingsw/16/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index d880802..0000000
--- a/legacy/Data/ingsw/16/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/oqO8kfc.png
diff --git a/legacy/Data/ingsw/16/wrong.txt b/legacy/Data/ingsw/16/wrong.txt
deleted file mode 100644
index 79ee317..0000000
--- a/legacy/Data/ingsw/16/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/kAJWpZb.png
diff --git a/legacy/Data/ingsw/17/correct.txt b/legacy/Data/ingsw/17/correct.txt
deleted file mode 100644
index 5aeccb4..0000000
--- a/legacy/Data/ingsw/17/correct.txt
+++ /dev/null
@@ -1,25 +0,0 @@
-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
deleted file mode 100644
index ff93c6c..0000000
--- a/legacy/Data/ingsw/17/quest.txt
+++ /dev/null
@@ -1,10 +0,0 @@
-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
deleted file mode 100644
index 5ab3880..0000000
--- a/legacy/Data/ingsw/17/wrong 2.txt	
+++ /dev/null
@@ -1,19 +0,0 @@
-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
deleted file mode 100644
index 12836de..0000000
--- a/legacy/Data/ingsw/17/wrong.txt
+++ /dev/null
@@ -1,25 +0,0 @@
-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
deleted file mode 100644
index 0465ee7..0000000
--- a/legacy/Data/ingsw/19/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b8d789e..0000000
--- a/legacy/Data/ingsw/19/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 43fd110..0000000
--- a/legacy/Data/ingsw/19/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 1aa1cd5..0000000
--- a/legacy/Data/ingsw/19/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 23cbd0e..0000000
--- a/legacy/Data/ingsw/2/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-6*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/2/quest.txt b/legacy/Data/ingsw/2/quest.txt
deleted file mode 100644
index 78e700c..0000000
--- a/legacy/Data/ingsw/2/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 489e74c..0000000
--- a/legacy/Data/ingsw/2/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-5*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/2/wrong.txt b/legacy/Data/ingsw/2/wrong.txt
deleted file mode 100644
index 63ca2eb..0000000
--- a/legacy/Data/ingsw/2/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-4*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/20/correct.txt b/legacy/Data/ingsw/20/correct.txt
deleted file mode 100644
index 375f7c5..0000000
--- a/legacy/Data/ingsw/20/correct.txt
+++ /dev/null
@@ -1,47 +0,0 @@
-: 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
deleted file mode 100644
index 1fb3954..0000000
--- a/legacy/Data/ingsw/20/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 43c9f97..0000000
--- a/legacy/Data/ingsw/20/wrong 2.txt	
+++ /dev/null
@@ -1,47 +0,0 @@
-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
deleted file mode 100644
index 4e53f48..0000000
--- a/legacy/Data/ingsw/20/wrong.txt
+++ /dev/null
@@ -1,47 +0,0 @@
-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
deleted file mode 100644
index 60eaa92..0000000
--- a/legacy/Data/ingsw/21/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7799f39..0000000
--- a/legacy/Data/ingsw/21/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 06a3fbf..0000000
--- a/legacy/Data/ingsw/21/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3e13d27..0000000
--- a/legacy/Data/ingsw/21/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 2d1c2f0..0000000
--- a/legacy/Data/ingsw/22/correct.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/22/quest.txt b/legacy/Data/ingsw/22/quest.txt
deleted file mode 100644
index fcc9ac9..0000000
--- a/legacy/Data/ingsw/22/quest.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-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
deleted file mode 100644
index 40720c0..0000000
--- a/legacy/Data/ingsw/22/wrong 2.txt	
+++ /dev/null
@@ -1,21 +0,0 @@
-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
deleted file mode 100644
index eba6b6d..0000000
--- a/legacy/Data/ingsw/22/wrong.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/24/correct.txt b/legacy/Data/ingsw/24/correct.txt
deleted file mode 100644
index c7c83e5..0000000
--- a/legacy/Data/ingsw/24/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-3*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/24/quest.txt b/legacy/Data/ingsw/24/quest.txt
deleted file mode 100644
index 1e2f071..0000000
--- a/legacy/Data/ingsw/24/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index ff38c25..0000000
--- a/legacy/Data/ingsw/24/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-2*A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/24/wrong.txt b/legacy/Data/ingsw/24/wrong.txt
deleted file mode 100644
index 8c7e5a6..0000000
--- a/legacy/Data/ingsw/24/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/25/correct.txt b/legacy/Data/ingsw/25/correct.txt
deleted file mode 100644
index 1c03108..0000000
--- a/legacy/Data/ingsw/25/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bf0f99b..0000000
--- a/legacy/Data/ingsw/25/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 5187be2..0000000
--- a/legacy/Data/ingsw/25/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 52330c1..0000000
--- a/legacy/Data/ingsw/25/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e13eda2..0000000
--- a/legacy/Data/ingsw/26/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3cb2d1f..0000000
--- a/legacy/Data/ingsw/26/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index b24f900..0000000
--- a/legacy/Data/ingsw/26/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 884d6b1..0000000
--- a/legacy/Data/ingsw/26/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 90c1575..0000000
--- a/legacy/Data/ingsw/32/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/qKyYHVj.png
diff --git a/legacy/Data/ingsw/32/quest.txt b/legacy/Data/ingsw/32/quest.txt
deleted file mode 100644
index f0c9221..0000000
--- a/legacy/Data/ingsw/32/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 54e368c..0000000
--- a/legacy/Data/ingsw/32/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/5I3NjLb.png
diff --git a/legacy/Data/ingsw/32/wrong.txt b/legacy/Data/ingsw/32/wrong.txt
deleted file mode 100644
index c3a4d99..0000000
--- a/legacy/Data/ingsw/32/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/NDNLPgt.png
diff --git a/legacy/Data/ingsw/33/correct.txt b/legacy/Data/ingsw/33/correct.txt
deleted file mode 100644
index ddb0d65..0000000
--- a/legacy/Data/ingsw/33/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4ea55e0..0000000
--- a/legacy/Data/ingsw/33/quest.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-Si consideri il monitor seguente che ritorna true appena i requisiti per il sistema monitorato sono violati.
-<pre>
-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;
-</pre>
-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
deleted file mode 100644
index 7c7a691..0000000
--- a/legacy/Data/ingsw/33/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3e05ae7..0000000
--- a/legacy/Data/ingsw/33/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 3f7adfb..0000000
--- a/legacy/Data/ingsw/34/correct.txt
+++ /dev/null
@@ -1,21 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/34/quest.txt b/legacy/Data/ingsw/34/quest.txt
deleted file mode 100644
index 0ba09fa..0000000
--- a/legacy/Data/ingsw/34/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 25f1613..0000000
--- a/legacy/Data/ingsw/34/wrong 2.txt	
+++ /dev/null
@@ -1,22 +0,0 @@
-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
deleted file mode 100644
index 4fb78cc..0000000
--- a/legacy/Data/ingsw/34/wrong.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-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
deleted file mode 100644
index 3a0f9a1..0000000
--- a/legacy/Data/ingsw/35/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9af583e..0000000
--- a/legacy/Data/ingsw/35/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6633b8c..0000000
--- a/legacy/Data/ingsw/35/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7edd4bc..0000000
--- a/legacy/Data/ingsw/35/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 634f690..0000000
--- a/legacy/Data/ingsw/39/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4a711a4..0000000
--- a/legacy/Data/ingsw/39/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 74c1239..0000000
--- a/legacy/Data/ingsw/39/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bd881bc..0000000
--- a/legacy/Data/ingsw/39/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6e771e9..0000000
--- a/legacy/Data/ingsw/4/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 07df0c7..0000000
--- a/legacy/Data/ingsw/4/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index a9b1c29..0000000
--- a/legacy/Data/ingsw/4/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c24cae9..0000000
--- a/legacy/Data/ingsw/4/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index c4cb236..0000000
--- a/legacy/Data/ingsw/43/correct.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/43/quest.txt b/legacy/Data/ingsw/43/quest.txt
deleted file mode 100644
index 71eee89..0000000
--- a/legacy/Data/ingsw/43/quest.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-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
deleted file mode 100644
index 98b6414..0000000
--- a/legacy/Data/ingsw/43/wrong 2.txt	
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/43/wrong.txt b/legacy/Data/ingsw/43/wrong.txt
deleted file mode 100644
index a4ee4fb..0000000
--- a/legacy/Data/ingsw/43/wrong.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/44/correct.txt b/legacy/Data/ingsw/44/correct.txt
deleted file mode 100644
index aa45c64..0000000
--- a/legacy/Data/ingsw/44/correct.txt
+++ /dev/null
@@ -1,20 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/44/quest.txt b/legacy/Data/ingsw/44/quest.txt
deleted file mode 100644
index 18bac37..0000000
--- a/legacy/Data/ingsw/44/quest.txt
+++ /dev/null
@@ -1,8 +0,0 @@
-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
deleted file mode 100644
index 2e82c1c..0000000
--- a/legacy/Data/ingsw/44/wrong 2.txt	
+++ /dev/null
@@ -1,20 +0,0 @@
-<pre>
-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;
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/44/wrong.txt b/legacy/Data/ingsw/44/wrong.txt
deleted file mode 100644
index 75b3383..0000000
--- a/legacy/Data/ingsw/44/wrong.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-<pre>
-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
-</pre>
\ No newline at end of file
diff --git a/legacy/Data/ingsw/45/correct.txt b/legacy/Data/ingsw/45/correct.txt
deleted file mode 100644
index 19d3060..0000000
--- a/legacy/Data/ingsw/45/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Layred architecture.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/45/quest.txt b/legacy/Data/ingsw/45/quest.txt
deleted file mode 100644
index e43794a..0000000
--- a/legacy/Data/ingsw/45/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index fd0a8b5..0000000
--- a/legacy/Data/ingsw/45/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 9266c1a..0000000
--- a/legacy/Data/ingsw/45/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4a45407..0000000
--- a/legacy/Data/ingsw/46/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/cMy78HJ.png
diff --git a/legacy/Data/ingsw/46/quest.txt b/legacy/Data/ingsw/46/quest.txt
deleted file mode 100644
index 20c9a97..0000000
--- a/legacy/Data/ingsw/46/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index 5b7d09a..0000000
--- a/legacy/Data/ingsw/46/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/7lOYboM.png
diff --git a/legacy/Data/ingsw/46/wrong.txt b/legacy/Data/ingsw/46/wrong.txt
deleted file mode 100644
index 50bd343..0000000
--- a/legacy/Data/ingsw/46/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-img=https://i.imgur.com/4gXreOh.png
diff --git a/legacy/Data/ingsw/47/correct.txt b/legacy/Data/ingsw/47/correct.txt
deleted file mode 100644
index c8bbd53..0000000
--- a/legacy/Data/ingsw/47/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 193a65f..0000000
--- a/legacy/Data/ingsw/47/quest.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-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
deleted file mode 100644
index bc8629f..0000000
--- a/legacy/Data/ingsw/47/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 5d317c8..0000000
--- a/legacy/Data/ingsw/47/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 455d534..0000000
--- a/legacy/Data/ingsw/48/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index b7e0b09..0000000
--- a/legacy/Data/ingsw/48/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 87e99c2..0000000
--- a/legacy/Data/ingsw/48/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index ddc2301..0000000
--- a/legacy/Data/ingsw/48/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 88f9125..0000000
--- a/legacy/Data/ingsw/49/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-Requisito utente.
\ No newline at end of file
diff --git a/legacy/Data/ingsw/49/quest.txt b/legacy/Data/ingsw/49/quest.txt
deleted file mode 100644
index e544e9e..0000000
--- a/legacy/Data/ingsw/49/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 6084c49..0000000
--- a/legacy/Data/ingsw/49/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4cae0da..0000000
--- a/legacy/Data/ingsw/49/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 58964fc..0000000
--- a/legacy/Data/ingsw/5/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 4ce9b89..0000000
--- a/legacy/Data/ingsw/5/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index a75a40c..0000000
--- a/legacy/Data/ingsw/5/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e47f380..0000000
--- a/legacy/Data/ingsw/5/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index bb086af..0000000
--- a/legacy/Data/ingsw/50/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 7816962..0000000
--- a/legacy/Data/ingsw/50/quest.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index d61601e..0000000
--- a/legacy/Data/ingsw/50/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index dd9b316..0000000
--- a/legacy/Data/ingsw/50/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 431a7c5..0000000
--- a/legacy/Data/ingsw/69420/correct.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 8fa4d25..0000000
--- a/legacy/Data/ingsw/69420/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 670e7eb..0000000
--- a/legacy/Data/ingsw/69420/wrong 2.txt	
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 673514a..0000000
--- a/legacy/Data/ingsw/69420/wrong 3.txt	
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index 6e6963e..0000000
--- a/legacy/Data/ingsw/69420/wrong.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-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
deleted file mode 100644
index b3843cf..0000000
--- a/legacy/Data/ingsw/8/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e4ebc4a..0000000
--- a/legacy/Data/ingsw/8/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 8c7e5a6..0000000
--- a/legacy/Data/ingsw/8/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-A
\ No newline at end of file
diff --git a/legacy/Data/ingsw/8/wrong.txt b/legacy/Data/ingsw/8/wrong.txt
deleted file mode 100644
index 54d2e91..0000000
--- a/legacy/Data/ingsw/8/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index e86ff88..0000000
--- a/legacy/Data/ingsw/9/correct.txt
+++ /dev/null
@@ -1 +0,0 @@
-1/1000
\ No newline at end of file
diff --git a/legacy/Data/ingsw/9/quest.txt b/legacy/Data/ingsw/9/quest.txt
deleted file mode 100644
index 7cae29d..0000000
--- a/legacy/Data/ingsw/9/quest.txt
+++ /dev/null
@@ -1 +0,0 @@
-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
deleted file mode 100644
index 78abc32..0000000
--- a/legacy/Data/ingsw/9/wrong 2.txt	
+++ /dev/null
@@ -1 +0,0 @@
-1/100
\ No newline at end of file
diff --git a/legacy/Data/ingsw/9/wrong.txt b/legacy/Data/ingsw/9/wrong.txt
deleted file mode 100644
index bb7060e..0000000
--- a/legacy/Data/ingsw/9/wrong.txt
+++ /dev/null
@@ -1 +0,0 @@
-1/10
\ No newline at end of file
diff --git a/legacy/Data/motd.txt b/legacy/Data/motd.txt
deleted file mode 100644
index 4451483..0000000
--- a/legacy/Data/motd.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-"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/legacy/Dockerfile b/legacy/Dockerfile
deleted file mode 100644
index 2a9f3bf..0000000
--- a/legacy/Dockerfile
+++ /dev/null
@@ -1,17 +0,0 @@
-FROM mcr.microsoft.com/dotnet/sdk:8.0 AS build-env
-WORKDIR /App
-
-# Copy everything
-COPY ./Bot ./
-# Restore as distinct layers
-RUN dotnet restore
-# Build and publish a release
-RUN dotnet publish -c Release -o out
-
-FROM mcr.microsoft.com/dotnet/aspnet:8.0
-WORKDIR /App
-# Copy the compiled binaries from the build stage container
-COPY --from=build-env /App/out .
-# Copy all the static data (questions, motd)
-COPY ./Data /data
-ENTRYPOINT ["dotnet", "SoUnBot.dll"]
diff --git a/legacy/README.md b/legacy/README.md
deleted file mode 100644
index a936ac3..0000000
--- a/legacy/README.md
+++ /dev/null
@@ -1,44 +0,0 @@
-# WARNING
-**We are working on a completely new version of the bot, written in Python. Stay tuned!**
-
----
-# so-un-bot
-The official https://t.me/so_1_bot questions repository
-
-🇮🇹 Raccolta di domande con risposta multipla utili per esercitarsi in molteplici esami!
-
-### Struttura del repository
-
-In Data/Questions sono presenti tutte le domande attualmente presenti nel bot, il nome del file corrisponde al nome del comando sul bot.
-Per aggiungere o correggere domande potete fare una Pull Request a questa repo.
-
-In Utils trovate script, sviluppati da vari studenti del corso, per creare o validare i file delle domande.
-
-**Nota per gli admin di appinfosapienza:**
-Al momento non sono presenti dei test CI che testano l'integrità del repository prima di un deploy.
-Quando accettate una Pull Request, entro due minuti verrà lanciata una nuova build sul server di produzione e al termine eseguito il bot con la nuova versione.
-
-Non essendoci test CI, se sono presenti errori, un commit contenente errori può mandare offline il bot (ad es. se il bot non riesce a fare il parsing di tutte le domande all'avvio).
-
-**Per i contributori:** 
-### Struttura dei file
-
-Il bot accetta le domande sia in un singolo file (utilizzato ad esesempio da Sistemi Operativi 1 e 2), che in file multipli (utilizzato da Ingegneria del Software).
-È in programma l'implementazione del supporto al formato JSON.
-
-#### Singolo file
-
-- Le domande sono separate da una riga vuota
-- Le risposte possono essere su una riga sola
-- Le risposte devono iniziano per `> ` se sono errate, per `v ` se sono corrette
-- Non ci possono essere righe vuote nella stessa domanda
-- Solo la domanda può contenere un'immagine, non le risposte
-
-#### File multipli
-
-- Ogni domanda è in una directory separata
-- La directory ha come nome il numero della domanda
-- Il testo della domanda è nel file `quest.txt`
-- La risposta corretta è nel file `correct.txt`
-- Gli altri file contengono solo risposte errate
-- Sia domande che risposte possono contenere immagini (max un'immagine per domanda e una per ciascuna risposta)
diff --git a/legacy/Utils/check-ingsw-photos.sh b/legacy/Utils/check-ingsw-photos.sh
deleted file mode 100755
index 94b92a1..0000000
--- a/legacy/Utils/check-ingsw-photos.sh
+++ /dev/null
@@ -1,17 +0,0 @@
-#!/bin/bash
-
-SEARCHDIR="./Ingegneria del Software/"
-
-echo "Invalid URLs:"
-
-for img in `grep "img" "$SEARCHDIR" -R | sed -E 's/^(.*?)\.txt\:img\=//'`; do
-    img=$(echo "$img"|tr -d '\n'|tr -d '\r')
-    curl -I "$img" 2>/dev/null | \
-        grep -i "Content-Type: image/" >/dev/null
-    if [ "$?" -ne 0 ]; then
-        (
-            cd "$SEARCHDIR"
-            grep "$img" . -R
-        )
-    fi
-done
diff --git a/legacy/Utils/find_duplicates.py b/legacy/Utils/find_duplicates.py
deleted file mode 100644
index 494f328..0000000
--- a/legacy/Utils/find_duplicates.py
+++ /dev/null
@@ -1,65 +0,0 @@
-# A python helper script that finds duplicated questions
-# and deletes them.
-
-import os
-import shutil
-
-path = input("Specify the path: ")
-
-quests = list(os.walk(path))[0][1]
-
-m = {}
-
-print("Loading questions...")
-
-for q in quests:
-    qq = open(path + "/" + q + "/quest.txt", "r").read()
-    if qq.startswith("img=") and "\n" in qq:
-        qq = qq[qq.index("\n"):]
-
-    cc = open(path + "/" + q + "/correct.txt", "r").read()
-    if cc.startswith("img=") and "\n" in cc:
-        cc = cc[cc.index("\n"):]
-    
-    qq = qq + cc
-
-    qq = qq.replace("\n", "")
-    qq = qq.replace("<pre>", "")
-    qq = qq.replace("<code>", "")
-    qq = qq.replace("</pre>", "")
-    qq = qq.replace("</code>", "")
-    qq = qq.replace("'", "")
-    qq = qq.replace("à", "a")
-    qq = qq.replace("è", "e")
-    qq = qq.replace("ì", "i")
-    qq = qq.replace("ò", "o")
-    qq = qq.replace("ù", "u")
-    qq = qq.replace(" ", "")
-    m[q] = qq
-
-print("Comparing questions...")
-
-rev_dict = {}
-
-for key, value in m.items():
-    rev_dict.setdefault(value, set()).add(key)
-
-
-result = [values for key, values in rev_dict.items()
-                              if len(values) > 1]
-
-if result:
-    print("Duplicate questions:", str(result))
-else:
-    print("There are no duplicates!")
-    exit()
-
-for dup in result:
-    #delete the duplicates
-    ld = list(dup)
-    for i in range(len(ld)):
-        if i == 0:
-            print("Keeping " + ld[i])
-            continue
-        print("Deleting", ld[i])
-        shutil.rmtree(path + "/" + ld[i])
\ No newline at end of file
diff --git a/legacy/Utils/make_questions.py b/legacy/Utils/make_questions.py
deleted file mode 100644
index 9eecf01..0000000
--- a/legacy/Utils/make_questions.py
+++ /dev/null
@@ -1,22 +0,0 @@
-# A python helper tool to generate questions with the directory tree format
-
-import os 
-
-prefix = input("Specify a prefix (default is no prefix): ")
-separator = input("Specify a separator (default is no separator): ")
-current = int(input("Number of the next question: "))
-path = input("Specify the path: ")
-
-while True:
-    dirname = path + "/" + prefix + separator + str(current)
-    os.mkdir(dirname)
-    open(dirname + "/quest.txt", 'a').close()
-    os.system("\"" + dirname + "/quest.txt" + "\"")
-    open(dirname + "/correct.txt", 'a').close()
-    os.system("\"" + dirname + "/correct.txt" + "\"")
-    open(dirname + "/wrong 1.txt", 'a').close()
-    os.system("\"" + dirname + "/wrong 1.txt" + "\"")
-    open(dirname + "/wrong 2.txt", 'a').close()
-    os.system("\"" + dirname + "/wrong 2.txt" + "\"")
-
-    current += 1
\ No newline at end of file
diff --git a/legacy/Utils/moodle-scraper/README.md b/legacy/Utils/moodle-scraper/README.md
deleted file mode 100644
index 584bde5..0000000
--- a/legacy/Utils/moodle-scraper/README.md
+++ /dev/null
@@ -1,12 +0,0 @@
-### Moodle Scraper
-
-Web scraper in Python per salvare un quiz Moodle in un formato compatibile con il bot.
-
-Per far funzionare lo scraper, è necessario creare un file .env nella directory dello scraper e inserire rispettivamente:
-
-USER = Matricola
-PASSWORD = Password di Infostud
-
-Infine inserire il chromedriver sempre nella directory dello scraper.
-
-Una volta lanciato lo script, le domande verranno inserite formattate in cartelle che verranno create all'interno della cartella Scraper. Fare attenzione al fatto che le domande con immagini non sono gestite e dovranno comunque essere inserite a mano. Non sono gestiti nemmeno le parti di codice, quindi il tag "pre" dovrà essere inserito a mano.
diff --git a/legacy/Utils/moodle-scraper/scraper.py b/legacy/Utils/moodle-scraper/scraper.py
deleted file mode 100644
index 6de4980..0000000
--- a/legacy/Utils/moodle-scraper/scraper.py
+++ /dev/null
@@ -1,90 +0,0 @@
-# Moodle Scraper
-# 2023 - Matteo Mariotti
-
-from selenium import webdriver
-from selenium.webdriver.common.by import By
-from dotenv import load_dotenv
-import time
-import os
-
-load_dotenv()
-
-
-matricola = os.getenv('UTENTE')
-password = os.getenv('PASSWORD')
-
-
-url_risultati_esame = "https://elearning.uniroma1.it/mod/quiz/review.php?attempt=1096697&cmid=408285"
-codice_esame = "0721"
-
-
-# Main Function
-if __name__ == '__main__':
-  
-    options = webdriver.ChromeOptions()
-    options.add_argument("--start-maximized")
-    options.add_argument('--log-level=3')
-  
-    # Provide the path of chromedriver present on your system.
-    driver = webdriver.Chrome(executable_path="./chromedriver.exe",
-                              chrome_options=options)
-    driver.set_window_size(1920,1080)
-  
-    # Loggo in elearning
-    driver.get('https://elearning.uniroma1.it/auth/mtsaml/')
-    time.sleep(1)
-    userbox = driver.find_element(By.ID, "username")
-    passbox = driver.find_element(By.ID, "password")
-    userbox.send_keys(matricola)
-    passbox.send_keys(password)
-    button = driver.find_element(By.NAME, "_eventId_proceed")
-    button.click()
-    time.sleep(1)
-
-    #Apro i risultati del test
-    driver.get(url_risultati_esame)
-
-    # Ottengo tutti i box delle domande
-    qboxes = driver.find_elements(By.CLASS_NAME, "qtext")
-
-    #Prendo tutti i box delle risposte e li divido (n.b. controllare nei risultati che la divisione sia corretta)
-    answers = driver.find_elements(By.CLASS_NAME, "answer")
-    answers_cleaned = []
-    for i, answer in enumerate(answers):
-        with open("risposte.txt", "w") as f1:
-            f1.write(answer.text)
-        answers_cleaned.append([])
-        answers_cleaned[i].append(answer.text.split("1.",1)[1].split("2.",1)[0])
-        answers_cleaned[i].append(answer.text.split("1.",1)[1].split("2.",1)[1].split("3.",1)[0])
-        answers_cleaned[i].append(answer.text.split("1.",1)[1].split("2.",1)[1].split("3.",1)[1])
-
-    # Ottenfo tutti i box delle risposte corrette e elimino la prima parte che non è necessaria
-    rightAnswers = driver.find_elements(By.CLASS_NAME, "rightanswer")
-    right = []
-    for ranswer in rightAnswers:
-        right.append(ranswer.text[24:])
-
-
-    #Procedo alla creazione dei file
-    i = 0    
-    for domanda, risposte, corretta in zip(qboxes, answers_cleaned, right):
-        cartella = codice_esame + "_" + str(i)
-        os.mkdir(cartella)
-        with open(cartella + "/quest.txt", "w") as f:
-            f.write(domanda.text.strip())
-        j=1
-        for risp in risposte:
-            #Se la risposta coincide con quella corretta la metto in correct.txt altrimenti va in un file wrong{indice}.txt
-            #N.B. Il controlla a volte non funziona correttamente (vengono generati solo file wrong.txt)
-            if (risp.strip() == corretta.strip()):
-                with open(cartella + "/correct.txt", "w") as f:
-                    f.write(risp.strip())
-            else:
-                with open(cartella + "/wrong"+str(j)+".txt", "w") as f:
-                    f.write(risp.strip())
-                j = j+1
-        i = i+1
-
-    time.sleep(60)
-    driver.quit()
-    print("Done")
\ No newline at end of file
diff --git a/legacy/docker-compose.yml b/legacy/docker-compose.yml
deleted file mode 100644
index 1a09fbb..0000000
--- a/legacy/docker-compose.yml
+++ /dev/null
@@ -1,23 +0,0 @@
-# The configuration used to deploy the bot on the production server
-# You can adapt it to create your own instance
-
-version: '3.8'
-services:
-  bot:
-    build: .
-    restart: unless-stopped
-    hostname: so-un-bot
-    # change to your local DNS zone (can be safely removed if not needed)
-    # for example: in the production server is pve-docer.net.mrlc.cc
-    domainname: ${DNS_ZONE}
-    pull_policy: build
-    environment:
-      # Leave /data unless you want to point to an external volume
-      - DATA_PATH=/data
-      # Should match the path defined in the volume mount (if you want it to persist)
-      - ACL_PATH=/acl
-      - TELEGRAM_TOKEN=${TELEGRAM_TOKEN}
-      # User id of the administrator user (will receive logs for errors)
-      - TELEGRAM_ADMIN_ID=${TELEGRAM_ADMIN_ID}
-    volumes:
-      - ${ACL_DIR}:/acl
\ No newline at end of file