{"id":98,"date":"2014-11-23T15:10:10","date_gmt":"2014-11-23T14:10:10","guid":{"rendered":"http:\/\/informatique.ltett.lu\/?page_id=98"},"modified":"2023-10-04T11:57:36","modified_gmt":"2023-10-04T10:57:36","slug":"3gig-activites-actuelles","status":"publish","type":"page","link":"https:\/\/informatique.ltett.lu\/?page_id=98","title":{"rendered":"3GIG \u2013 Activit\u00e9s"},"content":{"rendered":"

Actuellement le cours de la 3GIG est dans le chapitre:<\/p>\n

Boucles imbriqu\u00e9es
\n<\/i><\/b><\/p>\n

Les exercices ont \u00e9galement leur solution PDF (apr\u00e8s avoir \u00e9t\u00e9 trait\u00e9s). Toutes les vid\u00e9os sont ici…<\/a><\/p>\n

27.06.2019<\/h1>\n
    \n
  • Mati\u00e8re: boucles imbriqu\u00e9es<\/li>\n
  • Cours pages: 1 – 47<\/li>\n
  • Vid\u00e9os: \/<\/li>\n
  • Exercices: Exercice 29 et 30 modifi\u00e9s (\u00e9nonc\u00e9s) – solutions: 29, 30
    \n[ Exercice 26 modifi\u00e9 (\u00e9nonc\u00e9) – solutions:\u00a0 26a, 26b, 26c et 26d ]<\/li>\n
  • Vid\u00e9os \u00e0 voir: \/<\/li>\n
  • Travail \u00e0 faire: \/<\/li>\n<\/ul>\n

    20.06.2019<\/h1>\n
      \n
    • Mati\u00e8re: exercices avec objets<\/li>\n
    • Cours pages: 1 – 47<\/li>\n
    • Vid\u00e9os: \/<\/li>\n
    • Exercices: Exercice 26a (suite et fin) modifi\u00e9 (\u00e9nonc\u00e9)<\/li>\n
    • Vid\u00e9os \u00e0 voir: \/<\/li>\n
    • Travail \u00e0 faire: \/<\/li>\n<\/ul>\n

      13.06.2019<\/h1>\n
        \n
      • Mati\u00e8re: exercices avec objets<\/li>\n
      • Cours pages: 1 – 47<\/li>\n
      • Vid\u00e9os: \/<\/li>\n
      • Exercices: Exercice 26a modifi\u00e9 (\u00e9nonc\u00e9)<\/li>\n
      • Vid\u00e9os \u00e0 voir: \/<\/li>\n
      • Travail \u00e0 faire:\n
          \n
        • pr\u00e9parer test suppl\u00e9mentaire optionnel: algorithmes connus<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

          06.06.2019<\/h1>\n
            \n
          • Devoir en classe<\/li>\n<\/ul>\n

            23.05.2019<\/h1>\n
              \n
            • Mati\u00e8re: algorithmes avanc\u00e9s – min\/max et nombre premier<\/li>\n
            • Cours pages: 40 – 45<\/li>\n
            • Vid\u00e9os:\u00a0J.4 – find highest and lowest numbers in a range of numbers, J.5 – prime numbers \u2013 easiest algorithme\u00a0(optionnel: J.6 – prime numbers \u2013 optimized algorithm)<\/li>\n
            • Exercices: Exercice 27<\/li>\n
            • Vid\u00e9os \u00e0 voir: \/<\/li>\n
            • Travail \u00e0 faire:\n
                \n
              • terminer Exercice 27<\/li>\n
              • comprendre ces algorithmes<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                16.05.2019<\/h1>\n
                  \n
                • Mati\u00e8re: algorithmes avanc\u00e9s – min\/max et nombre premier<\/li>\n
                • Cours pages: 40 – 45<\/li>\n
                • Vid\u00e9os:\u00a0J.4 – find highest and lowest numbers in a range of numbers, J.5 – prime numbers \u2013 easiest algorithme\u00a0(optionnel: J.6 – prime numbers \u2013 optimized algorithm)<\/li>\n
                • Exercices: Exercice 23<\/li>\n
                • Vid\u00e9os \u00e0 voir: \/<\/li>\n
                • Travail \u00e0 faire:\n
                    \n
                  • terminer Exercice 23<\/li>\n
                  • comprendre ces algorithmes<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                    02.05.2019<\/h1>\n
                      \n
                    • Mati\u00e8re: algorithmes avanc\u00e9s – PGCD et PPCM<\/li>\n
                    • Cours pages: 40 – 45<\/li>\n
                    • Vid\u00e9os:\u00a0J.1 – GCD \u2013 search algorithm,\u00a0J.2 – LCM \u2013 search algorithm,\u00a0J.3 – GCD \u2013 Euclid algorithm<\/li>\n
                    • Exercices: Exercice 22 – params (\u00e9nonc\u00e9, solution)<\/li>\n
                    • Vid\u00e9os \u00e0 voir: \u00a0J.4 – find highest and lowest numbers in a range of numbers, J.5 – prime numbers \u2013 easiest algorithm
                      \n(optionnel: J.6 – prime numbers \u2013 optimized algorithm)<\/li>\n
                    • Travail \u00e0 faire:\n
                        \n
                      • terminer Exercice 22 – params<\/li>\n
                      • comprendre ces algorithmes<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                        25.04.2019<\/h1>\n
                          \n
                        • Mati\u00e8re: algorithmes avanc\u00e9s – PGCD et PPCM<\/li>\n
                        • Cours pages: 40 – 45<\/li>\n
                        • Vid\u00e9os:\u00a0J.1 – GCD \u2013 search algorithm,\u00a0J.2 – LCM \u2013 search algorithm,\u00a0J.3 – GCD \u2013 Euclid algorithm<\/li>\n
                        • Exercices: Exercice 22 – points f) \u00e0 j)<\/li>\n
                        • Vid\u00e9os \u00e0 voir: \/<\/li>\n
                        • Travail \u00e0 faire:\n
                            \n
                          • terminer Exercice 22<\/li>\n
                          • comprendre ces algorithmes<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                            28.03.2019<\/h1>\n
                              \n
                            • Mati\u00e8re: r\u00e9p\u00e9titive\u00a0tant que<\/em>\u00a0(while) + pour (for) – Algorithmes de base<\/li>\n
                            • Cours pages: 41 et 42<\/li>\n
                            • Vid\u00e9os: H.1 – while loop \u2013 standard algos \u2013 part 1\/3: calculateSum()\u00a0,\u00a0H.2 – while loop \u2013 standard algos \u2013 part 2\/3: non integer counter, H.3 – while loop \u2013 standard algos \u2013 part 3\/3: calculatePower()<\/li>\n
                            • Exercices: Exercice 22 a) – e), Exercice 21<\/li>\n
                            • Vid\u00e9os \u00e0 voir: I.1 – for loop , J.1 – GCD \u2013 search algorithm, J.2 – LCM \u2013 search algorithm, J.3 – GCD \u2013 Euclid algorithm<\/li>\n
                            • Travail \u00e0 faire:\n
                                \n
                              • traiter vid\u00e9os I.1 et J.1 \u00e0 J.3<\/li>\n
                              • terminer Exercice 22 a) – e), Exercice 21<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                21.03.2019<\/h1>\n
                                  \n
                                • Mati\u00e8re: r\u00e9p\u00e9titive\u00a0tant que<\/em>\u00a0(while) – Algorithmes de base<\/li>\n
                                • Cours pages: 41 et 42<\/li>\n
                                • Vid\u00e9os: H.1 – while loop \u2013 standard algos \u2013 part 1\/3: calculateSum()\u00a0,\u00a0H.2 – while loop \u2013 standard algos \u2013 part 2\/3: non integer counter,<\/li>\n
                                • Exercices: Exercice 20, Exercice 22 a) – e)<\/li>\n
                                • Vid\u00e9os \u00e0 voir: H.3 – while loop \u2013 standard algos \u2013 part 3\/3: calculatePower()<\/li>\n
                                • Travail \u00e0 faire:\n
                                    \n
                                  • traiter vid\u00e9os H.1 \u00e0 H.3<\/li>\n
                                  • terminer Exercice 20<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                    14.03.2019<\/h1>\n
                                      \n
                                    • Mati\u00e8re: r\u00e9p\u00e9titive\u00a0tant que<\/em>\u00a0(while)<\/li>\n
                                    • Cours pages: 41 et 42<\/li>\n
                                    • Vid\u00e9os: G.1 – while loop principles\u00a0(tr\u00e8s important!<\/strong>)<\/em><\/li>\n
                                    • Exercices: Exercice 20<\/li>\n
                                    • Vid\u00e9os \u00e0 voir: H.1 – while loop \u2013 standard algos \u2013 part 1\/3: calculateSum()\u00a0,\u00a0H.2 – while loop \u2013 standard algos \u2013 part 2\/3: non integer counter<\/li>\n
                                    • Travail \u00e0 faire:\n
                                        \n
                                      • traiter vid\u00e9os H.1 \u00e0 H.2<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                        07.03.2019<\/h1>\n
                                          \n
                                        • Mati\u00e8re: r\u00e9p\u00e9titive\u00a0tant que<\/em>\u00a0(while)<\/li>\n
                                        • Cours pages: 41 et 42<\/li>\n
                                        • Vid\u00e9os: G.1 – while loop principles\u00a0(tr\u00e8s important!<\/strong>)<\/em><\/li>\n
                                        • Exercices: Exercices suppl\u00e9mentaires R1 et R2 (\u00e9nonc\u00e9s, solutions)<\/li>\n
                                        • Vid\u00e9os \u00e0 voir:<\/li>\n
                                        • Travail \u00e0 faire:\n
                                            \n
                                          • r\u00e9viser vid\u00e9o G.1 et le cours<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                            28.02.2019<\/h1>\n
                                              \n
                                            • Devoir en classe II-1<\/li>\n
                                            • Mati\u00e8re \u00e0 revoir:\n
                                                \n
                                              • classes, attributs, constructeur, getters\/setters, m\u00e9thodes, appels de m\u00e9thodes<\/li>\n
                                              • nombres al\u00e9atoires Math.random()<\/li>\n
                                              • m\u00e9thodes de Math<\/li>\n
                                              • alternative (IF)<\/li>\n
                                              • tous les exercices<\/li>\n<\/ul>\n<\/li>\n
                                              • Vid\u00e9os \u00e0 voir: G.1 – while loop principles\u00a0(tr\u00e8s important!<\/strong>)<\/em>; vid\u00e9os G.2 et G.3 sont optionnelles
                                                \n<\/em><\/li>\n
                                              • Travail \u00e0 faire:\n
                                                  \n
                                                • traiter \/ voir la vid\u00e9o G.1<\/li>\n
                                                • lire cours pages 41, 42 et 45 \u00e0 47<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                  14.02.2018<\/h1>\n
                                                    \n
                                                  • Mati\u00e8re: alternative (IF) \/ Test II-2 (solution Groupe A, solution Groupe B)<\/li>\n
                                                  • Cours pages: 33 \u00e0 40<\/li>\n
                                                  • Vid\u00e9os:\u00a0\u00a0F.1 \u2013\u00a0IF principles and comparison operators,\u00a0F.2 – logical operators,\u00a0F.3 – nested IF structures,\u00a0F.4 – Creation of a test class \u2013 leap year algorithm<\/li>\n
                                                  • Exercices: Exercice A4 (\u00e9nonc\u00e9, solution)<\/li>\n
                                                  • Vid\u00e9os \u00e0 voir: G.1 – while loop principles\u00a0(tr\u00e8s important!<\/strong>)<\/em>; vid\u00e9os G.2 et G.3 sont optionnelles
                                                    \n<\/em><\/li>\n
                                                  • Travail \u00e0 faire:\n
                                                      \n
                                                    • pr\u00e9parer devoir en classe<\/li>\n
                                                    • revoir la partie sur l’alternative (structure \/ conditions) !!<\/li>\n
                                                    • Exercice A4 est une tr\u00e8s<\/strong> bonne pr\u00e9paration!<\/li>\n
                                                    • traiter \/ voir la vid\u00e9o G.1<\/li>\n
                                                    • lire cours pages 41, 42 et 45 \u00e0 47<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                      07.02.2018<\/h1>\n
                                                        \n
                                                      • Mati\u00e8re: alternative (IF)<\/li>\n
                                                      • Cours pages: 33 \u00e0 40<\/li>\n
                                                      • Vid\u00e9os:\u00a0\u00a0F.1 \u2013\u00a0IF principles and comparison operators,\u00a0F.2 – logical operators,\u00a0F.3 – nested IF structures,\u00a0F.4 – Creation of a test class \u2013 leap year algorithm<\/li>\n
                                                      • Exercices: Exercice 17<\/li>\n
                                                      • Vid\u00e9os \u00e0 voir: \/<\/em><\/li>\n
                                                      • Travail \u00e0 faire:\n
                                                          \n
                                                        • terminer exercice 17<\/li>\n
                                                        • revoir la partie sur l’alternative (structure \/ conditions) !!<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                          31.01.2018<\/h1>\n
                                                            \n
                                                          • Mati\u00e8re: alternative (IF)<\/li>\n
                                                          • Cours pages: 33 \u00e0 40<\/li>\n
                                                          • Vid\u00e9os:\u00a0\u00a0F.1 \u2013\u00a0IF principles and comparison operators,\u00a0F.2 – logical operators,\u00a0F.3 – nested IF structures,\u00a0F.4 – Creation of a test class \u2013 leap year algorithm<\/li>\n
                                                          • Exercices: Exercice 15 (avec classe de test), Exercice 16<\/li>\n
                                                          • Vid\u00e9os \u00e0 voir: \/<\/em><\/li>\n
                                                          • Travail \u00e0 faire:\n
                                                              \n
                                                            • terminer exercice 16<\/li>\n
                                                            • revoir la partie sur l’alternative (structure \/ conditions)<\/li>\n<\/ul>\n<\/li>\n
                                                            • Note: la structure r\u00e9p\u00e9titive (while) sera trait\u00e9e ult\u00e9rieurement<\/em><\/li>\n<\/ul>\n

                                                              24.01.2018<\/h1>\n
                                                                \n
                                                              • Mati\u00e8re: alternative (IF)<\/li>\n
                                                              • Cours pages: 33 \u00e0 40<\/li>\n
                                                              • Vid\u00e9os:\u00a0\u00a0F.1 \u2013\u00a0IF principles and comparison operators,\u00a0F.2 – logical operators,\u00a0F.3 – nested IF structures,\u00a0F.4 – Creation of a test class \u2013 leap year algorithm<\/li>\n
                                                              • Exercices: Exercice A3 – d\u00e9but: pair\/impair (\u00e9nonc\u00e9, solution)<\/li>\n
                                                              • Vid\u00e9os \u00e0 voir: \u00a0G.1 – while loop principles\u00a0(tr\u00e8s important!<\/strong>)<\/em>,\u00a0G.2 – from NS diagrams to java code\u00a0(optionnel)<\/em>,\u00a0G.3 – Tableau d\u2019ex\u00e9cution\u00a0(optionnel)<\/em><\/li>\n
                                                              • Travail \u00e0 faire:\n
                                                                  \n
                                                                • terminer exercice A3<\/li>\n
                                                                • traiter vid\u00e9os G.1 (optionnels G2 et G.3)<\/li>\n
                                                                • lire cours pages 41, 42 et 45 \u00e0 47<\/li>\n
                                                                • optionnellement, faire exercice A2 (\u00e9nonc\u00e9, solution)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                                  17.01.2019<\/h1>\n
                                                                    \n
                                                                  • Mati\u00e8re: alternative (IF)<\/li>\n
                                                                  • Cours pages: 1 \u00e0 32<\/li>\n
                                                                  • Vid\u00e9os: F.1 \u2013\u00a0IF principles and comparison operators,\u00a0F.2 – logical operators,\u00a0F.3 – nested IF structures,\u00a0F.4 – Creation of a test class \u2013 leap year algorithm<\/li>\n
                                                                  • Exercices: Exercice A1 (\u00e9nonc\u00e9, solution avec classe de test)<\/li>\n
                                                                  • Vid\u00e9os \u00e0 voir: \/<\/em><\/li>\n
                                                                  • Travail \u00e0 faire:\n
                                                                      \n
                                                                    • terminer exercice A1<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                                      10.01.2019<\/h1>\n
                                                                        \n
                                                                      • Mati\u00e8re: alternative (IF)<\/li>\n
                                                                      • Cours pages: 1 \u00e0 32<\/li>\n
                                                                      • Vid\u00e9os: F.1 \u2013\u00a0IF principles and comparison operators,\u00a0F.2 – logical operators,\u00a0F.3 – nested IF structures,\u00a0F.4 – Creation of a test class \u2013 leap year algorithm<\/li>\n
                                                                      • Exercices: Exercice 13, Exercice 14 (version 1 – base, version 2, version 3)<\/li>\n
                                                                      • Vid\u00e9os \u00e0 voir: \/<\/li>\n
                                                                      • Travail \u00e0 faire:\n
                                                                          \n
                                                                        • terminer exercies<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                                          13.12.2018<\/h1>\n
                                                                            \n
                                                                          • Mati\u00e8re: Correction tr\u00e8s en d\u00e9tail du Devoir I-2<\/li>\n
                                                                          • Cours pages: 1 \u00e0 32<\/li>\n
                                                                          • Vid\u00e9os: F.1 \u2013\u00a0IF principles and comparison operators,\u00a0F.2 – logical operators,\u00a0F.3 – nested IF structures,\u00a0F.4 – Creation of a test class \u2013 leap year algorithm<\/li>\n
                                                                          • Exercices:\u00a0\/<\/li>\n
                                                                          • Vid\u00e9os \u00e0 voir: \/<\/li>\n
                                                                          • Travail \u00e0 faire:\n
                                                                              \n
                                                                            • revoir la partie sur l’alternative<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                                              06.12.2018<\/h1>\n
                                                                                \n
                                                                              • Devoir en classe I-2<\/li>\n
                                                                              • Mati\u00e8re \u00e0 revoir:\n
                                                                                  \n
                                                                                • classes, attributs, constructeur, getters\/setters, m\u00e9thodes, appels de m\u00e9thodes<\/li>\n
                                                                                • nombres al\u00e9atoires Math.random()<\/li>\n
                                                                                • alternative (IF)<\/li>\n
                                                                                • tous les exercices<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                                                  29.11.2018<\/h1>\n
                                                                                    \n
                                                                                  • Mati\u00e8re: alternative (IF)<\/li>\n
                                                                                  • Cours pages: 1 \u00e0 32<\/li>\n
                                                                                  • Vid\u00e9os: F.1 \u2013\u00a0IF principles and comparison operators,\u00a0F.2 – logical operators,\u00a0F.3 – nested IF structures,\u00a0F.4 – Creation of a test class \u2013 leap year algorithm<\/li>\n
                                                                                  • Exercices: Exercice 11, Exercice 12 (solutions: base, avec classe de test)<\/li>\n
                                                                                  • Vid\u00e9os \u00e0 voir: \/<\/li>\n
                                                                                  • Travail \u00e0 faire:\n
                                                                                      \n
                                                                                    • terminer Exercices 11 et 12<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                                                      \u00a022.11.2018<\/h1>\n
                                                                                        \n
                                                                                      • Mati\u00e8re: Math.random() + alternative (IF) + Test (20 points) – solution (GrpA, GrpB)<\/li>\n
                                                                                      • Cours pages: 33 \u00e0 40<\/li>\n
                                                                                      • Vid\u00e9os: F.1 \u2013\u00a0IF principles and comparison operators,\u00a0F.2 – logical operators,\u00a0F.3 – nested IF structures,\u00a0F.4 – Creation of a test class \u2013 leap year algorithm<\/li>\n
                                                                                      • Exercices:\u00a0 Exercice 10 (solutions: base, avanc\u00e9e sans IF, avanc\u00e9e avec IF)<\/li>\n
                                                                                      • Vid\u00e9os \u00e0 voir: \/<\/li>\n
                                                                                      • Travail \u00e0 faire:\n
                                                                                          \n
                                                                                        • terminer Exercice 10<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                                                          15.11.2018<\/h1>\n
                                                                                            \n
                                                                                          • Mati\u00e8re: Correction Test I-2 (solutions: GrpA, GrpB)<\/li>\n
                                                                                          • Cours pages: 1 \u00e0 32<\/li>\n
                                                                                          • Vid\u00e9os:\u00a0 \/<\/li>\n
                                                                                          • Exercices:\u00a0 \/<\/li>\n
                                                                                          • Vid\u00e9os \u00e0 voir:\u00a0 \u00a0F.1 \u2013\u00a0IF principles and comparison operators,\u00a0F.2 – logical operators,
                                                                                            \nF.3 – nested IF structures,\u00a0F.4 – Creation of a test class \u2013 leap year algorithm<\/li>\n
                                                                                          • Travail \u00e0 faire:\n
                                                                                              \n
                                                                                            • lire cours pages 31 et 35<\/li>\n
                                                                                            • traiter vid\u00e9os F.1 \u00e0 F.4<\/li>\n
                                                                                            • lire cours pages 36 \u00e0 40<\/li>\n
                                                                                            • revoir les principes d’un nombre al\u00e9atoire – Math.random()<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                                                              08.11.2018<\/h1>\n
                                                                                                \n
                                                                                              • Mati\u00e8re: Math.random() + Test (20 points)<\/li>\n
                                                                                              • Cours pages: 1 \u00e0 32<\/li>\n
                                                                                              • Vid\u00e9os:\u00a0 \/<\/li>\n
                                                                                              • Exercices:\u00a0 \/<\/li>\n
                                                                                              • Vid\u00e9os \u00e0 voir:\u00a0 \u00a0F.1 \u2013\u00a0IF principles and comparison operators,\u00a0F.2 – logical operators,
                                                                                                \nF.3 – nested IF structures,\u00a0F.4 – Creation of a test class \u2013 leap year algorithm<\/li>\n
                                                                                              • Travail \u00e0 faire:\n
                                                                                                  \n
                                                                                                • lire cours pages 31 et 32<\/li>\n
                                                                                                • traiter vid\u00e9os F.1 \u00e0 F.4<\/li>\n
                                                                                                • lire cours pages 36 \u00e0 40<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                                                                  25.10.2018<\/h1>\n
                                                                                                    \n
                                                                                                  • Mati\u00e8re: Exercices sur les variables et m\u00e9thodes<\/li>\n
                                                                                                  • Cours pages: 1 \u00e0 30<\/li>\n
                                                                                                  • Vid\u00e9os: C \u2013 Variables et D \u2013 M\u00e9thodes<\/li>\n
                                                                                                  • Exercices:\u00a0 Exercice 07,\u00a0Exercice 08 et Exercice 09<\/li>\n
                                                                                                  • Vid\u00e9os \u00e0 voir:\u00a0 \/<\/li>\n
                                                                                                  • Travail \u00e0 faire:\n
                                                                                                      \n
                                                                                                    • terminer exercices<\/li>\n
                                                                                                    • r\u00e9viser toute la mati\u00e8re trait\u00e9e jusqu\u2019ici<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                                                                      18.10.2018<\/h1>\n
                                                                                                        \n
                                                                                                      • Pas cours<\/li>\n
                                                                                                      • Travail \u00e0 faire:\n
                                                                                                          \n
                                                                                                        • r\u00e9viser toute la mati\u00e8re trait\u00e9e jusqu\u2019ici (vid\u00e9os, cours, exercices)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                                                                          11.10.2018<\/h1>\n
                                                                                                            \n
                                                                                                          • Mati\u00e8re: Exercices sur les variables et m\u00e9thodes<\/li>\n
                                                                                                          • Cours pages: 1 \u00e0 30<\/li>\n
                                                                                                          • Vid\u00e9os: C \u2013 Variables et D \u2013 M\u00e9thodes<\/li>\n
                                                                                                          • Exercices:\u00a0\u00a0Exercice 04 et Exercice 06<\/li>\n
                                                                                                          • Vid\u00e9os \u00e0 voir:\u00a0 \/<\/li>\n
                                                                                                          • Travail \u00e0 faire:\n
                                                                                                              \n
                                                                                                            • r\u00e9viser toute la mati\u00e8re trait\u00e9e jusqu\u2019ici<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                                                                              04.10.2018<\/h1>\n
                                                                                                                \n
                                                                                                              • Mati\u00e8re: Variables + Types<\/li>\n
                                                                                                              • Cours pages:\u00a0 24 \u00e0 28<\/li>\n
                                                                                                              • Vid\u00e9os:\u00a0 C \u2013 Variables<\/li>\n
                                                                                                              • Exercices:\u00a0 Exercice sur les types page 28<\/li>\n
                                                                                                              • Vid\u00e9os \u00e0 voir:\u00a0C.5 \u2013 swap,\u00a0D.1 \u2013 methods: introduction,\u00a0D.2 \u2013 methods: introduction revisited,
                                                                                                                \nD.3 \u2013 methods: special cases \u2013 getters, setters and constructors,
                                                                                                                \nD.4 \u2013 methods: scoping of variables (attributs, parameters and local variables)<\/li>\n
                                                                                                              • Travail \u00e0 faire:\n
                                                                                                                  \n
                                                                                                                • traiter vid\u00e9o C.5<\/li>\n
                                                                                                                • lire cours pages 29 et 30<\/li>\n
                                                                                                                • traiter vid\u00e9os D.1 \u00e0 D.4<\/li>\n
                                                                                                                • lire cours pages 17 \u00e0 23<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                                                                                  27.09.2017<\/h1>\n
                                                                                                                    \n
                                                                                                                  • Mati\u00e8re: Introduction Objets + Variables<\/li>\n
                                                                                                                  • Cours pages:\u00a0 \/<\/li>\n
                                                                                                                  • Vid\u00e9os:\u00a0 \/<\/li>\n
                                                                                                                  • Exercices:\u00a0 \/<\/li>\n
                                                                                                                  • Vid\u00e9os \u00e0 voir (pendant le cours<\/strong>): B.1 – classes and objects , B.2 – classes in Java \u2013 first look, B.3 – unimozer interface basics<\/li>\n
                                                                                                                  • Travail \u00e0 faire (pendant le cours<\/strong>):\n
                                                                                                                      \n
                                                                                                                    • traiter vid\u00e9os B.1 \u00e0 B.3<\/li>\n
                                                                                                                    • lire cours pages 1 \u00e0 9<\/li>\n
                                                                                                                    • programmer projet Ball-Vid\u00e9os (1er Projet)<\/li>\n
                                                                                                                    • lire cours pages 10 \u00e0 16<\/li>\n
                                                                                                                    • programmer projet Ball-Cours (2\u00e8me Projet)<\/li>\n<\/ul>\n<\/li>\n
                                                                                                                    • Vid\u00e9os \u00e0 voir (\u00e0 la maison<\/strong>):\u00a0C.1 – introduction to variables, C.2 – basic types and String, C.3 – operations and expressions, C.4 – type casting<\/li>\n
                                                                                                                    • Travail \u00e0 faire (\u00e0 la maison<\/strong>):\n
                                                                                                                        \n
                                                                                                                      • traiter vid\u00e9os C.1 \u00e0 C.4<\/li>\n
                                                                                                                      • lire cours pages 24 \u00e0 28<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n

                                                                                                                        20.09.2018<\/h1>\n
                                                                                                                          \n
                                                                                                                        • Mati\u00e8re: Pr\u00e9sentation et Introduction<\/li>\n
                                                                                                                        • Cours pages: \/<\/li>\n
                                                                                                                        • Vid\u00e9os:\u00a0 \/<\/li>\n
                                                                                                                        • Exercices:\u00a0 \/<\/li>\n
                                                                                                                        • Vid\u00e9os \u00e0 voir:\u00a0 A.1 – how to install Java JDK et A.2 – how to install unimozer<\/li>\n
                                                                                                                        • Travail \u00e0 faire:\n
                                                                                                                            \n
                                                                                                                          • faire une photo de \u00a0 javac\u00a0 -version<\/li>\n
                                                                                                                          • faire un screenshot de Unimozer<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"

                                                                                                                            Actuellement le cours de la 3GIG est dans le chapitre: Boucles imbriqu\u00e9es Les exercices ont \u00e9galement leur solution PDF (apr\u00e8s avoir \u00e9t\u00e9 trait\u00e9s). Toutes les vid\u00e9os sont ici… 27.06.2019 Mati\u00e8re: boucles imbriqu\u00e9es Cours pages: 1 – 47 Vid\u00e9os: \/ Exercices: Exercice 29 et 30 modifi\u00e9s (\u00e9nonc\u00e9s) – solutions: 29, 30 [ Exercice 26 modifi\u00e9 (\u00e9nonc\u00e9) […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"page-templates\/full-width.php","meta":{"footnotes":""},"class_list":["post-98","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/informatique.ltett.lu\/index.php?rest_route=\/wp\/v2\/pages\/98","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/informatique.ltett.lu\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/informatique.ltett.lu\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/informatique.ltett.lu\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/informatique.ltett.lu\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=98"}],"version-history":[{"count":375,"href":"https:\/\/informatique.ltett.lu\/index.php?rest_route=\/wp\/v2\/pages\/98\/revisions"}],"predecessor-version":[{"id":2372,"href":"https:\/\/informatique.ltett.lu\/index.php?rest_route=\/wp\/v2\/pages\/98\/revisions\/2372"}],"wp:attachment":[{"href":"https:\/\/informatique.ltett.lu\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=98"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}