CSC-20037 - Programming II - Data Structures and Algorithms
Coordinator: Charles R Day Room: CR110 Tel: +44 1782 7 33411
Lecture Time: See Timetable...
Level: Level 5
Credits: 15
Study Hours: 150
School Office: 01782 733075

Programme/Approved Electives for 2022/23

None

Available as a Free Standing Elective

No

Co-requisites

None

Prerequisites

CSC-10024 Programming I - Programming Fundamental (or equivalent experience)



Barred Combinations

None

Description for 2022/23

In this module students learn about the important properties of some data structures and algorithms that are of foundational importance to modern computer science and IT. As they do so, there is ample opportunity to develop and practice their general purpose computer programming skills so that in the future they are able to develop their own software solutions to straightforward problems.

Aims
To develop new programming skills as part of an exploration of several important data structures and algorithms used in Computer Science.

Intended Learning Outcomes

Outline important features of computer programming using an object oriented programming language: 1
Explain and evaluate the principles and operation of several data structures that are widely used in computer science: 1
Differentiate programming language features that can be used to operate, test and evaluate one or more of the widely used computer science data structures: 1
Select class, data and control structures for program-based problem-solving: 1

Study hours

22 hours lectures
17 hours practical lab classes
2 hours class test
109 hours self study and assignment preparation

School Rules

CSC-10024 Programming I - Programming Fundamental (or equivalent experience)

Description of Module Assessment

1: Class Test weighted 100%
2-hour class test
Students will undertake a 2-hour class test covering important features of object- oriented computer programming for implementing graphical user interfaces and fundamental computer science data and control structures. The test will also address asymptotic analyses of selected algorithms for important computer science problems (e.g. searching and sorting) and data structure operations. The test will take place towards the end of the module.