Mathematics Notes
Subject Overview
The BCA program's opening Mathematics paper builds the discrete-math foundation the rest of the computing curriculum assumes: sets and their operations, propositional logic, matrix algebra, and progressions. It's a deliberately compact 4-unit paper aimed at giving every student the same baseline before Data Structures, Algorithms and AI lean on these ideas later. A 3-credit core theory paper.
Subject at a glance
4
Units
23
Topics
3
Credits
4
Infographics
Unit-wise Syllabus
4 units — open any unit for detailed topic-wise notes, diagrams and important exam questions
- Introduction
- representation of sets (roster method, set builder method)
- types of sets (null, singleton, finite, infinite, equal, equivalent, disjoint, subset, proper subset, power set, universal set)
- set operations (union, intersection, difference, symmetric difference)
- complement of a set
Contains
Every element in A or B or both
Only elements in both A and B
Example: A={1,2,3}, B={3,4}
{1,2,3,4}
{3}
Difference A − B
Elements in A but not in B: {1,2}
Symmetric difference: {1,2,4}
Study guide
Sets are the language of grouping things, and almost every database table, data type and search result in computing is a set in disguise. You learn to describe a set by listing it (roster) or by a rule (set-builder), to recognise types such as finite, infinite, empty and power sets, and to combine sets with union, intersection, difference and complement. Practise Venn diagrams: they make every operation easy to check.
- Logic statements
- connectives
- basic logic operations (conjunction, disjunction, negation)
- logical equivalence/equivalent statements
- tautologies and contradictions
- Conjunction (p ∧ q)
- True only when both p and q are true
- Disjunction (p ∨ q)
- True when at least one is true
- Negation (¬p)
- Reverses the truth value of p
- Tautology
- A statement that is always true, e.g. p ∨ ¬p
- Contradiction
- A statement that is always false, e.g. p ∧ ¬p
- Logical equivalence
- Two statements with identical truth tables
Study guide
Logic teaches you to reason precisely about true and false statements, the same reasoning that sits inside every if-condition you will write. You learn connectives (AND, OR, NOT), how to build and compare compound statements using truth tables, and how to spot tautologies (always true) and contradictions (always false). Build a truth table for every example; it is the quickest way to prove two statements equivalent.
- Introduction
- types of matrix (row, column, rectangular, square, diagonal, scalar, unit, null, comparable, equal)
- scalar multiplication
- negative of a matrix
- addition and difference of matrices
- multiplication of matrices
- transpose of a matrix
Addition
(A + B)ᵢⱼ = aᵢⱼ + bᵢⱼ
Only for matrices of the same order
Multiplication
(AB)ᵢⱼ = Σ aᵢₖ bₖⱼ
Columns of A must equal rows of B
Transpose
(Aᵀ)ᵢⱼ = aⱼᵢ
Rows become columns
Order rule
AB ≠ BA in general
Matrix multiplication is not commutative
Study guide
A matrix is a rectangular table of numbers, and matrices power graphics, machine learning and data processing. This unit covers the different kinds of matrix, adding and subtracting matrices of the same size, scalar multiplication, the row-by-column rule for multiplying matrices and transposing. Remember that order matters in multiplication: A x B is usually not the same as B x A, and sizes must be compatible.
- Introduction
- arithmetic progression
- sum of a finite number of quantities in AP
- arithmetic means
- geometric progression
- geometric mean
nth term of AP
aₙ = a + (n − 1)d
Sum of n terms of AP
Sₙ = n/2 [2a + (n − 1)d]
nth term of GP
aₙ = a·rⁿ⁻¹
Sum of n terms of GP
Sₙ = a(rⁿ − 1)/(r − 1), r ≠ 1
Arithmetic mean of a, b
(a + b) / 2
Geometric mean of a, b
√(ab)
Study guide
A progression is a sequence that follows a fixed pattern. In an arithmetic progression (AP) each term adds a constant difference; in a geometric progression (GP) each term multiplies by a constant ratio. You learn to find the nth term, the sum of the first n terms and the arithmetic and geometric means. These ideas return in loops, algorithm analysis and compound growth, so memorise the formulas and practise applying them.
Why Mathematics Matters
Discrete mathematics is the foundation under programming, databases, algorithms and artificial intelligence. Sets give you data structures and database thinking, logic gives you conditions and proofs, and matrices give you the tools behind graphics and data science. Students who are comfortable here find Data Structures, Algorithms and later AI papers noticeably easier.
How to Prepare for Mathematics
- Draw a Venn diagram for every set problem and build a truth table for every logic problem before writing the answer.
- Practise matrix multiplication daily for a week; speed and accuracy come only from repetition.
- Write the AP and GP formulas on one page and solve at least five numerical problems on each.
- Attempt previous year papers and check every step, since marks in a numerical paper come from the method as well as the answer.
Mathematics: Frequently Asked Questions
Is BCA Mathematics difficult?
It is a compact, foundation-level paper covering sets, logic, matrices and progressions. Students who practise numerical problems regularly usually find it manageable, even without a strong maths background from school.
Why do BCA students study sets, logic and matrices?
Because these ideas sit underneath programming and computer science. Sets underpin databases, logic underpins conditions and algorithms, and matrices underpin graphics, data science and machine learning.