Undergraduate Course: Discrete Mathematics and Mathematical Reasoning (INFR08023)
|School||School of Informatics
||College||College of Science and Engineering
||Availability||Available to all students
|Credit level (Normal year taken)||SCQF Level 8 (Year 2 Undergraduate)
|Home subject area||Informatics
||Other subject area||None
||Taught in Gaelic?||No
|Course description||Discrete mathematics and formal mathematical reasoning.
Information for Visiting Students
|Displayed in Visiting Students Prospectus?||Yes
Course Delivery Information
|Delivery period: 2013/14 Semester 1, Available to all students (SV1)
||Learn enabled: Yes
|Course Start Date
|Breakdown of Learning and Teaching activities (Further Info)
Lecture Hours 30,
Seminar/Tutorial Hours 10,
Summative Assessment Hours 2,
Programme Level Learning and Teaching Hours 4,
Directed Learning and Independent Learning Hours
|Breakdown of Assessment Methods (Further Info)
||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.
|Written Examination: 85%|
Assessed Assignments: 15%
||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]
* 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)
Timetabled Laboratories 0
Coursework Assessed for Credit 40
Other Coursework / Private Study 120
|Course organiser||Prof Colin Stirling
Tel: (0131 6)50 5186
|Course secretary||Ms Kendal Reid
Tel: (0131 6)50 5194
© Copyright 2013 The University of Edinburgh - 13 January 2014 4:26 am