THE UNIVERSITY of EDINBURGH

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

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

Undergraduate Course: Discrete Mathematics and Mathematical Reasoning (INFR08023)

Course Outline
SchoolSchool of Informatics CollegeCollege of Science and Engineering
Course typeStandard AvailabilityAvailable to all students
Credit level (Normal year taken)SCQF Level 8 (Year 2 Undergraduate) Credits20
Home subject areaInformatics Other subject areaNone
Course website http://www.inf.ed.ac.uk/teaching/courses/dmmr/ Taught in Gaelic?No
Course descriptionDiscrete mathematics and formal mathematical reasoning.
Entry Requirements (not applicable to Visiting Students)
Pre-requisites Students MUST have passed: Introduction to Linear Algebra (MATH08057)
It is RECOMMENDED that students have passed Informatics 1 - Functional Programming (INFR08013) AND Informatics 1 - Computation and Logic (INFR08012) AND Informatics 1 - Object-Oriented Programming (INFR08014) AND Informatics 1 - Data and Analysis (INFR08015) AND Calculus and its Applications (MATH08058)
Co-requisites
Prohibited Combinations Other requirements Higher Mathematics or A-level at Grade A, or equivalent
Additional Costs None
Information for Visiting Students
Pre-requisitesNone
Displayed in Visiting Students Prospectus?Yes
Course Delivery Information
Delivery period: 2012/13 Semester 1, Available to all students (SV1) Learn enabled:  No Quota:  None
Location Activity Description Weeks Monday Tuesday Wednesday Thursday Friday
CentralLecture1-11 17:10 - 18:00
CentralLecture1-11 11:10 - 12:00
CentralLecture1-11 17:10 - 18:00
First Class Week 1, Monday, 17:10 - 18:00, Zone: Central. Faculty Room South David Hume Tower
Exam Information
Exam Diet Paper Name Hours:Minutes
Main Exam Diet S1 (December)2:00
Summary of Intended Learning Outcomes
- Reason mathematically about basic (discrete) structures (such as numbers, sets, graphs, and trees)used in computer science.
- Use of mathematical and logical notation to define and formally reason about mathematical concepts such as sets, relations, functions, and integers, and discrete structures like trees, graphs, and partial orders;
- Evaluate elementary mathematical arguments and identify fallacious reasoning
- Construct inductive hypothesis and carry out simple induction proofs;
- Use graph theoretic models and data structures to model and solve some basic problems in Informatics (e.g., network connectivity, etc.)
- Prove elementary arithmetic and algebraic properties of the integers, and modular arithmetic, explain some of their basic applications in Informatics, e.g., to cryptography.
- Compare the asymptotic growth growth rates of basic functions; derive asymptotic bounds, and limits, for simple series and recurrence relations. Use these to derive bounds on the resource consumption (e.g., running time) of simple iterative and recursive algorithms.
- Calculate the number of possible outcomes of elementary combinatorial processes such as permutations and combinations.
- Be able to construct discrete probability distributions based on simple combinatorial processes, and to calculate the probabilities and expectations of simple events under such discrete distributions.
Assessment Information
Written Examination: 85%
Assessed Assignments: 15%
Special Arrangements
None
Additional Information
Academic description Not entered
Syllabus 1) Foundations (Chapters 1 & 2 of [Rosen])
2) Basic number systems, and rudimentary algorithms on numbers and matrices (Chapter 3, [Rosen])
3) Induction and Recursion (Chapter 4 [Rosen])
4) Basic Counting (Chapter 5 [Rosen])
5) Graphs (and binary relations): [Chapter 9, and parts of Chapter 8]]
6) Trees: (Chapter 10 [Rosen])
7) Discrete probability [Chapter 6, plus some supplementary material]
Transferable skills Not entered
Reading list REQUIRED TEXTBOOK:

* Kenneth Rosen, Discrete Mathematics and its Applications, 7th Edition, McGraw-Hill, (due to be published in July), 2012. Alternatively, 6th Edition, 2007.

Additional Reference Material:
* MIT Mathematics for Computer Science Lecture notes (online)
Study Abroad Not entered
Study Pattern Lectures 30
Tutorials 10
Timetabled Laboratories 0
Coursework Assessed for Credit 40
Other Coursework / Private Study 120
Total 200
KeywordsNot entered
Contacts
Course organiserProf Colin Stirling
Tel: (0131 6)50 5186
Email: cps@inf.ed.ac.uk
Course secretaryMs Kendal Reid
Tel: (0131 6)50 5194
Email: kr@inf.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 2012 The University of Edinburgh - 14 January 2013 4:08 am