Mat1016 Applied-Discrete-Mathematical-Structures TH 1.1 47 Mat1016
Mat1016 Applied-Discrete-Mathematical-Structures TH 1.1 47 Mat1016
Mat1016 Applied-Discrete-Mathematical-Structures TH 1.1 47 Mat1016
3 2 0 0 4
Pre-requisite None Syllabus Version
1.1
Course Objectives:
1. The aim of this course is to motivate the learners for understanding the fundamental concepts in
discrete mathematics required for software engineering such as sets, functions, sequences,
computing techniques, mathematical logics, proof techniques, graph theoretical approaches,
relations, recurrence equations and new structured types.
2. On completion of this course, the students are expected to implement the learned discrete
mathematical ideas in realistic projects of software technology, theoretical computer skills,
computer algorithms, networks and data structures.
Operations on Sets and Cardinality – The Pigeonhole Principle – Sequences – The Characteristic Sequence
of a Subset – Counting – Number of k-Sequences on an n-Set – Number of k-Permutations on an n-Set –
Number of k-Subsets of an n-Set.
Boolean Expressions and Truth Tables – Predicates and Quantifiers – Valid Arguments – Direct and
Indirect Proofs – Mathematical Induction.
Basic Terminology of Graphs – Special Graphs – The Concept of Degree – Paths – Circuits – Connectedness
– Euler and Hamiltonian Circuits – Matrix Representations of Graphs – Graph Isomorphism – Isomorphic
Invariants – Shortest Path Problem.
Module:4 Trees 6 hours
Definition of Trees – Characterizing Trees – Rooted and Binary Trees and Their Properties – Spanning Tree
– Minimum Spanning Trees.
Relations – Matrix and Digraph of a Relation – Properties of Relations – Order Relations – Matrix and
Digraph of a Partial Order – Minimal and Maximal Elements – Relations on Finite and Infinite Sequences.
Recurrence Equations – Solving First Order Linear Recurrence Equations – Solving Second Order Linear
Recurrence Equations – Infinite Series – Zeno’s Paradoxes.
Simple Enumerated Types – More Elaborate Types – Self-Referential Types – Parameterized Types –
Reasoning About New Types – Three-Valued Logic – Processing Data – Lists – Binary Trees.