Scribd
Upload
39 views3 pages

Discrete Maths

Uploaded by

vipulmahajan176
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
39 views3 pages

Discrete Maths

Uploaded by

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

BHAGWAN MAHAVIR UNIVERSITY

Bachelor of Technology

Department: Humanities & Social Science

Subject Code: 1010200401

B.Tech.
Semester IV
DISCRETE MATHEMATICS
(COMPUTER)
EFFECTIVE FROM DEC-2021

Syllabus version:1.00
BHAGWAN MAHAVIR UNIVERSITY
Bachelor of Technology

Department: Humanities & Social Science

Subject Code: 1010200401

Teaching Scheme (Hours)


Subject Tut Theory
Subject Title Theo Total
Code ori Credits Examination Marks
ry Marks
al Internal External

1010200 DISCRETE
3 2 5 40 60 100
401 MATHEMATICS

Objective of the course:

1. To interpret the preliminaries of discrete mathematics


2. To comprehend role of discrete mathematics in theoretical computer science
3. To recognize the importance of formal approach for solving computing problems

Course Outcomes:
Upon completion of the course, the student shall be able:

Sr. Marks %
CO statement
No. weightage
To understand the fundamental knowledge of set theory, relations,
CO-1 16%
lattices and their uses
Use logical operators to combine statements and become familiar with
CO-2 16%
predicates and quantifiers.
Apply relations and to determine their properties. Be familiar with
CO-3 18%
recurrence relations
Interpret different traversal methods for trees and graphs. Model
CO-4 25%
problems in Computer Science using graphs and trees.
CO-5 Use the properties of algebraic structures. 25%

Detail Content:

Sr. Total
Topic
NO. Hrs.
Sets, Relation and Function: Operations and laws of sets, Cartesian products,
binary relation, partial ordering relation, equivalence relation, image of a set, sum
1 and product of functions, bijective functions, inverse and composite function. Basic 6
counting techniques: inclusion and exclusion, pigeon-hole principle.

Propositional Logic: syntax, semantics, validity and satisfiability, basic connectives


6
2 and truth tables. Logical equivalence: the laws of logic, logical implication, rules of
inference, the use of quantifiers.
BHAGWAN MAHAVIR UNIVERSITY
Bachelor of Technology

Department: Humanities & Social Science

Subject Code: 1010200401

Recurrence Relations and Recursive Algorithms:


Recurrence relations, linear recurrence relations with constant coefficients, use of
3 recurrence relations for analysis of algorithms 6

Graphs and Trees:


graphs and their properties, isomorphism, Eulerian and Hamiltonian walks, graph
4 10
coloring, perfect graph, rooted trees, trees and sorting, weighted trees and prefix
codes, shortest path, spanning trees
Algebraic Structures:
Algebraic structures with one binary operation- Semigroup, Monoid, Group,
Subgroup, normal subgroup, group Permutations, Coset, homomorphic subgroups,
5 10
Lagrange’s theorem, Congruence relation and quotient structures. Algebraic
structures (Definitions and simple examples only) with two binary operation- Ring,
Integral domain and field.

Text books:

1. C. L. Liu, Elements of Discrete Mathematics, Tata McGraw Hill


2. Tremblay, J.P. & Manohar, Discrete mathematical structures with application to computer
science, McGraw Hill
3. Rosen, Kenneth L., Discrete Mathematics and its applications, McGraw Hill
4. S. Lipschutz and M. L. Lipson, Schaum’s Outline of Theory and Problems of Discrete
Mathematics, 2nd Ed., Tata McGraw-Hill,1999.

*******************************************************************

You might also like