Duration
Algorithmics : 14h Th, 14h Pr, 40h Proj.
Software patterns : 10h Th, 10h Pr, 30h Proj.
Number of credits
Lecturer
Algorithmics : Laurent Mathy
Software patterns : Laurent Mathy
Coordinator
Language(s) of instruction
English language
Organisation and examination
Teaching in the second semester
Schedule
Units courses prerequisite and corequisite
Prerequisite or corequisite units are presented within each program
Learning unit contents
Algorithmics
This first part addresses algorithmic problem solving and describes examples of advanced algorithms, using C as the reference programming language. The second part provides an introduction to programming design patterns, using Java as the reference programming language.
Software patterns
This first part addresses algorithmic problem solving and describes examples of advanced algorithms, using C as the reference programming language. The second part provides an introduction to programming design patterns, using Java as the reference programming language.
Learning outcomes of the learning unit
Algorithmics
In this course, the students learn: - the principles of complex program decomposition; - to write efficient programs - knowledge of advanced algorithmic techniques - to apply programming patterns
Software patterns
In this course, the students learn: - the principles of complex program decomposition; - to write efficient programs - knowledge of advanced algorithmic techniques - to apply programming patterns
Prerequisite knowledge and skills
Algorithmics
Knowledge of basic algorithms. Practical knowledge of the C and Java programming languages.
INFO0902 or INFO2050
INFO0062
Software patterns
Knowledge of basic algorithms. Practical knowledge of the C and Java programming languages.
INFO0902 or INFO2050
INFO0062
Planned learning activities and teaching methods
Algorithmics
Lectures.
The students carry out two unmarked projects.
Software patterns
Lectures.
The students carry out two unmarked projects.
Mode of delivery (face to face, distance learning, hybrid learning)
Algorithmics
Face-to-face course
Blended learning
Software patterns
Blended learning
Further information:
Face-to-face course
Blended learning
Course materials and recommended or required readings
Algorithmics
Optional recommended readings:
Introduction to algorithms; Cormen, Leiserson, Rivest and Stein; MIT press.
Algorithms in C; Sedgewick; Addison Wesley.
Design patterns; Gamma, Helm, Johnson, Vlissides; Addison-Wesley.
Software patterns
Optional recommended readings:
Introduction to algorithms; Cormen, Leiserson, Rivest and Stein; MIT press.
Algorithms in C; Sedgewick; Addison Wesley.
Design patterns; Gamma, Helm, Johnson, Vlissides; Addison-Wesley.
Algorithmics
Exam(s) in session
Any session
- In-person
written exam
Written work / report
Out-of-session test(s)
Further information:
Written exam. Each part of the course bears equal weight in the final mark.
Students who do not submit all the projects receive an absence mark for the corresponding exam session.
All resubmissions are individual.
There is no guaranteed support for projects to be resubmitted for the resit session.
Software patterns
Exam(s) in session
Any session
- In-person
written exam
Written work / report
Out-of-session test(s)
Further information:
Written exam. Each part of the course bears equal weight in the final mark.
Students who do not submit all the projects receive an absence mark for the corresponding exam session.
All resubmissions are individual.
There is no guaranteed support for projects to be resubmitted for the resit session.
Work placement(s)
Organisational remarks and main changes to the course
Contacts
Algorithmics
- Coordinator: L. Mathy, Laurent.Mathy@uliege.be
- Assistant: Jakub Duchateau, Jakub.Duchateau@uliege.be
Software patterns
- Coordinator: L. Mathy, Laurent.Mathy@uliege.be
- Assistant: Jakub Duchateau, Jakub.Duchateau@uliege.be