This module is inactive in the selected year. The information shown below is for the academic year that the module was last running in, prior to the year selected.

2014/15 Undergraduate Module Catalogue

COMP1551 Core Programming

40 creditsClass Size: 120

Module manager: Dr Andy Bulpitt
Email: a.j.bulpitt@leeds.ac.uk

Taught: Semesters 1 & 2 (Sep to Jun) View Timetable

Year running 2014/15

This module is not approved as a discovery module

Objectives

On completion of this module, students should be able to ...

-Analyse a problem and construct and test an algorithmic solution to the problem in pseudocode.

-Implement, test, debug and verify pseudocode solutions in standard imperative programming languages.

-Understand and use modular program construction, functional isolation, and recursion in solving larger algorithmic problems.

-Understand differences between programming languages, and criteria for matching languages to problems.

-Write and understand simple programs using languages from different language families.

-Design an object-oriented solution to a problem and implement it in a suitable language.

Skills outcomes
Construct and test algorithmic solutions in pseudocode.
Implement, test and debug solutions in standard imperative languages.

Syllabus

Algorithmic Problem Solving:
Problem-solving strategies; the role of algorithms for solving a problem; debugging strategies; use of pseudocode;
Fundamental Constructs:
Basic syntax and semantics of a higher-level language; Variables, types, expressions, and assignment; Simple I/O; Conditional and iterative control structures; Functions and parameter passing; Structured decomposition; Using libraries

Data structures:
Representation of numeric data; Range, precision, and rounding errors; Arrays; Representation of character data; Strings and string processing; Runtime storage management; Pointers and references; Linked structures; Stacks, Queues, Hash tables; Graphs and Trees; Strategies for choosing the right data structure.

Recursion:
The concept of recursion; Simple recursive functions;
Object Oriented programming:
Object-oriented design; Encapsulation and information-hiding; Classes and subclasses; Inheritance; Polymorphism

Compilers and interpreters
Integrated development environments
Strategies and tools for testing
Debugging tools

Teaching methods

Delivery type	Number	Length hours	Student hours
Lectures	44	1.00	44.00
Class tests, exams and assessment	1	3.00	3.00
Class tests, exams and assessment	4	1.00	4.00
Practical	20	2.00	40.00
Tutorial	22	2.00	44.00
Private study hours			265.00
Total Contact hours			135.00
Total hours (100hr per 10 credits)			400.00

Private study

lectures: 44 hours
tutorials: 14 hours
labs: 36 hours (9 x 2 hr sessions per semester)
exam: 2 hours
exam prep: 10 hours
coursework: 84 hours (12, 24, 24, 24)

Opportunities for Formative Feedback

Progress is monitored through
Class tests, formative and summative coursework and lab sessions

Methods of assessment

Coursework

Assessment type	Notes	% of formal assessment
Computer Exercise	Exercise 1	5.00
Computer Exercise	Exercise 2	5.00
Computer Exercise	Exercise 3	20.00
Computer Exercise	Exercise 4	10.00
Computer Exercise	Exercise 5	20.00
Total percentage (Assessment Coursework)		60.00

Resit will be by examination and limited to one piece of coursework.

Exams

Exam type	Exam duration	% of formal assessment
Open Book exam	2 hr 00 mins	40.00
Total percentage (Assessment Exams)		40.00

Normally resits will be assessed by the same methodology as the first attempt, unless otherwise stated

Reading list

There is no reading list for this module

Last updated: 06/05/2015

Disclaimer

Browse Other Catalogues

• Undergraduate module catalogue
• Taught Postgraduate module catalogue
• Undergraduate programme catalogue
• Taught Postgraduate programme catalogue

Errors, omissions, failed links etc should be notified to the Catalogue Team.PROD