COMP104P - Theory II

This database contains the 2016-17 versions of syllabuses. Syllabuses from the 2015-16 session are available here.

Note: Whilst every effort is made to keep the syllabus and assessment records correct, the precise details must be checked with the lecturer(s).

Code COMP104P
IEP Year 1 Discipline specific module
Year 1
Prerequisites COMP102P
Term 2
Taught By Anthony Hunter (50%)
Ilya Sergey  (50%)
Aims To develop programming and problem solving skills, to encourage a thoughtful approach to analysis and design problems, to familiarise students with logical and mathematical inference and argumentation.
Learning Outcomes Students should be able to apply this knowledge to specification of algorithms and logic programming.

Content:

Searching and sorting algorithms
Elementary searching - comparing sequential, binary and interpolation search. 
Binary search trees.