This action might not be possible to undo. Are you sure you want to continue?

Welcome to Scribd! Start your free trial and access books, documents and more.Find out more

com

Discrete Mathematics Code: CS503 Contact: 3L Credits: 3 Module I: Introduction to Propositional Calculus: Propositions, Logical Connectives, Conjunction, Disjunction, Negation and their truth table. Conditional Connectives, Implication, Converse, Contrapositive, Inverse, Biconditional statements with truth table, Logical Equivalence, Tautology, Normal forms-CNF, DNF; Predicates and Logical Quantifications of propositions and related examples. [10L] Module II: Theory of Numbers: Well Ordering Principle, Divisibility theory and properties of divisibility; Fundamental theorem of Arithmetic; Euclidean Algorithm for finding G.C.D and some basic properties of G.C.D with simple examples; Congruences, Residue classes of integer modulo ( ) n n Z and its examples; Order, Relation and Lattices: POSET, Hasse Diagram, Minimal , Maximal, Greatest and Least elements in a POSET, Lattices and its properties, Principle of Duality, Distributive and Complemented Lattices. [10L] Module III: Counting Techniques: Permutations, Combinations, Binomial coefficients, Pigeon- hole Principle, Principles of inclusion and exclusions; Generating functions, Recurrence Relations and their solutions using generating function, Recurrence relation of Fibonacci numbers and it’s solution, Divide-and-Conquer algorithm and its recurrence relation and its simple application in computer. [10L] Module IV: Graph Coloring: Chromatic Numbers and its bounds, Independence and Clique Numbers, Perfect GraphsDefinition and examples, Chromatic polynomial and its determination, Applications of Graph Coloring. Matchings: Definitions and Examples of Perfect Matching, Maximal and Maximum Matching, Hall’s Marriage Theorem (Statement only) and related problems. [6L] Text Books: 1. Russell Merris, Combinatorics, WILEY-INTERSCIENCE SERIES IN DISCRETE MATHEMATICS AND OPTIMIZATION

2. N. Chandrasekaran and M. Umaparvathi, Discrete Mathematics, PHI 3. Gary Haggard, John Schlipf and Sue Whitesides, Discrete Mathematics for Computer Science, CENGAGE

Learning. 4. Gary Chartrand and Ping Zhang – Introduction to Graph Theory, TMH

References: 1. J.K. Sharma, Discrete Mathematics, Macmillan 2. Winfried Karl Grassmann and Jean-Paul Tremblay, Logic and Discrete Mathematics, PEARSON. 3. S. K. Chakraborty and B. K. Sarkar, Discrete Mathematics, OXFORD University Press. 4. Douglas B. West, Introduction to graph Theory, PHI

- TEXCAVATOR 2013 Committee.
- NOTICE FOR B.Tech – 4th year, 2013 PASSING OUT BATCH
- HU501 Economics for Engineers
- CS504C (FE) Digital Signal Processing
- CS504B (FE) Data Communication
- CS504A (FE) Circuit Theory & Networks
- CS502 Microprocessors & Microcontrollers
- CS501 Design and Analysis of Algorithm
- c Aptitude Questions & Answers
- System of Linear Equation
- Interpolation
- Euler’s method, Runge Kutta methods, Predictor-Corrector methods
- Computer Number Systems, Approximation in Numerical Computation
- Chapter 2 - Probability and Random Variables
- Chapter 1 - Representation of Signals
- Suggestion Paper for CS521 - Formal Language & Automata Theory
- Suggestion Paper for CS503 - Design and Analysis of Algorithm
- Suggestion Paper for IT 501 - Object Technology & UML
- Sample Resume 3
- Sample Resume 2
- Sample Resume 1
- Sample Resume 4 for Fresh Engineering Graduates
- Suggestion Paper for EC 312 – DIGITAL ELECTRONICS & LOGIC DESIGN
- Suggestion Paper for M (CS) – 312 NUMERICAL METHODS & PROGRAMMING

WBUT Revised 5th Semester Syllabus , For Study Materials and Question Papers, log on to www.mywbut.com

WBUT Revised 5th Semester Syllabus , For Study Materials and Question Papers, log on to www.mywbut.com

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue listening from where you left off, or restart the preview.

scribd