Course Syllabus 2013/2014
PDF Extract Anglais
Module : IF101
Title :
Introduction to algorithmic
Number of hours :
Lecture : 9.33 h
Tutorial classes : 16.00 h
Individual work : 12.00 h
ECTS credits :
Evaluation :
Teacher(s) :
LAPOIRE Denis - Responsible
Shared by UV(s) :
Level :
first year module
Abstract :
This course provides an introduction to solving problems through simple algorithms, in particular the sorting problems. The only objects handled are simple types (natural numbers, real, etc.) or matrix of them. Some families of algorithms are introduced: divide and conquer, dynamic. The comparison of algorithms is addressed by introducing the notion of complexity.
Plan :
Introduction Problems and algorithms Divide-and-conquer algorithm Dynamic programing Sorting algorithms
Prerequisite :
Keyword(s) :
Problem Algorithm Complexity Sorting
Online course :