Scribd
Upload
10 views

BCA DM Syllabus Final

The document outlines a 60-hour course on Discrete Mathematics, covering Set Theory, Logic and Counting, Matrices, and Graph Theory. It includes course outcomes focused on applying mathematical concepts to real-world problems and specifies a range of assessments totaling 40 marks. Recommended textbooks and reference materials are also provided to support the course content.

Uploaded by

ml.nagaraju77
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views

BCA DM Syllabus Final

The document outlines a 60-hour course on Discrete Mathematics, covering Set Theory, Logic and Counting, Matrices, and Graph Theory. It includes course outcomes focused on applying mathematical concepts to real-world problems and specifies a range of assessments totaling 40 marks. Recommended textbooks and reference materials are also provided to support the course content.

Uploaded by

ml.nagaraju77
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

DISCRETE MATHEMAATICS

Total Teaching Hours: 60 No. of Hours / week: 04 + 01


(01 Hour / Week Problem Solving
Class)
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.

–I 15 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.
– II 15
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, Binomial
coefficients.
- III 15
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, Eigen Values and Eigen Vectors.
- IV 15
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, Tree Traversal, 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
Course Articulation Matrix: Mapping of Course Outcomes(COs) with Program
Outcomes(POs1-12)
Course Outcome(COs) Program Outcomes(POs)
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 2 1
CO2 2 3 1 1
CO3 2 1 1
CO4 1 1 1

Pedagogy: Lecture with the use of ICT/ Field Study / Assignment


Formative Assessment for Theory
Assessment Occasion Type Marks
C-1 Sessional Tests 10
C-1 Seminars/ Presentations 10
C-2 Sessional Tests 10
Case Study / Assignment / Project work etc. 10
Total 40 Marks
Formative Assessments as per SEP guidelines are compulsory

DISCRETE MATHEMAATICS

You might also like