Course Details
Subject {L-T-P / C} : CS2003 : Discrete Structures { 3-0-0 / 3}
Subject Nature : Theory
Coordinator : Anup Nandy
Syllabus
Module 1 : |
Logic and Proofs – Propositional logic, equivalences, Predicates and quantifiers, Nested quantifiers, Rules of inference, Introduction to proofs, Proof methods.
|
Course Objective
1 . |
To discuss mathematical reasoning for understanding logic and to address the methods of valid proof such as mathematical induction. |
2 . |
To discuss important problem-solving skills with the basic techniques of counting. Discussing combinatorial analysis to solve counting problems and to analyze algorithms. |
3 . |
To understand abstract mathematical structures used to represent discrete objects and relationships between these objects. These discrete structures include sets, permutations, relations, graphs, trees, and finite-state machines. |
4 . |
To learn a particular set of mathematical facts with algorithmic thinking and how to apply them. |
Course Outcome
1 . |
After reading this subject, students will be able to:
|
Essential Reading
1 . |
Kenneth H. Rosen, Discrete Mathematics and its Applications, McGraw Hill Education (India) Pvt. Ltd. , 2011 |
2 . |
B. Kolman and R. C. Busby, Discrete Mathematical Structures for Computer Science, Prentice Hall of India , 1999 |
Supplementary Reading
1 . |
C. L. Liu, and D. P. Mohapatra, Elements of Discrete Mathematics: A computer-Oriented Approach, McGraw Hill Education (India) Pvt. Ltd. , 2013 |
2 . |
N. Deo, Graph Theory with applications to Engineering & Computer Science, Prentice Hall of India , 2006 |