Algorithmics COMPSCI2026

  • Academic Session: 2023-24
  • School: School of Computing Science
  • Credits: 10
  • Level: Level 2 (SCQF level 8)
  • Typically Offered: Semester 2
  • Available to Visiting Students: No

Short Description

This course is intended for Graduate Apprenticeship students only.


This course will develop the students' skills in the design and analysis of algorithms, with focus on a range of important standard problems. This course will introduce students to the fundamental concepts of NP-completeness, solvability, and computability, and their application in the world of computing.



Requirements of Entry

Entry to Level 2 is guaranteed to students who achieve a GPA of D3 or better in their level 1 courses at the first sitting.

Excluded Courses





Written examination 60%, 20% assessed practical exercise, mid semester class test 15% and in-class quizzes 5%.

Main Assessment In: April/May

Course Aims

The aim of this course is to further develop the student's skills in the design and analysis of algorithms. The students will study algorithms for a range of important standard problems. They will also be introduced to the theory of NP-completeness and fundamental concepts of computability, together with their practical implications.

Intended Learning Outcomes of Course

By the end of this course, students will be able to:

1. Apply standard algorithmic design methods and basic principles of algorithm analysis.

2. Describe fundamental graph and string algorithms and be able to apply this knowledge in a program.

3. Describe the basic principles and practical implications of the theory of NP-completeness.

4. Provide examples of the computability and unsolvability, and know some standard examples of unsolvable problems.

Minimum Requirement for Award of Credits

Students must submit at least 75% by weight of the components (including examinations) of the course's summative assessment.