Module Details

The information contained in this module specification was correct at the time of publication but may be subject to change, either during the session because of unforeseen circumstances, or following review of the module at the end of the session. Queries about the module should be directed to the member of staff with responsibility for the module.
Title APPLIED ALGORITHMICS
Code COMP526
Coordinator Dr S Wild
Computer Science
Sebastian.Wild@liverpool.ac.uk
Year CATS Level Semester CATS Value
Session 2019-20 Level 7 FHEQ Second Semester 15

Aims

The main aim of this module is to lay down a strong context for research explorations in the field of algorithms. This is done through a rigorous study of selected algorithmic solutionswith application to related fields requiring analysis of large data (bioinformatics, networking, data compression, etc). This will be done by provision of the rationale for the use of algorithmic design and analysis methods, and also an in-depth, systematic and critical study of several important algorithmic challenges residing on the border of the theory of abstract algorithms and engineering of applied algorithmic solutions.


Learning Outcomes

(LO1) Critical awareness of algorithmic problems and as well as research issues in the context of engineering of efficient algorithmic solutions.

(LO2) Clear understanding of the relation (including differences) between the goals in the design of efficient abstract and applied algorithmic solutions.

(LO3) Ability to understand and assimilate research literature relating to the application of algorithmic techniques.

(LO4) Ability to undertake small software projects.

(LO5) Ability to communicate (within and outside of Algorithms/CS community) problems related to efficiency of algorithmic solutions

(S1) Critical thinking and problem solving - Critical analysis

(S2) Critical thinking and problem solving - Problem identification

(S3) Critical thinking and problem solving - Evaluation

(S4) Critical thinking and problem solving - Creative thinking

(S5) Numeracy/computational skills - Problem solving


Syllabus

 

Study of standard computational (including parallel) models, algorithmic methods, solutions and methods of analysis used in theory of algorithms and experimental algorithmics. This includes critical study of exemplar algorithmic problems including sorting, pattern matching, and others. [3 weeks]

Study of time, space and communication efficient algorithms and data structures for large centralised and distributed environments. This includes studies on respective solutions for peer-to-peer systems, crowdsourcing, data compression, security and others. [2 weeks]

Study of novel computational models motivated by new challenges in streaming of large data, memory caching, external memory computations, dynamic networks, and others. [2 weeks]

Study of more advanced applied algorithms used in networks (e.g., communication, random walks, significance, clustering), property/groups testing, error correction, visualisation and others. [3weeks]


Teaching and Learning Strategies

Teaching Method 1 - Lecture
Description:
Attendance Recorded: Not yet decided

Teaching Method 2 - Tutorial
Description:
Attendance Recorded: Not yet decided


Teaching Schedule

  Lectures Seminars Tutorials Lab Practicals Fieldwork Placement Other TOTAL
Study Hours 30

  10

      40
Timetable (if known)              
Private Study 110
TOTAL HOURS 150

Assessment

EXAM Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
Written Exam There is a resit opportunity. Standard UoL penalty applies for late submission. This is an anonymous assessment. Assessment Schedule (When) :Semester 2  150 minutes.    75       
CONTINUOUS Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
Programming exercise 3 There is a resit opportunity. Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :Semester 2  Each CA requiring 5-         
Programming exercise 2 There is a resit opportunity. Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :Semester 2  Each CA requiring 5-         
Programming exercise 1 There is a resit opportunity. Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :Semester 2  Each CA requiring 5-         

Recommended Texts

Reading lists are managed at readinglists.liverpool.ac.uk. Click here to access the reading lists for this module.