CS103-F26 · Computer Science · Introductory
Discrete Structures
The mathematics of computer science: logic, proofs, sets, relations, functions, combinatorics and graphs.
TODO(owner): enrolment status and Moodle course URL
- Format
- TODO(owner): self-paced or cohort
- Duration
- TODO(owner): number of weeks
- Effort
- TODO(owner): hours per week
- Status
- Status: to be confirmed
- Prerequisites
- TODO(owner): prerequisites, or “none”
- Instructor
- Ali Khudiyev
- Language
- English
- Cost
- Free
About this course
TODO(owner): two or three short paragraphs — who the course is for, what it covers, and what you will be able to do by the end.
What you will learn
- TODO(owner): learning outcome
- TODO(owner): learning outcome
- TODO(owner): learning outcome
Syllabus
| Unit | Topics |
|---|---|
| 1 | TODO(owner) |
| 2 | TODO(owner) |
| 3 | TODO(owner) |
How it’s assessed
TODO(owner): exercises, quizzes, projects or exams, and how you get feedback on your work.
Materials & licence
Course materials are published under the Creative Commons Attribution-ShareAlike 4.0 licence unless stated otherwise. See Licence for details.
TODO(owner): list textbooks or other resources, and any third-party material published under a different licence.
Free. No application needed. New to Moodle? See How to join.