Discrete Mathematics VIT University

Hi I am the student of M.Sc. Computer Science in VIT University and I want the syllabus of the Discrete Mathematics subject so can you please provide me? Also provide me the last year question papers of Discrete Mathematics of M.Sc. Computer Science of this University?

Can you provide me the B. Tech Computer Science and Engineering - Course Code: MAT 106 - Discrete Mathematical Structures- Curriculum offered by VIT University?

[sumit]

The B. Tech Computer Science and Engineering - Course Code: MAT 106 - Discrete Mathematical Structures- Curriculum offered by VIT University is as follows:


Course Code: MAT 106 - Discrete Mathematical Structures

Objectives:
The aim of this course is to motivate the students to address the challenge of the relevance of inference theory, Algebraic structures and graph theory to computer science and engineering problems.

Expected Outcome:
On completion of the course, the students will be able to Model simple physical problems in the form of a differential and difference equations.
Analyze and interpret the solutions.
Apply matrix methods and Eigen value problems so as to appreciate their importance to engineering systems.

This course meets the following student outcomes:
a) An ability to apply the knowledge of mathematics, science and computing appropriate to the discipline.
e) An ability to identify, formulate and solve engineering problems.
j) Recognition of the need for and an ability to engage in continuing professional learning (lifelong learning).
l) An ability to apply mathematical foundations, algorithmic principles and computer science theory in the modeling and design of computer-based systems (CS)


Unit I Mathematical Logic and Statement Calculus
Introduction -Statements and Notation - Connectives – Tautologies – Two State Devices and Statement logic - Equivalence - Implications - The Theory of Inference for the Statement Calculus –-The Predicate Calculus - Inference Theory of the Predicate Calculus.


Unit II Combinatorics
The Basics of Counting- The Pigeonhole Principle -Permutations and Combinations - Binomial Coefficients -Generalized Permutations and Combinations -Generating Permutations and Combinations


Unit III Algebraic Structures
Semigroups and Monoids - Grammars and Languages –Types of Grammars and Languages – Groups – Subgroups – Lagranges Theorem –Homomorphism: Introduction –Properties - Group Codes.


Unit IV Lattices and Boolean algebra
Partially Ordered Relations-Posets-Hasse Digram - Lattices - Boolean algebra – Boolean Functions - Representation and Minimization of Boolean Functions Basic Concepts of Graph Theory - Matrix Representation of Graphs – Trees -Storage Representation and Manipulation of Graphs-- Introduction to Finite State Machines


Text Books
1. J.P. Trembley and R.Manohar, “Discrete Mathematical Structures with Applications to Computer Science”, Tata McGraw Hill – 13th reprint, 2012
2. Kenneth H. Rosen, Discrete Mathematics and its applications, 6th Edition, Tata McGraw Hill,(2011)


Reference Books
1. Richard Johnsonbaugh, “Discrete Mathematics”, 6th Edition, Pearson Education, 2011.
2. S. Lipschutz and M. Lipson, “Discrete Mathematics”, Tata McGraw Hill, 3rd Edition, 2010
3. B.Kolman, R.C.Busby and S.C.Ross, “Discrete Mathematical structures”, 6th Edition, PHI, 2010.
4. C.L.Liu, “Elements of Discrete Mathematics”, Tata McGraw Hill, 3rd Edition, 2008.


Mode of Evaluation
Continuous Assessment (30%) and Assignments / Quizzes / Projects (20%)
Term End Examination (50%)