Prerequisite: Algorithms and Programming 1 unit.
| On completion of the unit, the student will be capable of: | Classification level | Priority |
|---|---|---|
| Learning, implementing and analysing different data structures | 1. Knowledge | Essential |
| Solving application problems : (i) analysing needs, (ii) formalising the problem, (iii) structuring and representing data and (iv) proposing and implementing algorithmic solutions | 4. Analyse | Essential |
| Consolidating C programming skills | 3. Apply | Essential |
| Percentage ratio of individual assessment | Percentage ratio of group assessment | ||||
|---|---|---|---|---|---|
| Written exam: | 75 | % | Project submission: | 13 | % |
| Individual oral exam: | % | Group presentation: | % | ||
| Individual presentation: | % | Group practical exercise: | % | ||
| Individual practical exercise: | % | Group report: | 12 | % | |
| Individual report: | % | ||||
| Other(s): % | |||||
| Type of teaching activity | Content, sequencing and organisation |
|---|---|
| Course + Practical course | GDB : Debugging GNU – Data structure (Linked lists, Files, Piles) – Graph theory |
| Course + Practical course | Shortest path problems – Dijkstra and Bellman-Ford algorithms (Implementation with and without piles) |
| Course + Practical course | Checking the existence of a word in a French dictionary. Data structure (Hash tables) |
| Course + Practical course | Graphs and distributed calculation |
| Course + Practical course | Project presentation and launching |