Programming Techniques
Course offerings
What will I learn?
The course covers the following topics
Program development
- Methods of specification
- Design
- Implementation
- Testing and debugging
- Case studies
- Design patterns
Graphs
- Construction
- Traversal
- Topological sorting
- Applications
Sorting and searching
- Internal and external algorithms
- Correctness and complexity analysis
How will my performance be assessed?
Your performance in the course will be assessed in three ways:
- Practical exercise marks will contribute between
20% and 30% to your final score.
- The final exam usually contributes the remainder of
the marks.
- Tutorials are not usually assessed.
However, we do record your attendance.
The precise details of assessment vary from year to year, and will
be explained at the first lecture.
What do students think of this course?
From time-to-time, we ask students to give their opinion of this course,
and allow the lecturers to respond to the evaluation.
The most recent results, labelled 'courseEvaluation', and 'courseResponse'
are here:
Handy links
Disclaimer
The information presented here should apply to most students.
It is possible, however, that special conditions may apply to you.
You can find out by reading the
University Calendar program rules
|
