Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

--- magistraleinformatica:mod:start:pretest [23/07/2015 alle 10:25 (10 anni fa)] – Roberto Bruni
+++ magistraleinformatica:mod:start:pretest [01/03/2016 alle 23:11 (9 anni fa)] (versione attuale) – Roberto Bruni
@@ Linea 1: / Linea 1: @@
 ==== Preliminary test for the course on Models of Computation ====
-There are no prerequisistes for MOD, but we expect the students to have some familiarity with discrete mathematics, first-order logic formulas, context-free grammars, and code fragments in imperative and functional style.
+There are no prerequisites for MOD, but we expect the students to have some familiarity with discrete mathematics, first-order logic formulas, context-free grammars, and code fragments in imperative and functional style.
 We encourage the students to use the following basic exercises to self-assess their level of knowledge for the above arguments.
@@ Linea 15: / Linea 15: @@
 === Exercise 3 ===
-Let 2<sup>n</sup> denote the nth power of 2. Prove by induction that for any natural number n > 1 we have that 3 divides 2<sup>n</sup> - 1.
+Let 7<sup>n</sup> denote the nth power of 7. Prove by induction that for any natural number n > 1 we have that 3 divides 7<sup>n</sup> - 1.
 === Exercise 4 ===
@@ Linea 27: / Linea 27: @@
 === Exercise 5 ===
-Let us consider the program
+Let us consider the imperative code fragment
 <code>while (x!=0 and y!=0) do {
-    x:=x-y ;
+    x := x-y;
-    y:=y-1
+    y := y-1
 }</code>