Computer programming (CSE101) introduces
students (with or without previous
programming experience) to the fundamentals
of computer programming
in Python, with applications across the
sciences. In this course, students will
explore fundamental algorithms and data
structures, up to and including binary
trees, using a mixture of procedural,
recursive, and object-oriented techniques.
Upon completion of this course, students
will have a solid foundation in the culture
and practice of modern programming,
and the basic skills to solve real-world
problems using efficient, well-written programs
and open-source tools. These foundations
will be extended and completed
in CSE 102 and CSE 103.
- Responsable: Berkemer Sarah
- Responsable: Blazy Olivier
- Responsable: Haucourt Emmanuel
- Responsable: Pogudin Gleb
- Responsable: Smith Benjamin
Advanced Programming (CSE102) is
the continuation of the previous semester’s
course (CSE101). We will continue
to lay the foundations of modern computer
science, while developing more
sophisticated programming techniques
in Python. At the end of this course,
students will have the fundamental analytical
and programming skills to solve
everyday problems in the sciences more
efficiently and effectively. They will also
be prepared to continue learning other
programming languages and paradigms,
and the theoretical foundations of computer
science itself.
- Responsable: Blazy Olivier
- Responsable: Haucourt Emmanuel
- Responsable: Strub Pierre-Yves
- Responsable: Will Sebastian
- Responsable: Zeilberger Noam
An algorithm is a sequence of instructions that allows us to solve a problem using a finite number of steps. As such, algorithms are the procedures that we use to “compute”. We study algorithms to know what can actually be computed, in theory and in practice, and to find out how efficiently it can be done.
Introduction to Algorithms (CSE103) is an initiation into the art and science of algorithms. This course will train students in how to think about algorithms, how to solve a wide range of problems by means of a number of algorithmic techniques, how to rigorously compare different algorithms and predict their performance, and how it is possible to formally prove that a program implementing an algorithm is correct.
- Responsable: Beguinot Julien
- Responsable: Berkemer Sarah
- Responsable: Blazy Olivier
- Responsable: Chiche Nathan
- Responsable: Haucourt Emmanuel
- Responsable: Hummes Flores Bernardo
- Responsable: Zhioua Sami
- Responsable: Blazy Olivier
- Responsable: Haucourt Emmanuel
- Responsable: Rohmer Damien