Back to Module List

CMPC2F01 - FURTHER MATHEMATICS

Module Code:
CMPC2F01
Department:
Computing Sciences
Credit Value:
20
Level:
2
Organiser:
Prof Andy Day
This module is for those students who have passed CMPC1F3Y in their first year and would like to study further theory that is a pre-requisite for several other 2nd and 3rd level modules in CMP. For such students it provides an introduction to the mathematics of counting and arrangements, a further development of the theory and practice of calculus, an introduction to linear algebra and its computing applications and a further development of the principles and computing applications of probability theory. 3D Vectors and complex numbers are also studied.

This is the closest in level and scope to what we cover. Should be seen more as an aid than a strict unit text:

  • Gersting,J. L., Mathematical Structures for Computer Science, Freeman.
  • Lipschutz,S., Discrete Mathematics, McGraw-Hill.
  • Lipschutz,S., Probability, McGraw-Hill.
  • Mathews,J. H.,  Numerical Methods for Mathematics, Science and Engineering,, Prentice Hall.
  • Stroud,K.A., Engineering Mathematics

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)
 

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 specific:
  • To introduce the mathematics of counting and arrangements
  • To develop the theory and practice calculus
  • To introduce linear algebra and its applications
  • To develop principles and applications of probability theory
  • To introduce complex numbers

Transferable skills:

  • To gain knowledge in a range of mathematical skills that are relevant to various areas of computer science and its applications.
  • To develop a methodical approach to problem solving using mathematical techniques and theory.

On completion of this module students should be able to:

  • Solve problems that involve calculus
  • Understand linear algebra and its applications
  • Understand and use probability theory
  • Solve problems that involve permutations and combinations
  • Understand and use complex numbers

 

Syllabus:

The course consists of 2 hours of lectures per week together with a 2 hour exercise class per week.

Total Hours: 44

Lectures: 22, Content: (with provisional weekly schedule)

  1. Permutations and combinations (3 lectures)
    Combinations. Permutations. Combinations with repetition. Binomial theorem. Applications in computing.
  2. Sequences and series (3 lectures)
    APs, GPs, limits, tests for convergence, divergence.
  3. Calculus (4 lectures)
    Limits. Differentiation and integration, differential equations. Applications of differential and integral calculus.
  4. Probability (5 lectures)
    Independent events. Calculating probabilities over trees of events. Bayes' theorem. Random variables. Simple distributions. Independent random variables. Markov chains. Basic statistics.
  5. Linear algebra (4 lectures)
    Matrices and vectors. Operations on vectors and matrices. Transformations in terms of matrices. Elementary row operations. Determinants. Linear independence, Eigenvectors, applications in computing.
  6. Complex Numbers (2 lectures)
    Introduction, Addition and multiplication, Graphical representation, polar form, exponential form.

Workshops: 11; hours: 22; content:
Weekly workshops based on exercise sheets for that week's lectures

Laboratory work: 0 hours

 


This module is assessed by coursework (40%) and examination (60%).


Setting of coursework tests:

One test worth 40% of the total assessment will be given towards the end of the Autumn semester. Exercise sheets are set at the end of each week. These are to be attempted by the students before the following week's workshop. The final summer examination is worth 60% and will cover all topics covered during the year.