Computer science Semester 1 - 1CMINFS1

Content(s)

Introduction
Computer architecture elements: history, internal functioning, notion of algorithm.

First elements of Python
Variable and assignment, basic control structures (if, for, while).

Type concept
Basic types: integers, floats, character strings.

Representation of numbers
Integers in base b, in base 2, integers coded on N bits.
Floating values.
Observing and understanding rounding and overflow problems.

Functions
Definition and function call. Formal parameter and effective parameter.
Difference between local and global variable.

Libraries
Examples of library usage (especially math and numpy libraries).

Lists
Simple algorithms on lists and strings.

Sorts on lists
Insertion sort, selection sort, buble sort.
Application to calculations reading lists of values ??from a file.

Simple numerical calculation algorithms
Dichotomous search in a sorted list, zero calculation of a function by dichotomy.

Introduction to recursion
Principle of recursion (a function that calls itself), simple examples.

Algorithmic complexity