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 DATA STRUCTURES AND ALGORITHMS
Code COMP108
Coordinator Prof PW Wong
Computer Science
P.Wong@liverpool.ac.uk
Year CATS Level Semester CATS Value
Session 2017-18 Level 4 FHEQ Second Semester 15

Aims

1. To introduce the notation, terminology, and techniques underpinning the study of algorithms.
2. To introduce basic data structures and associated algorithms.
3. To introduce standard algorithmic design paradigms and efficient use of data structures employed in the development of efficient algorithmic solutions.


Learning Outcomes

Be able to describe the principles of and apply a variety of data structures and their associated algorithms;

Be able to describe standard algorithms, apply a given pseudo code algorithm in order to solve a given problem, and carry out simple asymptotic analyses of algorithms;

Be able to describe and apply different algorithm design principles and distinguish the differences between these principles;

Be able to choose and justify the use of appropriate data structures to enable efficient implementation of algorithms;


Syllabus

1.    Basics of algorithms (6 lectures)
a)    What is an algorithm, design of pseudo code algorithm, basic notion of asymptotics and worst case analysis of running time

2.    Basic data structures and associated algorithms (12 lectures)
a)    Arrays and linked lists
b)    Stacks and queues
c)    Trees and graphs
d)    Hash table

3.    Algorithmic design techniques and efficient use of data structures (18 lectures)
a)    Basic top down approach – searching and sorting
b)    Divide-and-conquer approach – searching and sorting
c)    Greedy approach – graph algorithms
d)    Dynamic programming approach


Teaching and Learning Strategies

Lecture -

Laboratory Work -


Teaching Schedule

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

    11

    47
Timetable (if known)              
Private Study 103
TOTAL HOURS 150

Assessment

EXAM Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
Unseen Written Exam  120  60  Yes  Standard UoL penalty applies  Written Exam Notes (applying to all assessments) 2 (sets of) assessment tasks This work is not marked anonymously. Written examination Resit exam will replace failed CA components, the Learning Outcomes will be covered in the resit exam. Practical assessment is employed for both formative assessment and summative assessment. Students will get short formative feedback on a weekly basis from the module demonstrators during tutorial / lab sessions. More detailed summative and formative feedback will be returned following assessment of the continuously assessed (CA) work. The Learning Outcomes will be demonstrated on appropriately selected examples in the assessments, therefore all of the assessments address the specified Learning Outcomes. 
CONTINUOUS Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
Coursework  20 hours expected  20  Yes  Standard UoL penalty applies  Assignment 1 
Coursework  20 hours expected  20  Yes  Standard UoL penalty applies  Assignment 2 

Recommended Texts

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