Piazza will be used to answer student queries. Peer assessment will also be carried out in tutorial sessions. Sample answers are also given for students to compare their own homework answers. Programme Level Learning and Teaching Hours 4,ĭirected Learning and Independent Learning HoursĤ0% for weekly quizzes and engagement activitiesĦ0% for two class tests (30% each, one after each of the two blocks)įeedback is given weekly in tutorials, when students can discuss their solutions to homework questions. Learning and Teaching activities (Further Info) A previous computer science course is recommended.Īcademic year 2020/21, Available to all students (SV1) Visiting students should have done a previous University-level mathematics course, be comfortable with univariate calculus (differentiation and integration), and have some familiarity with basic concepts from discrete mathematics such as binary numbers, sets, functions, and relations. Information for Visiting Students Pre-requisites Probability (MATH08066) AND Proofs and Problem Solving (MATH08059) Informatics 1 - Introduction to Computation (INFR08025) AND Calculus and its Applications (MATH08058) It is RECOMMENDED that students have passed Introduction to Linear Algebra (MATH08057) Common discrete and continuous distributions (e.g., Bernoulli, binomial, Poisson, uniform, exponential, normal)Įntry Requirements (not applicable to Visiting Students) Pre-requisites Random variables, expectation, variance, covariance Joint and conditional probability, independence, chain rule, law of total probability, Bayes' Theorem Axioms of probability, sample space, events, De Morgan's Law Counting techniques: product rule, permutations, combinations Modular arithmetic, primes, greatest common divisors and their applications Sequences, sums and products, Induction and Recursion Set theory, properties of functions and relations, cardinality Methods of proof using properties of integers, rational numbers and divisibility Logical equivalences, conditional statements, predicates and quantifiers The course will cover roughly the following topics: *This course replaces "Discrete Mathematics and Mathematical Reasoning" (INFR08023). The second part of this course covers discrete and continuous probability theory, including standard definitions and commonly used distributions and their applications. The first part of this course covers fundamental topics in discrete mathematics that underlie many areas of computer science and presents standard mathematical reasoning and proof techniques such as proof by induction.
![basic number theory outcome from discrete mathematics basic number theory outcome from discrete mathematics](https://static.docsity.com/documents_first_pages/2009/07/31/ed649ecdf4719b48c533fb098cc93eac.png)
![basic number theory outcome from discrete mathematics basic number theory outcome from discrete mathematics](https://miro.medium.com/max/1200/1*8kZDZyD5OBuUnV-8Jj8lpg.jpeg)
Undergraduate Course: Discrete Mathematics and Probability (INFR08031) Course Outline School DRPS : Course Catalogue : School of Informatics : Informatics