Study information

Algorithms and Architectures - 2025 entry

MODULE TITLEAlgorithms and Architectures CREDIT VALUE15
MODULE CODECOMM107 MODULE CONVENERDr Siyang Song (Coordinator)
DURATION: TERM 1 2 3
DURATION: WEEKS 11
Number of Students Taking Module (anticipated)
DESCRIPTION - summary of the module content

This module will introduce you to algorithms, the fundamentals of their design, and their importance within computer science. You will learn how to design and implement efficient algorithms, as well as evaluating algorithm complexity. You will also learn about key concepts concerning computer architectures, operating systems and networks – including memory management, storage concepts, process control and software execution.

AIMS - intentions of the module

The aims of this module are to introduce you to the skills needed to design, construct and manage the operation of software running on modern computing systems. You will understand the importance of designing efficient algorithms and will be able to analyse their runtime complexity.

INTENDED LEARNING OUTCOMES (ILOs) (see assessment section below for how ILOs will be assessed)

On successful completion of this module you should be able to:

Module Specific Skills and Knowledge

  1. Analyse the time complexity of a given algorithm

  2. Critique the design of a software system in terms of the architecture it is intended to be deployed on.

Discipline Specific Skills and Knowledge

  1. Design an algorithm to solve a given computer science problem.

  2. Distinguish between the different aspects of an operating system.

Personal and Key Transferable / Employment Skills and Knowledge

  1. Formulate a solution to a given computer science problem in terms of the algorithm that will solve the problem and the computing machinery it will execute on.

SYLLABUS PLAN - summary of the structure and academic content of the module

The module will cover the following topics:

  • The nature of algorithms.

  • Data structures (e.g. lists, stacks, queues, trees, graphs) and the algorithms that manipulate them.

  • Algorithms (e.g. searching, sorting).

  • Specification and pseudocode.

  • Termination and correctness.

  • Complexity, NP-Completeness and the travelling salesman problem.

  • Computer operating systems: structure, file management, process management, processor management, memory management.

  • Computer architectures: von Neumann architectures, caching, pipelining, input/output devices, storage technologies.

  • Computer networks: interconnection, devices, organisation, protocols.

LEARNING AND TEACHING
LEARNING ACTIVITIES AND TEACHING METHODS (given in hours of study time)
Scheduled Learning & Teaching Activities 33 Guided Independent Study 117 Placement / Study Abroad 0
DETAILS OF LEARNING ACTIVITIES AND TEACHING METHODS

Category

Hours of study time

Description

Scheduled learning and teaching activities

22

Lectures

Scheduled learning and teaching activities

11

Workshops/tutorials

Guided Independent Study

32

Individual assessed work

Guided Independent Study

85

Lecture and assessment preparation

 

ASSESSMENT
FORMATIVE ASSESSMENT - for feedback and development purposes; does not count towards module grade

Form of Assessment

Size of Assessment (e.g. duration/length)

ILOs Assessed

Feedback Method

Workshop exercises

1 hour per week

All

Model answers and verbal feedback

 

SUMMATIVE ASSESSMENT (% of credit)
Coursework 30 Written Exams 70 Practical Exams 0
DETAILS OF SUMMATIVE ASSESSMENT

Form of Assessment

% of Credit

Size of Assessment (e.g. duration/length)

ILOs Assessed

Feedback Method

Examination

70

1 hour

1, 4-5

Written

Continuous assessment

30

30 hours

1, 3, 5

Written

 

DETAILS OF RE-ASSESSMENT (where required by referral or deferral)

Original Form of Assessment

Form of Re-assessment

ILOs Re-assessed

Time Scale for Re-assessment

Exam 

Exam (1 hour, 70%)

1, 4-5

Referral/deferral period

Coursework

Coursework (30 hours, 30%)

1, 3, 5

Referral/deferral period

 

RE-ASSESSMENT NOTES

Reassessment will be by coursework or exam in the failed or deferred element only. For referred candidates, the module mark will be capped at 50%. For deferred candidates, the module mark will be uncapped.

RESOURCES
INDICATIVE LEARNING RESOURCES - The following list is offered as an indication of the type & level of
information that you are expected to consult. Further guidance will be provided by the Module Convener

Basic reading:

  • Cormen T, Leiserson C, Rivest R, Stein C, “Introduction to Algorithms”, 3rd edition, MIT Press, 2009.

  • Aho, A., Ullman, J., Hopcroft, J., “Data Structures and Algorithms”, Addison Wesley, 1983.

  • Stallings, W, “Computer Organization and Architecture: Designing for Performance”, 9th edition, Pearson, 2012.

  • Stallings, W, “Operating Systems: Internals and Design Principles”, 7th edition, Pearson, 2011.

  • Comer, DE, “Computer Networks and Internals”, 5th edition, Pearson, 2008.

Reading list for this module:

There are currently no reading list entries found for this module.

CREDIT VALUE 15 ECTS VALUE 7.5
PRE-REQUISITE MODULES None
CO-REQUISITE MODULES None
NQF LEVEL (FHEQ) 7 AVAILABLE AS DISTANCE LEARNING No
ORIGIN DATE Wednesday 20th December 2023 LAST REVISION DATE Thursday 24th April 2025
KEY WORDS SEARCH Computer; programming; data; algorithms; problem solving; Python

Please note that all modules are subject to change, please get in touch if you have any questions about this module.