CS2DANU: Data Structures and Algorithms

Module code: CS2DANU

Module provider: Computer Science; School of Mathematical, Physical and Computational Sciences

Credits: 20

Level: Level 2 (Intermediate)

When you'll be taught: Semester 1

Module convenor: Professor Xia Hong, email: x.hong@reading.ac.uk

NUIST module lead: Chuande Liu, email: liuchuande@nuist.edu.cn

Pre-requisite module(s):

Co-requisite module(s):

Pre-requisite or Co-requisite module(s):

Module(s) excluded:

Placement information: NA

Academic year: 2024/5

Available to visiting students: No

Talis reading list: No

Last updated: 21 May 2024

Overview

Module aims and purpose

This module introduces fundamental data structures and algorithm design strategies that are common to many concrete applications of computer science. Data Structures and Algorithms are two essential parts of computerprogramming. The algorithms introduced in this module provide an appreciation of the concepts involved in the design and analysis of algorithms.     

Students will also be able to demonstrate their abilities in: 

• team-working and communication; 
• critical thinking to solve a large problem integrating components of data structures, algorithm development and implementation; and 
• professional and effective writing for algorithm development and software implementation. 

Module learning outcomes

By the end of the module, it is expected that students will be able to: 

1. Understand common data structures in Computer Science; 
2. Identify the fundamental strategies that are appropriate to solve a given problem;  
3. Analyse a given algorithm and assess its efficiency;and  
4. Demonstrate a deeper understanding of course by implementing a selection of the algorithms to a specific task. 

Module content

The module covers the following topics: 

• Data structure (trees, heap, graph) 
• Divide and Conquer (General method, Analysis, examples - Sorting, Convex Hull, Matrix Multiplication) 
• The Greedy method (General method, Analysis, examples - Shortest Paths, Spanning Trees) 
• Dynamic Programming (General method, Analysis, Travelling salesperson, Transitive Closure) 

Structure

Teaching and learning methods

The lectures will introduce students the theories, concepts and underpinning principles specified in the indicative content. Students will be supervised in the practical sessions to apply the concepts and principles to a given problem context and develop a technical solution.  

The lectures and practical sessions will enable students to apply the techniques of data structure and algorithms to solve a given problem, by demonstrating using programming, analysis and report writing. 

There will also be learning materials in digital forms when they are required to support learning.  

There are two types of assessment (i.e. formative assessment and summative assessment) which will support and reinforce students’ learning. Formative assessment is carried out through weekly learning activities. Summative assessment consists of one piece of written coursework assignment which requires students to demonstrate both individual and group achievements. Appropriate feedback will be timely communicated with students for enhancing learning.  

Study hours

At least 44 hours of scheduled teaching and learning activities will be delivered in person, with the remaining hours for scheduled and self-scheduled teaching and learning activities delivered either in person or online. You will receive further details about how these hours will be delivered before the start of the module.

Please note the independent study hours above are notional numbers of hours; each student will approach studying in different ways. We would advise you to reflect on your learning and the number of hours you are allocating to these tasks.

Semester 1 The hours in this column may include hours during the Christmas holiday period.

Semester 2 The hours in this column may include hours during the Easter holiday period.

Summer The hours in this column will take place during the summer holidays and may be at the start and/or end of the module.

Assessment

Requirements for a pass

Students need to achieve an overall module mark of 40% to pass this module.

Summative assessment

Penalties for late submission of summative assessment

The Support Centres will apply the following penalties for work submitted late:

Assessments with numerical marks

• where the piece of work is submitted after the original deadline (or any formally agreed extension to the deadline): 10% of the total marks available for that piece of work will be deducted from the mark for each working day (or part thereof) following the deadline up to a total of three working days;
• the mark awarded due to the imposition of the penalty shall not fall below the threshold pass mark, namely 40% in the case of modules at Levels 4-6 (i.e. undergraduate modules for Parts 1-3) and 50% in the case of Level 7 modules offered as part of an Integrated Masters or taught postgraduate degree programme;
• where the piece of work is awarded a mark below the threshold pass mark prior to any penalty being imposed, and is submitted up to three working days after the original deadline (or any formally agreed extension to the deadline), no penalty shall be imposed;
• where the piece of work is submitted more than three working days after the original deadline (or any formally agreed extension to the deadline): a mark of zero will be recorded.

Assessments marked Pass/Fail

• where the piece of work is submitted within three working days of the deadline (or any formally agreed extension of the deadline): no penalty will be applied;
• where the piece of work is submitted more than three working days after the original deadline (or any formally agreed extension of the deadline): a grade of Fail will be awarded.

The University policy statement on penalties for late submission can be found at: https://www.reading.ac.uk/cqsd/-/media/project/functions/cqsd/documents/qap/penaltiesforlatesubmission.pdf

You are strongly advised to ensure that coursework is submitted by the relevant deadline. You should note that it is advisable to submit work in an unfinished state rather than to fail to submit any work.

Formative assessment

Formative assessment is any task or activity which creates feedback (or feedforward) for you about your learning, but which does not contribute towards your overall module mark.

Each topic in a week has defined learning tasks which will enable students to self-reflect on the learning.   

Outcomes of the formative assessment for each topic may be given in the guidance tutorial notes, online tests feedback. 

Basic algorithms will be presented in pseudo codes and/or in executable codes (e.g., Python) towards weekly studies.  

Reassessment

Additional costs