THE UNIVERSITY of EDINBURGH

DEGREE REGULATIONS & PROGRAMMES OF STUDY 2011/2012
- ARCHIVE for reference only
THIS PAGE IS OUT OF DATE

University Homepage
DRPS Homepage
DRPS Search
DRPS Contact
DRPS : Course Catalogue : School of Mathematics : Mathematics

Undergraduate Course: Mathematics for Informatics 3b (MATH08043)

Course Outline
SchoolSchool of Mathematics CollegeCollege of Science and Engineering
Course typeStandard AvailabilityAvailable to all students
Credit level (Normal year taken)SCQF Level 8 (Year 2 Undergraduate) Credits10
Home subject areaMathematics Other subject areaMathematics for Informatics
Course website https://info.maths.ed.ac.uk/teaching.html Taught in Gaelic?No
Course descriptionEnumeration and functions, graph theory.
Entry Requirements (not applicable to Visiting Students)
Pre-requisites Students MUST have passed: Mathematics for Informatics 2a (MINF08002)
Co-requisites
Prohibited Combinations Students MUST NOT also be taking Discrete Mathematics (Year 2) (MATH08010) OR Discrete Mathematics (Year 3) (MATH09001)
Other requirements None
Additional Costs None
Information for Visiting Students
Pre-requisitesNone
Displayed in Visiting Students Prospectus?Yes
Course Delivery Information
Delivery period: 2011/12 Semester 1, Available to all students (SV1) WebCT enabled:  Yes Quota:  None
Location Activity Description Weeks Monday Tuesday Wednesday Thursday Friday
CentralLectureAppleton Th 21-11 12:10 - 13:00
CentralLectureAppleton Th 21-11 12:10 - 13:00
First Class Week 1, Monday, 12:10 - 13:00, Zone: Central. Appleton Tower, Th 2
Additional information Tutorials: Tu at 1110 or 1210
Exam Information
Exam Diet Paper Name Hours:Minutes
Main Exam Diet S1 (December)Mathematics for Informatics 3b1:30
Resit Exam Diet (August)1:30
Summary of Intended Learning Outcomes
1. Discuss and apply combinatorial properties of sets as well as objects constructed from them (e.g., pigeonhole principle, number of functions of a certain type between two finite sets).
2. Relate the study and properties of graphs to computational applications.
3. Discuss, apply and prove the correctness of various algorithms and results on graphs.
4. Discuss the application of appropriate algebraic operations to properties of graphs as well as the extension of applications by suitable interpretation of algebraic operations (various interpretations of matrix multiplication).
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
Keywordsmi3b
Contacts
Course organiserProf Andrew Ranicki
Tel: (0131 6)50 5073
Email: A.Ranicki@ed.ac.uk
Course secretaryMrs Joy Clark
Tel: (0131 6)50 5059
Email: joy.clark@ed.ac.uk
Navigation
Help & Information
Home
Introduction
Glossary
Search DPTs and Courses
Regulations
Regulations
Degree Programmes
Introduction
Browse DPTs
Courses
Introduction
Humanities and Social Science
Science and Engineering
Medicine and Veterinary Medicine
Other Information
Timetab
Prospectuses
Important Information
 
© Copyright 2011 The University of Edinburgh - 16 January 2012 6:23 am