Code | Type | Head of UE | Department’s contact details | Teacher(s) |
---|---|---|---|---|
UI-B1-IRCIVI-008-M | Compulsory UE | LIBERT Gaëtan | F114 - Informatique |
|
Language of instruction | Language of assessment | HT(*) | HE(*) | HTP(*) | HR(*) | HD(*) | Credits | Weighting | Term |
---|---|---|---|---|---|---|---|---|---|
| Français | 20 | 20 | 24 | 8 | 6.00 | 6.00 | 2nd term |
AA Code | Teaching Activity (AA) | HT(*) | HE(*) | HTP(*) | HR(*) | HD(*) | Term | Weighting |
---|---|---|---|---|---|---|---|---|
I-INFO-001 | Data structures and algorithms | 20.00 | 20.00 | 24.00 | 8.00 | 100.00% |
Objectives of general skills
- Understand the theoretical and methodological fundamentals in science and engineering to solve problems involving these disciplines
- Identify, describe and explain basic scientific and mathematical principles
- Select and rigorously apply knowledge, tools and methods in sciences and engineering to solve problems involving these disciplines
UE's Learning outcomes
After this teaching, students will be able to: Explain the main concepts of the algorithmic and the data structures in connection with the basic characteristics of computer science Find and implement algorithms with a programming language Describe the basic characteristics of computers and operating systems
UE Content
Design of algorithms with sequence, iteration, modularity and recursivity Definition and construction of data types and structures (basic types, array, record, file, pointer, list, heap, file, trees (general, binary, balanced, heap)) Searching and sorting algorithms Basics of computer architecture (central processing unit, memories, peripherals) Definition and basic characteristics of operating systems (process, kernel, memory management, input/output management) C++ programming language
Prior experience
Not applicable
Type of Teaching Activity/Activities
A.A. | Type of Teaching Activity/Activities |
---|---|
I-INFO-001 |
|
Mode of delivery
A.A. | Mode of delivery |
---|---|
I-INFO-001 |
|
Required Reading
A.A. | Required Reading |
---|---|
I-INFO-001 | Note de cours - Structures de données et algorithmes - Mohammed Benjelloun, Gaetan Libert Notes d'exercices - Introduction à la programmation en C++ - Mohammed Benjelloun Travaux Pratiques - Travaux Pratiques de Structures de données et algorithmes - Mohammed Benjelloun Copie de présentation - Programmation en C++ - Mohammed Benjelloun |
Required Learning Resources/Tools
A.A. | Required Learning Resources/Tools |
---|---|
I-INFO-001 | Not applicable |
Recommended Reading
A.A. | Recommended Reading |
---|---|
I-INFO-001 |
Recommended Learning Resources/Tools
A.A. | Recommended Learning Resources/Tools |
---|---|
I-INFO-001 | Not applicable |
Other Recommended Reading
A.A. | Other Recommended Reading |
---|---|
I-INFO-001 | Informatique et algorithmique, Goldschlager, Lister, Interéditions, 1986. Structures de données et algorithmes, Wirth, Prentice Hall, 1976 |
Term 1 Assessment - type
A.A. | Term 1 Assessment - type |
---|---|
I-INFO-001 |
|
Term 1 Assessment - comments
A.A. | Term 1 Assessment - comments |
---|---|
I-INFO-001 | Not applicable |
Resit Assessment - Term 1 (B1BA1) - type
A.A. | |
---|---|
I-INFO-001 |
Resit Assessment - Term 1 (B1BA1) - Comments
A.A. | Resit Assessment - Term 1 (B1BA1) - Comments |
---|---|
I-INFO-001 | Not applicable |
Term 2 Assessment - type
A.A. | Term 2 Assessment - type |
---|---|
I-INFO-001 |
|
Term 2 Assessment - comments
A.A. | Term 2 Assessment - comments |
---|---|
I-INFO-001 | Written examination during 2 h on the theoretical concepts of the teaching. 50% of the mark. Oral examination during 4h with a maximum of 2h30 for the writing of a program. The student has to explain and justify the correctness of his program with various sets of data. Questions are asked to the student who has to comment all or a part of the source code of his program. 50% of the mark. |
Term 3 Assessment - type
A.A. | Term 3 Assessment - type |
---|---|
I-INFO-001 |
|
Term 3 Assessment - comments
A.A. | Term 3 Assessment - comments |
---|---|
I-INFO-001 | Written examination during 2 h on the theoretical concepts of the teaching. 50% of the mark. Oral examination during 4h with a maximum of 2h30 for the writing of a program. The student has to explain and justify the correctness of his program with various sets of data. Questions are asked to the student who has to comment all or a part of the source code of his program. 50% of the mark. |