 | Study programme 2023-2024 | Français | |
 | Data Structures and Algorithms | ||
Programme component of Bachelor's in Engineering (MONS) (day schedule) à la Faculty of Engineering |
| Code | Type | Head of UE | Department’s contact details | Teacher(s) |
|---|---|---|---|---|
| UI-B1-IRCIVI-018-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
- Implement an engineering approach dealing with a set problem taking into account technical, economic and environmental constraints
- Understand the stages of an engineering approach
- Design, evaluate and optimise solutions addressing the problem
- Implement a chosen solution in the form of a drawing, a schema, a plan, a model, a prototype, software and/or digital model
- Identify and acquire the information and skills needed to solve the problem
- 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
- Communicate in a structured way - both orally and in writing, in French and English - giving clear, accurate, reasoned information
- Present analysis or experiment results in laboratory reports
- Demonstrate thoroughness and independence throughout their studies
- Identify the different fields and participants in engineering
- Direct their choice of modules within their degree programme in order to develop a career plan in line with the realities in the field and their profile (aspirations, strengths, weaknesses, etc.)
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 and information coding. 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, recursivity and binary coding. Definition and construction of data types and structures (basic types, list, file, stack, file, trees); Searching and sorting algorithms. 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 Learning Resources/Tools
| AA | Required Learning Resources/Tools |
|---|---|
| I-ILIA-001 | Not applicable |
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 | - Theoretical part (weighting 50%): dispensatory graded exercise on the first 2 chapters of the course and written examination (duration 2.5 hours, in session). If the mark for the dispensatory assessment is higher than 10/20, the student will only be questioned on the 2nd part of the course during the written exam, his mark for the theory will be equal to the average of the two tests. If the mark for the dispensatory assessment is less than 10/20, the student will be questioned on the whole of the subject during the written session (with an adapted test duration). - Practical part: assessment of practical work (10%) and practical test in the form of an oral in session (40%). For this assessment, which lasts a maximum of 4 hours, the student has 2h30 to write a programme. The student must then demonstrate and justify how the programme works, based on one or more data sets. Students are questioned and may be asked to explain all or part of their code. |
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 h30 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. |
(*) HT : Hours of theory - HTPE : Hours of in-class exercices - HTPS : hours of practical work - HD : HMiscellaneous time - HR : Hours of remedial classes. - Per. (Period), Y=Year, Q1=1st term et Q2=2nd term