2016/17 Undergraduate Module Catalogue
COMP1711 Procedural Programming
10 creditsClass Size: 175
Module manager: Dr Hamish Carr
Email: H.Carr@leeds.ac.ul
Taught: Semester 1 (Sep to Jan) View Timetable
Year running 2016/17
This module is not approved as a discovery module
Module summary
Learn how to develop a solution to a problem and design and implement its solution as a procedural program. Learn how to design robust code, debug to identify errors and test to ensure design requirements are met.Objectives
On completion of this module, students should be able to:-Develop an algorithmic solution to a problem
-Design and implement a simple procedural program that embodies an algorithm
-Understand data input/output and how programs make use of persistent storage
-Test and debug programs in a systematic way
Learning outcomes
On completion of the year/programme students should have provided evidence of being able to:
- demonstrate a familiarity with the basic concepts, information, practical competencies and techniques which are standard features of the discipline;
- be able to communicate the results of their work;
- present a structured and coherent simple argument;
- be able to interpret and evaluate the underlying concepts and principles of the discipline;
- demonstrate an ability to evaluate the appropriateness of different approaches to problem solving associated with the discipline;
- appreciate their strengths and weaknesses as learners;
- demonstrate computational thinking including its relevance to everyday life;
- operate computing equipment effectively, taking into account its logical and physical properties.
Skills outcomes
Computational thinking
Programming
Syllabus
-Concept and properties of algorithms
-Role of algorithms in the problem-solving process
-Programming language syntax and semantics
-Program compilation
-Concept of a data type
-Goals and limitations of static typing
-Variables and primitive data types
-Expressions and assignments
-Console and file I/O
-Conditional and iterative control structures
-Functions and parameter passing
-Concept of recursion
-Arrays
-Compound data types
-Strings and string processing
-Testing and debugging techniques
Teaching methods
| Delivery type | Number | Length hours | Student hours |
| Laboratory | 10 | 2.00 | 20.00 |
| Lecture | 20 | 1.00 | 20.00 |
| Private study hours | 60.00 | ||
| Total Contact hours | 40.00 | ||
| Total hours (100hr per 10 credits) | 100.00 | ||
Opportunities for Formative Feedback
Coursework assignments, in-class validation testsMethods of assessment
Coursework
| Assessment type | Notes | % of formal assessment |
| Assignment | Coursework | 5.00 |
| Assignment | Coursework | 5.00 |
| Assignment | Coursework | 10.00 |
| Assignment | Coursework | 20.00 |
| Assignment | Coursework | 20.00 |
| Assignment | Coursework | 20.00 |
| Assignment | Coursework | 20.00 |
| Total percentage (Assessment Coursework) | 100.00 | |
Resits will be assessed by the same methodology as the first attempt, unless otherwise stated.
Reading list
The reading list is available from the Library websiteLast updated: 01/03/2017
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