Page 32 - B.E CSE Curriculum and Syllabus R2017 - REC

Department of CSE, REC

SEMESTER III
MA17354 DISCRETE MATHEMATICS L T P C
(Common to B.E. CSE and B.Tech. IT) 3 2 0 4
OBJECTIVES:
● To extend student’s Logical and Mathematical maturity and ability to deal with abstraction.
● To introduce most of the basic terminologies used in computer science courses and application of
ideas to solve practical problems.

UNIT I MATHEMATICAL LOGIC 15
Propositional Logic – Propositional equivalences – Rules of inference – normal forms.

UNIT II PREDICATE CALCULUS 15
Predicates and quantifiers-Nested Quantifiers-Rules of inference-introduction to Proofs-Proof Methods and
strategy.

UNIT III COMBINATORICS 15
Mathematical inductions-Strong induction -The basics of counting-The pigeonhole principle –Permutations
and combinations-Recurrence relations-Solving Linear recurrence relations-generating functions-inclusion
and exclusion principle and applications.

UNIT IV GRAPHS 15
Graphs -Graph terminology and special types of graphs-Representation of graphs - graph isomorphism -
connectivity-Euler and Hamilton paths.

UNIT V GROUPS AND BOOLEAN ALGEBRA 15
Algebraic systems-Groups-Subgroups and homomorphisms-Cosets and Lagrange’s theorem- Posets-Lattices-
Boolean Algebra.
TOTAL: 75 PERIODS
OUTCOMES:
On successful completion of this course, the student will be able to:
● Apply the concepts of logic to test the validity of a program.
● Arrive at inferences on logical structures.
● Use the counting principles in implementing various programmes.
● Handle a class of functions which transform a finite set into another finite set which relates to input
and output functions in computer science.
● Apply the concepts and properties of algebraic structures such as groups.

TEXT BOOKS:
1. Kenneth H.Rosen, Discrete Mathematics and its Applications, Special Indian edition, Tata McGraw-
Hill Pub. Co. Ltd., New Delhi, (2007).
2. Veerarajan. T, Discrete Mathematics: with graph theory and combinatorics, McGrawHill Education
(India) Pvt.Ltd. 2007.
3. Bernard Kolman, Robert C. Busby and Sharon Ross., Discrete Mathematical Structures., Third
edition, Prentice Hall, Upper Saddle River, New Jersey 1996.

REFERENCES:
1. Trembly J.P and Manohar R, Discrete Mathematical Structures with Applications to Computer
Science, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, Thirtieth Re-print (2007).
2. Ralph. P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, Fourth
Edition, Pearson Education Asia, Delhi, (2002).
3. Thomas Koshy, Discrete Mathematics with Applications, Elsevier Publications, (2006).
4. Seymour Lipschutz and Mark Lipson, Discrete Mathematics, Schaum’s Outlines, Tata McGraw-Hill
Pub. Co. Ltd., New Delhi, Second edition, (2007).

Curriculum and Syllabus | B.E. Computer Science and Engineering | R2017 Page 32