BCS405A | DISCRETE MATHEMATICAL STRUCTURES

Basic Connectives and Truth Tables, Logic Equivalence – The Laws of Logic, Logical Implication –
Rules of Inference. The Use of Quantifiers, Quantifiers, Definitions and the Proofs of Theorems
Mathematical Induction, The Well Ordering Principle – Mathematical Induction, Recursive Definitions. Fundamental Principles of Counting: The Rules of Sum and Product, Permutations, Combinations – The Binomial Theorem, Combinations with Repetition.
 Cartesian Products and Relations, Functions – Plain and One-to-One, Onto Functions. The Pigeonhole Principle, Function Composition and Inverse Functions. Properties of Relations, Computer Recognition – Zero-One Matrices and Directed Graphs, Partial Orders – Hasse Diagrams, Equivalence Relations and Partitions.
 The Principle of Inclusion and Exclusion, Generalizations of the Principle, Derangements – Nothing is in its Right Place, Rook Polynomials. Recurrence Relations: First Order Linear Recurrence Relation, The Second Order Linear Homogeneous Recurrence Relation with Constant Coefficients.
Definitions and Examples of Particular Groups Klein 4-group, Additive group of Integers modulo n, Multiplicative group of Integers modulo-p and permutation groups, Properties of groups, Subgroups, cyclic groups, Cosets, Lagrange’s Theorem

BCS405A | Model Question Paper with Solution

Access well‑organized Model Question Paper with step‑by‑step, point‑wise solutions. Each solution is created to save your time, clarify concepts, and help you revise effectively. 

BCS405A | Passing Package
( Score More )

A smart package made for VTU students! Selected important questions prepared to cover exactly what matters in VTU exams. Clear, simple, and quick to revise – perfect for last‑minute preparation and aiming for better marks with confidence.