Undergraduate Course: Discrete Mathematics and Mathematical Reasoning (INFR08023)
Course Outline
School  School of Informatics 
College  College of Science and Engineering 
Credit level (Normal year taken)  SCQF Level 8 (Year 2 Undergraduate) 
Availability  Available to all students 
SCQF Credits  20 
ECTS Credits  10 
Summary  Discrete mathematics and formal mathematical reasoning. 
Course description 
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]

Information for Visiting Students
Prerequisites  None 
High Demand Course? 
Yes 
Course Delivery Information

Academic year 2016/17, Available to all students (SV1)

Quota: None 
Course Start 
Semester 1 
Timetable 
Timetable 
Learning and Teaching activities (Further Info) 
Total Hours:
200
(
Lecture Hours 30,
Seminar/Tutorial Hours 10,
Summative Assessment Hours 2,
Programme Level Learning and Teaching Hours 4,
Directed Learning and Independent Learning Hours
154 )

Assessment (Further Info) 
Written Exam
85 %,
Coursework
15 %,
Practical Exam
0 %

Additional Information (Assessment) 
You should expect to spend approximately 40 hours on the coursework for this course. 
Feedback 
Not entered 
Exam Information 
Exam Diet 
Paper Name 
Hours & Minutes 

Main Exam Diet S1 (December)   2:00   Resit Exam Diet (August)   2:00  
Learning Outcomes
On completion of this course, the student will be able to:
 Use of mathematical and logical notation to define and formally reason about mathematical concepts such as sets, relations, functions, and integers, and discrete structures, including proof by induction
 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
 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

Reading List
REQUIRED TEXTBOOK:
* Kenneth Rosen, Discrete Mathematics and its Applications, 7th Edition, McGrawHill, (due to be published in July), 2012. Alternatively, 6th Edition, 2007.
Additional Reference Material:
* MIT Mathematics for Computer Science Lecture notes (online) 
Contacts
Course organiser  Prof Colin Stirling
Tel: (0131 6)50 5186
Email: cps@inf.ed.ac.uk 
Course secretary  Ms Kendal Reid
Tel: (0131 6)50 5194
Email: kr@inf.ed.ac.uk 

