Fiches de cours 2016-2017

PDF
 

Algorithms

CS-250

Enseignant(s) :

Kapralov Mikhail
Svensson Ola Nils Anders

Langue:

English

Summary

The students learn the theory and practice of basic concepts and techniques in algorithms. The course covers mathematical induction, techniques for analyzing algorithms, elementary data structures, major algorithmic paradigms such as dynamic programming, sorting and searching, and graph algorithms.

Content

Mathematical Induction

Analysis of Algorithms

Data structures

Design of algorithms by induction

Greedy Algorithms

Sorting and searching

Graphs algorithms and data structures

Complexity

 

Keywords

algorithms, data structures, efficiency, problem solving

Learning Prerequisites

Recommended courses

Discrete Structures

Learning Outcomes

By the end of the course, the student must be able to:

Teaching methods

Ex cathedra lecture, exercises in classroom

Assessment methods

Continuous assessment with final exam.

Resources

Bibliography

Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein: Introduction to algorithms, Third Edition, MIT Press, 2009.

 

Ressources en bibliothèque
Websites

Dans les plans d'études

Semaine de référence

 LuMaMeJeVe
8-9     
9-10     
10-11     
11-12     
12-13     
13-14     
14-15     
15-16     
16-17     
17-18     
18-19     
19-20     
20-21     
21-22     
En construction
 
      Cours
      Exercice, TP
      Projet, autre

légende

  • Semestre d'automne
  • Session d'hiver
  • Semestre de printemps
  • Session d'été
  • Cours en français
  • Cours en anglais
  • Cours en allemand