A background in engineering, sciences, mathematics or technology. This is evidenced by the content of the first degree. Other students may be considered, depending on space, after discussion with the module tutor. This will be determined by discussion with the tutor.


Overview: The module will cover a broad range of topics from the field of computing, starting from the fundamentals and exploring, in relative detail, more advanced concepts and methods and the design and understanding of algorithms.

Current progress in information technology has meant the majority of organisations are using IT to innovate, and without an understanding of fundamental computing concepts future managers, scientists, engineers will be unable to take strategical decisions and provide critical thinking on most projects in full confidence.

The module is focused around two core themes in computing: algorithms and programming/development. These two concepts go hand in hand and it is understood that to be a good developer, algorithmic concepts need to be comprehensively understood and students should be able to critical apply knowledge from the theoretical aspects towards practical implementations of solutions for complex system designs in business, engineering, science and IT.

The programming focus is based on the C/C++ programming language, considered by many as one of the harder programming languages and still the language of choice in many industries – once mastered the transition to the other popular programming languages Java, C-sharp, Objective C and python are relatively straightforward. Importantly, this is not about teaching programming but about forming a conceptual understanding of computing principles with programming as a vehicle to further grasp these concepts with the added bonus of adding an important skill to the CV. Future editions may adopt other programming languages.

The over-arching aim of this module is:
Give students the ability and confidence to solve problems efficiently using computers.

The sub-aims of this module are:
- Form an understanding of some classic algorithms from the literature
- Develop the understanding of which solutions/algorithmic paradigms work best for certain types of problems
- Design straightforward algorithms for yet unseen problems that have straightforward solutions
- Learn programming methods and how to design good code for a proposed algorithm


Upon successful completion participants will be able to:



  1. Introduction
  2. Sorting as an introduction to algorithms, data structures, complexity and decision making

  3. Brute force and divide and conquer methods for solving problems via exhaustive search and recursion

  4. Data structures

  5. Graph algorithms – algorithms based on graph theory for solving problems that can be expressed as graphs

  6. Misc. algorithms (eg string matching, spatial data structures etc.) as part of in-class tutorials, introduced throughout the module.

  7. Limitations of algorithms and coping with limitations

  8. Conclusions, recap and next steps


  1. Introduction to programming

  2. Introduction to C/C++

  3. Types

  4. Commands

  5. Dealing with pointers

  6. Generics and abstract data types

  7. Concepts of Object Oriented Programming

  8. Inheritance

  9. Polymorphism

  10. File I/O

  11. Brief introduction to multithreading

Demonstrations and group work

  1. Worksheets solving one/two problems from each lecture - 2 versions of problems one more advanced for more advanced students
  2. Group project (in class) – learn advantages, pitfalls and practicalities of programming as part of a team


2000 Words report accompanying a programming assignment (100% weighting).


1 week
Lectures:15 hours
Seminar: 3 hours
Tutorials:19.5 hours
Total Learning Hours : 37.5 Hours