SHADAN WOMEN’S COLLEGE OF ENGINEERING & TECHNOLOGY

6-2-980, Khairatabad, Hyderabad, Telangana 500004

COURSE PLAN
Academic Year: 2017 – 2018

1. COURSE CODE / NAME : CS303ES / MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

2. BASIC INFORMATION
DEPRATMENT RESPONSIBLE FOR THE COURSE COMPUTER SCIENCE AND ENGINEERING
PROGRAMME II YEAR I SEM CSE
CREDIT VALUE 4 (LECTURE: 4 TUTORIAL: 0 PRACTICAL: 0)
PRE-REQUEST NONE
COURSE LECTURER NASIRA MAHJABEEN
CONTACT LAB2
FORMAL CONTACT PERIODS 60 PERIODS
PRIVATE STUDY HOURS FOR SLOW LEARNERS
COURSE WORK HOMEWORK, ASSIGNMENT
COURSE COORDINATOR K.SHILPA(HOD CSE)
APPROVED BY JNT UNIVERSITY, HYDERABAD
REFERRAL POLICY ACADEMIC COUNCIL, JNT UNIVERSITY, HYDERABAD

3. COURSE OBJECTIVES AND OUTCOMES

3.1 COURSE OBJECTIVES
The objectives of this course are
 To introduce the concepts of mathematical logic.
 To introduce the concepts of sets, relations, and functions
 To introduce generating functions and recurrence relations.
 To use Graph Theory for solving problems.

3.2 OUTCOMES
Knowledge and Understanding
Having successfully completed the course, the student will be able to demonstrate knowledge
and understanding of:
 The Theories of Mathematical logic.
 The operations associated with sets, functions, and relations.
 The Formulas of Elementary Combinatorics.
 The Properties and applications of Graphs and Trees.

Intellectual Skills
Having successfully completed the course, the student will be able to:
 Apply mathematical logic to solve problems.
 Relate practical examples to the appropriate sets, functions or relations , model and interpret
the associated operations and terminology in context.
 Formulate problems and solve recurrence relations.
 Model and solve real-world problems using graphs and trees.

General transferable(Key) Skills

Having successfully completed the course, the student will be able to:
 Manage his/her learning.
 Use logical notations to define and reason about fundamental mathematical concepts.

4. RESOURCES
 SHADAN WOMEN’S COLLEGE OF ENGINEERING & TECHNOLOGY
6-2-980, Khairatabad, Hyderabad, Telangana 500004
COURSE PLAN
Academic Year: 2017 – 2018
TEXT BOOKS

T1. J.P. Tremblay and R. Manohar, “ Discrete Mathematical Structures with Applications to
Computer Science”, McGraw Hill education (India) Private Limited. (UNITS - I , II )

T2. Joe L. Mott, Abraham Kandel and Theodore P. Baker, “ Discrete Mathematics for Computer
Scientists & Mathematicians”, Pearson , 2nd edition. (Units - III, IV, V )

REFERENCE BOOKS

R1. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, McGraw Hill education (India)
Private Limited ,7th Edition.
R2. D.S. Malik and M.K. Sen, “Discrete Mathematics”, Revised edition Cengage Learning.
R3. C. L. Liu and D. P. Mohapatra, “ Elements of Discrete Mathematics”, McGraw Hill education
(India) Private Limited , 4th edition.
R 4. Thomas Koshy and Elsevier, “Discrete Mathematics with Applications”.
R5. R. P. Grimaldi, “Discrete and Combinatorial Mathematics”, Pearson.

LECTURE NOTES
L1: prepared lecture notes / handout by the lecturer.

5. LESSON PLAN

REFERENCE NO. CUMUL

DATE TOPIC
MATERIALS PERIODS PERIODS
UNIT I : Mathematical logic
12/7/17 Introduction, Statements and Notation 1 1
13/7/17 Connectives 1 2
14/7/17 Well formed formulas, Tautologies 1 3
15/7/17 Equivalence of implications 1 4
18/7/17 Duality law ,Tautological implications 1 5
19/7/17 Normal forms 1 6
20/7/17 Problems on normal forms T1,L1 1 7
21/7/17 Theory of Inference for the Statement Calculus 1 8
22/7/17 Indirect method of proof 1 9
25/7/17 Automatic theorem proving 1 10
26/7/17 Predicate calculus 1 11
27/7/17 Free and bound variables 1 12
28/7/17 Inference Theory of the Predicate Calculus 1 13
UNIT II : Set theory and Algebraic Structures
1/8/17 Basic Concepts of Set Theory 1 14
2/8/17 Representation of Discrete Structures 1 15
3/8/17 Properties of relations 1 16
T1,L1
4/8/17 Equivalence , Transitive, closure 1 17
5/8/17 Compatibility and composition of binary relations 1 18
8/8/17 Partial ordering and posets 1 19
 SHADAN WOMEN’S COLLEGE OF ENGINEERING & TECHNOLOGY
6-2-980, Khairatabad, Hyderabad, Telangana 500004
COURSE PLAN
Academic Year: 2017 – 2018
9/8/17 Hasse diagram 1 20
10/8/17 Lattices as Partially Ordered Sets 1 21
11/8/17 Introduction of functions, composition of functions 1 22
16/8/17 Inverse function 1 23
17/8/17 Algebraic Systems and general properties 1 24
18/8/17 Semi groups and Monoids, Groups 1 25
19/8/17 Boolean algebra 1 26
UNIT III: Elementary Combinatorics
22/8/17 Basics of Counting 1 27
23/8/17 Combinations and Permutations, 1 28
24/8/17 Enumeration of Combinations and Permutations 1 29
Enumerating Combinations and Permutations with
26/8/17 1 30
Repetitions
29/8/17 Enumerating Permutations with Constrained Repetitions 1 31
T2,L1
30/8/17 Binomial Coefficients 1 32
31/8/17 Binomial Coefficients 1 33
1/9/17 Binomial Theorem 1 34
5/9/17 Multinomial Theorem 1 35
12/9/17 The Principle of Inclusion Exclusion 1 36
13/9/17 The Principle of Inclusion Exclusion 1 37
UNIT IV : Recurrence Relations
14/9/17 Introduction, Generating Functions 1 38
15/9/17 Generating Functions of Sequences 1 39
16/9/17 Calculating Coefficients of generating functions 1 40
19/9/17 Calculating Coefficients of generating functions 1 41
20/9/17 Recurrence relations 1 42
Solving recurrence relations by substitution and T2,L1
21/9/17 1 43
Generating functions
Solving recurrence relations by substitution and
22/9/17 1 44
Generating functions
23/9/17 The method of Characteristic roots 1 45
3/10/17 Solutions of Inhomogeneous Recurrence Relations 1 46
4/10/17 Problems 1 47
UNIT V : Graphs
5/10/17 Basic Concepts 1 48
6/10/17 Isomorphisms and Subgraphs 1 49
7/10/17 Trees and their Properties 1 50
10/10/17 Spanning Trees 1 51
11/10/17 Directed Trees 1 52
12/10/17 Binary Trees T2,L1 1 53
13/10/17 Planar Graphs 1 54
17/10/17 Euler’s Formula 1 55
18/10/17 Multigraphs and Euler Circuits 1 56
20/10/17 Hamiltonian Graphs 1 57
24/10/17 Chromatic Numbers 1 58
 SHADAN WOMEN’S COLLEGE OF ENGINEERING & TECHNOLOGY
6-2-980, Khairatabad, Hyderabad, Telangana 500004
COURSE PLAN
Academic Year: 2017 – 2018
25/10/17 Problems 1 59
26/10/17 The Four-Color Problem 1 60

6 TEACHING AND LEARNING ACTIVITIES

Teaching Methods
 Lecture
 Use of LCD for all units whenever it is necessary
 Lectures supported by examples
 Prepared notes
 Homework / Assignments

Learning Activities
 Individual work on examples supported by tutorials
 Use of internet for gaining associated knowledge and writing assignments

7 METHODS OF ASSESSMENT
EXAMINATION ASSESSMENT METHOD CONTRIBUTION OF MARKS
(each internal 25 marks)
Assignment 5
Theory 10
Internal -1
Bit 10
Assignment 5
Theory 10
Internal -2
Bit 10

8. ASSIGNMENT DUE DATES AND INTERNAL TEST DATES

Assignment-I Normal forms, Theory of Inference for the Statement Calculus ,Indirect SEP 1st, 2017
method of proof ,Automatic theorem proving , Inference Theory of the
Predicate Calculus, Set theory and Algebraic Structures, Basics of Counting,
Enumeration of Combinations and Permutations

Mid-I UNIT-I,II & UNIT-III up to Enumerating Combinations and Permutations with Sep 6 to sep 8
Repetitions
Assignment- II Enumerating Permutations with Constrained Repetitions, Binomial NOV 1, 2017
Coefficients,Binomial Theorem, Multinomial Theorem , The Principle of
Inclusion exclusion, Recurrence Relations , Spanning Trees, Isomorphisms and
Subgraphs, Multigraphs and Euler Circuits, Hamiltonian Graphs, Chromatic
Numbers.

Mid-II UNIT- III,IV,V Nov 8 to Nov 10

9 FEEDBACK AND STUDENT SUPPORT

 SHADAN WOMEN’S COLLEGE OF ENGINEERING & TECHNOLOGY
6-2-980, Khairatabad, Hyderabad, Telangana 500004
COURSE PLAN
Academic Year: 2017 – 2018

Individual feedback during lectures and tutorials and Feedback from tests

10 RELATIONSHIP BETWEEN THE TEACHING, LEARNING AND ASSESSMENT METHODS AND THE
PLANNED LEARNING OUTCOMES

The learning outcomes related to knowledge, understanding and use of principles in Mathematical
Foundations Of Computer Science and problem solving are tested in the written examinations.

STAFF HOD PRINCIPAL