2011 – 2012
[M2] Introduction à l'Informatique
Introduction to Computer Science
- TD n°5. Paradigmes de programmation
- TD n°4. NP Complétude – Paradigmes
- TD n°3. Tris & Complexité
- TD n°2. Machines de Turing
- TD n°1. Théorie des ensembles, dénombrabilité, automates.
[M1] Algorithmique des Réseaux
Networks algorithms
Here are a few links which may prove useful for the project. Facebook JavaScript SDK for the Facebook API and RaphaelJS for the graphical aspects. You can also use Jquery if it helps. The instructions given during the first lesson are available on Github.
This paper gives a graph layout algorithm using a constraint based system. You may of course decide to use something else if you find better. However, you are not allowed to use a graph visualization library. Concerning the community detection aspects, here are two papers: the first one computes a partition of the network by attempting to maximize a fitness function, the second one uses clique percolation in order to find overlapping communities. Both appraches have pros and cons, it is up to you to choose which one you want to implement.
- TD n°8. Performances de 802.11
- TD n°7. Routage sans fil, OLSR
- TD n°6. Routage dans les réseaux ad hoc
- TD n°5. TP Quagga : Rip et OSPF
- TD n°4. Routage (II)
- TD n°3. Routage à état de lien. (pas de fiche)
- TD n°2. Accès au médium radio
- TD n°1. Ethernet / Transmettre des données
2010 – 2011
[L3] Algorithmique II
Algorithms, Semester 2
- TD n°14. Algorithmique du texte
- TD n°13. Programmation linéaire (2)
- TD n°12. Programmation linéaire (1)
- TD n°11. Flots (2)
- TD n°10. Flots
- TD n°9. Couplages (2)
- TD n°8. Couplages
- TD n°7. Algorithmes de plus courts chemins
- TD n°6. Parcours de graphes
- TD n°5. Arbres couvrants de poids minimum
- TD n°4. Arbres.
- TD n°3. Graphes, introduction.
- TD n°2. Structures de données (suite).
- TD n°1. Structures de données.