Search Log in FR EN

Algorithmique et programmation 3Sciences de base 3 (STPI)

FISE STPI Semester 3 Common Core Machine translation

Algorithms and Programming 3

Teaching unit Basic Sciences 3
8ECTS (EU)
1Coefficient
37:20Hours

Séquencement

3C 3TD 3C 3TD C 3TD C 3TD 3TD 3TD 3TD 3TD 3TD 3TD 3TD 3TD 3TD 3TD 3TD 3TP 3TP 3TP 3TP 3TP 3TP 3TP 3TP 3TP 3TP 3TP 3TP 3TP
↳ Berthome Pascal
C TD C TD TD TD TD TD TD TD TD TD TD TD TD TD TD TP TP TP TP TP TP TP TP TP TP TP TP TP
↳ Clemente Patrice
C TD C TD C TD C TD TD TD TD TD TD TD TD TD TD TD TD TP TP TP TP TP TP TP TP TP TP TP TP TP
↳ Fettah Nadia
C TD C TD TD TD TD TD TD TD TD TD TD TD TD TD TD TP TP TP TP TP TP TP TP TP TP TP TP TP

Bloc incomplet : le nombre de séances planifiées ne correspond pas à la fiche.

Learning objectives

  • Learning to use algorithmic language
  • Learning to use simple data structures,
  • Learning to evaluate and compare the complexity of algorithms,
  • Implement algorithms in C language.

Educational platform

Bourges (STPI preorientation MRI or ITS): Algorithmics and Programming (3 and 4)

Blois (STPI pre-GSI orientation): Algorithmics and programming 3 & 4 - Blois campus

Training Without IAg

Prerequisites

ModuleTeaching unitSemester
Algorithms and Programming 1Optional Constitutive Elements 1S1
Algorithmics and ProgrammingBasic Sciences 2S2

Program

MRI and ITS Pre-Orientation

  • Algorithmic
  • Definition of sequential algorithmic language independent of a programming language:
  • Overall framework
  • data structures
  • control structures
  • functions and parameters
  • Terms of algorithmic complexity:
  • Rating O
  • simple algorithm analysis
  • lower terminals
  • Cells and Files:
  • Definitions
  • Use
  • Implementation with tables
  • Chained lists:
  • Definition
  • Functions
  • Applications
  • Recursivity (if time permits)
  • Definition
  • Complexity study
  • Classic algorithms (list path, Sort fusion, ...)
  • Programming
  • Using an IDE
  • Project Concepts and Compilation Automation
  • Programme development (debugging)
  • Programme documentation
  • This part can for example be done with CodeBlocks(R), debugger gdb, and doxygen
  • Application with implementation of data structures seen on the algorithmic side

GSI Pre-Orientation

  • Description of simple algorithms using a generic language that makes few assumptions about the details of practical implementation (pseudo-language).
  • Analysis of simple algorithms, termination and cost and asymptotic complexity
  • recurrent and loop-invariant reasoning
  • spatial and temporal costs, worst cases, best cases
  • Landau ratings
  • Basic data structures
  • linear data structures: chained tables and lists, advantages and disadvantages
  • Ordered data structures: batteries and queues, concept of encapsulation
  • Programming in language C
  • modular programming reminders

Assessment

The algorithmic part is evaluated primarily during the terminal examination. The practical part is evaluated by means of duties of directed work or practical work.

References

MRI and ITS Pre-Orientation

  • Algorithmic - 3rd edition - Thomas Cormen, CHARLES E. LEISERSON, RONALD L. RIVES, CLIFFORD STEIN, Editions Dunod.
  • Program in language C: Corrected courses and exercises, Claude Delannoy, Editions Eyrolles.

GSI Pre-Orientation

Course manual

C reference https://fr.cppreference.com/w/c