15MA302 Aug16

L T P C
15MA302 DISCRETE MATHEMATICS

4 0 0 4
Co-requisite: NOT APPLICABLE
Prerequisite: 15 MA102 (or) 15MA205B
Data Book /
NA
Codes/Standards
Course Category B CORE MATHEMATICS
Course designed by Department of Mathematics
Approval -- Academic Council Meeting -- , 2016
PURPOSE To acquire knowledge in discrete mathematical structures as applied to the respective

branches of Engineering
INSTRUCTIONAL OBJECTIVES STUDENT
OUTCOMES
At the end of the course, student will be able to
1 To understand logic and mathematical reasoning to count or enumerate
a e
objects in systematic way.
2 To understand set theory, relations and functions to read , understand and
a e
construct mathematical arguments.
3 To understand recurrence relation, generating functions and algebraic
systems. a e
4 To understand how to apply the knowledge of graph theory to solve real
a e
world problems like minimum spanning tree - traversal of binary tree.
5 To understand the concept of lattices and Boolean algebra. a e
Contact C-D-I- IO
Session Description of Topic Reference
Hours O s
UNIT I MATHEMATICAL LOGIC: 12
Propositions and Logical operators - Truth tables and
1. 1 C,I 1 1,2,9
propositions generated by a set
2. Equivalence and Implications of statements 2 C,I 1 1,2,9
3. Tautologies of statements 1 C,I 1 1,2,9
4. Direct proofs - Conditional conclusions 2 C,I 1 1,2,9
5. Indirect proofs 1 C,I 1 1,2,9
6. Problems bases on Mathematical Induction 1 C,I 1 1,2,9
7. The existential and universal quantifiers 2 C,I 1 1,2,9
8. Predicate calculus including theory of inference 2 C,I 1 1,2,9
UNIT II SET THEORY: 12
9. Laws of Set theory 1 C 2 1 ,2
10. Partition of a set 1 C,I 2 1 ,2
11. The duality principle 1 C,I 2 1 ,2
Relations Properties - Equivalence relation and partial
12. 2 C,I 2 1 ,2
order relation
13. Poset - Graphs of relations - Hasse diagram 1 C,I 2 1 ,2
14. Matrices of relations 2 C,I 2 1 ,2
15. Closure operations on relations - Warshall's algorithm 2 C,I 2 1 ,2
Functions, Combinatorics - Pigeonhole Principle
16. 2 C,I 2 1 ,2
Generalized Pigeon hole principle
UNIT III RECURRENCE RELATION &
ALGEBRAIC SYSTEMS: 12
Recurrence relations - Solving a recurrence relation
17. Homogeneous and Non-homogeneous Recurrence 2 C,I 3 1,2,9
relations
Formation of Recurrence relations obtained from
18. 1 C,I 3 1,2,9
solutions
Generating functions, Solution of a recurrence relation

19. 1 C,I 3 1,2,9
using generating functions
20. Groups Axioms of groups 2 C,I 3 1,2,9
21. Cyclic groups and their axioms 2 C,I 3 1,2,9
22. subgroups and their axioms 1 C,I 3 1,2,9
23. Cosets Lagranges Theorem 2 C,I 3 1,2,9
24. Normal subgroup, group homomorphism 1 C,I 3 1,2,9

UNIT IV GRAPH THEORY: 12
25. Basic concepts - Basic Definitions Some Special Graphs 2 C,I 4 1,2,7
26. Matrix Representation of Graphs 1 C,I 4 1,2,7
27. Paths and circuits 2 C,I 4 1,2,7
28. Eulerian and Hamiltonian Graphs 1 C,I 4 1,2,7
29. Connected graphs 2 C,I 4 1,2,7

30. Trees - Spanning Trees - Rooted trees 2 C,I 4 1,2,7
31. Binary Trees, Kruskal's algorithm - Traversals of Binary 2 C,I 4 1,2,7

trees
UNIT V LATTICES AND BOOLEAN ALGEBRA: 12
32. Lattices, properties of lattices 2 C,I 5 1,2,7
33. Lattices as algebraic system 1 C,I 5 1,2,7
34. Sub-lattices 1 C,I 5 1,2,7
35. Lattices Properties of Lattices 2 C,I 5 1,2,7
36. Some special lattices 2 C,I 5 1,2,7
Boolean algebra : Definition and Examples, Basic laws of
37. 2 C,I 5 1,2,7
Boolean Algebra
38. Expression of Boolean function by algebraic method 2 C,I 5 1,2,7
Total Contact Hours 60
LEARNING RESOURCES:
Sl. No. TEXT BOOKS
Alan Doerr and Kenneth Levasseur, "Applied Discrete Structures for Computer Science",
1.
Galgotia Publications (P) Ltd, 1992.
Tremblay J. P. and Manohar R., Discrete Mathematical Structures with applications to Computer
2.
Science, Tata Mc Graw Hill Publishing Co., 35th edition,2008.
REFERENCE BOOKS/OTHER READING MATERIAL
V. Sundaresan, K.S. Ganapathy Subramanian and K. Ganesan, Discrete Mathematics, New
3.
Revised Edition, A. R. Publications, 2001
Kolman and Busby, Discrete Mathematical Structures for Computer Science, Prentice Hall, 3rd
4.
edition,1997.
Kenneth H.Rosen, Discrete Mathematics and its Application, Fifth edition, Tata McGraw-Hill
5.
Publishing company PVT .Ltd., New Delhi, 2003
6. Lipschutz Seymour, Marc Lars Lipson, Discrete Mathematics, Mc Graw Hill Inc., 1992
Narsing Deo, Graph Theory with applications to Engineering and Computer science, Prentice-
7.
Hall of India pvt. Ltd., New Delhi, 1987.
8. C.L. Liu, Elements of Discrete Mathematics, 2nd Edition, McGraw Hill Publications, 1985.
T.Veerarajan, Discrete Mathematics with Graph Theory and Combinatorics, Tata McGraw Hill,
9.
2009.
Course nature Theory

Assessment Method (Weightage 100%)
Assessment Cycle test Cycle test Cycle Test Surprise
Quiz Total
In-semester tool I II III Test
Weightage 10% 15% 15% 5% 5% 50%
End semester examination Weightage : 50%

15MA302 Aug16

Uploaded by

Copyright:

Available Formats

15MA302 Aug16

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

15MA302 Aug16

Uploaded by

Copyright:

Available Formats

L T P C

15MA302 DISCRETE MATHEMATICS

PURPOSE To acquire knowledge in discrete mathematical structures as applied to the respective

Generating functions, Solution of a recurrence relation

23. Cosets Lagranges Theorem 2 C,I 3 1,2,9

24. Normal subgroup, group homomorphism 1 C,I 3 1,2,9

29. Connected graphs 2 C,I 4 1,2,7

31. Binary Trees, Kruskal's algorithm - Traversals of Binary 2 C,I 4 1,2,7

38. Expression of Boolean function by algebraic method 2 C,I 5 1,2,7

Total Contact Hours 60

Course nature Theory

You might also like