0% found this document useful (0 votes)
89 views4 pages

Tableof Content

The document provides a table of contents for a course guide on mathematics and discrete structures. It outlines 14 topics that will be covered in the course, including sets, relations, functions, sequences, propositional logic, integers, counting, matrices, graphs, paths and cycles, graph representation, planar graphs, and trees. Each topic is further broken down into sections that will provide more detailed coverage of the concepts and methods within that topic area.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
89 views4 pages

Tableof Content

The document provides a table of contents for a course guide on mathematics and discrete structures. It outlines 14 topics that will be covered in the course, including sets, relations, functions, sequences, propositional logic, integers, counting, matrices, graphs, paths and cycles, graph representation, planar graphs, and trees. Each topic is further broken down into sections that will provide more detailed coverage of the concepts and methods within that topic area.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Table of Contents

Course Guide ix-xiv

Topic 1 Set 1
1.1 Concept of Set 1
1.1.1 Listing the Elements of Sets 2
1.1.2 Specifying Properties of Sets 3
1.1.3 Set Membership 3
1.1.4 Empty Set 4
1.1.5 Set of Numbers 5
1.2 Set Equality 6
1.3 Venn Diagram 7
1.4 Subset 8
1.5 Power Set 11
1.6 Set Operation 13
1.6.1 Union 13
1.6.2 Intersection 14
1.6.3 Disjoint Sets 16
1.6.4 Set Difference 16
1.6.5 Set Complementary 17
1.6.6 Characteristics of Set 18
1.7 Generalised Union and Intersection 19
1.8 Partition 20
1.9 Cartesian Product 21

Topic 2 Relation 23
2.1 Concept of Relation 23
2.2 Inverse Relation 26
2.3 Composition of Relations 28
2.4 Relation on a Set 30
2.4.1 Reflexive Relation 30
2.4.2 Symmetric Relation 31
2.4.3 Antisymmetric Relation 31
2.4.4 Transitive Relation 31
2.5 Digraph 32
2.6 Partial Order 34
2.7 Equivalence Relation 36
iv X TABLE OF CONTENTS

Topic 3 Function 38
3.1 Concept of Function 38
3.2 Graph of a Function 41
3.3 Types of Function 42
3.3.1 Injective 42
3.3.2 Surjective 43
3.3.3 Bijective 43
3.4 Inverse of a Function 44
3.5 Functions Composition 46
3.6 Binary and Unary Operators 49

Topic 4 Sequence and Strings 51


4.1 Sequence 51
4.1.1 Examples of Sequence 52
4.1.2 Types of Sequence 54
4.1.3 Subsequence 55
4.2 Sequence Operation 57
4.3 String 59

Topic 5 Propositional Logic 62


5.1 Proposition 63
5.1.1 Conjunction and Disjunction 64
5.1.2 Negation 65
5.2 Conditional Proposition 67
5.3 Biconditional Proposition 68
5.4 Tautologies, Contradictions and Logical Equivalence 69
5.5 Contrapositive and Converse 72

Topic 6 Predicate Logic 74


6.1 Predicate 75
6.2 Quantifier 76
6.2.1 Universal Quantifier 76
6.2.2 Existential Quantifier 78
6.2.3 Combining Quantifiers 79
6.3 Generalised De Morgan Laws 80
6.4 Translating Sentences into Logical Expressions 81

Topic 7 Integer 84
7.1 Integer 84
7.1.1 Basic Operations 85
7.1.2 Order 86
7.1.3 Absolute Value 86
7.2 Mod 87
TABLE OF CONTENTS W v

7.3 Divisor and Greatest Common Divisor 88


7.3.1 Divisors 89
7.3.2 Common Divisors 90
7.3.3 Greatest Common Divisors 91
7.3.4 Euclidean Algorithm 91
7.4 Prime Numbers 92
7.5 Cryptography 94
7.5.1 Private Key 95
7.5.2 Public Key 95

Topic 8 Counting 98
8.1 Basic Principle of Counting 98
8.1.1 Multiplication Principle 99
8.1.2 Addition Principle 100
8.1.3 Combining Principles 100
8.2 Permutation 104
8.3 Combination 106
8.4 Pigeonhole Principle 107
8.4.1 First Form 108
8.4.2 Second Form 108

Topic 9 Matrices 111


9.1 Matrices 111
9.1.1 Equal Matrices 112
9.1.2 Matrix Addition 113
9.1.3 Matrix Multiplication 113
9.1.4 Identity Matrix 114
9.1.5 Power of Square Matrices 114
9.1.6 Matrix Transpose 115
9.1.7 Zero-One Matrices 115
9.2 Matrices of Relation 116
9.2.1 Representing Relations as Matrices 116
9.2.2 Using Matrices for Analysis of Relations 118
9.2.3 Checking for Transitivity 118

Topic 10 Introduction to Graph 123


10.1 The Concept of Graph 123
10.2 Types of Graph 126
10.2.1 Directed Graph 126
10.2.2 Simple Graph 127
10.2.3 Weighted Graph 128
10.2.4 Complete Graph 128
10.2.5 Cycles 129
vi X TABLE OF CONTENTS

10.2.6 n-cube 129


10.2.7 Bipartite Graph 130
10.2.8 Complete Bipartite Graph 131
10.3 Subgraph 134

Topic 11 Path and Cycle 136


11.1 Path 136
11.2 Connected Graph 139
11.3 Components 140
11.4 Euler Path and Cycle 141
11.5 Hamilton Path and Cycle 145

Topic 12 Graph Representation and Isomorphism 147


12.1 Graph Representation 148
12.1.1 Adjacency Matrix 148
12.1.2 Incidence Matrix 151
12.2 Isomorphism 153

Topic 13 Planar Graph 157


13.1 Planar Graph 158
13.2 Graph Colouring 160

Topic 14 Tree 163


14.1 Concept of Trees 163
14.2 Important Terminology 165
14.3 Binary Tree 166
14.4 Tree Isomorphism 169
14.4.1 Basic Concept of Isomorphism 169
14.4.2 Rooted Isomorphism 171
14.4.3 Binary Isomorphism of Trees 172

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy