Foundation of Mathematics - 2
Foundation of Mathematics - 2
Semester Course Type Course Level Course Code Credits Total Hours
4 1 30 70 100 2
Course Description
This course is to introduce basic concepts of sets and relations and how they are used
in computer language.
Course Prerequisite
1. Basic Set Theory
Course Outcomes
CO
Expected Outcome Learning Domains
No.
CO 1 ✓ ✓ ✓ ✓
CO 2 ✓
CO 3 ✓
CO 4 ✓
CO 5 ✓
CO 6 ✓
CO 7 ✓
COURSE CONTENTS
Contents
for
Classroo
m UNIT DESCRIPTION HOURS
Transacti
on
MODULE
Set Theory
a) Basic Definitions
I 12
1 b) Operations on Sets.
c) Principle of Inclusion -Exclusion.
Functions
a) Basic Definitions.
II 12
1 b) Operations on Functions
c) Pigeon hole Principle.
Recurrence Relations
Essential Readings:
1. Gary Haggard, John Schlipf, Sue Whitesides, Discrete Mathematics
for
Computer Science, Thomson Brooks/Cole
Reference Distribution:
Reference
Module Unit Sections Remarks
No.
V 1 1 Relevant Topics
Suggested Readings:
1. Seymour Lipschutz, Marc Lars Lipson, Schaum’s Outline of Theory and Problems
of Discrete Mathematics, Third edition, McGRAW-HILL
2. Seymour Lipschutz, Schaum’s Outlines Set Theory and Related Topics, Second
Edition,McGRAW-Hill.
3. Ralph P Grimaldi, Discrete and Combinatorial Mathematics An Applied
Introduction, Fifth Edition, Addison-Wesley.
4. V K Balakrishnan, Introductory Discrete Mathematics, Dover Publications, INC
Assessment Rubrics:
Continuous Evaluation 30
a) Test Paper * 12
b) Assignment 6
c) Seminar, Viva-Voce 12
Total 100
* A student has to appear for at least two written tests. Average mark of best two tests is to be
considered for internal mark.
**Use of Scientific Calculators below 100 functions (that is, uptofx 99) shall be permitted.