Phelma Formation 2022

Informatique 2- Structure de données et algorithmes PET-PI - 3PMKSDAL

  • Number of hours

    • Lectures 4.0
    • Projects 0
    • Tutorials 2.0
    • Internship 0
    • Laboratory works 12.0

    ECTS

    ECTS 1.5

Goal(s)

The objective is to learn the main concepts and data structures used by solutions to many problems. It addresses the recursive programming and the main dynamic data structures and abstract data types (lists, stacks, queues, trees, graphs) and presents some implementations and algorithms used by these these data structures.

Another objectif is reinforcing software engineering knowhows.

Contact Francois CAYRE, Cyrille CHAVET, Nicolas CASTAGNE, Julien POETTE

Content(s)

Examples of main concepts :
Recursive programming, Complexity
Abstract data type
Linear dynamic data structures: lists, fifos, etc.
hast tables and dictionnaries
Tree data structures

Tp : These concepts are implemented in lab works using C langage and Linux, such as:
MandelBrot Fractal
Heap Sort
War Card Game with stack and queue
Spelling checker with Hash Table
computer algebra, arithmetic, derivation with binary trees

Final mini project. Example : routes in Paris (Metro and RER) using the shortest path in a graph with different algorithms: Dijkstra, Bellman, A-Star.



Prerequisites

COmputer science module of first semester.

Test



Additional Information

Course list
Curriculum->1st year engineer PET->Semester 6
Curriculum->1st year engineer PMP->Semester 6