BCA Semester 1 - Mathematics Foundation for Computer Science
Complete Syllabus Notes
MODULE 1: Set, Relation & Function
1. Set Operations, Properties of Sets, Subsets, Venn Diagrams
- Set: Collection of distinct elements.
- Operations: Union, Intersection, Difference, Complement.
- Subsets: A subset B if every element of A is in B.
- Venn Diagram: Visual representation of sets using circles.
2. Cartesian Products
- A x B = set of all ordered pairs (a, b) where a in A and b in B.
3. Relations on Sets, Properties of Relations
- Relation: Subset of A x B.
- Properties: Reflexive, Symmetric, Transitive.
4. Representing Relations using Matrices and Digraphs
- Matrix: 1 if relation exists, 0 otherwise.
- Digraph: Directed edges between related elements.
5. Types of Relations, Equivalence Relations, Partition of Set
- Types: Reflexive, Symmetric, Transitive, Antisymmetric.
- Equivalence Relation: All three properties above.
BCA Semester 1 - Mathematics Foundation for Computer Science
- Partition: Divides set into non-overlapping subsets.
6. Closures of Relations, Warshall's Algorithm
- Closure: Add missing pairs to make relation reflexive/transitive.
- Warshall's Algorithm: Finds transitive closure using matrix.
7. Functions: Domain, Range, Composition, Inverse
- Function: Maps every input to exactly one output.
- Domain: Input set, Range: Output set.
- Composition: f(g(x)), Inverse: f-1(y) = x.
8. Injective, Surjective, Bijective Functions
- Injective: One-to-one, Surjective: Onto, Bijective: Both.
9. Useful Functions for Computer Science
- Identity, Mod, Floor, Ceiling, Exponential, Log.
10. Exponential and Logarithmic Functions
- Exponential: a^x, Logarithmic: log_a(x).
MODULE 1.2: Counting and Recurrence Relations
1. Polynomial, Floor and Ceiling Functions
- Polynomial: Sum of terms a_n*x^n.
- Floor floor(x): Largest integer <= x. Ceiling ceil(x): Smallest integer >= x.
BCA Semester 1 - Mathematics Foundation for Computer Science
2. Basics of Counting, Pigeonhole Principle
- Counting: Add/multiply rule.
- Pigeonhole: n items, m containers, n > m -> at least one container has >1 item.
3. Permutation, Combination
- Permutation: nPr = n!/(n-r)!
- Combination: nCr = n!/[r!(n-r)!]
4. Binomial Coefficient, Binomial Theorem
- Binomial Coefficient: Coefficient of terms in (a + b)^n.
- Theorem: (a + b)^n = Sum(nCr * a^(n-r) * b^r)
5. Recurrence Relations, Modelling with Examples
- Recurrence: Sequence defined using previous terms.
- Example: a_n = a_{n-1} + 3
6. Fibonacci Numbers, Tower of Hanoi
- Fibonacci: F(n) = F(n-1) + F(n-2)
- Tower of Hanoi: T(n) = 2T(n-1) + 1
7. Linear Recurrence with Constant Coefficients
- Use characteristic equation to solve recurrence.
MODULE 2: Elementary Graph Theory
BCA Semester 1 - Mathematics Foundation for Computer Science
1. Basic Terminologies of Graphs
- Graph G = (V, E), Vertices, Edges, Degree.
2. Connected, Disconnected, Simple Graphs
- Connected: All vertices reachable.
- Disconnected: Not all connected.
- Simple: No loops/multiple edges.
3. Path and Cycle
- Path: Sequence of edges.
- Cycle: Ends where it starts.
4. Complete Graphs, Digraphs
- Complete: All vertices connected.
- Digraph: Directed edges.
5. Weighted Graphs, Euler and Hamiltonian Graphs
- Weighted: Edges with cost.
- Euler: All edges once, Hamiltonian: All vertices once.
6. Trees, Spanning Trees
- Tree: No cycles.
- Spanning Tree: Connects all vertices minimally.
BCA Semester 1 - Mathematics Foundation for Computer Science
7. Planar Graphs
- Drawn without edge crossing.
- Euler's formula: V - E + F = 2
MODULE 2.2: Matrix Algebra
1. Types of Matrices
- Row, Column, Square, Zero, Diagonal, Identity.
2. Matrix Operations
- Add, Subtract, Multiply (AB).
3. Determinants
- 2x2: ad-bc
4. Symmetric and Skew-Symmetric
- Symmetric: A = AT, Skew: A = -AT
5. Orthogonal Matrices
- ATA = I
6. Rank of a Matrix
- Max number of linearly independent rows/columns.
7. Inverse of a Matrix
BCA Semester 1 - Mathematics Foundation for Computer Science
- A-1 = 1/(ad-bc) x [[d,-b],[-c,a]]
8. Solving System of Equations
- AX = B -> X = A-1B
9. Eigenvalues and Eigenvectors
- |A-lambdaI| = 0 -> find lambda, then solve for X.
10. Cayley-Hamilton Theorem
- Every square matrix satisfies its own characteristic equation.
