Module

The module is designed to provide students who have not studied A level Mathematics with sufficient understanding of basic algebra to give them confidence to embark on the study of computing fundamentals. Various topics in discrete and continuous mathematics which are fundamental to Computer Science will be introduced.

Teaching Resources:
Library Resources:

Submission:

Written coursework should be submitted by following the standard CMP practice. Students are advised to refer to the Guidelines and Hints on Written Work in CMP.

Deadlines:

If coursework is handed in after the deadline day or an agreed extension:

Work submitted	Marks deducted
After 15:00 on the due date and before 15:00 on the day following the due date	10 marks
After 15:00 on the second day after the due date and before 15:00 on the third day after the due date	20 marks
After 15:00 on the third day after the due date and before 15:00 on the 20th day after the due date.	All the marks the work merits if submitted on time (ie no marks awarded)
After 20 working days	Work will not be marked and a mark of zero will be entered

Saturdays and Sundays will NOT be taken into account for the purposes of calculation of marks deducted.

All extension requests will be managed through the LTS Hub. A request for an extension to a deadline for the submission of work for assessment should be submitted by the student to the appropriate Learning and Teaching Service Hub, prior to the deadline, on a University Extension Request Form accompanied by appropriate evidence. Extension requests will be considered by the appropriate Learning and Teaching Service Manager in those instances where (a) acceptable extenuating circumstances exist and (b) the request is submitted before the deadline. All other cases will be considered by a Coursework Coordinator in CMP.

For more details, including how to apply for an extension due to extenuating circumstances download Submission for Work Assessment (PDF, 39KB)

Note: As electronic tests are generated randomly, missed tests will be treated in a similar way to coursework.
 

Plagiarism:

Plagiarism is the copying or close paraphrasing of published or unpublished work, including    the work of another student; without due acknowledgement. Plagiarism is regarded a serious offence by the University, and all cases will be investigated. Possible consequences of plagiarism include deduction of marks and disciplinary action, as detailed by UEA's Policy on Plagiarism and Collusion.

Module Objectives:
Learning Outcomes:

On completion of this module students should be able to:
 

• Use algebraic manipulation confidently and correctly.
• Confidently use logarithmic and exponential functions.
• Understand and use arithmetic and geometric sequences and series.
• Understand the basic concept of limit, derivative and integral.
• Understand and use basic probability.
• Understand linear algebra and use of it to solve systems of equations.

Teaching Approach:

The material covered in this module will cover the topics listed below, although this should be taken as an indicative description of the syllabus which may be modified; it is not intended to reflect a detailed presentation order.

There will be 2 one-hour lectures a week and one workshop every fortnight. The lectures are used to motivate the topics and give a general overview as well as the vehicle for detailed explanations of the techniques. Workshops will be used to apply those techniques to a variety of problems.

Lectures: 23, hours: 46, Content (with provisional weekly schedule)

1. Introduction: Introduction to the unit. The AiM system and MapleTA; Importance of Maths in computing science: illustration with sorting (bubble sort and merge sort) using human (student) cells;
2. Fractions.
3. Algebra: Powers, polynomials.
4. Linear and quadratic equations. Inequalities;
5. Definition of a function of one variable, and its graph
6. Logarithmic, Polynomial and Exponential functions; The binomial theorem (note: important for derivative of polynomials)
7. Elementary Calculus: Limit.
8. Slope of a tangent to a curve;
9. Definition of the derivative. Interpretation as instantaneous rate of change
10. Derivative of polynomials.
11. Application: Newton method for finding square root, cubic roots.;
12. Antiderivative (indefinite integral), area under a curve, definititve integral ( all illustrated with polynomials)
13. Sequences and Series: Motivation using merge sort;
14. Sequences (in particular arithmetic and geometric.);
15. Recurrence relations as specification of sequences. Solving a recurrence relation by guessing the result using merge sort as example; Series (in particular arithmetic and geometric.); Comparison of merge sort and bubble sort.
16. Basic Discrete Probability: Sets: universe, union, intersection, difference, complement (very simple as more is seen in CMPCF102);
17. Probability: sample space, events, combining events, probability rules, equally likely events, permutations, combinations, examples.
18. Conditional probability, Bayes theorem, independence;
19. Random variable, Expectation, Variance
20. Linear algebra/Vectors: Matrices and vectors;
21. Operations on vectors and matrices.
22. Transformations in terms of matrices;
23. Elementary row/column operations. Gaussian elimination.  

Workshops: 10, hours: 10, Content (with provisional weekly schedule)
 2 to 11 Exercise sheet on the topic lectured on, in the preceeding week.

Laboratory Work: 0 hours  

Tutorials: 9, hours: 9, Content (with provisional weekly schedule) 3 to 11 an additional 1 hour support tutorial

Method of Assessment:

Students will be assessed by electronic tests using the MapleTA system.

They will have to take 5 tests in their own time. These tests are each worth 8 percent of the overall mark for the unit. They will be made available from noon on Wednesday to noon on Thursday.

In addition an Maple TA test in exam condition will take place in week 12. This test will be worth 60 percent of the overall mark for the unit.