Course Overview

During this course, students discover how to implement simple
algorithms on a suitable data structure - arrays.

Students are required to apply their knowledge and skills to
abstraction, complexity calculation and the implementation of
iterative and recursive algorithms for the manipulation of data
arrays.

The basic programming concepts studied during the first semester will
be resumed and completed with notions of the cost of an operation,
elementary complexity, as well as recursivity within the common
framework of programming algorithms on arrays for sorting and
numerical computation applications.

Learning Achievement

Competence

Course prerequisites

Grading Philosophy

Continuous assessment: intermediate evaluations, written midterm exam.
 

In case of failure, a second session in the form of a written exam
will be organized.

Course schedule

- Array data structures
- Application of elementary algorithms to data arrays   
- Sorting and searching algorithms
- Worst-case algorithm analysis

Course type

Lectures (13 hours), tutorials (15 hours) and practical sessions (15 hours).

Online Course Requirement

Instructor

Other information

Duration: 43 hours

Language of instruction: Lectures are taught in French. Practical and tutorial sessions are in English.
Mode of delivery: Face-to-face teaching

Site for Inquiry