CS3511 Discrete MethodsCS3511 is broadly based onthe book "Discrete Mathematics and its Applications", by Kenneth H. Rosen (Fifth or Sixth Edition, McGraw-Hill, International Edition; available from Blackwell in Old Aberdeen). The course offers an overview of some of the main concepts and methods in Discrete Mathematics, with emphasis on issues of particular relevance for computing science. Topics include: propositional and predicate logic; proof methods (such as mathematical induction); sets, functions and relations (including structures such as posets); graphs and trees. In CS3511 we have can only study a small part of Rosen's book, but there is much else in the book that should be useful to you in the fourth year and in your later career.Assessed coursework has appeared on the Assessment page on 26 March 2009. Lecturer: Kees van Deemter
|
You can obtain a text only version of this page by following the link.
home | Lectures | Practicals | Assessment | Information |
|