ADVANCED DISCRETE MATHEMATICS

1.1 Subject Details

Subject Code : CSE 2033

Offered in : 4th Semester
Credits : 3
Contact Hours : 4 Contact Hours (4 Classes/Week, 1 hr/Class).
1.2 Grading Pattern

This subject comes under Grading Pattern 2 and follows a Relative Grading System. The
following is the split up of marks from a numeric score of 100.

Attendance : 5
Marks Major Lab / Problem Solving Assignments / Quizzes : 10
Marks Minor Assignments/ Class Assignment : 10
Marks Mid-term Examination : 15
Marks Total Internal Marks : 40
Problem Solving Examination Marks : 15
Theory Examination Marks : 45

Total Marks : 100

1.3 Whether a required Subject for promotion (Yes/No)

Yes, it is a required subject for promotion from 2nd year 3nd to year in CSE and CSIT
Engineering.

1.4 Pre-requisites/Co-requisites
CSE 1002: Discrete Mathematics, MTH 2002 : Probability and Statistics

1.5 Subject Offered for

This subject is offered for CSE and CSIT B.Tech Program.

1.6 Text Books

a. Introductory Combinatorics by Richard A. Brualdi, Fifth Edition, Pearson India

b. Introduction to Lattices and order by B. A Davey and H. A. Priestley, Cambridge
University
c. Abstract Algebra, 3rd Edition by David S. Dummit, Wiley India

1
1.7 Subject Description

The course topics will include concepts of Counting Principles of Permutations and
combinations, Combanotries with Multiset and Combanotries with repetitions, Recurrence
Relation, Concepts of Matrix Group, Cyclic Groups, Quotient Groups and Quotient Rings,
Lattices and order, Boolean Algebra. The subject enhances one’s ability to reason and
ability to present a coherent and mathematically accurate argument.

1.8 Subject Objectives

1. Provide students with basic concepts about Perfect Covers of Chessboard, Magic
squares and Basics principle of Permutations and combinations.
2. The objective for the students is to obtain a foundational knowledge of combinato-
rial proofs of classical theorems, examples, and as well as to sharpen their skills
through problem-solving.
3. Students will learn the role of the inclusion-exclusion principle in combinatorics.
number theory in the history of mathematics, which helps improving one's ability of
mathematical thinking.
4. To Provide an approach to the students about Algebra, which is one of the basics of
the modern mathematics and to study certain structures called groups, rings, and
some related topics.
5. Provide students with concepts of ordered set , lattices and different types of lattices
and Boolean algebra and their uses in different problems.

1.9 Course Outcomes

CO 1: Apply the knowledge of fundamental counting principle

CO 2: Apply knowledge of combinatorics to establish properties of binomial coefficients.
CO 3: Apply the knowledge of pigeonhole principle to solve different problems
CO 4: Apply the knowledge of set theory to combinatorial problems and Recurrence
Relation.
CO 5: Apply the concept of group and rings theory in solving polynomial equation.
CO 6: Apply the knowledge of lattices to solve different problems and evaluate Boolean
functions and simplify expression using the properties of Boolean algebra; apply Boolean
algebra to circuits and gating networks

2
1.10 Lesion Plan

Sl Topics Lecture Hours Chapters

No.
COMBINATORICS
3 Counting Principles 1 2.1

Permutations of Sets 1 2.2

4 Combination of Sets 1 2.3
*(Th2.3.1,2.3.2,2.3.3,2.3.4)
5 Permuatations of Multisets 1 2.4

6 Combinatios of Multisets 1 2.5

*(Th 2.4.1,2.4.2,2.4.4,2.5.1)
7 Pigeonhole Principle:Simple form 1 3.1
8 Pigeonhole Principle: Strong form 1 3.2
9 Generating Permutaions 1 4.1
(algorithm I, II)
10 Inversions in permutations 1 4.2
11 Generating Combinations 1 4.3
(Base 2 algorithm)
12 Pascal’s Triangle ,The Binomial 1 5.1
Theorem (Th 5.2.2) 5.2
13 Unimodality of Binomial Coefficients (Th 1 5.3
5.3.1, Cor: 5.3.2)
14 The Multinomial Theorem and Newton’s 1 5.4
Binomial Theorem, (Th 5.4.1, Th 5.5.1)
15 The Inclusion – Exclusion Principle Th 1 6.1
6.1.1
16 Combinations with repetition, 1 6.2

17 Derangements (Th 6.3.1( without proof) 1 6.3

18 Some Number Sequences 1 7.1

19 Generating Sequences 1 7.2

20,21 Solving Linear Homogeneous 2 7.4
Recurrence Relations
Note: 1. Few examples will be discussed by teacher in class and
remaining all examples are strictly to be covered from each mentioned
topics by the students.
2. Theorems proof are not compulsory

ABSTRACT ALGEBRA
22 Introduction to groups: axioms and 1 1.1
exaamples
(Proposition 1 and 2)
23 Dihedral Groups 1 1.2
The Quaternion Group 1 1.5

3
24 Subgroups: Definitions and examples 1 2.1
(Proposition 1)
25 Centralizers and Normalisers 1 2.2
26 Cyclic Groups( Examples and 1 2.3
Proposition 2,3)
27 The lattice of subgroups of a group 1 2.5
29 Quotient Groups: Definitions and 1 3.1
Examples
30 Lagrange’s Theorem 1 3.2
31 Ring Theory: Basic Definitions and 1 7.1
Examples
32 Polynomial Rings, Matrix Rings and 1 7.2
Group Rings
LATTICES
33 Ordered sets : Definition and 1 1.1 to 1.7
Examples from social science and
computer science
34 Constructing and deconstructing 1 1.14 to 1.25
orders sets
35 Down Sets and up sets 1 1.27 to 1.32
36 Lattices and complete lattices: 1 2.1 to 2.6
lattices as ordered sets
37 Lattices of Subgroups 1 2.7 to 2.11
38 Formal Concept analysis: 1 3.1 to 3.6
39 The fundamental theorem of 1 3.7 to 3.11
concept lattices
40 Modular Distributive 1 4.1 to 4.7

Boolean Algebra 1 4.16 to 4.20