Scribd
Upload
5 views

Discrete Mathematics Syllabus

The document outlines the course BCS 403: Discrete Mathematics, which aims to provide students with a comprehensive understanding of the foundational concepts in computer science and their applications. It covers various modules including formal logic, proof techniques, sets and combinations, relations and functions, and lattices and Boolean algebra. The examination scheme includes class tests, home assignments, seminars, and an end-semester examination, with a list of recommended texts and references for further study.

Uploaded by

Vicky Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views

Discrete Mathematics Syllabus

The document outlines the course BCS 403: Discrete Mathematics, which aims to provide students with a comprehensive understanding of the foundational concepts in computer science and their applications. It covers various modules including formal logic, proof techniques, sets and combinations, relations and functions, and lattices and Boolean algebra. The examination scheme includes class tests, home assignments, seminars, and an end-semester examination, with a list of recommended texts and references for further study.

Uploaded by

Vicky Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

DISCRETE MATHEMATICS

Course Code: BCS 403 Credit Units: 03


Course Objective:
This subject provides students with an in-depth education in the conceptual foundations of computer science and
in engineering complex software and hardware systems. It allows them to explore the connections between
computer science and a variety of other disciplines in engineering and outside. Combined with a strong
education in mathematics, sciences, and the liberal arts it prepares students to be leaders in computer science
practice, applications to other disciplines, and research.
Course Contents:
Module I:Formal Logic
Statement, Symbolic Representation and Tautologies, Quantifiers, Predicator and validity, Normal form.
Propositional Logic, Predicate Logic, First Order Logic.
Module II: Proof & Relation
Techniques for theorem proving: Direct Proof, Proof by Contra position, Proof by exhausting cares and proof by
contradiction, principle of mathematical induction, principle of complete induction. Recursive definitions,
solution methods for linear, first-order recurrence relations with constant coefficients.
Module III: Sets and Combinations
Sets, Subtracts, power sets, binary and unary operations on a set, set operations/set identities, fundamental
country principles, principle of inclusion, exclusion and pigeonhole principle, permutation and combination,
Pascal’s triangles, Comparing rates of growth: big theta, little oh, big oh and big omega.
Module IV: Relation/function and matrices
Relation/function and matrices: Relation, properties of binary relation, operation on binary relation, closures,
partial ordering, equivalence relation, Function, properties of function, composition of function, inverse, binary
and n-ary operations, characteristic function, Permutation function, composition of cycles, Boolean matrices,
Boolean matrices multiplication.
Module V: Lattices & Boolean Algebra
Lattices: definition, sub lattices, direct product, homomorphism Boolean algebra: definition, properties,
isomorphic structures (in particulars, structures with binary operations) sub algebra, direct product and homo-
morphism, Boolean function, Boolean expression, representation & minimization of Boolean function.

Examination Scheme:
Components A CT S/V/Q HA EE
Weightage (%) 5 15 5 5 70
CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester Examination; Att:
Attendance

Text & References:

Text:
 J.P. Tremblay & R. Mamohan, “Discrete Mathematical Structure with Application to Computer Science,”
TMH, New Delhi (2000).
 Kolman, Busby & Ross “Discrete Mathematical Structures”, PHI.
 Iyengar, Chandrasekaran and Venkatesh, “Discrete Mathematics”, Vikas Publication.
 Peter Linz, “An Introduction to Formal Languages and Automata”, Narosa Publishing
House.
References:
 J. Truss, “Discrete Mathematics”, Addison Wesley.
 C.L. Liu, “Elements of Discrete Mathematics”, McGraw Hill Book Company.
 M. Lipson &Lipshutz, “Discrete Mathematics”, Schaum’s Outline series.
 J. E. Hopcroft & J. D. Ullman, “Introduction to Automata Theory, Languages and Computation”, Addison
Weliy.

You might also like