0% found this document useful (0 votes)
93 views1 page

Discrete Structure

Uploaded by

Ravishankar G
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
0% found this document useful (0 votes)
93 views1 page

Discrete Structure

Uploaded by

Ravishankar G
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/ 1

DISCRETE STRUCTURE

Course Outcome
1 Apply Set theory, Relations, Functions and Mathematical Induction for solving problems
2 Getting familiar with counting techniques and Mathematical Logic, and apply the same to
address the real life problems
3 Learn different operations of a Matrix and apply them to solve real-life problems.
4 Apply graph theory concepts to solve the problems of real world.

UNIT – I 11 Hours
Set Theory: Fundamentals of Set Theory, Set Operations, Laws of Set Theory, Counting and
Venn Diagrams, Cartesian Product, Relations, Types of Relations, Functions, Types of
Functions, Function Composition, Inverse Functions. Mathematical Induction.

UNIT – II 11 Hours
Logic and Counting: Fundamentals of Logic, Propositional Logic, Logical Connectives and
Truth Tables, Logic Equivalence, Tautology, and Contradiction. Basics of counting, Counting
Principles, Pigeonhole Principle, Permutation, Combinations.

UNIT - III 11 Hours


Matrices: Basics of Matrix, Types of Matrices, Operations on Matrices, Inverse of a matrix,
Solution for system of linear equations, Determinant, Properties of Determinant, Cramer’s Rule,
Introduction to Eigen Values and Eigen Vectors.

UNIT – IV 12 Hours
Graph Theory: Graphs: Introduction, Representing Graphs, Operations on graphs, Directed
Graphs Graph Isomorphism, Paths, Cycles, Euler Graph, Hamilton Graph, Planar Graphs.
Trees: Introduction, Applications of Trees, Spanning Trees, Minimum Spanning Trees, Prim’s
and Kruskul’s Algorithms.

Text Book

1 Ralph P. Grimaldi: Discrete and Combinatorial Mathematics, 5thEdition, Pearson Education.


2 Richard Bronson, Schaum’s Outline of Matrix Operations, McGraw-Hill publications, 2nd
Edition,
Reference Books
1 Gregory Hartman, Fundamentals of Matrix Algebra, Third Edition
2 Gary Haggard, John Schlipf, Discrete Mathematics for Computer Science, , Thomson Books

You might also like