| Code | Lecturer(s) | Associate Lecturer(s) | Subsitute Lecturer(s) et other(s) |
|---|---|---|---|
| S-INFO-603 |
|
| Language of instruction | Language of assessment | HT(*) | HE(*) | HTP(*) | HR(*) | HD(*) | Term |
|---|---|---|---|---|---|---|---|
| Français | Français | 30.00 | 60.00 | 1st term |
Contents
Algorithms and computer programming (Python): functions; conditonals; recursivity; iteration; introspection; lists; dictionaries; tuples; writing and reading files; exceptions handling; objects (introduction); proofs of termination and correctness of an algorithm; complexity and big-O notation; introduction to data structures (linked list, stack and queue).
Required Reading
Note de cours - Programmation et Algorithmique 1 - Hadrien MELOT
Required Learning Resources/Tools
Not applicable
Recommended Reading
Recommended Learning Resources/Tools
Not applicable
Other Recommended Reading
- Downey, A., Think Python: how to think like a computer scientist, Green Tea Press (2009)
- Aho, A. et Ullman, J., Concepts fondamentaux de l'informatique, Dunod (1993)
Mode of delivery
- Face to face
Type of Teaching Activity/Activities
- Course
- Exercices
- Practical works
Term 1 Assessment - type
- Written examination
- Quoted exercices
Term 1 Assessment - comments
- Intermediate test: 15%
- Written examination: 85%
Practical exercices are mandatory to have access to the examination (at least 75% of presence).
Term 2 Assessment - type
- Written examination
Term 2 Assessment - comments
Written examination: 100%
Practical exercices are mandatory to have access to the examination (at least 75% of presence).
Term 3 Assessment - type
- Written examination
Term 3 Assessment - comments
Written examination: 100%
Resit Assessment - Term 1 (B1BA1) - type
- Written examination
Resit Assessment - Term 1 (B1BA1) - Comments
Written examination: 100%
Practical exercices are mandatory to have access to the examination (at least 75% of presence).