 | Study programme 2020-2021 | Français | |
 | Computer Programming and Algorithms II | ||
Programme component of Bachelor's in Mathematics à la Faculty of Science |
| Students are asked to consult the ECTS course descriptions for each learning activity (AA) to know what special Covid-19 assessment methods are possibly planned for the end of Q3 |
|---|
| Code | Type | Head of UE | Department’s contact details | Teacher(s) |
|---|---|---|---|---|
| US-B1-SCMATH-011-M | Optional UE | QUOITIN Bruno | S802 - Réseaux et Télécommunications |
|
| Language of instruction | Language of assessment | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Credits | Weighting | Term |
|---|---|---|---|---|---|---|---|---|---|
| Français | 30 | 45 | 0 | 0 | 0 | 6 | 6.00 | 2nd term |
| AA Code | Teaching Activity (AA) | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term | Weighting |
|---|---|---|---|---|---|---|---|---|
| S-INFO-604 | Computer programming and Algorithms II | 30 | 45 | 0 | 0 | 0 | Q2 | 100.00% |
| Programme component |
|---|
Objectives of Programme's Learning Outcomes
- Use computers effectively
- Understand and implement algorithms using appropriate data structures
- Use at least one programming language
- Develop computer programs to solve problems with mathematical formulation
Learning Outcomes of UE
Design and understand an algorithm and its implementation as a program.
Understand and apply object-oriented programming (OOP).
Write and understand a Java program.
Analyse the efficiency of an algorithm (complexity).
Identify and use a few design patterns.
Understand and use simple data structures (linked lists, arrays, hash tables) as well as programming techniques (recursion, divide and conquer, dynamic programming).
Content of UE
(see learning activity)
Prior Experience
Not applicable
Type of Assessment for UE in Q2
- Written examination
Q2 UE Assessment Comments
Written exam 100%
Type of Assessment for UE in Q3
- Written examination
Q3 UE Assessment Comments
Written exam 100%
Type of Teaching Activity/Activities
| AA | Type of Teaching Activity/Activities |
|---|---|
| S-INFO-604 |
|
Mode of delivery
| AA | Mode of delivery |
|---|---|
| S-INFO-604 |
|
Required Reading
| AA | |
|---|---|
| S-INFO-604 |
Required Learning Resources/Tools
| AA | Required Learning Resources/Tools |
|---|---|
| S-INFO-604 | Java Concepts, Cay Horstmann, 4th Edition, John Wiley & Sons, Inc., 2005, ISBN 0-471-69704-4 |
Recommended Reading
| AA | |
|---|---|
| S-INFO-604 |
Recommended Learning Resources/Tools
| AA | Recommended Learning Resources/Tools |
|---|---|
| S-INFO-604 | Not applicable |
Other Recommended Reading
| AA | Other Recommended Reading |
|---|---|
| S-INFO-604 | - Garbage Collection: Algorithms for Automatic Dynamic Memory Management, R. Jones, R. Lins, John Wiley & Sons, Inc., 1996, ISBN 0-471-94148-4. - Introduction to Programming in Java: An Interdisciplinary Approach, R. Sedgewick, K. Wayne, Addison-Wesley, 2007, ISBN 0-321-49805-4. - Introduction to Algorithms (3rd edition), Th. H. Cormen et al, 2009, MIT Press. |
Grade Deferrals of AAs from one year to the next
| AA | Grade Deferrals of AAs from one year to the next |
|---|---|
| S-INFO-604 | Authorized |