Skip to content
Snippets Groups Projects

Compare revisions

Changes are shown as if the source revision was being merged into the target revision. Learn more about comparing revisions.

Source

Select target project
No results found

Target

Select target project
  • alexis.durgnat/homepage
  • orestis.malaspin/homepage
2 results
Show changes
Hide whitespace changes
Inline Side-by-side
hakyll-bootstrap/templates/nav.html deleted 100644 → 0
View file @ b103362d
<div class="navbar-wrapper">
<div class="container">
<div class="navbar navbar-inverse navbar-static-top" role="navigation">
<div class="container">
<div class="navbar-header">
<button type="button" class="navbar-toggle" data-toggle="collapse" data-target=".navbar-collapse">
<span class="sr-only">Toggle navigation</span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
</button>
<a class="navbar-brand" href="/index.html">Orestis Malaspinas</a>
</div>
<div class="navbar-collapse collapse">
<ul class="nav navbar-nav">
<li><a href="/index.html">Home</a></li>
<li class="dropdown">
<a href="#" class="dropdown-toggle" data-toggle="dropdown"> Classes <b class="caret"></b></a>
<ul class="dropdown-menu">
<li><a href="/phys_app.html">Physique appliquée</a></li>
<li><a href="/math_tech_info.html">Mathématiques en technologie de l'information</a></li>
<li><a href="/prog_seq.html">Programmation séquentielle en C</a></li>
<li class="divider"></li>
<li class="dropdown-header">Archived</li>
<li><a href="#">Sciences orientation logicielle</a></li>
<li><a href="#">Programmation séquentielle en Rust</a></li>
<li><a href="/prog_conc.html">Programmation concurrente</a></li>
</ul>
<li><a href="/research_projects.html">Research projects</a></li>
<li><a href="/bachelor_projects.html">Bachelor projects</a></li>
<li><a href="/pages/team.html">Team</a></li>
<li><a href="/pages/contact.html">Contact </a></li>
</li>
</ul>
</div>
</div>
</div>
</div>
</div>
hakyll-bootstrap/templates/page.html deleted 100644 → 0
View file @ b103362d
<!DOCTYPE HTML>
<html lang="en">
<head>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<meta name="description" content="">
<meta name="author" content="">
<title>$title$</title>
<link href="/css/bootstrap.css" rel="stylesheet">
<link href="/css/syntax.css" rel="stylesheet">
<link href="/css/carousel.css" rel="stylesheet">
<link href='http://fonts.googleapis.com/css?family=Open+Sans' rel='stylesheet' type='text/css'>
<style>
body {
font-family: 'Open Sans', sans-serif;
}
body { margin-top: 80px; }
footer { margin-top: 80px; }
</style>
</head>
<body>
$partial("templates/nav.html")$
<div class="container">
$body$
$partial("templates/footer.html")$
</div>
<script src="/js/jquery.js"></script>
<script src="/js/bootstrap.js"></script>
<script src="/js/holder.js"></script>
</body>
</html>
hakyll-bootstrap/templates/post.html deleted 100644 → 0
View file @ b103362d
<!DOCTYPE HTML>
<html lang="en">
<head>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<meta name="description" content=$title$>
<meta name="author" content="">
<title>$title$</title>
<link href="/css/bootstrap.css" rel="stylesheet">
<link href="/css/syntax.css" rel="stylesheet">
<link href="/css/carousel.css" rel="stylesheet">
<link href="/css/prism.css" rel="stylesheet">
<!-- <link href='http://fonts.googleapis.com/css?family=Open+Sans' rel='stylesheet' type='text/css'> -->
$mathjax$
<style>
body {
font-family: 'Open Sans', sans-serif;
}
body { margin-top: 80px; }
</style>
</head>
<body>
$partial("templates/nav.html")$
<div class="container">
<h1>$title$</h1>
$body$
$partial("templates/footer.html")$
</div>
</div><!-- /.container -->
<script src="/js/prism.js"></script>
<script src="/js/jquery.js"></script>
<script src="/js/bootstrap.js"></script>
<script src="/js/holder.js"></script>
</body>
</html>
hakyll-bootstrap/templates/reveal.html deleted 100644 → 0
View file @ b103362d
<!DOCTYPE html>
<html$if(lang)$ lang="$lang$"$endif$$if(dir)$ dir="$dir$"$endif$>
<head>
<meta charset="utf-8">
<meta name="generator" content="pandoc">
$if(keywords)$
<meta name="keywords" content="$for(keywords)$$keywords$$sep$, $endfor$">
$endif$
<title>$if(title-prefix)$$title-prefix$ – $endif$$if(pagetitle)$$pagetitle$$endif$</title>
<meta name="apple-mobile-web-app-capable" content="yes">
<meta name="apple-mobile-web-app-status-bar-style" content="black-translucent">
<meta name="viewport" content="width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=no, minimal-ui">
<link rel="stylesheet" href="$revealjs-url$/dist/reset.css">
<link rel="stylesheet" href="$revealjs-url$/dist/reveal.css">
<link href="/css/bootstrap.css" rel="stylesheet">
<link href="/css/syntax.css" rel="stylesheet">
<link href="/css/carousel.css" rel="stylesheet">
<link href="/css/prism.css" rel="stylesheet">
$if(theme)$
<link rel="stylesheet" href="$revealjs-url$/dist/theme/$theme$.css" id="theme">
$else$
<link rel="stylesheet" href="$revealjs-url$/dist/theme/white.css" id="theme">
$endif$
$if(math)$
$math$
$endif$
$if(header-includes)$
$for(header-includes)$
$header-includes$
$endfor$
$endif$
<style>
body {
font-family: 'Open Sans', sans-serif;
}
body { margin-top: 80px; }
</style>
<!-- $if(title)$
<h1 class="title">$title$</h1>
$if(subtitle)$
<p class="subtitle">$subtitle$</p>
$endif$
$if(author)$
<p class="author">$author$</p>
$endif$
$if(date)$
<p class="date">$date$</p>
$endif$ -->
</head>
<body>
$partial("templates/nav.html")$
$if(include-before)$
$for(include-before)$
$include-before$
$endfor$
$endif$
<div class="reveal">
<div class="slides">
</section>
$endif$
$if(toc)$
<section id="$idprefix$TOC">
$table-of-contents$
</section>
$endif$
$body$
</div>
</div>
<script src="$revealjs-url$/dist/reveal.js"></script>
<script src="$revealjs-url$/plugin/notes/notes.js"></script>
<script src="$revealjs-url$/plugin/search/search.js"></script>
<script src="$revealjs-url$/plugin/zoom/zoom.js"></script>
$if(mathjax)$
<script src="$revealjs-url$/plugin/math/math.js"></script>
$endif$
<script>
// Full list of configuration options available at:
// https://revealjs.com/config/
Reveal.initialize({
$if(controls)$
// Display controls in the bottom right corner
controls: $controls$,
$endif$
$if(controlsTutorial)$
// Help the user learn the controls by providing hints, for example by
// bouncing the down arrow when they first encounter a vertical slide
controlsTutorial: $controlsTutorial$,
$endif$
$if(controlsLayout)$
// Determines where controls appear, "edges" or "bottom-right"
controlsLayout: $controlsLayout$,
$endif$
$if(controlsBackArrows)$
// Visibility rule for backwards navigation arrows; "faded", "hidden"
// or "visible"
controlsBackArrows: $controlsBackArrows$,
$endif$
$if(progress)$
// Display a presentation progress bar
progress: $progress$,
$endif$
$if(slideNumber)$
// Display the page number of the current slide
slideNumber: $slideNumber$,
$endif$
$if(hash)$
// Add the current slide number to the URL hash so that reloading the
// page/copying the URL will return you to the same slide
hash: $hash$,
$endif$
// Push each slide change to the browser history
$if(history)$
history: $history$,
$else$
history: true,
$endif$
$if(keyboard)$
// Enable keyboard shortcuts for navigation
keyboard: $keyboard$,
$endif$
$if(overview)$
// Enable the slide overview mode
overview: $overview$,
$endif$
$if(center)$
// Vertical centering of slides
center: true,
$endif$
$if(touch)$
// Enables touch navigation on devices with touch input
touch: $touch$,
$endif$
$if(loop)$
// Loop the presentation
loop: $loop$,
$endif$
$if(rtl)$
// Change the presentation direction to be RTL
rtl: $rtl$,
$endif$
$if(navigationMode)$
// see https://revealjs.com/vertical-slides/#navigation-mode
navigationMode: '$navigationMode$',
$endif$
$if(shuffle)$
// Randomizes the order of slides each time the presentation loads
shuffle: $shuffle$,
$endif$
$if(fragments)$
// Turns fragments on and off globally
fragments: $fragments$,
$endif$
$if(fragmentInURL)$
// Flags whether to include the current fragment in the URL,
// so that reloading brings you to the same fragment position
fragmentInURL: $fragmentInURL$,
$endif$
$if(embedded)$
// Flags if the presentation is running in an embedded mode,
// i.e. contained within a limited portion of the screen
embedded: $embedded$,
$endif$
$if(help)$
// Flags if we should show a help overlay when the questionmark
// key is pressed
help: $help$,
$endif$
$if(showNotes)$
// Flags if speaker notes should be visible to all viewers
showNotes: $showNotes$,
$endif$
$if(autoPlayMedia)$
// Global override for autoplaying embedded media (video/audio/iframe)
// - null: Media will only autoplay if data-autoplay is present
// - true: All media will autoplay, regardless of individual setting
// - false: No media will autoplay, regardless of individual setting
autoPlayMedia: $autoPlayMedia$,
$endif$
$if(preloadIframes)$
// Global override for preloading lazy-loaded iframes
// - null: Iframes with data-src AND data-preload will be loaded when within
// the viewDistance, iframes with only data-src will be loaded when visible
// - true: All iframes with data-src will be loaded when within the viewDistance
// - false: All iframes with data-src will be loaded only when visible
preloadIframes: $preloadIframes$,
$endif$
$if(autoSlide)$
// Number of milliseconds between automatically proceeding to the
// next slide, disabled when set to 0, this value can be overwritten
// by using a data-autoslide attribute on your slides
autoSlide: $autoSlide$,
$endif$
$if(autoSlideStoppable)$
// Stop auto-sliding after user input
autoSlideStoppable: $autoSlideStoppable$,
$endif$
$if(autoSlideMethod)$
// Use this method for navigation when auto-sliding
autoSlideMethod: $autoSlideMethod$,
$endif$
$if(defaultTiming)$
// Specify the average time in seconds that you think you will spend
// presenting each slide. This is used to show a pacing timer in the
// speaker view
defaultTiming: $defaultTiming$,
$endif$
$if(totalTime)$
// Specify the total time in seconds that is available to
// present. If this is set to a nonzero value, the pacing
// timer will work out the time available for each slide,
// instead of using the defaultTiming value
totalTime: $totalTime$,
$endif$
$if(minimumTimePerSlide)$
// Specify the minimum amount of time you want to allot to
// each slide, if using the totalTime calculation method. If
// the automated time allocation causes slide pacing to fall
// below this threshold, then you will see an alert in the
// speaker notes window
minimumTimePerSlide: $minimumTimePerSlide$,
$endif$
$if(mouseWheel)$
// Enable slide navigation via mouse wheel
mouseWheel: $mouseWheel$,
$endif$
$if(rollingLinks)$
// Apply a 3D roll to links on hover
rollingLinks: $rollingLinks$,
$endif$
$if(hideInactiveCursor)$
// Hide cursor if inactive
hideInactiveCursor: $hideInactiveCursor$,
$endif$
$if(hideCursorTime)$
// Time before the cursor is hidden (in ms)
hideCursorTime: $hideCursorTime$,
$endif$
$if(hideAddressBar)$
// Hides the address bar on mobile devices
hideAddressBar: $hideAddressBar$,
$endif$
$if(previewLinks)$
// Opens links in an iframe preview overlay
previewLinks: $previewLinks$,
$endif$
$if(transition)$
// Transition style
transition: '$transition$', // none/fade/slide/convex/concave/zoom
$endif$
$if(transitionSpeed)$
// Transition speed
transitionSpeed: '$transitionSpeed$', // default/fast/slow
$endif$
$if(backgroundTransition)$
// Transition style for full page slide backgrounds
backgroundTransition: '$backgroundTransition$', // none/fade/slide/convex/concave/zoom
$endif$
$if(viewDistance)$
// Number of slides away from the current that are visible
viewDistance: $viewDistance$,
$endif$
$if(mobileViewDistance)$
// Number of slides away from the current that are visible on mobile
// devices. It is advisable to set this to a lower number than
// viewDistance in order to save resources.
mobileViewDistance: $mobileViewDistance$,
$endif$
$if(parallaxBackgroundImage)$
// Parallax background image
parallaxBackgroundImage: '$parallaxBackgroundImage$', // e.g. "'https://s3.amazonaws.com/hakim-static/reveal-js/reveal-parallax-1.jpg'"
$else$
$if(background-image)$
// Parallax background image
parallaxBackgroundImage: '$background-image$', // e.g. "'https://s3.amazonaws.com/hakim-static/reveal-js/reveal-parallax-1.jpg'"
$endif$
$endif$
$if(parallaxBackgroundSize)$
// Parallax background size
parallaxBackgroundSize: '$parallaxBackgroundSize$', // CSS syntax, e.g. "2100px 900px"
$endif$
$if(parallaxBackgroundHorizontal)$
// Amount to move parallax background (horizontal and vertical) on slide change
// Number, e.g. 100
parallaxBackgroundHorizontal: $parallaxBackgroundHorizontal$,
$endif$
$if(parallaxBackgroundVertical)$
parallaxBackgroundVertical: $parallaxBackgroundVertical$,
$endif$
$if(width)$
// The "normal" size of the presentation, aspect ratio will be preserved
// when the presentation is scaled to fit different resolutions. Can be
// specified using percentage units.
width: $width$,
$endif$
$if(height)$
height: $height$,
$endif$
$if(margin)$
// Factor of the display size that should remain empty around the content
margin: $margin$,
$endif$
$if(minScale)$
// Bounds for smallest/largest possible scale to apply to content
minScale: $minScale$,
$endif$
$if(maxScale)$
maxScale: $maxScale$,
$endif$
$if(zoomKey)$
// Modifier key used to click-zoom to part of the slide
zoomKey: '$zoomKey$',
$endif$
$if(display)$
// The display mode that will be used to show slides
display: $display$,
$endif$
$if(mathjax)$
math: {
mathjax: '$mathjaxurl$',
config: 'TeX-AMS_HTML-full',
tex2jax: {
inlineMath: [['\\(','\\)']],
displayMath: [['\\[','\\]']],
balanceBraces: true,
processEscapes: false,
processRefs: true,
processEnvironments: true,
preview: 'TeX',
skipTags: ['script','noscript','style','textarea','pre','code'],
ignoreClass: 'tex2jax_ignore',
processClass: 'tex2jax_process'
},
},
$endif$
// reveal.js plugins
plugins: [
$if(mathjax)$
RevealMath,
$endif$
RevealNotes,
RevealSearch,
RevealZoom
]
});
</script>
$if(include-after)$
$for(include-after)$
$include-after$
$endfor$
$endif$
<script src="/js/prism.js"></script>
<script src="/js/jquery.js"></script>
<script src="/js/bootstrap.js"></script>
<script src="/js/holder.js"></script>
</body>
</html>
index.md
View file @ 18092c20
---
author:
- Orestis Malaspinas
- Orestis Malaspinas, bureau A401, ISC, HEPIA
title: Quelques cours de la filière ISC de hepia
autoSectionLabels: true
autoEqnLabels: true
......@@ -15,100 +15,143 @@ lang: fr
documentclass: book
papersize: A4
cref: false
pandoc-numbering:
- category: exercice
listing: Liste des exercices
urlcolor: blue
corrige: false
---
<div align="left">
<div align="center">
<video width="640" poster="figs/intro.svg" height="360" controls="true" autoplay="false">
<source src="videos/malaspinas.mp4" type="video/mp4">
</video>
<iframe poster="figs/intro.svg" title="omhepia's player frame" src="https://player.twitch.tv/?channel=omhepia&parent=malaspinas.academy" frameborder="0" allowfullscreen="true" scrolling="no" height="360" width="590">
</iframe>
<!-- <iframe
id="chat_embed"
src="https://www.twitch.tv/embed/omhepia/chat?parent=malaspinas.academy"
height="360"
width="252">
</iframe> -->
</div>
La chaîne *twitch* de mes cours se trouve sur <https://www.twitch.tv/omhepia>
:::::::::::::: {.columns}
::: {.column width="40%"}
# Première année
# Prog. séquentielle en C
<!-- Chaîne *BBB* du cours <https://bbb.hesge.ch/rooms/wkm-a1q-7d1-rjb/join> -->
# Cours de programmation séquentielle en C
## Bibliographie
## [Récapitulatif](prog_seq_c_cours/index.html)
* Débutants: [E. Barthomier, D. Schang, Le C en 20 heures](https://c.developpez.com/cours/20-heures/)
* Moyens: [J. Gustedt, Modern C](https://hal.inria.fr/hal-02383654/document)
---
## Introduction [PDF](prog_seq_c_cours/intro.pdf), [git repo](https://gitedu.hesge.ch/programmation_sequentielle/cours)
## [Théorie](https://malaspinas.academy/prog_seq_c_cours/index.html)
## Introduction à l'interface en ligne de commande [PDF](prog_seq_c_cours/command_line.pdf), [git repo](https://gitedu.hesge.ch/programmation_sequentielle/cours)
## [Tutoriel git](https://malaspinas.academy/git_tuto/git_tutorial.pdf)
<!-- ## Théorie
### Introduction [PDF](prog_seq_c_cours/intro.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/cours) -->
---
## Base 1 [PDF](prog_seq_c_cours/base_1.pdf), [git repo](https://gitedu.hesge.ch/programmation_sequentielle/cours)
## Exercices
## Base 2 [PDF](prog_seq_c_cours/base_2.pdf), [git repo](https://gitedu.hesge.ch/programmation_sequentielle/cours)
<!-- ### 02.06.2023: Plus court chemin, [HTML](https://malaspinas.academy/prog_seq_c_tp/shortest_path/graphes.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/shortest_path/graphes.pdf), [MAIN](https://malaspinas.academy/prog_seq_c_tp/shortest_path/squelette/c/main_dijkstra.c), [XML_PARSER_H](https://malaspinas.academy/prog_seq_c_tp/shortest_path/xml_parser.h), [XML_PARSER_C](https://malaspinas.academy/prog_seq_c_tp/shortest_path/xml_parser.c), [TEST_INPUT](https://malaspinas.academy/prog_seq_c_tp/shortest_path/squelette/commandes_de_test/cmd_a_tester_dijkstra.txt), [TEST_OUTPUT](https://malaspinas.academy/prog_seq_c_tp/shortest_path/squelette/results_out/output_dijkstra), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/shortest_path/enonce)
## Base 3 [PDF](prog_seq_c_cours/base_3.pdf), [git repo](https://gitedu.hesge.ch/programmation_sequentielle/cours)
### 23.05.2023: Barbes euh... B-arbres, [HTML](https://malaspinas.academy/prog_seq_c_tp/b_arbres/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/b_arbres/b_arbres.pdf), [HEADER](https://malaspinas.academy/prog_seq_c_tp/b_arbres/b_arbre.h), [SQUELETTE](https://malaspinas.academy/prog_seq_c_tp/b_arbres/b_arbre_skel.c), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/b_arbres/enonce)
## Base 4 [PDF](prog_seq_c_cours/base_4.pdf), [git repo](https://gitedu.hesge.ch/programmation_sequentielle/cours)
### 16.05.2023: Classification, [HTML](https://malaspinas.academy/prog_seq_c_tp/classification/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/classification/classification.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/classification/enonce)
## Base 5 [PDF](prog_seq_c_cours/base_5.pdf), [git repo](https://gitedu.hesge.ch/programmation_sequentielle/cours)
### 02.05.2023: Arbres quaternaires, [HTML](https://malaspinas.academy/prog_seq_c_tp/quadtree/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/quadtree/quadtree.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/quadtree/enonce), [BUZZ](https://malaspinas.academy/prog_seq_c_tp/quadtree/buzz.pgm)
## Base 6 [PDF](prog_seq_c_cours/base_6.pdf), [git repo](https://gitedu.hesge.ch/programmation_sequentielle/cours)
### 18.04.2023: Julia, [HTML](https://malaspinas.academy/prog_seq_c_tp/julia/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/julia/julia.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/julia/enonce)
## Tutoriel git [PDF](git_tuto/git_tutorial.pdf), .gitignore [PDF](git_tuto/git_tutorial_gitignore.pdf), [git repo](https://gitedu.hesge.ch/orestis.malaspin/git_tutorial)
### 28.03.2023: Arbres AVL, [HTML](https://malaspinas.academy/prog_seq_c_tp/arbres_avl/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/arbres_avl/arbres_avl.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/arbres_avl/enonce)
<!-- ## Intro à `make` [PDF](prog_seq_c_cours/make.pdf)
### 21.03.2023: Tris, [HTML](https://malaspinas.academy/prog_seq_c_tp/tris/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/tris/tris.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/tris/enonce)
## Tests unitaires et assertions [PDF](prog_seq_c_cours/tests_assertions.pdf)
### 14.03.2023: Code morse, [HTML](https://malaspinas.academy/prog_seq_c_tp/morse/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/morse/code_morse.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/code_morse/enonce), [texte-morse.txt](https://malaspinas.academy/prog_seq_c_tp/morse/texte-morse.txt), [code-morse.txt](https://malaspinas.academy/prog_seq_c_tp/morse/code-morse.txt)
## Chaînes de caractères [PDF](prog_seq_c_cours/strings.pdf)
### 28.02.2023: Table de hachage, [HTML](https://malaspinas.academy/prog_seq_c_tp/hashmap/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/hashmap/hashmap.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/hashmap/enonce), [students.txt](https://malaspinas.academy/prog_seq_c_tp/hashmap/students.txt)
## La ligne de commande [PDF](prog_seq_c_cours/ligne_commande.pdf)
### 21.02.2023: Doubles pointeurs, [HTML](https://malaspinas.academy/prog_seq_c_tp/doubles_pointeurs/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/doubles_pointeurs/doubles_pointeurs.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/doubles_pointeurs/enonce)
## Les pointeurs avancés [PDF](prog_seq_c_cours/pointeurs_avances.pdf) -->
### 10.01.2023: Jeu du serpent, [HTML](https://malaspinas.academy/prog_seq_c_tp/serpent/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/serpent/serpent.pdf), [GFX](https://malaspinas.academy/prog_seq_c_tp/serpent/gfx.tar), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/serpent/enonce)
# Exercices de programmation séquentielle en C
### 28.11.2022: Puissance 4, [HTML](https://malaspinas.academy/prog_seq_c_tp/puissance4/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/puissance4/puissance4.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/puissance4/enonce), [Skeleton](https://malaspinas.academy/prog_seq_c_tp/puissance4/skeleton_for_students.tar.gz)
## Le nombre secret, [HTML](prog_seq_c_tp/nombre_secret/index.html), [PDF](prog_seq_c_tp/nombre_secret/nombre_secret.pdf), [corrigé](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/nombre_secret/corrige)
### 20.09.2022: Calendrier, [HTML](https://malaspinas.academy/prog_seq_c_tp/calendar/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/calendar/calendar.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/calendar/enonce) -->
## La méthode de la bissection, [HTML](prog_seq_c_tp/bissection/index.html), [PDF](prog_seq_c_tp/bissection/bissection.pdf)
<!-- ### 14.12.2023: Traitement d'image, [HTML](https://malaspinas.academy/prog_seq_c_tp/traitement_dimages/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/traitement_dimages/traitement_dimages.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/traitement_dimages/enonce) -->
<!---->
## Les fractions, [HTML](prog_seq_c_tp/fractions/index.html), [PDF](prog_seq_c_tp/fractions/fractions.pdf)
### 07.01.2025: La liste doublement chaînée, [HTML](https://malaspinas.academy/prog_seq_c_tp/doubly_linked_list/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/doubly_linked_list/doubly_linked_list.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/doubly_linked_list/enonce)
## Tableaux unidimensionnels, [HTML](prog_seq_c_tp/tableaux_unidimensionnels/index.html), [PDF](prog_seq_c_tp/tableaux_unidimensionnels/tableaux_unidimensionnels.pdf), [GFX](prog_seq_c_tp/tableaux_unidimensionnels/gfx_example.tar)
### 17.12.2024: Le serpent, [HTML](https://malaspinas.academy/prog_seq_c_tp/serpent/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/serpent/serpent.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/serpent/enonce), [GFX](https://malaspinas.academy/prog_seq_c_tp/serpent/gfx.tar)
## Allocation dynamique de mémoire, [HTML](prog_seq_c_tp/memoire_frac_tab/index.html), [PDF](prog_seq_c_tp/memoire_frac_tab/memoire_frac_tab.pdf)
### 10.12.2024: La calculatrice, [HTML](https://malaspinas.academy/prog_seq_c_tp/calculator/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/calculator/calculator.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/calculator/enonce)
## Matrices, [HTML](prog_seq_c_tp/matrices/index.html), [PDF](prog_seq_c_tp/matrices/matrices.pdf)
### 03.12.2024: Matrices, [HTML](https://malaspinas.academy/prog_seq_c_tp/matrices/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/matrices/matrices.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/matrices/enonce)
# Cours de physique appliquée
### 26.11.2024: Chaînes de caractères, [HTML](https://malaspinas.academy/prog_seq_c_tp/chaines_caracteres/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/chaines_caracteres/chaines_caracteres.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/chaines_caracteres/enonce)
## [Polycopié](phys/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/isc_physics), [pdf](phys/cours.pdf)
### 19.11.2024: Makefiles et compilation séparée, [HTML](https://malaspinas.academy/prog_seq_c_tp/makefiles/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/makefiles/makefiles.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/makefiles/enonce)
<!---->
### 05.11.2024: Démineur, [HTML](https://malaspinas.academy/prog_seq_c_tp/demineur/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/demineur/demineur.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/demineur/enonce)
### 28.10.2024: Tris par fusion, base, et sélection, [HTML](https://malaspinas.academy/prog_seq_c_tp/tri_fusion_base_selection/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/tri_fusion_base_selection/tri_fusion_base_selection.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/tri_fusion_base_selection/enonce)
### 15.10.2024: Fractions, [HTML](https://malaspinas.academy/prog_seq_c_tp/fractions/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/fractions/fractions.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/fractions/enonce)
### 08.10.2024: Tableaux unidimensionnels, [HTML](https://malaspinas.academy/prog_seq_c_tp/tableaux_unidimensionnels/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/tableaux_unidimensionnels/tableaux_unidimensionnels.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/tableaux_unidimensionnels/enonce)
### 01.10.2024: Bissection, [HTML](https://malaspinas.academy/prog_seq_c_tp/bissection/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/bissection/bissection.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/bissection/enonce)
### 23.09.2024: Exercices introductifs, [HTML](https://malaspinas.academy/prog_seq_c_tp/exercices_intro/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/exercices_intro/exercices_intro.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/exercices_intro/enonce)
### 16.09.2024: Nombre secret, [HTML](https://malaspinas.academy/prog_seq_c_tp/nombre_secret/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/nombre_secret/nombre_secret.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/nombre_secret/enonce)
:::
::: {.column width="60%"}
# Algo. et structures de données
# Deuxième année
<!-- Chaîne *BBB* du cours <https://bbb.hesge.ch/rooms/jli-y03-zrx-52a> -->
# Mathématiques en technologie de l'information
## Bibliographie
## [Polycopié](mti/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/math_tech_info), [pdf](mti/cours.pdf)
[T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, 3rd edition](https://mitpress.mit.edu/9780262533058/)
## [Travail pratique: optimisation](mti/tpOptimisation/index.html), [git repo](https://gitedu.hesge.ch/orestis.malaspin/math_tech_info/-/tree/master/travaux_pratiques/tpOptimisation), [pdf](mti/tpOptimisation/tpOptimisation.pdf)
---
<!-- ## [Travail pratique: intégrales](mti/tpIntegrales/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/math_tech_info/tree/master/tpIntegrales), [pdf](mti/tpIntegrales/tp_integrales_conv.pdf)
## [Théorie](https://malaspinas.academy/algo_cours/index.html)
## [Travail pratique: EDO](mti/tpEdo/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/math_tech_info/tree/master/tpEdo), [pdf](mti/tpEdo/tpEquadiffs.pdf) -->
---
# Prog. Système avancée
## [Repo git du cours](https://gitedu.hesge.ch/programmation_systeme_avancee/cours)
## [Lien BBB](https://bbb.hesge.ch/rooms/x7q-ciw-ue6-90s/join)
---
## Travaux pratiques
## 17.02.2025: Les emsembles de Julia, [HTML](https://malaspinas.academy/prog_sys_av_tp/julia/), [PDF](https://malaspinas.academy/prog_sys_av_tp/julia/julia.pdf)
## 24.02.2025: Le petit déjeuner, [HTML](https://malaspinas.academy/prog_sys_av_tp/petit_dej/), [PDF](https://malaspinas.academy/prog_sys_av_tp/petit_dej/petit_dej.pdf)
## 24.02.2025: Logging, [HTML](https://malaspinas.academy/prog_sys_av_tp/logging/), [PDF](https://malaspinas.academy/prog_sys_av_tp/logging/logging.pdf)
## 03.03.2025: Appels système, [HTML](https://malaspinas.academy/prog_sys_av_tp/syscalls/), [PDF](https://malaspinas.academy/prog_sys_av_tp/syscalls/syscalls.pdf)
## 10.03.2025: Le runtime (un peu plus) générique, [HTML](https://malaspinas.academy/prog_sys_av_tp/fibers/), [PDF](https://malaspinas.academy/prog_sys_av_tp/fibers/fibers.pdf)
## 17.03.2025: Les coroutines, [HTML](https://malaspinas.academy/prog_sys_av_tp/coroutines/), [PDF](https://malaspinas.academy/prog_sys_av_tp/coroutines/coroutines.pdf)
## 24.03.2025: Réacteur-Exécuteur, [HTML](https://malaspinas.academy/prog_sys_av_tp/executor_reactor/), [PDF](https://malaspinas.academy/prog_sys_av_tp/executor_reactor/executor_reactor.pdf)
---
# Université d'automne
## [Polycopié](https://malaspinas.academy/rust-101/book/)
## [Slides](https://malaspinas.academy/rust-101/slides)
## [Exercices](https://malaspinas.academy/rust-101/exercises)
## [Git](https://gitedu.hesge.ch/orestis.malaspin/rust-101)
:::
::::::::::::::
......@@ -117,77 +160,64 @@ La chaîne *twitch* de mes cours se trouve sur <https://www.twitch.tv/omhepia>
# Les projets de bachelor passés
## [Astéroides avec algorithme génétique, T. Ibanez](https://dai.ly/x6tosqh)
## [Pacman, Pong et Phoenix avec technique de renforcement, N. Nufer](https://dai.ly/x6tosqg)
# Cours d'années précédentes
# Programmation concurrente
## 2024
## [Polycopié](concurrence/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/cours_prog_conc)
### [F. Burgener, Isochrones des transports publics suisses à partir des données HRDF](https://gradechelor.hesge.ch/2024/documents/BURGENER-674)
# Exercices de programmation concurrente
### [Y. Niermaréchal, Extraction automatique d'information de plans architecturaux](https://gradechelor.hesge.ch/2024/documents/NIERMAR%C3%89CHAL-693)
## TP1: L'ensemble de Julia [PDF](tp_concurrence/julia.pdf), [HTML](tp_concurrence/julia.html)
## 2023
## TP2: Les threads et verrous [PDF](tp_concurrence/threads.pdf), [HTML](tp_concurrence/threads.html)
### [J. Debray, Analyse automatique de plans architecturaux](https://gradechelor.hesge.ch/2023/documents/Debray-626)
## TP3: Structures de données concurrentes [PDF](tp_concurrence/synchro.pdf), [HTML](tp_concurrence/synchro.html)
### [D. Peiry, Création d'une plateforme de dépôt et d'attribution de projets de semestre/Bachelor](https://gradechelor.hesge.ch/2023/documents/Peiry-648)
## TP4: File et workflow [PDF](tp_concurrence/file_workflow.pdf), [HTML](tp_concurrence/file_workflow.html)
## 2022
## TP5: Variables de condition [PDF](tp_concurrence/variables_condition.pdf), [HTML](tp_concurrence/variables_condition.html)
### [R. Bach, fmpi: An easy-to-use libray using Futhark and MPI to create simple parallel programs](https://sitehepia.hesge.ch/diplome/ITI/2022/documents/Bach-575)
## Projet: Asteroids [PDF](tp_concurrence/asteroids.pdf), [HTML](tp_concurrence/asteroids.html)
### [A. Blancy, HEPIA Virtuel - une plateforme virtuelle pour hepia](https://sitehepia.hesge.ch/diplome/ITI/2022/documents/Blancy-578)
## TP6: Sémaphores [PDF](tp_concurrence/semaphores.pdf), [HTML](tp_concurrence/semaphores.html)
### [T. Dagier-Joncour, Simulation de transports publics : l'import de Genève dans A/B street](https://sitehepia.hesge.ch/diplome/ITI/2022/documents/Dagier-Joncour-583)
## Projet: Asteroids concurrents [PDF](tp_concurrence/multithreaded_asteroids.pdf), [HTML](tp_concurrence/multithreaded_asteroids.html)
### [D. Fangous, Application d'entraînement pour sportifs et entraîneurs intéractive et modulaire](https://sitehepia.hesge.ch/diplome/ITI/2022/documents/Fangous-586)
## [Programmation séquentielle en Rust](prog_seq/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/rust)
### [I. N'Hairi, Modélisation de la population du canton de Genève](https://sitehepia.hesge.ch/diplome/ITI/2022/documents/N'Hairi-605)
# Anciens exercices en C (2019-20)
## 2021
## Tableaux unidimensionnels, [HTML](prog_seq_c_tp/tableaux_unidimensionnels/index.html), [PDF](prog_seq_c_tp/tableaux_unidimensionnels/tableaux_unidimensionnels.pdf), [GFX](prog_seq_c_tp/tableaux_unidimensionnels/gfx_example.tar.gz)
### [B. Coudray, MPI-Futhark : distributed high-performance computing for people](https://sitehepia.hesge.ch/diplome/ITI/2021/documents/Coudray-553)
## Les matrices, [HTML](prog_seq_c_tp/matrices_intro/index.html), [PDF](prog_seq_c_tp/matrices_intro/matrices_intro.pdf)
### [J. Jose Goncalves, Générateur statique d'une plateforme d'apprentissage dynamique](https://sitehepia.hesge.ch/diplome/ITI/2021/documents/Jose%20Goncalves-556)
## Les chaînes de caractères, [HTML](prog_seq_c_tp/chaines_caracteres/index.html), [PDF](prog_seq_c_tp/chaines_caracteres/chaines_caracteres.pdf)
### [T. Kaltrachian, GAN's methods for super-resolution on fluid flow simulation](https://sitehepia.hesge.ch/diplome/ITI/2021/documents/Kaltrachian-570)
## Traitement d'images, [HTML](prog_seq_c_tp/transformations/index.html), [PDF](prog_seq_c_tp/transformations/transformations.pdf)
## 2020
## Vector, [HTML](prog_seq_c_tp/vector/index.html), [PDF](prog_seq_c_tp/vector/vector.pdf)
### [J. Chétélat, Application de triangulation de points lidar sur le canton de Genève](https://sitehepia.hesge.ch/diplome/ITI/2020/documents/Ch%C3%A9telat-495)
## Fichier LAS, [HTML](prog_seq_c_tp/lidar/index.html), [PDF](prog_seq_c_tp/lidar/read.pdf)
### [L. De Biasi, Inari, Apprentissage par renforcement appliqué au jeu Dota 2](https://sitehepia.hesge.ch/diplome/ITI/2020/documents/De%20biasi-497)
## Fichier STL, [HTML](prog_seq_c_tp/stl/index.html), [PDF](prog_seq_c_tp/stl/stl.pdf)
### [M. El Kharroubi, Cryptographie sur GPU avec le langage Futhark](https://sitehepia.hesge.ch/diplome/ITI/2020/documents/El%20kharroubi-501)
## List-Vector, [HTML](prog_seq_c_tp/lst_vector/index.html), [PDF](prog_seq_c_tp/lst_vector/linked_vector.pdf)
### [T. Pirkl, Outil de scraping de sites internet](https://sitehepia.hesge.ch/diplome/ITI/2020/documents/Pirkl-532), [vidéo](https://www.youtube.com/watch?v=RKho4VPnF58)
## Delaunay, [HTML](prog_seq_c_tp/delaunay/index.html), [PDF](prog_seq_c_tp/delaunay/delaunay.pdf)
### [M. Vachon, Développement d'IHM pour la librairie open source Palabos](https://sitehepia.hesge.ch/diplome/ITI/2020/documents/Vachon-537)
## TP noté 2: triangulation, [HTML](prog_seq_c_tp/lidar_triangulation/index.html), [PDF](prog_seq_c_tp/lidar_triangulation/triangulation.pdf)
## 2019
## Code Morse, [HTML](prog_seq_c_tp/morse/index.html), [PDF](prog_seq_c_tp/morse/morse.pdf)
### [N. Denby, Création d'IHM pour la librairie Palabos](https://sitehepia.hesge.ch/diplome/ITI/2019/documents/Denby-449)
## Arbres quaternaires, [HTML](prog_seq_c_tp/quadtree/index.html), [PDF](prog_seq_c_tp/quadtree/quadtree.pdf)
### [G. Laurie, Méthode de Boltzmann sur réseau sur GPU en Futhark](https://sitehepia.hesge.ch/diplome/ITI/2019/documents/Laurie%20riveros-463)
## File de priorité, [HTML](prog_seq_c_tp/priority_queue/index.html), [PDF](prog_seq_c_tp/priority_queue/linked_list.pdf)
### [S. Ollquist, Étude et visualisation d'algorithmes de classement de pages Web](https://sitehepia.hesge.ch/diplome/ITI/2019/documents/Ollquist-465)
## Graphes, [HTML](prog_seq_c_tp/shortest_path/graphes.html), [PDF](prog_seq_c_tp/shortest_path/graphes.pdf), [xml_parser.h](prog_seq_c_tp/shortest_path/xml_parser.h), [xml_parser.c](prog_seq_c_tp/shortest_path/xml_parser.c), [main.c](prog_seq_c_tp/shortest_path/main.c), [villes.xml](prog_seq_c_tp/shortest_path/villes.xml), [suisse.txt](prog_seq_c_tp/shortest_path/suisse.txt)
### [A. Vanini, Logiciels et Systèmes complexes](https://sitehepia.hesge.ch/diplome/ITI/2019/documents/Vanini-482)
## Floyd-Dijkstra, [HTML](prog_seq_c_tp/shortest_path/df.html), [PDF](prog_seq_c_tp/shortest_path/df.pdf), [squelette.c](prog_seq_c_tp/shortest_path/squelette/c/main.c), [Makefile](prog_seq_c_tp/shortest_path/squelette/c/Makefile), [commandes_a_tester.txt](prog_seq_c_tp/shortest_path/squelette/commandes_de_test/cmd_a_tester.txt), [output](prog_seq_c_tp/shortest_path/squelette/results_out/output)
## 2018
## Tests, [HTML](prog_seq_c_tp/shortest_path/test.html), [PDF](prog_seq_c_tp/shortest_path/test.pdf)
### [T. Ibanez, Astéroides avec algorithme génétique](https://sitehepia.hesge.ch/diplome/ITI/2018/documents/Ibanez-11), [video](https://dai.ly/x6tosqh)
# Exercices programmation séquentielle en Rust (2018-19)
### [N. Nufer, Construction d'un agent joueur par apprentissage par renforcement](https://sitehepia.hesge.ch/diplome/ITI/2018/documents/Nufer-18), [video](https://dai.ly/x6tosqg)
## TP1 Rust: Nombre secret, [HTML](prog_seq/exercices/01_nombre_secret/), [PDF](prog_seq/exercices/01_nombre_secret/index.pdf)
## TP2 Rust: Calcul de $\pi$, [HTML](prog_seq/exercices/02_calcul_pi/), [PDF](prog_seq/exercices/02_calcul_pi/index.pdf)
## TP3 Rust: Tableaux, [HTML](prog_seq/exercices/03_tableaux/), [PDF](prog_seq/exercices/03_tableaux/index.pdf)
## TP4 Rust: Couverture de la reine, [HTML](prog_seq/exercices/04_reine/), [PDF](prog_seq/exercices/04_reine/index.pdf)
## TP5 Rust: Puissance 4, [HTML](prog_seq/exercices/05_puissance4/), [PDF](prog_seq/exercices/05_puissance4/index.pdf)
## TP6 Rust: Listes, [HTML](prog_seq/exercices/06_listes/), [PDF](prog_seq/exercices/06_listes/index.pdf)
## TP7 Rust: Reed-Solomon, [HTML](prog_seq/exercices/07_reed_solomon/index.html), [PDF](prog_seq/exercices/07_reed_solomon/index.pdf)
## TP8 Rust: Transformation d'images, [HTML](prog_seq/exercices/08_transformation_images/index.html), [PDF](prog_seq/exercices/08_transformation_images/index.pdf)
## TP9 Rust: Problème du voyageur de commerce, [HTML](prog_seq/exercices/09_voyageur_commerce/index.html), [PDF](prog_seq/exercices/09_voyageur_commerce/index.pdf)
# [Cours archivés (Prog. Concurrente, Rust, Maths)](archives/index.html)