Course Information Package
|Course Unit Title||DISCRETE MATHEMATICS|
|Course Unit Code||ACSC191|
|Course Unit Details||BSc Computer Engineering (Required Courses) - BSc Computer Science (Required Courses) -|
|Number of ECTS credits allocated||5|
|Learning Outcomes of the course unit||By the end of the course, the students should be able to:|
|Mode of Delivery||Face-to-face|
|Recommended optional program components||NONE|
Mathematical logic: Propositional Algebra; Logical Operators; Basic logic Equivalences; Predicates; Quantifiers.
Proof Methods: Direct Proofs; Mathematical Induction; Contradiction and Contraposition.
Sets: Basic Definitions; Set operations; Venn diagrams; Set Identities
Relations and Functions: Relations; Equivalence Relations; Equivalence Classes; Definition and Properties of Functions; Inverse Functions; Composition of Functions.
Combinatorics: Basic counting principles; Permutations and Combinations.
Graph Theory: Terminology, Graph Representation and Isomorphism; Connectivity; Traversability; Eulerian graphs; Kruskall’s algorithm for finding Minimal Spanning Trees.
|Recommended and/or required reading:|
|Planned learning activities and teaching methods|
For the delivery of the class material, power point presentations are primarily used, along with the whiteboard. The lecture notes, consisting of slides presented in class, and additional material, are made available to the students through the course website and are complementary of the course textbooks. The theoretical part of each lecture is accompanied with detailed solved examples on which emphasis is given in the class. The solutions to these exercises, as well as specimen solutions for all tests and assignments, are discussed with students.
|Assessment methods and criteria|
|Language of instruction||English|