{"id":20,"date":"2014-03-21T11:28:49","date_gmt":"2014-03-21T10:28:49","guid":{"rendered":"http:\/\/informatique.ltett.lu\/?page_id=20"},"modified":"2020-05-03T15:55:47","modified_gmt":"2020-05-03T14:55:47","slug":"videos-java-pour-la-3gig","status":"publish","type":"page","link":"https:\/\/informatique.ltett.lu\/?page_id=20","title":{"rendered":"Vid\u00e9os JAVA pour la 3GIG"},"content":{"rendered":"<p>Ici se trouvent les vid\u00e9os pour les cours de la 3GIG. Pour les vid\u00e9os de la 2GIG&#8230; <a href=\"http:\/\/informatique.ltett.lu\/?page_id=462\" target=\"_blank\" rel=\"noopener\">c&#8217;est par ici<\/a> et celles de la 1GIG&#8230; <a href=\"http:\/\/informatique.ltett.lu\/?page_id=770\">c&#8217;est par ici<\/a>!<\/p>\n<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PL3LseQBo6yAQYGQBZ8qzFHJZ25liqkaF7\">Playlist sur YouTube&#8230;<\/a><\/p>\n<p><em>A &#8211; Installation<\/em><\/p>\n<ul>\n<li>A.1 &#8211; video de la <a href=\"http:\/\/java.cnpi.lu\/download.php?id=526\">CNPI sur l&#8217;installation de Java version <em>AdoptOpenJDK 11<\/em> et <em>Unimozer<\/em><\/a><br \/>\n(allez voir sur <a href=\"http:\/\/java.cnpi.lu\">java.cnpi.lu<\/a> pour toutes les ressources!)<\/li>\n<\/ul>\n<p><em>B &#8211; Introduction<\/em><\/p>\n<ul>\n<li>B.1 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/KCi11ApTpLE\" target=\"_blank\" rel=\"noopener\">classes and objects<\/a><br \/>\npr\u00e9sentation de premiers concepts et mots-cl\u00e9 essentiels<\/li>\n<li>B.2 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/0IP899YzhPE\">classes in Java &#8211; first look<\/a><br \/>\nd\u00e9couvrir comment les classes se pr\u00e9sentent dans Java<\/li>\n<li>B.3 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/bJ9nRNJriyU?list=UUfuXyrDOB1H4vkhSPXTx2xA\" target=\"_blank\" rel=\"noopener\">unimozer interface basics<\/a><br \/>\npr\u00e9sentation rapide des \u00e9l\u00e9ments de base de l&#8217;outil unimozer<\/li>\n<\/ul>\n<p><em>C &#8211; Variables<\/em><\/p>\n<ul>\n<li>C.1 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/iAec-LQISD8\" target=\"_blank\" rel=\"noopener\">introduction to variables<\/a><br \/>\nintroduction aux variables avec des exemples d&#8217;erreurs fr\u00e9quentes<\/li>\n<li>C.2 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/p_jKaeHSso4\" target=\"_blank\" rel=\"noopener\">basic types and String<\/a><br \/>\ntypes de base et le type String<\/li>\n<li>C.3 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/qMAQ86I5XMg\" target=\"_blank\" rel=\"noopener\">operations and expressions<\/a><br \/>\nop\u00e9rations et expressions<\/li>\n<li>C.4 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/w-BS9n5rDCg\" target=\"_blank\" rel=\"noopener\">type casting<\/a><br \/>\nconversion de types<\/li>\n<li>C.5 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/rmNzrb1MOjc\" target=\"_blank\" rel=\"noopener\">swap<\/a><br \/>\nprogrammation de l&#8217;\u00e9change (<em>swap<\/em>) du contenu de deux variables<\/li>\n<\/ul>\n<p><em>D &#8211; M\u00e9thodes<\/em><\/p>\n<ul>\n<li>D.1 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/iWyYDaNJtbQ\" target=\"_blank\" rel=\"noopener\">methods: introduction<\/a><br \/>\nintroduction aux m\u00e9thodes des objets<\/li>\n<li>D.2 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/fdTgpAd64Fw\" target=\"_blank\" rel=\"noopener\">methods: introduction revisited<\/a><br \/>\nvue plus graphique des m\u00e9thodes<\/li>\n<li>D.3 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/p4E53-tkn3w\" target=\"_blank\" rel=\"noopener\">methods: special cases &#8211; getters, setters and constructors<\/a><br \/>\naccesseurs, modificateurs et constructeurs<\/li>\n<li>D.4 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/bDgJiNd366E\" target=\"_blank\" rel=\"noopener\">methods: scoping of variables (attributs, parameters and local variables)<\/a><br \/>\nvisibilit\u00e9s des variables (attributs, param\u00e8tres et variables locales)<\/li>\n<\/ul>\n<p><em>E &#8211; Structogrammes \/ diagrammes NSD<\/em><\/p>\n<ul>\n<li>E.1 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/E-EjqxzR9TY\">basic visual representation of code<\/a><br \/>\nrepr\u00e9sentation en NSD des \u00e9l\u00e9ments de base<\/li>\n<\/ul>\n<p><em>F &#8211; Structure alternative (<code>if<\/code>)<\/em><\/p>\n<ul>\n<li>F.1 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/1119oPe8FLU\" target=\"_blank\" rel=\"noopener\">IF principles and comparison operators<\/a><br \/>\npr\u00e9sentation de la structure alternative et des op\u00e9rateurs de comparaison<\/li>\n<li>F.2 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/jfCnPg5a6qg\" target=\"_blank\" rel=\"noopener\">logical operators<\/a><br \/>\nop\u00e9rateurs logiques<\/li>\n<li>F.3 &#8211;\u00a0<a href=\"https:\/\/youtu.be\/abOfW76RXg4\" target=\"_blank\" rel=\"noopener\">nested IF structures<\/a><br \/>\nstructures alternatives imbriqu\u00e9es<\/li>\n<li>F.4 &#8211;\u00a0<a href=\"https:\/\/www.youtube.com\/watch?v=69tU2jn96xQ\">creation of a test class &#8211; leap year algorithm<\/a><a href=\"https:\/\/www.youtube.com\/watch?v=c5fZvukfyHs\"><br \/>\n<\/a>comment utiliser une classe de test afin de v\u00e9rifier si le code est correct; utilisation du <em>new<\/em>; application \u00e0 l&#8217;algorithme de l&#8217;ann\u00e9e bissextile<\/li>\n<\/ul>\n<p><em>G &#8211; Structure r\u00e9p\u00e9titive (<code>while<\/code>)<\/em><\/p>\n<ul>\n<li>G.1 &#8211;\u00a0<a href=\"https:\/\/www.youtube.com\/watch?v=TQIywj2eA1A\">while loop principles<br \/>\n<\/a>pr\u00e9sentation des principes de base de la boucle <em>tant que<\/em><\/li>\n<li>G.2 &#8211;\u00a0<a href=\"https:\/\/www.youtube.com\/watch?v=c5fZvukfyHs\">from NS diagrams to java code<br \/>\n<\/a>comment traduire un algorithme d\u00e9crit par un structogramme en JAVA<\/li>\n<li>G.3 &#8211;\u00a0<a href=\"https:\/\/www.youtube.com\/watch?v=9as1OFyymDs\">Tableau d&#8217;ex\u00e9cution<br \/>\n<\/a>comment simuler l&#8217;ex\u00e9cution d&#8217;un programme en notant tous les contenus des variables et des expressions<\/li>\n<\/ul>\n<p><em>H &#8211; Algorithmes de base (<code>while<\/code>)<\/em><\/p>\n<ul>\n<li>H.1 &#8211;\u00a0<a href=\"https:\/\/www.youtube.com\/watch?v=Bkxob9nSUZU\">while loop &#8211; standard algos &#8211; part 1\/3: calculateSum()<br \/>\n<\/a>construction de l&#8217;algorithme pour calculer la somme de <em>n<\/em> nombres avec une boucle <em>tant que<\/em><\/li>\n<li>H.2 &#8211; <a href=\"https:\/\/www.youtube.com\/watch?v=TV1_U2b6-8Y\">while loop &#8211; standard algos &#8211; part 2\/3: non integer counter<br \/>\n<\/a>construction d&#8217;une boucle <em>tant que<\/em> qui compte avec des nombres d\u00e9cimaux<\/li>\n<li>H.3 &#8211; <a href=\"https:\/\/www.youtube.com\/watch?v=5DMiovpz5wA\">while loop &#8211; standard algos &#8211; part 3\/3: calculatePower()<br \/>\n<\/a>construction de l&#8217;algorithme pour calculer la puissance de deux nombres avec une boucle <em>tant que<\/em><\/li>\n<\/ul>\n<p><em>I &#8211; Structure r\u00e9p\u00e9titive (<code>for<\/code>)<\/em><\/p>\n<ul>\n<li>I.1 &#8211; <a href=\"https:\/\/www.youtube.com\/watch?v=B1mnYNjXRmw\">for loop<br \/>\n<\/a>pr\u00e9sentation de la boucle<em> for<\/em> utilis\u00e9e uniquement comme compteur d&#8217;entiers<\/li>\n<\/ul>\n<p><em>J &#8211; Algorithmes avanc\u00e9s<\/em><\/p>\n<ul>\n<li>J.1 &#8211; <a href=\"https:\/\/www.youtube.com\/watch?v=ImljBENqp4M\">GCD &#8211; search algorithm<br \/>\n<\/a>calculer le PGCD en utilisant l&#8217;algorithme par recherche<\/li>\n<li>J.2 &#8211; <a href=\"https:\/\/www.youtube.com\/watch?v=DP8B3K8O66s\">LCM &#8211; search algorithm<br \/>\n<\/a>calculer le PPCM en utilisant l&#8217;algorithme par recherche<\/li>\n<li>J.3 &#8211; <a href=\"https:\/\/www.youtube.com\/watch?v=Gze_HDpP4oQ\">GCD &#8211; Euclid algorithm<br \/>\n<\/a>calculer le PGCD en utilisant l&#8217;algorithme d&#8217;Euclide (version de base et optimis\u00e9e)<\/li>\n<li>J.4 &#8211; <a href=\"https:\/\/www.youtube.com\/watch?v=_YP1Np9pBUk\">find highest and lowest numbers in a range of numbers<br \/>\n<\/a>d\u00e9terminer le nombre le plus \u00e9lev\u00e9 et le plus bas de plusieurs nombres<\/li>\n<li>J.5 &#8211; <a href=\"https:\/\/youtu.be\/2VSB03Qs4S4\">prime numbers &#8211; easiest algorithm<\/a><br \/>\nprogrammer l&#8217;algorithme du nombre premier en partant de sa d\u00e9finition<\/li>\n<li>J.6 &#8211; <a href=\"https:\/\/youtu.be\/q0FaYIaWqCE\" target=\"_blank\" rel=\"noopener\">prime numbers &#8211; optimized algorithm<\/a><br \/>\nprogrammer un meilleur algorithme du nombre premier<\/li>\n<\/ul>\n<p><em>K &#8211; Manipulations complexes d&#8217;objets<\/em><\/p>\n<ul>\n<li>K.1 &#8211; <a href=\"https:\/\/youtu.be\/QVWqEo_rIgg\">classes as types<\/a><br \/>\nutiliser des classes comme des types et comment manipuler des objets dans un programme multi-classes. T\u00e9l\u00e9charger le <a href=\"https:\/\/informatique.ltett.lu\/wp-content\/uploads\/2015\/06\/race_simulation.zip\">projet java<\/a><\/li>\n<li>K.2 &#8211; <a href=\"https:\/\/youtu.be\/_Zdsh67npjo\" target=\"_blank\" rel=\"noopener\">interactions between objects part 1\/3<\/a><br \/>\nprogrammer une simple interaction entre objets, bataille navale, partie 1 sur 3<\/li>\n<li>K.3 &#8211; <a href=\"https:\/\/youtu.be\/ZhmB44DHyTI\" target=\"_blank\" rel=\"noopener\">interactions between objects part 2\/3<\/a><br \/>\nprogrammer une simple interaction entre objets, bataille navale, partie 2 sur 3<\/li>\n<li>K.4 &#8211; <a href=\" https:\/\/youtu.be\/zfOPoviZl2M\" target=\"_blank\" rel=\"noopener\">interactions between objects part 3\/3<br \/>\n<\/a>programmer une simple interaction entre objets, bataille navale, partie 3 sur 3<\/li>\n<li>K.5 &#8211; <a href=\"https:\/\/youtu.be\/GJgvcjOmPtI\" target=\"_blank\" rel=\"noopener\">DoubleDice Game<\/a><br \/>\nprogrammer un jeu de d\u00e9s. Nouvelle illustration d&#8217;une interactions entre objets<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Ici se trouvent les vid\u00e9os pour les cours de la 3GIG. Pour les vid\u00e9os de la 2GIG&#8230; c&#8217;est par ici et celles de la 1GIG&#8230; c&#8217;est par ici! Playlist sur YouTube&#8230; A &#8211; Installation A.1 &#8211; video de la CNPI sur l&#8217;installation de Java version AdoptOpenJDK 11 et Unimozer (allez voir sur java.cnpi.lu pour toutes [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-20","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/informatique.ltett.lu\/index.php?rest_route=\/wp\/v2\/pages\/20","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=20"}],"version-history":[{"count":84,"href":"https:\/\/informatique.ltett.lu\/index.php?rest_route=\/wp\/v2\/pages\/20\/revisions"}],"predecessor-version":[{"id":1613,"href":"https:\/\/informatique.ltett.lu\/index.php?rest_route=\/wp\/v2\/pages\/20\/revisions\/1613"}],"wp:attachment":[{"href":"https:\/\/informatique.ltett.lu\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=20"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}