Show/hide contentOpenClose All
Curricular information is subject to change
On completing this module, a student should be able to solve basic and intermediate programming problems involving data structures, mathematics, graphs, network flow, strings and geometry, as well as being conversant with various problem solving paradigms including greedy algorithms and dynamic programming.
Indicative Module Content:The following indicative topics are envisaged:
Module Introduction
Data structures and libraries
Data structures
Problem solving paradigms
Greedy algorithms
Dynamic programming
Mathematics
Unweighted graphs
Graphs
Network flow
Strings
Geometry
Student Effort Type | Hours |
---|---|
Autonomous Student Learning | 60 |
Lectures | 24 |
Laboratories | 24 |
Total | 108 |
Students joining this this module must be strong programmers with a good knowledge of data structures and algorithms.
Description | Timing | Component Scale | % of Final Grade | ||
---|---|---|---|---|---|
Practical Skills Assessment: Programming assignments that take place throughout the module. | Week 1, Week 2, Week 3, Week 4, Week 5, Week 6, Week 7, Week 8, Week 9, Week 10, Week 11, Week 12 | Graded | No | 20 |
No |
Exam (In-person): Programming exam | End of trimester Duration: 2 hr(s) |
Graded | No | 80 |
No |
Resit In | Terminal Exam |
---|---|
Spring | No |
• Group/class feedback, post-assessment
• Self-assessment activities
Not yet recorded.