Annexure CD 01

UTTAR PRADESH
FORMAT FOR COURSE CURRICULUM
Course Title: DISCRETE MATHEMATICS

P/S

SW/F
W

TOTAL
CREDIT
UNITS
4

Credit Units: 4

Course Level: B.Tech

Course Code: MATH 302

Course Objectives: 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.

Pre-requisites: Students must have basic knowledge of Set, integration, differential equation,Function and relation,.
Course Contents/Syllabus:
Module I Formal Logic
Descriptors/Topics :
Statement
Symbolic Representation
Tautologies
Quantifiers
Predicator and validity
Normal form
Propositional Logic
Predicate Logic

Weightage (%)
20%

First Order Logic.

Module II Proof & Relation

20%

Descriptors/Topics:
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
Descriptors/Topics:
Sets, Subtracts
power sets,
binary and unary operations on a set
set operations/set identities,
fundamental country principles,
principle of inclusion, exclusion
pigeonhole principle,
permutation and combination
Pascals triangles,
Comparing rates of growth: big theta, little oh, big oh and big omega
Module VI Relation/function and matrices

20%

20%

Descriptors/Topics:
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.
Module V Lattices & Boolean Algebra

Descriptors/Topics:

20%

 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

Student Learning Outcomes: After completing this course, students learning outcomes are as follows:
1 Students will be able to recognize, identify, classify and describe the problems of set theory so that they can differentiate between functions and
relations.
2 They will understand abstract algebra, posets, lattices, Boolean algebra and their application in computer science.
3 By studying mathematical logic, they will be able to learn to use logically valid forms of arguments, to avoid logical errors.
4 Students will be able to define the concepts of simple and strong mathematical induction..
5 They can define the concepts of Pigeonhole principle and permutation and combination .
Towards the end students will be able to evaluate and assess the results of various problems in other subjects based on these concepts.
Pedagogy for Course Delivery:
1
2
3

Lot of illustrations, examples will be covered in the classroom to give thorough knowledge of the course.
All the topics covered in the syllabus will be correlated with its applications in real life situations and also in other disciplines.
In order to inculcate problem solving ability in students time to time quiz, viva, home assignments and class tests will be conducted during the progress
of semester. Extra sessions for revision will be undertaken.

Lab/ Practicals details, if applicable: NA

List of Experiments:

Assessment/ Examination Scheme:

Theory L/T (%)

Lab/Practical/Studio (%)
30

End Term Examination

NA

70

Theory Assessment (L&T):

Continuous Assessment/Internal Assessment

End Term Examination

Components (Drop down)

MID TERM

HOME ASSIGNMENT

VIVA

ATTENDANCE

Weightage (%)

10

70

Lab/ Practical/ Studio Assessment: NA

Continuous Assessment/Internal Assessment

End Term Examination

Components (Drop down

Weightage (%)

Text Books:

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, Schaums Outline series.
J. E. Hopcroft & J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison Weliy.