This course is an introduction to imperative programming, using Java, and assumes no prior experience. It covers the fundamentals: values and expressions, methods, control structures. It then turns to the ways a program organises what it holds, from its own types to arrays, text and files.
It introduces algorithmic thinking, recursion included, and closes on data structures: linked lists, binary trees, hash tables. The same problem is solved several ways and measured, because choosing the right structure is what separates a program that answers instantly from one that takes a hundred times longer.
Practice comes first. Every idea is put to work the same afternoon, in a program you write, run and watch on screen.
- Docente: Jean-Luc Bloechle
- Docente: Jérémie Gremaud