COMP1210

Course Title: 
Mathematics for Computing
Credits: 
3
Educational Level: 
I
Semester offered: 
I & II
Associated Programme: 
B.Sc. CS; B.Sc. IT
Core Course: 
yes
Course Aims: 

Discrete structures include important material from such areas as set theory, logic, graph theory, and combinatorics. This material is foundational for computing. This course includes a body of material of a mathematical nature that computer science and information technology education must include. The course material forms the basis of knowledge necessary for specialization in computing.

Syllabus: 
  • Propositional logic
  • Logical connectives
  • Truth tables
  • Normal forms (conjunctive and disjunctive)
  • Validity
  • Predicate logic
  • Universal and existential quantification
  • Modus ponens and modus tollens
  • Limitations of predicate logic
  • Functions (surjections, injections, inverses, composition)
  • Relations (reflexivity, symmetry, transitivity, equivalence relations)
  • Sets (Venn diagrams, complements, Cartesian products, power sets)
  • Pigeonhole principle
  • Cardinality and countability
  • Finite probability space, probability measure, events
  • Conditional probability, independence
  • Trees
  • Undirected graphs
  • Directed graphs
  • Spanning trees/forests
Course Assessment: 
  • Final Exam (2-hours long)     60%
  • Coursework
    • 3 assignments/quizzes     30% (10% each)
    • 1 in-course test, 1-hour long   10%

Students will be required to pass both the coursework and the final examination to pass the course.

Course Prerequisites: 

CSEC Mathematics