Programming - 2019 entry

We use computers in almost all aspects of our daily lives and throughout science, so it is easy to take them for granted. However, in order that we can use computers to solve new problems and create new things, we have to be able to program them. This module introduces you to programming and problem solving with a computer.  You will learn how to formulate an algorithm to solve a problem, and you will acquire the skills to write, test and debug programs.

This module is an introductory course in computer programming and will introduce you to the fundamental concepts of computer algorithms and programming, with a strong emphasis on practical implementation. You will also learn how to apply analytical and problem-solving skills to the design and implementation of small applications.

On successful completion of this module, you should be able to:

Module Specific Skills and Knowledge:

1 design an algorithm, using sequence, iteration and selection;

2 write, compile, test, and debug a computer program;

3 explain how a program written in a procedural language is translated into a form that allows it to be executed on a computer;

4 systematically test your programs;

5 document software to accepted standards;

6 design an algorithm, using a divide and conquer strategy;

7 demonstrate familiarity with basic numerical and discrete algorithms;

Discipline Specific Skills and Knowledge:

9 systematically break down a problem into its components;

10 understand and choose appropriate programming techniques.

Personal and Key Transferable/ Employment Skills and Knowledge:

11 analyse a problem and synthesise a solution;

12 use technical manuals and books to interpret specifications and technical errors.
 

Problem solving and programming overview: algorithms, flow charts; pseudo-code; compilers and interpreters;

Python as a language: statements, comments and simple arithmetic operations;

variables, and data types;

functions: encapsulation and abstraction; arguments and return values; namespaces and scope;

sequences and iteration: lists, loops, nested loops; accumulation as a programming idiom;

flow control: conditional expressions, while loops; searching by bisection and bracketing;

integer and floating point representation; numerical precision;

mutable and immutable variables, and sequences: tuples, lists and strings;

simulation: pseudo-random numbers;

larger programs; encapsulation and program organisation;

input/output and exceptions;

recursion: divide and conquer algorithms; memoisation;

associative arrays, hashing and dictionaries;

basic functional programming constructions: map, filter, reduce, anonymous functions;

searching and sorting: linear search versus bisection; insertion sort, bubble sort, merge sort.
 

Students failing the module will be required to take both elements of the re-assessment.

Web based and Electronic Resources:

ELE: http://vle.exeter.ac.uk

Think Python website: http://www.greenteapress.com/thinkpython/

Python language website: http://www.python.org

Reading list for this module: