Scribd
Upload
72 views2 pages

BCA DM Syllabus

The document outlines a 60-hour course in Discrete Mathematics, covering topics such as Set Theory, Logic and Counting, Matrices, and Graph Theory. It includes course outcomes related to problem-solving using mathematical concepts and provides a structure for assessments. The course employs various pedagogical methods, including lectures and assignments, and maps course outcomes to program outcomes.

Uploaded by

ml.nagaraju77
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
72 views2 pages

BCA DM Syllabus

The document outlines a 60-hour course in Discrete Mathematics, covering topics such as Set Theory, Logic and Counting, Matrices, and Graph Theory. It includes course outcomes related to problem-solving using mathematical concepts and provides a structure for assessments. The course employs various pedagogical methods, including lectures and assignments, and maps course outcomes to program outcomes.

Uploaded by

ml.nagaraju77
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 MATHEMAATICS

Total Teaching Hours: 60 No. of Hours / week:


04
Course Outcome
1 Apply Set theory, Relations, Functions and Mathematical Induction for solving problems
2 Calculate Permutation, Combination, Binomial theorems and Mathematical Logic Problems.
3 Solve the real life problems using the Matrix Algebra
4 Apply trees and graphs concepts to solve the problems

–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 Text Book
2

Reference Books
1 Discrete Mathematics for Computer Science, Gary Haggard, John Schlipf and Sue Whitesides,
Thomson Books
2

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
CO2
CO3
CO4

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