Object oriented Programming and Graphs
Objectifs
Objectives:
At the end of this module, the student will have understood and be able to explain (main concepts):
- the principles and fundamental notions of objects oriented design and programing,
- the principles of UML class diagram and object oriented programming in Java
- the different kinds of graphs, several classical problems on graphs and solving methods, comparison between several graph representations and algorithms
- Apply the Graph theory for modelling various problems
- Conception and Implementation of efficient algorithms based on graph data structure to solve a given problem.
The student will be able to:
- design class diagrams of an application
- design and program in JAVA a simple application,
- to develop a classical graph algorithm aimed at solving a well-known problem whose specificity is to manipulate great amount of data,
- to develop and compare different implementation of a well-known algorithm with the aim to apprehend the notion of algorithm complexity,
- to propose and adapt classical algorithms aimed at solving a new problem,
- to perform relevant measurements tests aimed at evaluating performances of different algorithms.
Pré-requis
Necessary knowledge:
- C Language (3e year MIC)
- Introduction to complexity (3e year MIC)
- Algorithms and Data structures (2e year MIC, 1st year)
Évaluation
L’évaluation des acquis d’apprentissage est réalisée en continu tout le long du semestre. En fonction des enseignements, elle peut prendre différentes formes : examen écrit, oral, compte-rendu, rapport écrit, évaluation par les pairs…
En bref
Crédits ECTS : 4.0
Nombre d’heures : 54.0
INSA Toulouse
135 avenue de Rangueil
31077 Toulouse cedex 4
Tél : 05 61 55 95 13
Fax : 05 61 55 95 00
Dans un souci d'alléger le texte et sans aucune discrimination de genre, l'emploi du genre masculin est utilisé à titre épicène.