Undergraduate Course: Mathematics for Informatics 1a (MATH08046)
Course Outline
| School | School of Mathematics |
College | College of Science and Engineering |
| Course type | Standard |
Availability | Available to all students |
| Credit level (Normal year taken) | SCQF Level 8 (Year 1 Undergraduate) |
Credits | 10 |
| Home subject area | Mathematics |
Other subject area | Mathematics for Informatics |
| Course website |
https://info.maths.ed.ac.uk/teaching.html |
Taught in Gaelic? | No |
| Course description | *In 2011-12, this course is available only to students retaking it and will be assessed on an 'exam only' basis.*
Set theory, number theory, counting, basic probability and information theory. |
Information for Visiting Students
| Pre-requisites | None |
| Displayed in Visiting Students Prospectus? | No |
Course Delivery Information
|
| Delivery period: 2011/12 Semester 1, Available to all students (SV1)
|
WebCT enabled: No |
Quota: 0 |
| Location |
Activity |
Description |
Weeks |
Monday |
Tuesday |
Wednesday |
Thursday |
Friday |
| No Classes have been defined for this Course |
| First Class |
First class information not currently available |
| Additional information |
Tutorials: F at 1110 and 1210 |
| Exam Information |
| Exam Diet |
Paper Name |
Hours:Minutes |
|
|
| Main Exam Diet S1 (December) | Mathematics for Informatics 1a | 1:30 | | | | Resit Exam Diet (August) | | 1:30 | | |
Summary of Intended Learning Outcomes
1. Discuss as well as derive basic properties of sets and demonstrate various operations with examples.
2. Employ mathematical notation (such as sum and product) in calculations and chains of reasoning.
3. Describe Euclid's algorithm for greatest common divisors of integers and be able to apply it to simple examples.
4. Discuss and apply properties of congruences and relate them to computational applications, such as the RSA cryptosystem.
5. Discuss basic combinatorial properties of sets and employ the methods studied to derive combinatorial properties for related situations.
6. Discuss the methods and properties of probability for discrete spaces and apply them to related problems.
7. Presented with a calculation or proof to be able to discuss its correctness or otherwise.
8. Carry out derivations with appropriate justification as well as proofs for problems of a similar nature to those in the course.
9. To explain induction as a proof technique and be able to apply it to appropriate situations.
|
Assessment Information
| Coursework: 15%; Degree Examination: 85% |
Special Arrangements
| None |
Additional Information
| Academic description |
Not entered |
| Syllabus |
Not entered |
| Transferable skills |
Not entered |
| Reading list |
Not entered |
| Study Abroad |
Not entered |
| Study Pattern |
Not entered |
| Keywords | mi1a |
Contacts
| Course organiser | Dr Antony Maciocia
Tel: (0131 6)50 5994
Email: A.Maciocia@ed.ac.uk |
Course secretary | Mrs Joy Clark
Tel: (0131 6)50 5059
Email: joy.clark@ed.ac.uk |
|
© Copyright 2011 The University of Edinburgh - 16 January 2012 6:23 am
|
University Homepage