Module

Reference materials:

• Gersting,J.L., Mathematical Structures for Computer Science, Freeman
• Rosen,K., Discrete Mathematics and its Applications, McGrawHill
• Backhouse,R. C., Program Construction and Verification, Prentice-Hall 
• Cormen,T.H., Leiserson,C.E., Rivest,R.L., Stein,C., Introduction to Algorithms, MIT Press
• R. Johnsonbaugh, Discrete Mathematics, 5th edition, Prentice Hall

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:
 

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 provide students with mathematical foundation for the theoretical studies of program and algorithm design and implementation.
• To provide understanding of the issues arising in the design of correct and efficient programs

Transferrable skills:

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

On completion of this module students should be able to:

• Understand how form and meaning can be formally specified in the context of computer language
• Understand different models of computation.
• Understand performance issues and estimate performance of algorithms.
• Understand how to perform simple proof of correctness of program and test for invariance.

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 3 one-hour lectures and one workshop per week. 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.

Total hours: 43

Lectures: 11; hours 33; content (with provisional weekly schedule)

1. Language and grammar
2. Finite state machines and Tuning machines
3. Recurrence relations
4. Induction
5. Induction
6. Predicate logic and proofs
7. Predicate logic and proofs
8. Complexity analysis
9. Complexity analysis
10. Program verification
11. Profram verification

Worskshops:   10, hours 10, Content (with provisional weekly schedule)

2 to 11 Exercise sheet on the topic lectured on, in the preceding week.