2026/27 · Official catalogue edition
The effective term printed in this PDF is Semester A 2026/27。
Offering details for 2026/27 have not been checked. Confirm available sections in AIMS before registering.
What you will study
- Course overview
- This course is aimed at providing students with an understanding of the basic mathematical and fundamental concepts required for Foundations of Digital Techniques.
Official PDF, page 2 · Abstract
- Course content
- Numbers Number Systems: Integers, rational numbers, real numbers; Number representation methods: signed and unsigned binary numbers, hexadecimal, binary coded decimal, fixed-point numbers, floating-point numbers; binary arithmetic, floating- point arithmetic. Sets Sets, subsets, cardinality, set operations: union, intersection, complement; Venn diagrams, Cartesian product, power sets. Logic Logic connectives, truth tables, conditionals, necessary and sufficient conditions, validity and soundness of arguments, rules of inference, universal and existential quantifiers, nested quantification, De Morgan's Laws, logic gates, simple logic circuits. Functions Definition of functions, injection, surjection, bijection, inverse functions, composition of functions; polynomial and rational functions, exponential and logarithmic functions, graphs of functions, growth of functions, big-O notation. Methods of Proof Direct proof methods, counter-examples, indirect proof methods: contradiction and contraposition, mathematical induction. Sequences and Series Explicit formula for sequences, summation and product notation, arithmetic series, geometric series, recursive definition of sequences, solving simple recurrence relations. Counting Combination, permutation, the Binomial Theorem, the inclusion-exclusion principle, the pigeon-hole principle.
Official PDF, page 5 · Keyword Syllabus
- Keyword syllabus
- Numbers Number Systems: Integers, rational numbers, real numbers; Number representation methods: signed and unsigned binary numbers, hexadecimal, binary coded decimal, fixed-point numbers, floating-point numbers; binary arithmetic, floating- point arithmetic. Sets Sets, subsets, cardinality, set operations: union, intersection, complement; Venn diagrams, Cartesian product, power sets. Logic Logic connectives, truth tables, conditionals, necessary and sufficient conditions, validity and soundness of arguments, rules of inference, universal and existential quantifiers, nested quantification, De Morgan's Laws, logic gates, simple logic circuits. Functions Definition of functions, injection, surjection, bijection, inverse functions, composition of functions; polynomial and rational functions, exponential and logarithmic functions, graphs of functions, growth of functions, big-O notation. Methods of Proof Direct proof methods, counter-examples, indirect proof methods: contradiction and contraposition, mathematical induction. Sequences and Series Explicit formula for sequences, summation and product notation, arithmetic series, geometric series, recursive definition of sequences, solving simple recurrence relations. Counting Combination, permutation, the Binomial Theorem, the inclusion-exclusion principle, the pigeon-hole principle.
Official PDF, page 5 · Keyword Syllabus
- Intended learning outcomes
View learning outcomes
CILO Intended learning outcome Weight DEC 1 Explain abstract mathematical concepts (e.g., logic, sets, and functions) fundamental to digital technologies. — DEC-A1, DEC-A2 2 Apply inference rules and/or methods of proof to determine and demonstrate the truth or falsity of propositions. — DEC-A1, DEC-A2 3 Describe how numbers are represented in binary form and demonstrate how digital systems perform arithmetic operations. — DEC-A1, DEC-A2 4 Apply combinatorial methods to solve counting problems. — DEC-A1, DEC-A2 5 Implement simple combinatorial logic circuits. — DEC-A1, DEC-A2 Original table and definitions
Course Intended Learning Outcomes (CILOs) CILOs Weighting (if DEC-A1 DEC-A2 DEC-A3 app.) 1 Explain abstract mathematical concepts (e.g., x x logic, sets, and functions) fundamental to digital technologies. 2 Apply inference rules and/or methods of proof x x to determine and demonstrate the truth or falsity of propositions. 3 Describe how numbers are represented in x x binary form and demonstrate how digital systems perform arithmetic operations. 4 Apply combinatorial methods to solve counting x x problems. 5 Implement simple combinatorial logic circuits. x x A1: Attitude Develop an attitude of discovery/innovation/creativity, as demonstrated by students possessing a strong sense of curiosity, asking questions actively, challenging assumptions or engaging in inquiry together with teachers. A2: Ability Develop the ability/skill needed to discover/innovate/create, as demonstrated by students possessing critical thinking skills to assess ideas, acquiring research skills, synthesizing knowledge across disciplines or applying academic knowledge to real-life problems. A3: Accomplishments Demonstrate accomplishment of discovery/innovation/creativity through producing /constructing creative works/new artefacts, effective solutions to real-life problems or new processes.Official PDF, page 2 · Course Intended Learning Outcomes (CILOs)
Official PDF, page 2 · Course Intended Learning Outcomes (CILOs)
Before you take this course
Check prerequisites, precursors and corequisites separately, together with equivalence and exclusion conditions. “and” means conditions must be met together; “or” marks alternatives. Read combined conditions in the groupings shown in the original text below.
- Prerequisites
- Nil
- Precursors
- Nil
- Corequisites
- This edition of the official syllabus does not state this item.
- Additional course requirements
- This edition of the official syllabus does not state this item.
- Equivalent courses and conditions
- Nil
- Exclusive courses and conditions
- Nil
Assessment and passing the course
- Assessment
- Continuous assessment: 30%; Examination: 70%; Examination duration: 2 hours
Assessment breakdown
Assessment task Weight Generative AI Remarks and restrictions TestsCILO 1, 2, 3, 4 20% No - AssignmentsCILO 1, 2, 3, 4 5% Yes - Lab Exercises/ReportsCILO 5 5% Yes - Official PDF, pages 2–3 · Assessment Tasks / Activities (ATs)
View the original assessment table and instructions
Assessment Tasks / Activities (ATs) ATs CILO No. Weighting (%) Remarks Allow Use of GenAI? 1 Tests (min.: 2) 1, 2, 3, 4 20 - No 2 #Assignments 1, 2, 3, 4 5 - Yes (min.: 3) 3 Lab Exercises/ 5 5 - Yes Reports Continuous Assessment (%) 30 Examination (%) 70 Examination Duration (Hours) 2 Minimum Continuous Assessment Passing Requirement (%) 30 Minimum Examination Passing Requirement (%) 30 Additional Information for ATs Remark: To pass the course, students are required to achieve at least 30% in the coursework and 30% in the examination. Also, 65% laboratory attendance rate must be obtained. # may include homework, tutorial exercise, project/mini-project, presentation, lab report 3 Lab Exercises/ 5 5 - Yes Reports - Passing requirements
- Remark: To pass the course, students are required to achieve at least 30% in the coursework and 30% in the examination. Also, 65% laboratory attendance rate must be obtained. # may include homework, tutorial exercise, project/mini-project, presentation, lab report
Credits, duration and edition details
- Title in this edition
- Foundations of Digital Techniques
- Credits in this edition
- 3
- Course duration
- One Semester
- Syllabus effective term
- Semester A 2026/27
- Levels printed in the syllabus
- B1, B2, B3, B4 - Bachelor's Degree
Check the official document
Read or download this edition through the university link below. EE1001 · Open the original university PDF ↗
Source · University course information ↗ · Checked 2026-10-18