Discrete Maths for Computer Scientists
Instructor: Melisa ÇOPUR - UAA'20
Computer Science, University College London in London - UK
Embedded Files
Course Description
Course Description
The first part of the course will focus on foundational discrete mathematics, including but not necessarily limited to: functions and relations, permutations, group theory, set theory, cardinalities, diagonalisation, linear algebra and combinatorics. The module continues with mathematical reasoning, logical notation and proof by mathematical induction.
Course Details
Course Details
Class size: Max 10
Class size: Max 10
Prerequisites: Interest in maths
Prerequisites: Interest in maths
Course Goals:
Understand the foundations of mathematics and logic that will help computer science knowledge.
Identify and reason with the logical content of arguments.
Course Outline:
Week 1: Set Theory, Functions and Permutations
Week 2: Binary Relations and Groups
Week 3: Euclidian Algorithm
Week 4: Linear Algebra
Page updated
Report abuse