Scribd
Upload
2K views3 pages

Discrete Mathematics

This course provides students with mathematical foundations for computer science and information technology courses, including data structures, algorithms, database theory, computer security, and operating systems. The course aims to develop students' abilities in mathematical reasoning, induction, logical thinking, and team-based problem solving. It covers topics such as logic, sets, functions, induction, recursion, counting, relations, graphs, and trees. Students will be assessed through assignments, tests, quizzes, and a final exam.

Uploaded by

Mohd Shahril
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
2K views3 pages

Discrete Mathematics

This course provides students with mathematical foundations for computer science and information technology courses, including data structures, algorithms, database theory, computer security, and operating systems. The course aims to develop students' abilities in mathematical reasoning, induction, logical thinking, and team-based problem solving. It covers topics such as logic, sets, functions, induction, recursion, counting, relations, graphs, and trees. Students will be assessed through assignments, tests, quizzes, and a final exam.

Uploaded by

Mohd Shahril
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

TMC1813 Discrete Mathematics Faculty of Computer Science and Information Technology, UNIMAS

COURSE TITLE DISCRETE MATHEMATICS


(Matematik Diskrit)
COURSE CODE TMC1813
CREDIT 3
PREREQUISITE/S N/A
SYNOPSIS This course will prepare the students with mathematical foundations
for other Computer Science and Information Technology courses
which including data structures, algorithms, database theory,
computer security and operating system.
(Kursus ini menyediakan pelajar dengan asas matematik untuk
kursus berkaitan Sains Komputer dan Teknologi Maklumat termasuk
struktur data, algoritma, teori pangkalan data, sekuriti komputer dan
sistem pengoperasian.)
LEARNING
OUTCOMES
By the end of this course, students will be able to:
o Demonstrate the ability to perform mathematical reasoning and
induction. [C3]
o Show their logical thinking through problem-based learning
techniques. [P2]
o Form strong opinion on issues based on logic thinking. [A2]
o Work as team mates to prepare and produce sound
mathematical proofs via reasoning and induction, and present
the results clearly and concisely. [CS, TS, LL]
STUDENT
LEARNING
HOURS
Guided LHs Self LHs
34 30 Lectures
12 10 Tutorials
1 8 Student-Centered Learning
4 12 Continuous Assessment
0 9 Final Examination
51 69 Sub-Total
120 Hours Total
Generated using the E-CourseOutline System. 1 / 3
TMC1813 Discrete Mathematics Faculty of Computer Science and Information Technology, UNIMAS
LEARNING
UNITS
Guided LHs
1. 3 Introduction/Overview - The Foundation: Logic, Sets
and Function
o Logic
2. 3 The Foundation: Logic, Sets and Functions (continued)
o Propositional Equivalences
o Predicated and Quantifiers Sets
o Nested Quantifiers
3. 3 The Foundation: Logic, Sets and Functions (continued)
o Method of Proof
o Proof Methods and Strategy
4. 2 Sets
o Set
o Set Operations
5. 3 Functions
o Function
o Sequence and Summations
6. 2 Induction and Recursion
o Mathematical Induction
7. 2 Induction and Recursion
o Recursive Definitions and Structural Induction
8. 2 Counting
o The Basics of Counting
o The Pigeonhole Principle
9. 2 Counting (continued)
o Permutation and Combinations
o Binomial Coefficients
o Generalized Permutations and Combinations
10. 3 Relations
o Relation and their properties
o Representing Relations
o Equivalence Relations
11. 3 Graphs
o Introduction to graphs
Generated using the E-CourseOutline System. 2 / 3
TMC1813 Discrete Mathematics Faculty of Computer Science and Information Technology, UNIMAS
o Graph Terminology
o Representing Graphs and Graph Isomorphism
12. 2 Graphs (continued)
o Connectivity
o Euler and Hamilton Path
o Planar Graphs
13. 2 Trees
o Introduction to Trees
o Application of Trees
o Tree Traversal
14. 2 Trees (continued)
o Spanning Trees
o Binary Trees
34 Total
ASSESSMENT 30 % Assignments
30 % Tests
5 % Quiz
35 % Final Exam
100 % Total
REFERENCES 1. Discrete Mathematic and Its Application, Kenneth H. Rosen,
6th Ed. McGraw-Hill, 2007.
2. Discrete Mathematics with Applications, Susanna S. Epp, 3rd
Ed. Brooks Cole, 2004.
3. Discrete Mathematics with Graph Theory, E.G Goodaire M
Parmenter, 3rd Ed. Prentice Hall, 2005.
4. Discrete Mathematics, Norman L. Biggs, 2nd Ed. Oxford
University Press, 2003.
Last updated: December 11, 2012, Tue, 10:20 AM
Generated using the E-CourseOutline System. 3 / 3

You might also like