Study programme 2022-2023 | Français | ||
Data Structures and Algorithms | |||
Programme component of Bachelor's in Engineering: Architectural Engineering (MONS) (day schedule) à la Faculty of Engineering |
Code | Type | Head of UE | Department’s contact details | Teacher(s) |
---|---|---|---|---|
UI-B2-IRCIVA-008-M | Compulsory UE | MAHMOUDI Saïd | F114 - Informatique, Logiciel et Intelligence artificielle |
|
Language of instruction | Language of assessment | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Credits | Weighting | Term |
---|---|---|---|---|---|---|---|---|---|
| Français | 22 | 30 | 0 | 8 | 0 | 5 | 5.00 | 2nd term |
AA Code | Teaching Activity (AA) | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term | Weighting |
---|---|---|---|---|---|---|---|---|
I-ILIA-001 | Data Structures and Algorithms | 22 | 30 | 0 | 8 | 0 | Q2 | 100.00% |
Programme component |
---|
Objectives of Programme's Learning Outcomes
Learning Outcomes of UE
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: description and pedagogical relevance
- 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, etc.)).
- Searching and sorting algorithms, recursion.
- Python programming language.
Prior Experience
Not applicable
Type of Teaching Activity/Activities
AA | Type of Teaching Activity/Activities |
---|---|
I-ILIA-001 |
|
Mode of delivery
AA | Mode of delivery |
---|---|
I-ILIA-001 |
|
Required Reading
AA | Required Reading |
---|---|
I-ILIA-001 | Note de cours - Syllabus - théorie - Informatique -2022-2023 - Saïd Mahmoudi, M. Benjelloun, G. Libert ,Copie de présentation - Informatique - transparents du cours théorique - Saïd Mahmoudi |
Required Learning Resources/Tools
AA | Required Learning Resources/Tools |
---|---|
I-ILIA-001 | Not applicable |
Recommended Reading
AA | Recommended Reading |
---|---|
I-ILIA-001 | Notes d'exercices - Introduction à la programmation en Python - Mohammed Benjelloun |
Recommended Learning Resources/Tools
AA | Recommended Learning Resources/Tools |
---|---|
I-ILIA-001 | Not applicable |
Other Recommended Reading
AA | Other Recommended Reading |
---|---|
I-ILIA-001 | Les fondements de l'informatique - Du bit au Cloud Computing, de Hugues Bersini, Marie-Paule Spinette-Rose, Robert Spinette-Rose, Nicolas Van Zeebroeck , 2014, Editeur : VUIBERT Informatique et algorithmique, Goldschlager, Lister, Interéditions, 1986. Structures de données et algorithmes, Wirth, Prentice Hall, 1976 |
Grade Deferrals of AAs from one year to the next
AA | Grade Deferrals of AAs from one year to the next |
---|---|
I-ILIA-001 | Authorized |
Term 2 Assessment - type
AA | Type(s) and mode(s) of Q2 assessment |
---|---|
I-ILIA-001 |
|
Term 2 Assessment - comments
AA | Term 2 Assessment - comments |
---|---|
I-ILIA-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 (40% for the pratical exman and 10% for pratical works evaluation). |
Term 3 Assessment - type
AA | Type(s) and mode(s) of Q3 assessment |
---|---|
I-ILIA-001 |
|
Term 3 Assessment - comments
AA | Term 3 Assessment - comments |
---|---|
I-ILIA-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. |