0% found this document useful (0 votes)
32 views3 pages

Discrete Mathematics

discrete math uitm

Uploaded by

Dalilah Farhana
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)
32 views3 pages

Discrete Mathematics

discrete math uitm

Uploaded by

Dalilah Farhana
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/ 3

UNIVERSITI TEKNOLOGI MARA

FACULTY OF COMPUTER AND MATHEMATICAL SCIENCES


COURSE INFORMATION

Code : MAT210
Course : Discrete Mathematics
Level : Diploma
Credit Unit : 3

SCHEME OF WORK
Week Topics Hours References
1. SET THEORY

 Sets and subsets (including number 2


systems)
1
 Counting and Venn Diagram
 Set Operations Lesson – Introduction
2 Complete Entrance
TUTORIAL Survey

2
 Set Operations and Laws of Set Theory
2
TUTORIAL Complete Entrance
2
Survey
2. FUNDAMENTAL PRINCIPLES OF COUNTING
2
 Rules of Sum and Product
3
 Permutation
 Permutation
2
TUTORIAL
 Combination
- Combination with and without conditions
- Combination with repetition 2

4
 Binomial Theorem
- Expand the expression
2
TUTORIAL

 Binomial Theorem
- finding the n-th term and the coefficient 2
5
TUTORIAL ASSESSMENT 1
2 TOPIC 1 & 2

SCHEME OF WORK MAT210


Page 1
3. RELATIONS AND FUNCTIONS
2
 Cartesian Products and Relations
6
 Properties of Relations (reflexive,
symmetric, transitive and anti-symmetric)
 Equivalence Relations and Partitions 2

TUTORIAL

 Functions : Plain and One-to- One


7 - Sketch the graph
2
- Domain and range
- Horizontal line test

 Onto Functions

TUTORIAL 2

4. DIRECTED GRAPHS
8
 Relations and Directed Graphs 2
- Draw directed graph
- Properties of relation in directed graph
 Functions and Directed Graphs
2
TUTORIAL
 Paths in Directed Graphs
2
- Circuits, Hamiltonian,
- Eulerian
9
2
TUTORIAL

 Trees
- Binary trees
- Full binary trees 2
10
- Full binary trees
ASSESSMENT 2
TUTORIAL 2
TOPIC 3 & 4

5. FUNDAMENTALS OF LOGIC

 Basic Connectives and Truth Tables 2


(including arguments)

11  Logical Equivalence and logical implies


 Laws of Logic
2
TUTORIAL

 Arguments – validation using truth table 2


12

SCHEME OF WORK MAT210


Page 2
 Logical Implications: Rules of Inference 2
(proving: Syllogism, Modus Tollens, Modus
Ponens, Contrapositive, Implications etc)

TUTORIAL

6. BASIC NUMBER THEORY


2
 Summation
 Principle of Mathematical Induction
13  Principle of Mathematical Induction
GROUP ASSIGNMENT
TUTORIAL 2 TOPIC 4 & 5

 Recursion 2
14 TUTORIAL Complete Exit Survey
2
and SuFo

SCHEME OF WORK MAT210


Page 3

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