Business and technology qualifications, Levels 3-6, in Brussels. Explore qualifications
Portal login
Level 4 Diploma in Cyber Security

Midterm evaluation

CYB402 · Mathematics for Computer Science — Midterm

CourseCYB402
Week8 of 16
SemesterI
TutorOnline in the course chat

This week’s topics

Midterm evaluation

  1. Midterm assessment of the criteria taught so far
  2. Individual feedback and targets

What you will be able to do

  • 1.1 Describe what is meant by binary representation.
  • 1.2 Explain how to change between bases.
  • 1.3 Explain how numbers are represented in binary.
  • 1.4 Evaluate the use of binary representation in the field of computer science.
  • 2.1 Describe a range of mathematical proof techniques.
  • 2.2 Describe the possible algebraic operations in set theory.
  • 2.3 Explain the key principles of (Boolean) propositional logic.
  • 2.4 Use truth tables to detail the possible outcomes of binary logical operators.
  • 2.5 Analyse the similarities between Boolean logical operators and Boolean algebra in set theory.
  • 2.6 Evaluate mathematical proof techniques and the circumstances under which they may be appropriate.

Activity

Midterm assessment task and individual feedback.

Study materials

The teaching notes, exercises and videos of this week are in the student portal. Your portal is set up as soon as you receive final acceptance, so you can open them before the semester starts.
Week 7Week 9
Course chat

Admitted students ask questions on this week’s page in the student portal: an AI assistant trained on the course answers first, and during the course’s timetabled classes Connect to your tutor brings your tutor into the chat, who may start a call if needed.

Open this week in the portal
Course plan
  • Week 1: Number bases: binary, denary and hexadecimal, and convertin…
  • Week 2: Binary in computer science: binary addition and overflow, t…
  • Week 3: Propositional logic: Boolean operators and truth tables
  • Week 4: Set theory: Venn diagrams, notation, union, intersection an…
  • Week 5: Proof techniques: induction and strong induction, contradic…
  • Week 6: Finite fields and modular arithmetic: algebras, identities …
  • Week 7: Number-theoretic theorems (Fermat's little theorem, Euler's…
  • Midterm: Midterm evaluation
  • Week 9: Sequences and series: arithmetic, geometric and harmonic pr…
  • Week 10: Vectors and matrices: matrix multiplication, inverses and s…
  • Week 11: Matrix types and properties (trace, determinant), LU decomp…
  • Week 12: Applying Mathematics for Computer Science in practice: case…
  • Week 13: Assignment workshop: research, planning and referencing
  • Week 14: Assignment workshop: drafting, feedback and improvement
  • Week 15: Review and coursework completion
  • Final: Final assessment and submission
Back to the course
Scroll